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>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
map<string,int>mp;
vector<pair<string,string>>all(n);
for(int i=0;i<n;i++){
cin>>all[i].first>>all[i].second;
mp[all[i].first]=i;
}
vector<int>adj(n+1);
for(int i=0;i<n;i++){
adj[i]=mp[all[i].second];
}
if(n&1){
cout<<-1<<"\n";
return 0;
}
int res=n;
for(int i=0;i<(1<<n);i++){
int f=1,cnt=0;
vector<int>cnta(n+1);
for(int j=0;j<n;j++){
if((i>>j)&1){
continue;
}
if((i>>(adj[j]))&1){
cnt++;
cnta[adj[j]]++;
if(cnta[adj[j]]>1){
f=0;
}
continue;
}
if(adj[adj[j]]!=j||adj[j]==j){
f=0;
}
}
if(f&&cnt<=__builtin_popcount(i)){
//cout<<i<<" "<<cnt<<" "<<f<<'\n';
res=min(res,__builtin_popcount(i));
}
}
cout<<res<<"\n";
}
# | 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... |