# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4624 | cki86201 | Game (IOI13_game) | C++98 | 8452 ms | 76316 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<stdlib.h>
typedef long long ll;
int R,C;
ll gc(ll x,ll y){
ll tmp=-1;
while(x!=tmp&&y)tmp=x,x=y,y=tmp%y;
return x;
}
struct node1{
node1(){}
node1(int s,int d,ll x):s(s),d(d),x(x),right(0),left(0){}
int s,d;
ll x;
node1 *right,*left;
};
struct node2{
node1 *x;
node2 *right,*left;
}*tree;
void init(int R, int C){
::R=R,::C=C;
tree = new node2();
}
# | 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... |