#include <bits/stdc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int idx;
map<string,int> m;
int assign(string x){
if(m.find(x)==m.end()){
m[x] = idx++;
}
return m[x];
}
signed main(){
fastio
int n;
cin >> n;
int arr[n];
for(int i = 0;i < n;i++){
string a,b;
cin >> a >> b;
int x = assign(a);
int y = assign(b);
arr[x] = y;
}
if(n%2){
cout << -1 << "\n";
return 0;
}
int dp[1<<n];
fill(dp,dp+(1<<n),1e18);
dp[0] = 0;
for(int mask = 0;mask < (1<<n); mask++){
for(int i = 0;i < n;i++){
if(mask&(1<<i)) continue;
for(int j = 0;j < n;j++){
if(i==j||mask&(1<<j)) continue;
dp[mask|(1<<i)|(1<<j)] = min(dp[mask]+(arr[i]!=j)+(arr[j]!=i),dp[mask|(1<<i)|(1<<j)]);
}
}
}
cout << dp[(1<<n)-1] << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
669 ms |
8496 KB |
Output is correct |
2 |
Correct |
696 ms |
8512 KB |
Output is correct |
3 |
Correct |
691 ms |
8500 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
690 ms |
8492 KB |
Output is correct |
8 |
Correct |
684 ms |
8584 KB |
Output is correct |
9 |
Correct |
678 ms |
8396 KB |
Output is correct |
10 |
Correct |
687 ms |
8496 KB |
Output is correct |
11 |
Correct |
669 ms |
8512 KB |
Output is correct |
12 |
Correct |
0 ms |
204 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
316 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Runtime error |
158 ms |
20020 KB |
Execution killed with signal 11 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
154 ms |
20024 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
669 ms |
8496 KB |
Output is correct |
2 |
Correct |
696 ms |
8512 KB |
Output is correct |
3 |
Correct |
691 ms |
8500 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
690 ms |
8492 KB |
Output is correct |
8 |
Correct |
684 ms |
8584 KB |
Output is correct |
9 |
Correct |
678 ms |
8396 KB |
Output is correct |
10 |
Correct |
687 ms |
8496 KB |
Output is correct |
11 |
Correct |
669 ms |
8512 KB |
Output is correct |
12 |
Correct |
0 ms |
204 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
0 ms |
204 KB |
Output is correct |
17 |
Correct |
0 ms |
316 KB |
Output is correct |
18 |
Correct |
0 ms |
204 KB |
Output is correct |
19 |
Runtime error |
158 ms |
20020 KB |
Execution killed with signal 11 |
20 |
Halted |
0 ms |
0 KB |
- |