| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 121979 | yusufake | 게임 (IOI13_game) | C++98 | 컴파일 에러 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include "game.h"
using namespace std;
#define _ int v, int tl, int tr
#define tm (tl+tr >> 1)
#define sol L[v],tl,tm
#define sag R[v],tm+1,tr
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 22000 * 27 * 27;
#define Y[v] s[v]
#define Y[ L[v] ] s[ L[v] ]
#define Y[ R[v] ] s[ R[v] ]
int L[N],R[N],id;
ll s[N];
// 0 is empty node
// s[0] should be ineffective element
// Y[0], L[0], and R[0] should be 0
// 1 is the root of the -x axis segment tree
// Y[v] is the root of the segment tree of the interval that corresponds to node 'v' in -x axis segment tree
ll gcd(ll u, ll v) {
ll r;
while (v != 0) { r = u % v; u = v; v = r; }
return u;
}
ll qry_y(_, int ly, int ry) {
if(ly > tr || ry < tl || !v) return 0;
if (ly <= tl && tr <= ry) return s[v];
return gcd(qry_y(sol,ly,ry) , qry_y(sag,ly,ry));
}
ll qry_x(_, int lx, int rx, int ly, int ry) {
if(lx > tr || rx < tl) return 0;
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
return gcd(qry_x(sol,lx,rx,ly,ry) , qry_x(sag,lx,rx,ly,ry));
}
void up_y(_, int posy, int r1, int r2, ll t){
if(id == N - 5) while(1);
if(tl == tr){
s[v] = t == -1 ? gcd(s[r1] , s[r2]) : t;
return;
}
if(posy > tm) { if(!R[v]) R[v] = ++id; up_y(sag,posy,R[r1],R[r2],t); }
else { if(!L[v]) L[v] = ++id; up_y(sol,posy,L[r1],L[r2],t); }
s[v] = gcd(s[ L[v] ] , s[ R[v] ]);
}
void up_x(_, int posx, int posy, ll t){
if(id == N - 5) while(1);
if(tl < tr){
if(posx > tm) { if(!R[v]) R[v] = ++id; up_x(sag,posx,posy,t); }
else { if(!L[v]) L[v] = ++id; up_x(sol,posx,posy,t); }
}
if(!Y[v]) Y[v] = ++id;
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
}
void update(int posx, int posy, ll t){
up_x(1,0,mod,posx,posy,t);
}
ll calculate(int lx, int ly, int rx, int ry){
return qry_x(1,0,mod,lx,rx,ly,ry);
}
void init(int a, int b) {
memset(s , 0 , sizeof s);
// memset(Y , 0 , sizeof Y);
memset(L , 0 , sizeof L);
memset(R , 0 , sizeof R);
id = 1;
}
컴파일 시 표준 에러 (stderr) 메시지
grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
int res;
^~~
game.cpp:22:10: warning: ISO C++11 requires whitespace after the macro name
#define Y[v] s[v]
^
game.cpp:23:10: warning: ISO C++11 requires whitespace after the macro name
#define Y[ L[v] ] s[ L[v] ]
^
game.cpp:23:0: warning: "Y" redefined
#define Y[ L[v] ] s[ L[v] ]
game.cpp:22:0: note: this is the location of the previous definition
#define Y[v] s[v]
game.cpp:24:10: warning: ISO C++11 requires whitespace after the macro name
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:24:0: warning: "Y" redefined
#define Y[ R[v] ] s[ R[v] ]
game.cpp:23:0: note: this is the location of the previous definition
#define Y[ L[v] ] s[ L[v] ]
game.cpp: In function 'll qry_y(int, int, int, int, int)':
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:8:21: note: in expansion of macro 'tm'
#define sol L[v],tl,tm
^~
game.cpp:46:19: note: in expansion of macro 'sol'
return gcd(qry_y(sol,ly,ry) , qry_y(sag,ly,ry));
^~~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:9:18: note: in expansion of macro 'tm'
#define sag R[v],tm+1,tr
^~
game.cpp:46:38: note: in expansion of macro 'sag'
return gcd(qry_y(sol,ly,ry) , qry_y(sag,ly,ry));
^~~
game.cpp: In function 'll qry_x(int, int, int, int, int, int, int)':
game.cpp:24:12: warning: capture of variable 'R' with non-automatic storage duration
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp:27:10: note: 'int R [16038000]' declared here
int L[N],R[N],id;
^
game.cpp:24:13: error: expected ',' before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp:24:13: error: expected identifier before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp: In lambda function:
game.cpp:24:19: error: expected '{' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp: In function 'll qry_x(int, int, int, int, int, int, int)':
game.cpp:24:19: error: expected ')' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp:50:61: error: invalid user-defined conversion from 'qry_x(int, int, int, int, int, int, int)::<lambda()>' to 'int' [-fpermissive]
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp:24:17: note: candidate is: qry_x(int, int, int, int, int, int, int)::<lambda()>::operator void (*)()() const <near match>
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp:24:17: note: no known conversion from 'void (*)()' to 'int'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:50:41: note: in expansion of macro 'Y'
if (lx <= tl && tr <= rx) return qry_y(Y[v], 0, mod, ly, ry);
^
game.cpp:43:4: note: initializing argument 1 of 'll qry_y(int, int, int, int, int)'
ll qry_y(_, int ly, int ry) {
^~~~~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:8:21: note: in expansion of macro 'tm'
#define sol L[v],tl,tm
^~
game.cpp:51:19: note: in expansion of macro 'sol'
return gcd(qry_x(sol,lx,rx,ly,ry) , qry_x(sag,lx,rx,ly,ry));
^~~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:9:18: note: in expansion of macro 'tm'
#define sag R[v],tm+1,tr
^~
game.cpp:51:44: note: in expansion of macro 'sag'
return gcd(qry_x(sol,lx,rx,ly,ry) , qry_x(sag,lx,rx,ly,ry));
^~~
game.cpp: In function 'void up_y(int, int, int, int, int, int, ll)':
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:60:12: note: in expansion of macro 'tm'
if(posy > tm) { if(!R[v]) R[v] = ++id; up_y(sag,posy,R[r1],R[r2],t); }
^~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:9:18: note: in expansion of macro 'tm'
#define sag R[v],tm+1,tr
^~
game.cpp:60:46: note: in expansion of macro 'sag'
if(posy > tm) { if(!R[v]) R[v] = ++id; up_y(sag,posy,R[r1],R[r2],t); }
^~~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:8:21: note: in expansion of macro 'tm'
#define sol L[v],tl,tm
^~
game.cpp:61:46: note: in expansion of macro 'sol'
else { if(!L[v]) L[v] = ++id; up_y(sol,posy,L[r1],L[r2],t); }
^~~
game.cpp: In function 'void up_x(int, int, int, int, int, ll)':
game.cpp:65:21: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
if(id == N - 5) while(1);
^~~~~
game.cpp:66:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
if(tl < tr){
^~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:67:13: note: in expansion of macro 'tm'
if(posx > tm) { if(!R[v]) R[v] = ++id; up_x(sag,posx,posy,t); }
^~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:9:18: note: in expansion of macro 'tm'
#define sag R[v],tm+1,tr
^~
game.cpp:67:47: note: in expansion of macro 'sag'
if(posx > tm) { if(!R[v]) R[v] = ++id; up_x(sag,posx,posy,t); }
^~~
game.cpp:7:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
#define tm (tl+tr >> 1)
~~^~
game.cpp:8:21: note: in expansion of macro 'tm'
#define sol L[v],tl,tm
^~
game.cpp:68:47: note: in expansion of macro 'sol'
else { if(!L[v]) L[v] = ++id; up_x(sol,posx,posy,t); }
^~~
game.cpp:24:12: warning: capture of variable 'R' with non-automatic storage duration
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:6: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp:27:10: note: 'int R [16038000]' declared here
int L[N],R[N],id;
^
game.cpp:24:13: error: expected ',' before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:6: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp:24:13: error: expected identifier before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:6: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp: In lambda function:
game.cpp:24:19: error: expected '{' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:6: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp: In function 'void up_x(int, int, int, int, int, ll)':
game.cpp:24:19: error: expected ')' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:6: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp:24:12: warning: capture of variable 'R' with non-automatic storage duration
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:12: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp:27:10: note: 'int R [16038000]' declared here
int L[N],R[N],id;
^
game.cpp:24:13: error: expected ',' before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:12: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp:24:13: error: expected identifier before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:12: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp: In lambda function:
game.cpp:24:19: error: expected '{' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:12: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp: In function 'void up_x(int, int, int, int, int, ll)':
game.cpp:24:19: error: expected ';' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:70:12: note: in expansion of macro 'Y'
if(!Y[v]) Y[v] = ++id;
^
game.cpp:24:12: warning: capture of variable 'R' with non-automatic storage duration
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:27:10: note: 'int R [16038000]' declared here
int L[N],R[N],id;
^
game.cpp:24:13: error: expected ',' before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:13: error: expected identifier before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp: In lambda function:
game.cpp:24:19: error: expected '{' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp: In function 'void up_x(int, int, int, int, int, ll)':
game.cpp:24:19: error: expected ')' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:12: warning: capture of variable 'R' with non-automatic storage duration
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:27:10: note: 'int R [16038000]' declared here
int L[N],R[N],id;
^
game.cpp:24:13: error: expected ',' before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:13: error: expected identifier before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp: In lambda function:
game.cpp:24:19: error: expected '{' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp: In function 'void up_x(int, int, int, int, int, ll)':
game.cpp:24:19: error: expected ')' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:12: warning: capture of variable 'R' with non-automatic storage duration
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:33: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:27:10: note: 'int R [16038000]' declared here
int L[N],R[N],id;
^
game.cpp:24:13: error: expected ',' before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:33: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:13: error: expected identifier before '[' token
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:33: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp: In lambda function:
game.cpp:24:19: error: expected '{' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:33: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp: In function 'void up_x(int, int, int, int, int, ll)':
game.cpp:24:19: error: expected ')' before 's'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:33: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:71:56: error: invalid user-defined conversion from 'up_x(int, int, int, int, int, ll)::<lambda()>' to 'int' [-fpermissive]
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:17: note: candidate is: up_x(int, int, int, int, int, ll)::<lambda()>::operator void (*)()() const <near match>
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:17: note: no known conversion from 'void (*)()' to 'int'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:7: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:54:6: note: initializing argument 1 of 'void up_y(int, int, int, int, int, int, ll)'
void up_y(_, int posy, int r1, int r2, ll t){
^~~~
game.cpp:71:56: error: invalid user-defined conversion from 'up_x(int, int, int, int, int, ll)::<lambda()>' to 'int' [-fpermissive]
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:17: note: candidate is: up_x(int, int, int, int, int, ll)::<lambda()>::operator void (*)()() const <near match>
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:24:17: note: no known conversion from 'void (*)()' to 'int'
#define Y[ R[v] ] s[ R[v] ]
^
game.cpp:71:23: note: in expansion of macro 'Y'
up_y(Y[v],0,mod,posy,Y[ L[v] ],Y[ R[v] ],(tl==tr?t:-1));
^
game.cpp:54:6: note: initializing argument 5 of 'void up_y(int, int, int, int, int, int, ll)'
void up_y(_, int posy, int r1, int r2, ll t){
^~~~
game.cpp:71:56: error: invalid user-defined conversion from 'up_x(int, int, int, int, int, ll)::