# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931905 | 2024-02-22T14:24:23 Z | hugsfromadicto | Geppetto (COCI15_geppetto) | C++14 | 466 ms | 8648 KB |
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define int long long using namespace std; const int mxN = 1e6+1; int a[mxN], b[mxN]; int s[mxN]; void _() { int n; cin >> n; int k = (1<<n); int b = k; int m; cin >> m; int cnt = 0; for(int i = 0; i < m; ++i) { int x,y; cin >> x >> y; for(int i = 0; i < k; ++i) { if(i & (1 << (x - 1)) and i & (1 << (y - 1))) { if(!s[i]) cnt++; s[i]++; } } } cout << k - cnt; } main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; while(tc--) { _(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 466 ms | 8648 KB | Output is correct |
4 | Correct | 288 ms | 8644 KB | Output is correct |
5 | Correct | 227 ms | 8648 KB | Output is correct |
6 | Correct | 74 ms | 8644 KB | Output is correct |
7 | Correct | 61 ms | 8540 KB | Output is correct |
8 | Correct | 68 ms | 8536 KB | Output is correct |
9 | Correct | 21 ms | 8540 KB | Output is correct |
10 | Correct | 6 ms | 6748 KB | Output is correct |