Submission #1246565

#TimeUsernameProblemLanguageResultExecution timeMemory
1246565aykhnGame (IOI13_game)C++20
0 / 100
0 ms328 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int MXN = 2e3 + 5; int n, m; int t[MXN << 2][MXN << 2]; void init(int R, int C) { n = R, m = C; } int sum_y(int vx, int vy, int tly, int try_, int ly, int ry) { if (ly > ry) return 0; if (ly == tly && try_ == ry) return t[vx][vy]; int tmy = (tly + try_) / 2; return gcd(sum_y(vx, vy*2, tly, tmy, ly, min(ry, tmy)), sum_y(vx, vy*2+1, tmy+1, try_, max(ly, tmy+1), ry)); } int sum_x(int vx, int tlx, int trx, int lx, int rx, int ly, int ry) { if (lx > rx) return 0; if (lx == tlx && trx == rx) return sum_y(vx, 1, 0, m-1, ly, ry); int tmx = (tlx + trx) / 2; return gcd(sum_x(vx*2, tlx, tmx, lx, min(rx, tmx), ly, ry), sum_x(vx*2+1, tmx+1, trx, max(lx, tmx+1), rx, ly, ry)); } void update_y(int vx, int lx, int rx, int vy, int ly, int ry, int x, int y, int new_val) { if (ly == ry) { if (lx == rx) t[vx][vy] = new_val; else t[vx][vy] = gcd(t[vx*2][vy], t[vx*2+1][vy]); } else { int my = (ly + ry) / 2; if (y <= my) update_y(vx, lx, rx, vy*2, ly, my, x, y, new_val); else update_y(vx, lx, rx, vy*2+1, my+1, ry, x, y, new_val); t[vx][vy] = gcd(t[vx][vy*2], t[vx][vy*2+1]); } } void update_x(int vx, int lx, int rx, int x, int y, int new_val) { if (lx != rx) { int mx = (lx + rx) / 2; if (x <= mx) update_x(vx*2, lx, mx, x, y, new_val); else update_x(vx*2+1, mx+1, rx, x, y, new_val); } update_y(vx, lx, rx, 1, 0, m-1, x, y, new_val); } void update(int P, int Q, long long K) { update_x(1, 0, n - 1, P, Q, K); } long long calculate(int P, int Q, int U, int V) { return sum_x(1, 0, n - 1, P, U, Q, V); }
#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...