Pagini recente » Cod sursa (job #572813) | Cod sursa (job #630207) | Cod sursa (job #2895494) | Cod sursa (job #2716727) | Cod sursa (job #1364615)
#include<fstream>
#include<vector>
#include<bitset>
#include<unordered_map>
using namespace std;
typedef int var;
ifstream fin("regiuni.in");
ofstream fout("regiuni.out");
const var MAXN = 1001;
const var P1 = 666013,
P2 = 123201,
P3 = 9381;
var A[MAXN], B[MAXN], C[MAXN], H[MAXN], hsize;
inline bool is_above(const var &x, const var &y, const var &ind) {
return A[ind]*x + B[ind]*y + C[ind] > 0;
}
inline void check_add(var val) {
for(var i=0; i<hsize; i++) {
if(H[i] == val)
return;
}
H[hsize++]=val;
}
int main() {
var n, m, x, y;
fin>>n>>m;
for(var i=1; i<=n; i++) {
fin>>A[i]>>B[i]>>C[i];
}
for(var i=1; i<=m; i++) {
fin>>x>>y;
var val1, val2;
val1 = val2 = 0;
for(var j=1; j<=n; j++) {
bool rez = is_above(x, y, j);
val1 = val1*2 + rez;
val2 = val2*2 + rez;
val1 %= P1;
val2 %= P2;
}
check_add(val1*P3+val2);
}
fout<<hsize;
return 0;
}