#include<bits/stdc++.h>
using namespace std;
int n,a,b;
vector<pair<int,int>> e;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for (int i = 0;i<n;i++){
cin >> a >> b;e.push_back({a-1,b-1});
}
int ans = 100;
if (n > 0) {
if (n%4 == 0) cout << n/2;
else cout << -1;
return 0;
}
for (int mask = 0;mask<1<<n;mask++){
vector<int> cnt(n,0);
for (int i = 0;i<n;i++){
if ((1<<e[i].second)&mask) cnt[e[i].first]++;
if ((1<<e[i].first)&mask) cnt[e[i].second]++;
}
int pos = 1;
for (int i = 0;i<n;i++){
if (cnt[i] != pos){
pos = 0;
break;
}
}
if (pos) ans = min(ans,__popcount(mask));
}
if (ans == 100) ans = -1;
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
15 ms |
1400 KB |
Output is correct |
6 |
Correct |
15 ms |
2372 KB |
Output is correct |
7 |
Correct |
16 ms |
2484 KB |
Output is correct |
8 |
Correct |
15 ms |
2380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
15 ms |
1400 KB |
Output is correct |
6 |
Correct |
15 ms |
2372 KB |
Output is correct |
7 |
Correct |
16 ms |
2484 KB |
Output is correct |
8 |
Correct |
15 ms |
2380 KB |
Output is correct |
9 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |