# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919508 | 2024-02-01T03:36:34 Z | TIN | Geppetto (COCI15_geppetto) | C++17 | 3 ms | 600 KB |
#include <bits/stdc++.h> using namespace std; #define FNAME "test" const int N = 21; int n, m; int res = 0; bool ok[N]; vector<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 sinh(int i, int p = 0) { res++; if (i == n + 1) { return; } for (int idx = p + 1; idx <= n; idx++) { if (ok[idx]) { for (int v : bad[idx]) ok[v] = false; sinh(i + 1, idx); for (int v : bad[idx]) ok[v] = true; } } } void Solve() { //Your Code cin >> n >> m; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; bad[u].push_back(v); bad[v].push_back(u); } memset(ok, true, sizeof(ok)); sinh(1); 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 | Incorrect | 0 ms | 344 KB | Output isn't correct |
3 | Incorrect | 2 ms | 548 KB | Output isn't correct |
4 | Incorrect | 1 ms | 344 KB | Output isn't correct |
5 | Incorrect | 1 ms | 344 KB | Output isn't correct |
6 | Incorrect | 1 ms | 348 KB | Output isn't correct |
7 | Incorrect | 1 ms | 344 KB | Output isn't correct |
8 | Incorrect | 1 ms | 600 KB | Output isn't correct |
9 | Incorrect | 2 ms | 344 KB | Output isn't correct |
10 | Correct | 3 ms | 344 KB | Output is correct |