제출 #962757

#제출 시각아이디문제언어결과실행 시간메모리
962757serkanrashid게임 (IOI13_game)C++14
컴파일 에러
0 ms0 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; struct Tnode { long long a; Tnode *l, *r; Tnode() { a = 0; l = r = nullptr; } }; struct Tree { Tnode *A; Tree *L, *R; Tree() { A = nullptr; L = R = nullptr; } }; Tree *Root; int r,c; int Ql,Qr,ql,qr; int Pos,pos,val; long long merge1(Tnode *&t1, Tnode *&t2) { //if(t1==nullptr&&t2==nullptr) return 0; if(t1==nullptr) return t2->a; if(t2==nullptr) return t1->a; return gcd2(t1->a,t2->a); } void upd(Tnode *&t, int l, int r) { if(t==nullptr) t = new Tnode(); if(l==r) { t->a = val; return; } int mid = (l+r)/2; if(mid<=pos) upd(t->l,l,mid+0); else upd(t->r,mid+1,r); t->a = merge1(t->l,t->r); } Tree *getA(Tree *&t) { if(t==nullptr) return nullptr; return t->A; } long long *geta(Tndoe *&t) { if(t==nullptr) return 0; return t->a; } void Merge(Tnode *&t, Tnode *&t1, Tnode *&t2, int l, int r) { if(t==nullptr) t = new Tnode(); if(l==r) { t->a = gcd2(geta(t1),geta(t2)); return; } int mid = (l+r)/2; if(mid<=pos) Merge(t->l,t1->l,t2->l,l,mid+0); else Merge(t->r,t1->r,t2->r,mid+1,r); t->a = gcd2(geta(t->l),geta(t->r)); } void Upd(Tree *&t, int l, int r) { if(t==nullptr) t = new Tree(); if(l==r) { upd(t->A,0,c-1); return; } int mid = (l+r)/2; if(Pos<=mid) Upd(t->L,l,mid+0); else Upd(t->R,mid+1,r); Merge(t->A,getA(t->L),getA(t->R),0,c-1); } void update(int P, int Q, long long K) { Pos = P; pos = Q; val = K; Upd(Root,0,r-1); } long long query(Tnode *&t, int l, int r) { if(r<ql||qr<l||l>r) return -1; if(t==nullptr) return 0; if(ql<=l&&r<=qr) return t->a; int mid = (l+r)/2; long long ch1 = query(t->l,l,mid+0); long long ch2 = query(t->r,mid+1,r); if(ch1==-1) return ch2; if(ch2==-1) return ch1; return gcd2(ch1,ch2); } long long Query(Tree *&t, int l, int r) { if(r<Ql||Qr<l||l>r) return -1; if(t==nullptr) return 0; if(Ql<=l&&r<=Qr) return query(t->A,0,c-1); int mid = (l+r)/2; long long ch1 = Query(t->L,l,mid+0); long long ch2 = Query(t->R,mid+1,r); if(ch1==-1) return ch2; if(ch2==-1) return ch1; return gcd2(ch1,ch2); } long long calculate(int P, int Q, int U, int V) { ql = Q; qr = V; /// Ql = P; Qr = U; long long ans = Query(Root,0,r-1); if(ans==-1) ans = 0; return ans; } void init(int R, int C) { r = R; c = C; }

컴파일 시 표준 에러 (stderr) 메시지

game.cpp: In function 'long long int merge1(Tnode*&, Tnode*&)':
game.cpp:39:12: error: 'gcd2' was not declared in this scope
   39 |     return gcd2(t1->a,t2->a);
      |            ^~~~
game.cpp: In function 'Tree* getA(Tree*&)':
game.cpp:59:15: error: cannot convert 'Tnode*' to 'Tree*' in return
   59 |     return t->A;
      |            ~~~^
      |               |
      |               Tnode*
game.cpp: At global scope:
game.cpp:62:17: error: 'Tndoe' was not declared in this scope; did you mean 'Tnode'?
   62 | long long *geta(Tndoe *&t)
      |                 ^~~~~
      |                 Tnode
game.cpp:62:25: error: 't' was not declared in this scope
   62 | long long *geta(Tndoe *&t)
      |                         ^
game.cpp: In function 'void Merge(Tnode*&, Tnode*&, Tnode*&, int, int)':
game.cpp:73:28: error: 'geta' cannot be used as a function
   73 |         t->a = gcd2(geta(t1),geta(t2));
      |                            ^
game.cpp:73:37: error: 'geta' cannot be used as a function
   73 |         t->a = gcd2(geta(t1),geta(t2));
      |                                     ^
game.cpp:73:16: error: 'gcd2' was not declared in this scope
   73 |         t->a = gcd2(geta(t1),geta(t2));
      |                ^~~~
game.cpp:79:26: error: 'geta' cannot be used as a function
   79 |     t->a = gcd2(geta(t->l),geta(t->r));
      |                          ^
game.cpp:79:37: error: 'geta' cannot be used as a function
   79 |     t->a = gcd2(geta(t->l),geta(t->r));
      |                                     ^
game.cpp:79:12: error: 'gcd2' was not declared in this scope
   79 |     t->a = gcd2(geta(t->l),geta(t->r));
      |            ^~~~
game.cpp: In function 'void Upd(Tree*&, int, int)':
game.cpp:93:20: error: invalid initialization of non-const reference of type 'Tnode*&' from an rvalue of type 'Tree*'
   93 |     Merge(t->A,getA(t->L),getA(t->R),0,c-1);
      |                ~~~~^~~~~~
game.cpp:68:31: note: in passing argument 2 of 'void Merge(Tnode*&, Tnode*&, Tnode*&, int, int)'
   68 | void Merge(Tnode *&t, Tnode *&t1, Tnode *&t2, int l, int r)
      |                       ~~~~~~~~^~
game.cpp: In function 'long long int query(Tnode*&, int, int)':
game.cpp:114:12: error: 'gcd2' was not declared in this scope
  114 |     return gcd2(ch1,ch2);
      |            ^~~~
game.cpp: In function 'long long int Query(Tree*&, int, int)':
game.cpp:127:12: error: 'gcd2' was not declared in this scope
  127 |     return gcd2(ch1,ch2);
      |            ^~~~