# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98837 | Alexa2001 | Game (IOI13_game) | C++17 | 4913 ms | 96444 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 "game.h"
#include <bits/stdc++.h>
#define left_son (node<<1)
#define right_son ((node<<1)|1)
#define mid ((st+dr)>>1)
using namespace std;
typedef long long ll;
const int Nmax = 2005;
int N, M, Nr100, Nr10, Y1, Y2;
ll ans, a[Nmax + 200][Nmax + 200];
ll gcd2(ll X, ll Y)
{
if(!Y) return X;
ll rest = X % Y;
while(rest)
X = Y, Y = rest, rest = X % Y;
return Y;
}
class SegTree
{
ll a[Nmax<<2];
public:
void update(int node, int st, int dr, int pos, ll val)
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... |