Pagini recente » Cod sursa (job #1567094) | Rating Petrescu Andrei (vicand198) | Cod sursa (job #2438353) | Cod sursa (job #2646002) | Cod sursa (job #286447)
Cod sursa(job #286447)
#include <cstdio>
#include <vector>
#define mod 100003
#define maxn 1010
using namespace std;
struct dreapta {
int a, b, c;
};
struct punct {
int x, y;
};
int n, m, i, j, nr, sol, k, nra;
dreapta v[maxn];
punct t[maxn];
vector <int> x[1010];
vector <int> v1[1010], v2[1010];
int main() {
freopen("regiuni.in", "r", stdin);
freopen("regiuni.out", "w", stdout);
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &v[i].a, &v[i].b, &v[i].c);
for (i = 1; i <= m; i++) {
scanf("%d%d", &t[i].x, &t[i].y);
x[1].push_back(i);
}
nr = 1;
for (i = 1; i <= n; i++) {
//fac treaba pentru dreapta i
nra = nr;
for (j = 1; j <= nra; j++) {
v1[j].clear(); v2[j].clear();
for (k = 0; k < x[j].size(); k++)
if (v[i].a * t[x[j][k]].x + v[i].b * t[x[j][k]].y + v[i].c < 0)
v1[j].push_back(x[j][k]);
else
v2[j].push_back(x[j][k]);
if (v2[j].size() && v1[j].size()) {
nr++;
x[nr] = v2[j];
x[j] = v1[j];
}
else
if (v1[j].size())
x[j] = v1[j];
else
x[j] = v2[j];
}
}
printf("%d\n", nr);
return 0;
}