# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437531 | He_Ren | Game (IOI13_game) | C++98 | 3264 ms | 59392 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;
typedef pair<int,int> pii;
inline ll gcd(ll a,ll b){ return b? gcd(b,a%b): a;}
namespace Segment_Tree_1
{
struct Node
{
Node *ls, *rs;
int l,r;
ll val;
Node(void){}
Node(int _l,int _r,ll _val): ls(0), rs(0), l(_l), r(_r), val(_val) {}
}*hd = 0;
inline Node* new_Node(int l,int r,ll val)
{
if(!hd)
{
static const int SIZ = 1e6;
hd = new Node[SIZ + 1];
for(int i=0; i<SIZ; ++i) (hd + i) -> rs = hd + i + 1;
(hd + SIZ) -> rs = 0;
}
Node *res = hd; hd = hd -> rs;
*res = Node(l,r,val);
return res;
# | 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... |