0_0_19231094_530.cpp:31:5: error: expected unqualified-id before '{' token
int {
^
0_0_19231094_530.cpp:35:15: error: 'P' does not name a type
int _ix, _iy;}P[maxn];
^
0_0_19231094_530.cpp: In function 'int Process(int, int)':
0_0_19231094_530.cpp:123:25: error: 'P' was not declared in this scope
int xleft = LargeThan( P[idx].x - dis, P[idx]._ix );
^
0_0_19231094_530.cpp:131:82: error: invalid initialization of reference of type 'Type& {aka long long int&}' from expression of type 'int'
int Num = 0; Query(root, xleft, xright, yleft, yright, 0, tot-1, 0, tot-1, Num); return Num;}
^
0_0_19231094_530.cpp:65:6: note: in passing argument 10 of 'void Query(int, int, int, int, int, int, int, int, int, Type&)'
void Query(
^
0_0_19231094_530.cpp: In function 'int main()':
0_0_19231094_530.cpp:139:170: error: 'P' was not declared in this scope
int Max; while(scanf("%d", &n) != EOF) { size = 0; tot = 0; all = 0; Max = 0; for(i = 0; i < n; i++) { scanf("%d %d", &P[i].x, &P[i].y); bin[ size++ ] = P[i].x; bin[ size++ ] = P[i].y; if(P[i].x > Max) Max = P[i].x; if(P[i].y > Max) Max = P[i].y; } sort(bin, bin + size); for(i = 0; i < size; i++) { if(i == 0 || bin[i] != bin[i-1]) bin[tot++] = bin[i]; } root = -1; for(i = 0; i < n; i++) { P[i]._ix = B(P[i].x); P[i]._iy = B(P[i].y); Insert(root, P[i]._ix, P[i]._iy, 0, tot-1, 0, tot-1); } ll ans = 0; for(i = 0; i < n; i++) {
^
0_0_19231094_530.cpp:139:566: error: 'P' was not declared in this scope
int Max; while(scanf("%d", &n) != EOF) { size = 0; tot = 0; all = 0; Max = 0; for(i = 0; i < n; i++) { scanf("%d %d", &P[i].x, &P[i].y); bin[ size++ ] = P[i].x; bin[ size++ ] = P[i].y; if(P[i].x > Max) Max = P[i].x; if(P[i].y > Max) Max = P[i].y; } sort(bin, bin + size); for(i = 0; i < size; i++) { if(i == 0 || bin[i] != bin[i-1]) bin[tot++] = bin[i]; } root = -1; for(i = 0; i < n; i++) { P[i]._ix = B(P[i].x); P[i]._iy = B(P[i].y); Insert(root, P[i]._ix, P[i]._iy, 0, tot-1, 0, tot-1); } ll ans = 0; for(i = 0; i < n; i++) {
^
0_0_19231094_530.cpp:139:706: error: 'ans' was not declared in this scope
int Max; while(scanf("%d", &n) != EOF) { size = 0; tot = 0; all = 0; Max = 0; for(i = 0; i < n; i++) { scanf("%d %d", &P[i].x, &P[i].y); bin[ size++ ] = P[i].x; bin[ size++ ] = P[i].y; if(P[i].x > Max) Max = P[i].x; if(P[i].y > Max) Max = P[i].y; } sort(bin, bin + size); for(i = 0; i < size; i++) { if(i == 0 || bin[i] != bin[i-1]) bin[tot++] = bin[i]; } root = -1; for(i = 0; i < n; i++) { P[i]._ix = B(P[i].x); P[i]._iy = B(P[i].y); Insert(root, P[i]._ix, P[i]._iy, 0, tot-1, 0, tot-1); } ll ans = 0; for(i = 0; i < n; i++) {
^
|
