oj.uz

Submission #861935

# Submission time Handle Problem Language Result Execution time Memory
861935 2023-10-17T07:55:28 Z HossamHero7 Logičari (COCI21_logicari) C++14
20 / 110
 30 ms 7056 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
    int n;
    cin>>n;
    vector<vector<int>> adj(n);
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        a --, b --;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    if(n <= 20){
        int ans = 1e9;
        for(int mask=0;mask<(1<<n);mask++){
            bitset<21> on;
            for(int i=0;i<n;i++) on[i] = (mask>>i)&1;
            for(int i=0;i<n;i++){
                int cnt = 0;
                for(auto ch : adj[i]) cnt += on[ch];
                if(cnt != 1) goto gt;
            }
            ans = min(ans,(int)on.count());
            gt: continue;
        }
        cout<<(ans == 1e9 ? -1 : ans)<<endl;
    }
    else {
        if(n%4 == 0) cout<<n/2<<endl;
        else cout<<-1<<endl;
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 22 ms 6448 KB Output is correct
6 Correct 21 ms 7004 KB Output is correct
7 Correct 21 ms 7056 KB Output is correct
8 Correct 22 ms 7004 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 348 KB Output is correct
2 Correct 24 ms 348 KB Output is correct
3 Correct 24 ms 456 KB Output is correct
4 Correct 24 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 456 KB Output is correct
9 Correct 30 ms 460 KB Output is correct
10 Correct 25 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 27 ms 348 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 348 KB Output is correct
2 Correct 24 ms 348 KB Output is correct
3 Correct 24 ms 456 KB Output is correct
4 Correct 24 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 456 KB Output is correct
9 Correct 30 ms 460 KB Output is correct
10 Correct 25 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 27 ms 348 KB Output is correct
13 Incorrect 1 ms 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 22 ms 6448 KB Output is correct
6 Correct 21 ms 7004 KB Output is correct
7 Correct 21 ms 7056 KB Output is correct
8 Correct 22 ms 7004 KB Output is correct
9 Correct 23 ms 348 KB Output is correct
10 Correct 24 ms 348 KB Output is correct
11 Correct 24 ms 456 KB Output is correct
12 Correct 24 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 11 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 456 KB Output is correct
17 Correct 30 ms 460 KB Output is correct
18 Correct 25 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 27 ms 348 KB Output is correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -