# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330045 | 2qbingxuan | Game (IOI13_game) | C++17 | 1 ms | 364 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>
#ifndef local
#include "game.h"
#endif // local
using namespace std;
using ll = long long;
const int N = 22000, LG = 30;
inline ll gcd(ll a, ll b) {
int s = __builtin_ctz(a | b);
while(a && b) {
a >>= __builtin_ctz(a);
b >>= __builtin_ctz(b);
if(a > b) a -= b;
else b -= a;
}
return (a | b) << s;
}
int R, C;
int cnt;
class Treap {
private:
struct node {
int key, sz;
ll val, ans;
node *l, *r;
node(int k, ll v) : key(k), sz(1), val(v), ans(v), l(0), r(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... |