Submission #62469

#TimeUsernameProblemLanguageResultExecution timeMemory
62469ggohGame (IOI13_game)C++98
0 / 100
4 ms580 KiB
#include "game.h" #include<algorithm> #include<vector> int a,b,X,t; struct A{ int left,right,ynum; }; struct B{ int left,right;long long val; }; std::vector<A>xTree; std::vector<B>yTree; long long gcd2(long long xx,long long yy){ if(yy==0)return xx; return gcd2(yy,xx%yy); } void yup(int num,int s,int e,int num1,int num2,int yco,long long v) { if(s==e){ if(num1==-1&&num2==-1)yTree[num].val=v; else yTree[num].val=gcd2(num1==-1?0:yTree[num1].val,num2==-1?0:yTree[num2].val); return ; } if((s+e)/2>=yco) { if(yTree[num].left==-1) { yTree[num].left=yTree.size(); yTree.push_back({-1,-1,0}); } if(num1>=0)num1=yTree[num1].left; if(num2>=0)num2=yTree[num2].left; yup(yTree[num].left,s,(s+e)/2,num1,num2,yco,v); } else { if(yTree[num].right==-1) { yTree[num].right=yTree.size(); yTree.push_back({-1,-1,0}); } if(num1>=0)num1=yTree[num1].right; if(num2>=0)num2=yTree[num2].right; yup(yTree[num].right,(s+e)/2+1,e,num1,num2,yco,v); } yTree[num].val=gcd2(yTree[num].left>=0?yTree[yTree[num].left].val:0,yTree[num].right>=0?yTree[yTree[num].right].val:0); } void xup(int num,int s,int e,int xco,int yco,long long v) { if(xTree[num].ynum==-1) { xTree[num].ynum=yTree.size(); yTree.push_back({-1,-1,0}); } if(s==e) { yup(xTree[num].ynum,1,X,-1,-1,yco,v); return ; } if((s+e)/2>=xco) { if(xTree[num].left==-1) { xTree[num].left=xTree.size(); xTree.push_back({-1,-1,-1}); } xup(xTree[num].left,s,(s+e)/2,xco,yco,v); } else { if(xTree[num].right==-1) { xTree[num].right=xTree.size(); xTree.push_back({-1,-1,-1}); } xup(xTree[num].right,(s+e)/2+1,e,xco,yco,v); } yup(xTree[num].ynum,1,X,xTree[num].left==-1?-1:xTree[xTree[num].left].ynum,xTree[num].right==-1?-1:xTree[xTree[num].right].ynum,yco,v); } long long yans(int num,int s,int e,int py,int qy) { if(s>qy||e<py)return 0ll; if(py<=s&&e<=qy)return yTree[num].val; long long l=0,r=0; if(yTree[num].left>=0)l=yans(yTree[num].left,s,(s+e)/2,py,qy); if(yTree[num].right>=0)r=yans(yTree[num].right,(s+e)/2+1,e,py,qy); return gcd2(l,r); } long long xans(int num,int s,int e,int px,int qx,int py,int qy) { if(s>qx||e<px)return 0ll; if(px<=s&&e<=qx) { if(xTree[num].ynum>=0)return yans(xTree[num].ynum,1,X,py,qy); else return 0ll; } long long l=0,r=0; if(xTree[num].left>=0)l=xans(xTree[num].left,s,(s+e)/2,px,qx,py,qy); if(xTree[num].right>=0)r=xans(xTree[num].right,(s+e)/2+1,e,px,qx,py,qy); return gcd2(l,r); } void init(int R, int C) { a=R;b=C;X=1e9; xTree.push_back({-1,-1,0}); yTree.push_back({-1,-1,0}); } void update(int P, int Q, long long K) { xup(0,1,X,P,Q,K); } long long calculate (int P, int Q, int U, int V) { return xans(0,1,X,P,U,Q,V); }

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...