# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
882957 | 2023-12-04T09:11:42 Z | Do_you_copy | Senior Postmen (BOI14_postmen) | C++17 | 6 ms | 25632 KB |
//Then #include <bits/stdc++.h> #define pb push_back #define fi first #define se second #define faster ios_base::sync_with_stdio(0); cin.tie(0); using namespace std; using ll = long long; using ld = long double; using pii = pair <int, int>; mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 1e6 + 1; //const int Mod = 1e9 + 7; //const int inf = int n, m; struct TEdge{ int u, v; bool del; }; vector <TEdge> e; vector <int> adj[maxN]; void add_edge(int u, int v){ adj[u].pb(e.size()); adj[v].pb(e.size()); e.pb({u, v, 0}); } vector <int> euler(int s){ vector <int> res; vector <int> S(1, s); while (!S.empty()){ int u = S.back(); while (!adj[u].empty() && e[adj[u].back()].del) adj[u].pop_back(); if (!adj[u].empty()){ auto &i = e[adj[u].back()]; S.pb(i.u ^ i.v ^ u); i.del = 1; adj[u].pop_back(); } else{ res.pb(u); S.pop_back(); } } return res; } int visited[maxN]; void Init(){ cin >> n >> m; for (int i = 1; i <= m; ++i){ int u, v; add_edge(u, v); } vector <int> eulertour = euler(1); vector <int> ans; for (int u: eulertour){ if (visited[u]){ int v; do{ v = ans.back(); visited[v] = 0; cout << v << " "; ans.pop_back(); } while (v != u); cout << "\n"; } ans.pb(u); visited[u] = 1; } } #define debug #define taskname "test" signed main(){ faster if (fopen(taskname".inp", "r")){ freopen(taskname".inp", "r", stdin); freopen(taskname".out", "w", stdout); } int tt = 1; //cin >> tt; while (tt--){ Init(); } if (fopen("timeout.txt", "r")){ ofstream timeout("timeout.txt"); timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000); timeout.close(); #ifndef debug cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n"; #endif // debug } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 25432 KB | Some edges were not used |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 25632 KB | Some edges were not used |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 25436 KB | Some edges were not used |
2 | Halted | 0 ms | 0 KB | - |