oj.uz

Submission #31522

# Submission time Handle Problem Language Result Execution time Memory
31522 2017-08-29T07:25:34 Z minhtung0404 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 141244 KB 
#include<bits/stdc++.h>
const int N = 5e5 + 5;
using namespace std;

typedef pair <int, int> ii;

set <int> adj[N];
vector <int> mv[N];

int n, m, a, b, cnt;
bool check[N], edge[N];
stack <int> ms;

void dfs(int u){
    while (adj[u].size()){
        int v = *adj[u].begin();
        adj[u].erase(adj[u].begin()); adj[v].erase(u);
        dfs(v);
    }
    if (check[u]){
        while (ms.top() != u){
            cout << ms.top() << " ";
            check[ms.top()] = 0;
            ms.pop();
        }
        cout << u << "\n";
        ms.pop();
        check[u] = 0;
    }

    check[u] = 1;
    ms.push(u);
}

int main(){
    //ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> a >> b;
        adj[a].insert(b);
        adj[b].insert(a);
    }
    dfs(1);
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 35560 KB Output is correct
2 Correct 26 ms 35584 KB Output is correct
3 Correct 26 ms 35504 KB Output is correct
4 Correct 35 ms 36200 KB Output is correct
5 Correct 29 ms 35840 KB Output is correct
6 Correct 33 ms 36516 KB Output is correct
7 Correct 57 ms 38624 KB Output is correct
8 Correct 34 ms 35968 KB Output is correct
9 Correct 275 ms 56204 KB Output is correct
10 Correct 29 ms 36224 KB Output is correct
11 Correct 29 ms 35968 KB Output is correct
12 Correct 238 ms 56440 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 35584 KB Output is correct
2 Correct 36 ms 35576 KB Output is correct
3 Correct 30 ms 35584 KB Output is correct
4 Correct 31 ms 36184 KB Output is correct
5 Correct 26 ms 35712 KB Output is correct
6 Correct 30 ms 36456 KB Output is correct
7 Correct 43 ms 38656 KB Output is correct
8 Correct 33 ms 35968 KB Output is correct
9 Correct 313 ms 56228 KB Output is correct
10 Correct 35 ms 36224 KB Output is correct
11 Correct 33 ms 35832 KB Output is correct
12 Correct 275 ms 56332 KB Output is correct
13 Correct 195 ms 56608 KB Output is correct
14 Correct 219 ms 56620 KB Output is correct
15 Correct 211 ms 56416 KB Output is correct
16 Correct 203 ms 56648 KB Output is correct
17 Correct 233 ms 56568 KB Output is correct
18 Correct 219 ms 48352 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 35584 KB Output is correct
2 Correct 31 ms 35584 KB Output is correct
3 Correct 31 ms 35576 KB Output is correct
4 Correct 35 ms 36160 KB Output is correct
5 Correct 30 ms 35712 KB Output is correct
6 Correct 32 ms 36400 KB Output is correct
7 Correct 57 ms 38648 KB Output is correct
8 Correct 34 ms 35968 KB Output is correct
9 Correct 242 ms 56184 KB Output is correct
10 Correct 29 ms 36200 KB Output is correct
11 Correct 29 ms 35840 KB Output is correct
12 Correct 252 ms 56348 KB Output is correct
13 Correct 198 ms 56576 KB Output is correct
14 Correct 205 ms 56568 KB Output is correct
15 Correct 251 ms 56376 KB Output is correct
16 Correct 199 ms 56568 KB Output is correct
17 Correct 234 ms 56716 KB Output is correct
18 Correct 208 ms 48364 KB Output is correct
19 Execution timed out 971 ms 141244 KB Time limit exceeded
20 Halted 0 ms 0 KB -