#include "game.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e3 + 5;
int R, C, sz = 1;
int rec[maxn][3];
ll seg[maxn];
ll gcd2(ll X, ll Y) {
ll tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
class segtree {
public:
int get(int pos, int dir) {
if(!rec[pos][dir]) rec[pos][dir] = ++sz;
return rec[pos][dir];
}
void row_update(int pos, int l, int r, int x, int y, ll val) {
// printf("row_update [%d, %d] : (%d, %d) val = %lld\n",l,r,x,y,val);
col_update(get(pos,2), 1, C, y, val);
if(l==r) return ;
int mid = (l+r)/2;
if(x<=mid) row_update(get(pos,0), l, mid, x, y, val);
else row_update(get(pos,1), mid+1, r, x, y, val);
}
void col_update(int pos, int l, int r, int x, ll val) {
// printf("------- col_update [%d, %d] : (%d) val = %lld\n",l,r,x,val);
if(l==r) {
seg[pos] = val;
// printf("------- seg[%d, %d] = %lld\n",l,r,seg[pos]);
return ;
}
int mid = (l+r)/2;
if(x<=mid) col_update(get(pos,0), l, mid, x, val);
else col_update(get(pos,1), mid+1, r, x, val);
seg[pos] = gcd2(seg[get(pos,0)], seg[get(pos,1)]);
// printf("------- seg[%d, %d] = %lld (%lld and %lld)\n",l,r,seg[pos],seg[get(pos,0)],seg[get(pos,1)]);
}
ll row_query(int pos, int l, int r, int r1, int r2, int c1, int c2) {
if(l>r || r<r1 || r2<l) return 0;
if(r1<=l && r<=r2) return col_query(get(pos,2), 1, C, c1, c2);
int mid = (l+r)/2;
ll res = 0;
if(mid>=r1) res = gcd2(res, row_query(get(pos,0), l, mid, r1, r2, c1, c2));
if(mid+1<=r2) res = gcd2(res, row_query(get(pos,1), mid+1, r, r1, r2, c1, c2));
return res;
}
ll col_query(int pos, int l, int r, int x, int y) {
if(l>r || r<x || y<l) return 0;
if(x<=l && r<=y) return seg[pos];
int mid = (l+r)/2;
ll res = 0;
if(mid>=x) res = gcd2(res, col_query(get(pos,0), l, mid, x, y));
if(mid+1<=y) res = gcd2(res, col_query(get(pos,1), mid+1, r, x, y));
return res;
}
void update(int x, int y, ll val) {
row_update(1, 1, R, x, y, val);
}
ll query(int r1, int r2, int c1, int c2) {
return row_query(1, 1, R, r1, r2, c1, c2);
}
};
segtree tree;
void init(int N, int M) {
R = N; C = M;
asser(R<=100 && C<=100);
}
void update(int P, int Q, ll K) {
tree.update(P+1, Q+1, K);
}
long long calculate(int P, int Q, int U, int V) {
return tree.query(P+1, U+1, Q+1, V+1);
}
Compilation message
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 'void init(int, int)':
game.cpp:78:27: error: 'asser' was not declared in this scope
asser(R<=100 && C<=100);
^
