oj.uz

Submission #889197

# Submission time Handle Problem Language Result Execution time Memory
889197 2023-12-19T07:12:00 Z Alora Logičari (COCI21_logicari) C++17
20 / 110
 30 ms 7004 KB 
#include <bits/stdc++.h>
#define Alora "cownav"
#define fi(i,a,b) for(int i = a; i <= b; i++)
#define fid(i,a,b) for(int i = a; i >= b; i--)
#define ll long long
#define f first
#define se second
#define pii pair<int, int>
#define getbit(i, j) ((i >> j) & 1)
#define all(v) v.begin(), v.end()
#define pb push_back
#define maxn 100005
const int M = 1e9 + 7;
using namespace std;
int n, xd[maxn], res = 1e9, ok, ok1 = 1;
vector <int> g[maxn];

void sub1(){
    if(n % 4 == 0) cout << n/2;
    else cout << -1;
    exit(0);
}

void sub2(){
    fi(tt, 1, (1 << n) - 1){
        int cnt = __builtin_popcount(tt);
        fi(i, 0, n - 1) xd[i + 1] = getbit(tt, i);
        ok = 1;
        fi(u, 1, n){
            int sl = 0;
            for(auto v: g[u]) sl += xd[v];
            if(sl != 1) {ok = 0; break;}
        }
        if(ok) res = min(res, cnt);
    }
    if(res == 1e9) cout << -1;
    else cout << res;
    exit(0);
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	if(fopen(Alora".inp", "r")){
    freopen(Alora".inp", "r", stdin);
    freopen(Alora".out", "w", stdout);}
    cin >> n;
    fi(i, 1, n){
        int u, v; cin >> u >> v;
        g[u].pb(v); g[v].pb(u);
    }
    fi(i, 1, n) if(g[i].size() != 2) {ok1 = 0; break;}
    if(ok1) sub1();
    if(n <= 20) sub2();

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen(Alora".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen(Alora".out", "w", stdout);}
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 30 ms 6860 KB Output is correct
6 Correct 22 ms 6972 KB Output is correct
7 Correct 22 ms 7004 KB Output is correct
8 Correct 22 ms 7000 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2652 KB Output is correct
2 Correct 25 ms 2792 KB Output is correct
3 Correct 17 ms 2648 KB Output is correct
4 Correct 17 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 8 ms 2812 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 28 ms 2652 KB Output is correct
10 Correct 24 ms 2652 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 19 ms 2652 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2652 KB Output is correct
2 Correct 25 ms 2792 KB Output is correct
3 Correct 17 ms 2648 KB Output is correct
4 Correct 17 ms 2648 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 8 ms 2812 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 28 ms 2652 KB Output is correct
10 Correct 24 ms 2652 KB Output is correct
11 Correct 3 ms 2652 KB Output is correct
12 Correct 19 ms 2652 KB Output is correct
13 Incorrect 1 ms 2648 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 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Correct 30 ms 6860 KB Output is correct
6 Correct 22 ms 6972 KB Output is correct
7 Correct 22 ms 7004 KB Output is correct
8 Correct 22 ms 7000 KB Output is correct
9 Correct 17 ms 2652 KB Output is correct
10 Correct 25 ms 2792 KB Output is correct
11 Correct 17 ms 2648 KB Output is correct
12 Correct 17 ms 2648 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 8 ms 2812 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 5 ms 2652 KB Output is correct
17 Correct 28 ms 2652 KB Output is correct
18 Correct 24 ms 2652 KB Output is correct
19 Correct 3 ms 2652 KB Output is correct
20 Correct 19 ms 2652 KB Output is correct
21 Incorrect 1 ms 2648 KB Output isn't correct
22 Halted 0 ms 0 KB -