# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919515 | 2024-02-01T04:01:16 Z | TIN | Geppetto (COCI15_geppetto) | C++17 | 47 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define FNAME "test" const int N = 21; int n, m; int res = 0; int bad[N]; void Task() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(9); if (fopen(FNAME".inp","r")) { freopen(FNAME".inp","r",stdin); freopen(FNAME".out","w",stdout); } } void Solve() { //Your Code cin >> n >> m; memset(bad, 0, sizeof(bad)); for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; --u, --v; bad[u] |= (1 << v); bad[v] |= (1 << u); } for (int mask = 0; mask < (1 << n); mask++) { res++; for (int i = 0; i < n; i++) { if (mask & (1 << i)) { if (mask & bad[i]) { res--; break; } } } } cout << res << '\n'; } int main() { Task(); Solve(); cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms"; return 37^37; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 3 ms | 344 KB | Output is correct |
4 | Correct | 3 ms | 348 KB | Output is correct |
5 | Correct | 3 ms | 348 KB | Output is correct |
6 | Correct | 4 ms | 344 KB | Output is correct |
7 | Correct | 4 ms | 344 KB | Output is correct |
8 | Correct | 4 ms | 344 KB | Output is correct |
9 | Correct | 12 ms | 348 KB | Output is correct |
10 | Correct | 47 ms | 344 KB | Output is correct |