# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1038409 | _8_8_ | Game (APIO22_game) | C++17 | 19 ms | 106320 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>
using namespace std;
const int N = 3e5 + 12;
vector<int> g[N],gr[N];
set<int> L[N * 3],R[N * 3];
int k;
int nn;
void build(int v = 1,int tl = 0,int tr = k - 1) {
if(tl > tr) return;
int tm = (tl + tr) >> 1;
for(int i = tl;i <= tr;i++) {
if(i <= tm) {
L[v].insert(i);
}
if(i >= tm) {
R[v].insert(i);
}
}
if(tl == tr) return;
build(v + v,tl,tm - 1);
build(v + v + 1,tm + 1,tr);
}
void init(int n, int K) {
k = K;
nn = n;
for(int i = 0;i <= k - 2;i++) {
g[i].push_back(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... |