# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24120 | Mamnoon_Siam | Game (IOI13_game) | C++14 | 3406 ms | 229836 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>
using namespace std;
#ifndef __GAME_H__
#define __GAME_H__
#ifdef __cplusplus
extern "C" {
#endif
const long long maxn=2700;
long long tree[maxn*2][maxn*2]; long long maxR, maxC;
vector<long long> edit;
long long gcd(long long X, long long Y) {
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
void build_merge(long long parent, long long left, long long right, long long node, long long b, long long e)
{
if(b==e) { tree[parent][node] = gcd(tree[left][node], tree[right][node]); return ; }
long long __left=node<<1; long long __right=__left+1; long long mid=(b+e)>>1;
build_merge(parent, left, right, __left, b, mid);
Compilation message (stderr)
# | 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... |