| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 40668 |
2018-02-06T17:18:41 Z |
top34051 |
Game (IOI13_game) |
C++14 |
|
1 ms |
436 KB |
#include "game.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e7 + 5;
int R, C, sz = 1;
int rec[maxn][5];
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);
if(l>r || r<x || x<l) return ;
col_update(get(pos,2), 1, C, y, gcd2(val, gcd2(row_query(1,1,C,l,x-1,y,y), row_query(1,1,C,x+1,r,y,y))));
if(l==r) return ;
int mid = (l+r)/2;
row_update(get(pos,0), l, mid, x, y, val);
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 || r<x || x<l) return ;
if(l==r) {
seg[pos] = val;
// printf("------- seg[%d, %d] = %lld\n",l,r,seg[pos]);
return ;
}
int mid = (l+r)/2;
col_update(get(pos,0), l, mid, x, val);
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 0LL;
if(r1<=l && r<=r2) return col_query(get(pos,2), 1, C, c1, c2);
int mid = (l+r)/2;
return gcd2(row_query(get(pos,0), l, mid, r1, r2, c1, c2), row_query(get(pos,1), mid+1, r, r1, r2, c1, c2));
}
ll col_query(int pos, int l, int r, int x, int y) {
if(l>r || r<x || y<l) return 0LL;
if(x<=l && r<=y) return seg[pos];
int mid = (l+r)/2;
return gcd2(col_query(get(pos,0), l, mid, x, y), col_query(get(pos,1), mid+1, r, x, y));
}
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) {
// printf("QUERY (%d, %d) (%d, %d)\n",r1,r2,c1,c2);
return row_query(1, 1, R, r1, r2, c1, c2);
// int x,y;
// ll ans = 0;
// for(x=r1;x<=r2;x++) {
// for(y=c1;y<=c2;y++) {
// ans = gcd2(ans, row_query(1,1,R,x,x,y,y));
// }
// }
// return ans;
}
};
segtree tree;
void init(int N, int M) {
R = N; C = M;
}
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;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
128 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
436 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
436 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
