# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136024 | Kastanda | Game (IOI13_game) | C++11 | 4875 ms | 28800 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.
// ItnoE
#include<bits/stdc++.h>
#include "game.h"
using namespace std;
typedef long long ll;
const int N = 22005, SQ = 800;
int n, X[N], Y[N], P[N], rev[N];
ll Z[N];
vector < int > UX, UY, V[N];
map < pair < int , int > , int > MP;
struct Tree
{
int m;
vector < ll > G;
vector < int > A;
inline void Build()
{
m = (int)A.size();
G.resize(m + m);
for (int i = 0; i < m; i ++)
G[i + m] = Z[A[i]];
for (int i = m - 1; i; i --)
G[i] = __gcd(G[i << 1], G[i << 1 ^ 1]);
}
inline void Set(int i)
{
G[i + m] = Z[A[i]];
for (i += m; i > 1; i >>= 1)
G[i >> 1] = __gcd(G[i], G[i ^ 1]);
}
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... |