oj.uz

Submission #31520

# Submission time Handle Problem Language Result Execution time Memory
31520 2017-08-29T07:24:56 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 28 ms 35560 KB Output is correct
2 Correct 27 ms 35636 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 27 ms 36224 KB Output is correct
5 Correct 26 ms 35840 KB Output is correct
6 Correct 27 ms 36448 KB Output is correct
7 Correct 39 ms 38776 KB Output is correct
8 Correct 30 ms 36048 KB Output is correct
9 Correct 177 ms 56184 KB Output is correct
10 Correct 30 ms 36256 KB Output is correct
11 Correct 29 ms 35968 KB Output is correct
12 Correct 174 ms 56544 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 27 ms 35516 KB Output is correct
3 Correct 28 ms 35568 KB Output is correct
4 Correct 35 ms 36144 KB Output is correct
5 Correct 26 ms 35840 KB Output is correct
6 Correct 30 ms 36472 KB Output is correct
7 Correct 36 ms 38656 KB Output is correct
8 Correct 24 ms 35968 KB Output is correct
9 Correct 205 ms 56272 KB Output is correct
10 Correct 28 ms 36224 KB Output is correct
11 Correct 28 ms 35968 KB Output is correct
12 Correct 199 ms 56440 KB Output is correct
13 Correct 140 ms 56696 KB Output is correct
14 Correct 192 ms 56680 KB Output is correct
15 Correct 156 ms 56424 KB Output is correct
16 Correct 128 ms 56672 KB Output is correct
17 Correct 179 ms 56560 KB Output is correct
18 Correct 150 ms 48388 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 35600 KB Output is correct
2 Correct 30 ms 35584 KB Output is correct
3 Correct 24 ms 35584 KB Output is correct
4 Correct 25 ms 36224 KB Output is correct
5 Correct 32 ms 35840 KB Output is correct
6 Correct 30 ms 36480 KB Output is correct
7 Correct 45 ms 38624 KB Output is correct
8 Correct 26 ms 35968 KB Output is correct
9 Correct 279 ms 56188 KB Output is correct
10 Correct 30 ms 36224 KB Output is correct
11 Correct 29 ms 35960 KB Output is correct
12 Correct 218 ms 56324 KB Output is correct
13 Correct 146 ms 56652 KB Output is correct
14 Correct 160 ms 56596 KB Output is correct
15 Correct 167 ms 56504 KB Output is correct
16 Correct 131 ms 56668 KB Output is correct
17 Correct 162 ms 56656 KB Output is correct
18 Correct 163 ms 48340 KB Output is correct
19 Execution timed out 620 ms 141244 KB Time limit exceeded
20 Halted 0 ms 0 KB -