| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 121593 | yusufake | Game (IOI13_game) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 * 500;
int Y[N],L[N],R[N],id=1;
ll s[N];
// 0 is empty node
// s[0] should be ineffective element
// 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 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) , qry_y(sag));
}
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(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(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) {}