oj.uz

Submission #655502

# Submission time Handle Problem Language Result Execution time Memory
655502 2022-11-04T15:14:59 Z google Logičari (COCI21_logicari) C++17
10 / 110
 145 ms 2600 KB 
#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 > 20) {
        if (n%2) cout << -1;
        else cout << n/2;
    }
    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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Incorrect 16 ms 2600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 332 KB Output is correct
2 Correct 145 ms 300 KB Output is correct
3 Correct 132 ms 296 KB Output is correct
4 Correct 129 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 66 ms 312 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 30 ms 212 KB Output is correct
9 Correct 120 ms 304 KB Output is correct
10 Correct 116 ms 332 KB Output is correct
11 Correct 17 ms 212 KB Output is correct
12 Correct 130 ms 296 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 332 KB Output is correct
2 Correct 145 ms 300 KB Output is correct
3 Correct 132 ms 296 KB Output is correct
4 Correct 129 ms 296 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 66 ms 312 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 30 ms 212 KB Output is correct
9 Correct 120 ms 304 KB Output is correct
10 Correct 116 ms 332 KB Output is correct
11 Correct 17 ms 212 KB Output is correct
12 Correct 130 ms 296 KB Output is correct
13 Incorrect 1 ms 340 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 316 KB Output is correct
5 Incorrect 16 ms 2600 KB Output isn't correct
6 Halted 0 ms 0 KB -