# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597218 | Bench0310 | Game (IOI13_game) | C++17 | 1 ms | 468 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;
int N,M;
struct Node
{
ll g;
Node *l,*r;
Node(ll _g=0){g=_g;l=r=nullptr;}
void extend(){if(l==nullptr){l=new Node(); r=new Node();}}
void pull(){g=gcd(l->g,r->g);}
};
struct Up
{
Node *root;
Up *l,*r;
Up(){root=new Node();l=r=nullptr;}
void extend(){if(l==nullptr){l=new Up(); r=new Up();}}
};
Up *st;
void update_c(Node *now,int l,int r,int pos,ll x)
{
if(l==r) now->g=x;
# | 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... |