UVALive 6263 The Dragon and the knights --统计，直线分平面

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#define ll long long
using namespace std;
#define N 50007

struct Line
{
    int A,B,C;
}line[107];

bool UPLine(Line ka,ll x,ll y)
{
    ll res = ka.A*x + ka.B*y + ka.C;
    return res > 0;
}

bool intersection(Line ka,Line kb)
{
    if(ka.A*kb.B == ka.B*kb.A)
        return false;
    return true;
}

string ss[N];

int main()
{
    int t,n,m,i,j;
    int x,y;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(i=0;i<n;i++)
            scanf("%d%d%d",&line[i].A,&line[i].B,&line[i].C);
        string tmp = "";
        for(i=0;i<n;i++)
            tmp += "0";
        for(i=0;i<m;i++)
        {
            scanf("%d%d",&x,&y);
            ss[i] = tmp;
            for(j=0;j<n;j++)
            {
                if(UPLine(line[j],x,y))
                    ss[i][j] = ‘1‘;
            }
        }
        int C = n+1;
        for(i=0;i<n;i++)
        {
            for(j=i+1;j<n;j++)
                if(intersection(line[i],line[j]))
                    C++;
        }
        sort(ss,ss+m);
        int cnt = 1;
        for(i=1;i<m;i++)
        {
            if(ss[i] != ss[i-1])
                cnt++;
        }
        if(cnt >= C)
            puts("PROTECTED");
        else
            puts("VULNERABLE");
    }
    return 0;
}