# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167014 | 12345678 | Game (IOI13_game) | C++17 | 10205 ms | 79064 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
mt19937 rng(time(0));
ll r, c;
struct treap
{
struct node
{
ll sz, key, vl, g;
pair<ll, ll> idx;
node *l, *r;
node(ll vl, pair<ll, ll> idx): sz(1), key(rng()), vl(vl), g(vl), idx(idx), l(0), r(0){}
};
typedef node* pnode;
pnode rt=0;
ll size(pnode x)
{
return x?x->sz:0;
}
ll g(pnode x)
{
return x?x->g:0;
}
# | 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... |