| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1106596 | Ahmed57 | Sphinx's Riddle (IOI24_sphinx) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
#include "sphinx.h"
#include "grader.cpp"
using namespace std;
int pr[251];
vector<int> adjj[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> 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]);
}
queue<int> q;
set<int> s;
for(int i = 0;i<n;i++){
s.insert(i);
}
vector<int> col(n,0);
int d = 0;
while(!s.empty()){
q.push((*s.begin()));
s.erase(s.begin());
while(!q.empty()){
int i = q.front();
q.pop();
s.erase(i);
vector<int> v;
for(auto j:adjj[i]){
if(s.find(j)==s.end()){
v.push_back(j);
}
}
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++){
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(col[X[j]]==col[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){
col[i] = d++;
}else{
col[i] = col[v[ans]];
}
}
}
return col;
}