Submission #65459

#TimeUsernameProblemLanguageResultExecution timeMemory
65459boookGame (IOI13_game)C++14
63 / 100
4771 ms257024 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; #define REP(i,j,k) for(int i = j ; i < k ; ++i) #define RREP(i,j,k) for(int i = j ; i >=k ; --i) #define A first #define B second #define mp make_pair #define pb emplace_back #define PII pair<long long , long long> #define MEM(i,j) memset(i , j , sizeof i) #define ALL(i) i.begin() , i.end() #define DBGG(i,j) cout << i << " " << j << endl #define DB4(i,j,k,l) cout << i << " " << j << " " << k << " " << l << endl #define IOS cin.tie(0) , cout.sync_with_stdio(0) #define endl "\n" //------------------------------------------------------------ // #include "grader.h" #include "game.h" #define MAX 23000 #define INF 0x3f3f3f3f #define mid (l + (r - l) / 2) long long n , m; long long sum[MAX * 700]; int ls[MAX * 700] , rs[MAX * 700] , pos = 2; long long GCD(long long a , long long b){ // if(a && b) cout << a << " " << b << endl; return __gcd(a , b); } void init(int R, int C) { n = R , m = C; } void update2(long long now , long long l , long long r , long long x , long long y , long long val){ if(l == r) sum[now] = val;// , DB4("now update" , l , now , val); else { if((y * n + x) <= mid + 0){ if(ls[now] == 0) ls[now] = pos ++; update2(ls[now] , l , mid + 0 , x , y , val); } if(mid + 1 <= y * n + x){ if(rs[now] == 0) rs[now] = pos ++; update2(rs[now] , mid + 1 , r , x , y , val); } sum[now] = GCD(sum[ls[now]] , sum[rs[now]]); } // DB4("now = " , sum[now] , sum[ls[now]] , sum[rs[now]]); } void update1(long long now , long long l , long long r , long long x , long long y , long long val){ if(sum[now] == 0) sum[now] = pos ++; update2(sum[now] , 0 , m * n , x , y , val); if(l == r); else { if(x <= mid + 0){ if(ls[now] == 0) ls[now] = pos ++; update1(ls[now] , l , mid + 0 , x , y , val); } if(mid + 1 <= x){ if(rs[now] == 0) rs[now] = pos ++; update1(rs[now] , mid + 1 , r , x , y , val); } } } void update(int P, int Q, long long K) { update1(1 , 0 , n , P , Q , K); } long long query2(long long now , long long l , long long r , long long ql , long long qr){ // DBGG("now = " , now); if(now == 0) return 0; if(ql <= l && r <= qr) return sum[now]; else if(qr <= mid + 0) return query2(ls[now] , l , mid + 0 , ql , qr); else if(mid + 1 <= ql) return query2(rs[now] , mid + 1 , r , ql , qr); else GCD(query2(ls[now] , l , mid + 0 , ql , qr) , query2(rs[now] , mid + 1 , r , ql , qr)); } long long query1(long long now , long long l , long long r , long long ql , long long qr , long long c , long long d){ if(now == 0) return 0; if(ql <= l && r <= qr) return query2(sum[now] , 0 , m * n , c * n , d * n + n - 1); else if(qr <= mid + 0) return query1(ls[now] , l , mid + 0 , ql , qr , c , d); else if(mid + 1 <= ql) return query1(rs[now] , mid + 1 , r , ql , qr , c , d); return GCD(query1(ls[now] , l , mid + 0 , ql , qr , c , d) , query1(rs[now] , mid + 1 , r , ql , qr , c , d)); } long long calculate(int P, int Q, int U, int V) { return query1(1 , 0 , n , 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;
      ^~~
game.cpp: In function 'long long int query2(long long int, long long int, long long int, long long int, long long int)':
game.cpp:76:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...