Pagini recente » Cod sursa (job #2168443) | Cod sursa (job #2327731) | Cod sursa (job #472094) | Cod sursa (job #1880551) | Cod sursa (job #286468)
Cod sursa(job #286468)
#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, ct;
dreapta v[maxn];
punct t[maxn];
vector <vector <int> > x, xa;
vector <int> v1, v2;
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);
v1.push_back(i);
}
x.push_back(v1);
for (i = 1; i <= n; i++) {
//fac treaba pentru dreapta i
nra = nr; ct = 0;
for (j = 0; j < x.size(); j++) {
v1.clear(); v2.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.push_back(x[j][k]);
else
v2.push_back(x[j][k]);
if (v2.size() && v1.size()) {
ct++;
xa.push_back(v2);
ct++;
xa.push_back(v1);
}
else {
ct++;
if (v1.size())
xa.push_back(v1);
else
xa.push_back(v2);
}
}
x = xa;
xa.clear();
}
printf("%d\n", x.size());
// printf("%d\n", sizeof(x) / 1024);
return 0;
}