# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169633 | lighton | Game (APIO22_game) | C++20 | 1412 ms | 214112 KiB |
#include "game.h"
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define forf(i,s,e) for(int i = s; i<=e; i++)
#define forb(i,s,e) for(int i = s; i>=e; i--)
#define idx(i,v) lower_bound(all(v),i)-v.begin()
#define comp(v) v.erase(unique(all(v)),v.end())
#define sz(v) (int)v.size()
#define pb push_back
#pragma GCC optimize("O3, Ofast, unroll-loops")
using namespace std;
int N,K;
int S[1000001][31];
set<pair<int,int> > SET;
int chk[1000001][31];
vector<pair<int,int> > adj[1000001],radj[1000001];
void dnc(int dep, int s, int e){
if(s>e) return;
int m = s+e>>1;
forf(i,2*s,2*m) S[i][dep] = 1;
forf(i,2*m+1,2*e+1) S[i][dep] = 2;
dnc(dep+1,s,m-1), dnc(dep+1,m+1,e);
}
int f = 0;
int cnt = 0;
void upd(int now, int h){
if(h!= -1) {
assert(h<21);
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... |