# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330052 | 2qbingxuan | Game (IOI13_game) | C++17 | 11865 ms | 55832 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.
#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#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) {
if(!a || !b) return a | b;
int s = __builtin_ctzll(a | b);
a >>= s, b >>= s;
while(a && b) {
a >>= __builtin_ctzll(a);
b >>= __builtin_ctzll(b);
if(a > b) a -= b;
else if(b > a) b -= a;
else return a << s;
}
return (a | b) << s;
}
int R, C;
class Treap {
private:
struct node {
Compilation message (stderr)
# | 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... |