# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619764 | 2022-08-02T15:38:21 Z | Sergio_2357 | Simurgh (IOI17_simurgh) | C++17 | 3000 ms | 212 KB |
#include "simurgh.h" #include <bits/stdc++.h> using namespace std; typedef vector<int> vi; struct DSU { vi v, sz; int cg; int find(int x) { if (v[x] == -1) return x; v[x] = find(v[x]); return v[x]; } void join(int a, int b) { a = find(a); b = find(b); if (a == b) return; cg--; if (sz[a] > sz[b]) swap(a, b); v[a] = b; sz[b] += sz[a]; } DSU(int n) { v = vi(n + 10, -1); sz = vi(n + 10, 1); cg = n; } }; bool test(vi u, vi v) { DSU dsu(u.size()); for (int i = 0; i < u.size(); i++) dsu.join(u[i], v[i]); return dsu.cg == 1; } vi to_list(int b, int ma) { vi r; for (int i = 0; i < ma; i++) { if (b & (1ll << i)) r.push_back(i); } return r; } vi find_roads(int n, vi u, vi v) { int x = 0; while (true) { x++; } //cout << "YES" << endl; for (int b = 0; b < (1ll << (u.size())); b++) { vi tu, tv; vi lst = to_list(b, u.size()); for (int x : lst) { tu.push_back(u[x]); tv.push_back(v[x]); } if (lst.size() == n - 1 && test(tu, tv) && (count_common_roads(lst) == (lst.size()))) { return lst; } } return to_list((1ll << (n - 1)) - 1, n); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3062 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3062 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3062 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3093 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3062 ms | 212 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |