# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331856 | aryan12 | Game (IOI13_game) | C++17 | 1572 ms | 256004 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 "game.h"
#include <bits/stdc++.h>
using namespace std;
const long long N = 2000;
vector<long long> seg[N * 4 + 2];
long long row, col;
long long gcd2(long long X, long long Y) {
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
void init(int R, int C) {
row = R;
col = C;
for(long long i = 0; i <= R * 4; i++) {
seg[i].resize(C * 4 + 1, 0);
}
}
void updateY(long long l, long long r, long long xpos, long long pos, long long xl, long long xr, long long q, long long val) {
if(l == r) {
if(xl == xr) {
seg[xpos][pos] = val;
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |