#include <bits/stdc++.h>
#include "sphinx.h"
#include "grader.cpp"
using namespace std;
int pr2[251];
int find2(int x){
if(x==pr2[x])return x;
return pr2[x] = find2(pr2[x]);
}
void mergegroup2(int a,int b){
a = find2(a);
b = find2(b);
if(a==b)return ;
pr2[a] = b;
}
int pr[251];
vector<int> adjj[251],nadj[251];
int find(int x){
if(x==pr[x])return x;
return pr[x] = find(pr[x]);
}
bool mergegroup(int a,int b){
a = find(a);
b = find(b);
if(a==b)return 0;
pr[a] = b;
return 1;
}
vector<int> even,odd;
int VIS[251];
void dfs(int i,int dep){
VIS[i] =1 ;
if(dep)even.push_back(i);
else odd.push_back(i);
for(auto j:nadj[i]){
if(!VIS[j])dfs(j,dep^1);
}
}
vector<int> find_colours(int n,vector<int> X,vector<int> Y){
for(int i = 0;i<X.size();i++){
adjj[X[i]].push_back(Y[i]);
adjj[Y[i]].push_back(X[i]);
}
int d = 0;
for(int i = 0;i<n;i++){
pr2[i] = i;
}
for(int i = n-1;i>=0;i--){
int ans = 0;
while(ans!=-1){
vector<int> v;
int vis[n] = {0};
for(auto j:adjj[i]){
if(j>i&&vis[find2(j)]==0&&find2(j)!=find2(i)){
v.push_back(j);
vis[find2(j)] = 1;
}
}
int sz = v.size();
int l = 0 , r = sz-1;
ans = -1;
while(l<=r){
int mid = (l+r)/2;
vector<int> e(n,n);
e[i] = -1;
for(int j = 0;j<=mid;j++){
e[v[j]] = -1;
}
int cnt = 0;
for(int j = 0;j<n;j++){
if(e[j]==-1){
pr[j] = j;cnt++;
}else {
pr[j] = j;cnt++;
}
}
for(int j = 0;j<X.size();j++){
if(e[X[j]]==-1&&e[Y[j]]==-1){
if(X[j]==i||Y[j]==i)continue;
if(find2(X[j])==find2(Y[j]))cnt-=mergegroup(X[j],Y[j]);
}else if(e[X[j]]==n&&e[Y[j]]==n){
cnt-=mergegroup(X[j],Y[j]);
}
}
if(cnt==perform_experiment(e)){
l = mid+1;
}else {
ans = mid;
r = mid-1;
}
}
if(ans!=-1){
mergegroup2(i,v[ans]);
}
}
}
vector<int> V[n];
for(int i = 0;i<n;i++){
V[find2(i)].push_back(i);
}
for(int i = 0;i<X.size();i++){
if(find2(X[i])!=find2(Y[i])){
nadj[find2(X[i])].push_back(find2(Y[i]));
nadj[find2(Y[i])].push_back(find2(X[i]));
}
}
dfs(find2(0),0);
if(even.size()+odd.size()==1){
for(int i = 0;i<n;i++){
vector<int> e(n,i);
e[0] = -1;
if(perform_experiment(e)==1){
vector<int> na(n,i);
return na;
}
}
}
int in[n] = {0};
for(int i = 0;i<n;i++){
{
vector<int> lol;
for(auto j:even){
if(in[j]==0){
lol.push_back(j);
}
}
int ans = 0;
while(ans!=-1){
int sz = lol.size();
int l = ans , r = sz-1;
int org = ans;
ans = -1;
while(l<=r){
int mid = (l+r)/2;
vector<int> e(n,i);
int cnt = 0;
for(int j = 0;j<n;j++){
if(e[j]==-1){
pr[j] = j;cnt++;
}else {
pr[j] = j;cnt++;
}
}
for(int j = org;j<=mid;j++){
for(auto w:V[lol[j]]){
e[w] = -1;
}
}
for(int j = 0;j<X.size();j++){
if(e[X[j]]==-1&&e[Y[j]]==-1){
if(find2(X[j])==find2(Y[j]))cnt-=mergegroup(X[j],Y[j]);
}else if(e[X[j]]==i&&e[Y[j]]==i){
cnt-=mergegroup(X[j],Y[j]);
}
}
if(cnt==perform_experiment(e)){
l = mid+1;
}else {
ans = mid;
r = mid-1;
}
}
if(ans==-1){
break;
}
in[lol[ans]] = i+1;
ans++;
}
}
swap(even,odd);
{
vector<int> lol;
for(auto j:even){
if(in[j]==0){
lol.push_back(j);
}
}
int ans = 0;
while(ans!=-1){
int sz = lol.size();
int l = ans , r = sz-1;
int org = ans;
ans = -1;
while(l<=r){
int mid = (l+r)/2;
vector<int> e(n,i);
int cnt = 0;
for(int j = 0;j<n;j++){
if(e[j]==-1){
pr[j] = j;cnt++;
}else {
pr[j] = j;cnt++;
}
}
for(int j = org;j<=mid;j++){
for(auto w:V[lol[j]]){
e[w] = -1;
}
}
for(int j = 0;j<X.size();j++){
if(e[X[j]]==-1&&e[Y[j]]==-1){
if(find2(X[j])==find2(Y[j]))cnt-=mergegroup(X[j],Y[j]);
}else if(e[X[j]]==i&&e[Y[j]]==i){
cnt-=mergegroup(X[j],Y[j]);
}
}
if(cnt==perform_experiment(e)){
l = mid+1;
}else {
ans = mid;
r = mid-1;
}
}
if(ans==-1){
break;
}
in[lol[ans]] = i+1;
ans++;
}
}
}
vector<int> col(n,0);
for(int i = 0;i<n;i++){
col[i] = in[find2(i)]-1;
}
return col;
}
Compilation message
sphinx.cpp:3:10: fatal error: grader.cpp: No such file or directory
3 | #include "grader.cpp"
| ^~~~~~~~~~~~
compilation terminated.
