Submission #1013253

#TimeUsernameProblemLanguageResultExecution timeMemory
1013253parsadox2Game (IOI13_game)C++17
Compilation error
0 ms0 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; int N , M; long long gcd2(long long X, long long Y) { long long tmp; while (X != Y && Y != 0) { tmp = X; X = Y; Y = tmp % Y; } return X; } struct SEG{ struct NODE{ int lc , rc; long long g; NODE(){ lc = 0; rc = 0; g = 0; } }; vector <NODE> t; NODE emp; void Build() { t.push_back(emp); t.push_back(emp); } void Set(int id , long long vl) { int nd = 1 , nl = 0 , nr = N; while(nr - nl != 1) { int mid = (nl + nr) >> 1; if(id < mid) { if(t[nd].lc == 0) { t[nd].lc = t.size(); t.emplace_back(emp); } t[t[nd].lc].p = nd; nd = t[nd].lc; nr = mid; } else { if(t[nd].rc == 0) { t[nd].rc = t.size(); t.emplace_back(emp); } t[t[nd].rc].p = nd; nd = t[nd].rc; nl = mid; } } t[nd].g = vl; nd = t[nd].p; while(nd != 1) { t[nd].g = gcd2(t[t[nd].lc].g , t[t[nd].rc].g); nd = t[nd].p; } t[nd].g = gcd2(t[t[nd].lc].g , t[t[nd].rc].g); } /*void Set(int id , long long vl , int node = 1 , int nl = 0 , int nr = N) { int nd = node; if(nr - nl == 1) { t[nd].g = vl; return; } int mid = (nl + nr) >> 1; if(id < mid) { if(t[nd].lc == 0) { t[nd].lc = t.size(); t.emplace_back(emp); } Set(id , vl , t[nd].lc , nl , mid); } else { if(t[nd].rc == 0) { t[nd].rc = t.size(); t.emplace_back(emp); } Set(id , vl , t[nd].rc , mid , nr); } t[nd].g = gcd2(t[t[nd].lc].g , t[t[nd].rc].g); }*/ long long Get(int l , int r , int node = 1 , int nl = 0 , int nr = M) { if(r <= nl || nr <= l) return 0; if(l <= nl && nr <= r) return t[node].g; int mid = (nl + nr) >> 1; return gcd2(Get(l , r , t[node].lc , nl , mid) , Get(l , r , t[node].rc , mid , nr)); } }; struct SEG2{ struct NODE{ int lc , rc; SEG s; }; NODE emp; vector <NODE> t; void Build() { emp.s.Build(); emp.lc = 0; emp.rc = 0; t.push_back(emp); t.push_back(emp); } void Set(int id , int a , long long b) { int nd = 1 , nl = 0 , nr = N , mid; vector <int> vec; while(nr - nl != 1) { vec.push_back(nd); mid = (nl + nr) >> 1; if(id < mid) { if(t[nd].lc == 0) { t[nd].lc = t.size(); t.push_back(emp); } nr = mid; nd = t[nd].lc; } else { if(t[nd].rc == 0) { t[nd].rc = t.size(); t.push_back(emp); } nl = mid; nd = t[nd].rc; } } t[nd].s.Set(a , b); while(!vec.empty()) { int nd = vec.back(); vec.pop_back(); t[nd].s.Set(a , gcd2(t[t[nd].lc].s.Get(a , a + 1) , t[t[nd].rc].s.Get(a , a + 1))); } } /*void Set(int id , int a , long long b , int node = 1 , int nl = 0 , int nr = N) { int nd = node; if(nr - nl == 1) { t[nd].s.Set(a , b); return; } int mid = (nl + nr) >> 1; if(id < mid) { if(t[nd].lc == 0) { t[nd].lc = t.size(); t.push_back(emp); } Set(id , a , b , t[nd].lc , nl , mid); } else { if(t[nd].rc == 0) { t[nd].rc = t.size(); t.push_back(emp); } Set(id , a , b , t[nd].rc , mid , nr); } t[nd].s.Set(a , gcd2(t[t[nd].lc].s.Get(a , a + 1) , t[t[nd].rc].s.Get(a , a + 1))); }*/ long long Get(int l , int r , int s , int e , int node = 1 , int nl = 0 , int nr = N) { if(r <= nl || nr <= l) return 0; if(l <= nl && nr <= r) { long long x = t[node].s.Get(s , e); return x; } int mid = (nl + nr) >> 1; return gcd2(Get(l , r , s , e , t[node].lc , nl , mid) , Get(l , r , s , e , t[node].rc , mid , nr)); } } seg; void init(int R, int C) { seg.Build(); N = R; M = C; } void update(int P, int Q, long long K) { seg.Set(P , Q , K); } long long calculate(int P, int Q, int U, int V) { int l = min(P , U) , r = max(P , U); int s = min(Q , V) , e = max(Q , V); return seg.Get(l , r + 1 , s , e + 1); } /*signed main() { int R, C, N; int P, Q, U, V; long long K; int i, type; assert(scanf("%d", &R) == 1); assert(scanf("%d", &C) == 1); assert(scanf("%d", &N) == 1); init(R, C); std::vector<long long> answers; for (i = 0; i < N; i++) { assert(scanf("%d", &type) == 1); if (type == 1) { assert(scanf("%d%d%lld", &P, &Q, &K) == 3); update(P, Q, K); } else if (type == 2) { assert(scanf("%d%d%d%d", &P, &Q, &U, &V) == 4); answers.push_back(calculate(P, Q, U, V)); } } for (auto answer: answers) { printf("%lld\n", answer); } return 0; }*/ /* 2 3 4 1 0 0 20 1 0 2 15 1 1 1 12 2 0 0 1 1 */

Compilation message (stderr)

game.cpp: In member function 'void SEG::Set(int, long long int)':
game.cpp:47:29: error: '__gnu_cxx::__alloc_traits<std::allocator<SEG::NODE>, SEG::NODE>::value_type' {aka 'struct SEG::NODE'} has no member named 'p'
   47 |                 t[t[nd].lc].p = nd;
      |                             ^
game.cpp:58:29: error: '__gnu_cxx::__alloc_traits<std::allocator<SEG::NODE>, SEG::NODE>::value_type' {aka 'struct SEG::NODE'} has no member named 'p'
   58 |                 t[t[nd].rc].p = nd;
      |                             ^
game.cpp:64:20: error: '__gnu_cxx::__alloc_traits<std::allocator<SEG::NODE>, SEG::NODE>::value_type' {aka 'struct SEG::NODE'} has no member named 'p'
   64 |         nd = t[nd].p;
      |                    ^
game.cpp:68:24: error: '__gnu_cxx::__alloc_traits<std::allocator<SEG::NODE>, SEG::NODE>::value_type' {aka 'struct SEG::NODE'} has no member named 'p'
   68 |             nd = t[nd].p;
      |                        ^