# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31434 | gs14004 | Game (IOI13_game) | C++14 | 6493 ms | 110336 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 <cstdlib>
int r,c;
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;
}
struct nodey{
nodey() : ls(NULL), rs(NULL), v(0ll), pos(0){}
nodey *ls,*rs;
long long v;
int pos;
};
struct nodex{
nodex() : ls(NULL), rs(NULL), ys(){}
nodex *ls,*rs;
nodey *ys;
}*root;
void Yadd(int y, int ps, int pe, nodey* p, long long v){
if(!p->ls && !p->rs && !p->pos){
p->pos = y+1;
p->v = v;
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... |