# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755472 | 2023-06-10T07:04:25 Z | irmuun | Senior Postmen (BOI14_postmen) | C++17 | 500 ms | 101660 KB |
#include<bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define ff first #define ss second #define all(s) s.begin(),s.end() int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n,m; cin>>n>>m; set<int>adj[n+1]; vector<int>used(n+1,0); for(int i=1;i<=m;i++){ int u,v; cin>>u>>v; adj[u].insert(v); adj[v].insert(u); } vector<int>ord; function <void(int)> dfs=[&](int x){ ord.pb(x); if(adj[x].size()==0){ return; } int y=*adj[x].begin(); adj[x].erase(y); adj[y].erase(x); dfs(y); }; for(int i=1;i<=n;i++){ if(adj[i].size()>0){ dfs(i); } } stack<int>v; for(int i=0;i<ord.size();i++){ if(used[ord[i]]==0){ used[ord[i]]=1; v.push(ord[i]); } else{ int x=ord[i]; cout<<x<<' '; while(!v.empty()){ int y=v.top(); if(x!=y){ cout<<y<<' '; v.pop(); used[y]=0; } else{ break; } } cout<<"\n"; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 2 ms | 852 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 3 ms | 912 KB | Output is correct |
7 | Correct | 10 ms | 2240 KB | Output is correct |
8 | Correct | 2 ms | 724 KB | Output is correct |
9 | Correct | 141 ms | 10640 KB | Output is correct |
10 | Correct | 2 ms | 852 KB | Output is correct |
11 | Correct | 2 ms | 724 KB | Output is correct |
12 | Correct | 111 ms | 10852 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 3 ms | 852 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 3 ms | 852 KB | Output is correct |
7 | Correct | 12 ms | 2140 KB | Output is correct |
8 | Correct | 1 ms | 724 KB | Output is correct |
9 | Correct | 135 ms | 10612 KB | Output is correct |
10 | Correct | 2 ms | 852 KB | Output is correct |
11 | Correct | 2 ms | 724 KB | Output is correct |
12 | Correct | 107 ms | 10840 KB | Output is correct |
13 | Correct | 95 ms | 20552 KB | Output is correct |
14 | Correct | 92 ms | 19284 KB | Output is correct |
15 | Correct | 92 ms | 18716 KB | Output is correct |
16 | Correct | 89 ms | 20604 KB | Output is correct |
17 | Correct | 91 ms | 18912 KB | Output is correct |
18 | Correct | 94 ms | 15844 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 2 ms | 852 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 3 ms | 852 KB | Output is correct |
7 | Correct | 11 ms | 2256 KB | Output is correct |
8 | Correct | 1 ms | 724 KB | Output is correct |
9 | Correct | 112 ms | 10636 KB | Output is correct |
10 | Correct | 2 ms | 852 KB | Output is correct |
11 | Correct | 3 ms | 724 KB | Output is correct |
12 | Correct | 115 ms | 10824 KB | Output is correct |
13 | Correct | 78 ms | 20492 KB | Output is correct |
14 | Correct | 107 ms | 19268 KB | Output is correct |
15 | Correct | 93 ms | 18724 KB | Output is correct |
16 | Correct | 80 ms | 20576 KB | Output is correct |
17 | Correct | 107 ms | 18888 KB | Output is correct |
18 | Correct | 91 ms | 15904 KB | Output is correct |
19 | Execution timed out | 523 ms | 101660 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |