# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1237434 | speedcode | 스핑크스 (IOI24_sphinx) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
#define Algerian ios::sync_with_stdio(false);
#define OI cin.tie(0);
typedef long long ll;
void Solve(int N, int node, vector<int> &ans){
vector<int> E(N,N);
E[node]=-1; E[node+1]=-1;
int exp = perform_experiment(E);
if(node==0 || node == N-2){
if(exp<=2) ans[node+1]=ans[node];
else ans[node+1]=ans[node]+1;
}
else{
if(exp<=3) ans[node+1]=ans[node];
else ans[node+1]=ans[node]+1;
}
}
vector<int> find_colours(int N, vector<int> X, vector<int> Y){
vector<int> ans(N,0);
for (int i = 0; i < N-1; ++i){
Solve(N,i,ans);
}
return ans;
}