# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
351262 | Mefarnis | Game (IOI13_game) | C++14 | 13090 ms | 103024 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>
#include "game.h"
using namespace std;
typedef long long LL;
struct Quad {
LL val;
Quad* child[2][2];
Quad() {
val = 0;
child[0][0] = NULL;
child[0][1] = NULL;
child[1][0] = NULL;
child[1][1] = NULL;
}
}*root;
LL gcd(LL x, LL y) {
if(!y)
return x;
return gcd(y,x%y);
}
int n,m;
void init(int xl , int xr , int yl , int yr , Quad* node) {
if(xl == xr && yl == yr)
return;
int xm = (xl+xr)>>1;
int ym = (yl+yr)>>1;
# | 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... |