# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725678 | kyanl9 | Cluedo (IOI10_cluedo) | C++14 | 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>
#define pb push_back
#define mp make_pair
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
/*
int m=2,l=3,w=4,counter=0;
int Theory(int M, int L, int W){
int c=0;
if(M!=m) c++;
if(L!=l) c++;
if(W!=w) c++;
return c;
}*/
void solve(){
int c=-1;
vector<int> vect,mid;
for(int i=1;i<=6;i++){
int v=Theory(i,i,i);
if(v==3) c=i;
if(v<=2) vect.pb(i);
}
for(int i=7;i<=10;i++){
if(Theory(c,i,c)!=3) mid.pb(i);
}
if(int(mid.size()==0)){ // middle empty
if(int(vect.size())==3){ // all different numbers;
if(Theory(vect[0],vect[1],vect[2])) return;
if(Theory(vect[0],vect[2],vect[1])) return;
if(Theory(vect[1],vect[0],vect[2])) return;
if(Theory(vect[1],vect[2],vect[0])) return;
if(Theory(vect[2],vect[1],vect[0])) return;
if(Theory(vect[2],vect[0],vect[1])) return;
}
else if(int(vect.size()==1)) return;
else{
if(Theory(vect[0],vect[0],vect[1])) return;
if(Theory(vect[0],vect[1],vect[1])) return;
if(Theory(vect[1],vect[0],vect[0])) return;
if(Theory(vect[1],vect[1],vect[0])) return;
if(Theory(vect[1],vect[0],vect[1])) return;
if(Theory(vect[0],vect[1],vect[0])) return;
}
}
else{
if(int(vect.size()==2)){
if(Theory(vect[0],mid[0],vect[1])) return;
if(Theory(vect[1],mid[0],vect[0])) return;
}
else{
if(Theory(vect[1],mid[0],vect[1])) return;
if(Theory(vect[0],mid[0],vect[0])) return;
}
}
}
/*
int main(){
ios::sync_with_stdio(0);cin.tie(0);
}*/