oj.uz

Submission #31476

# Submission time Handle Problem Language Result Execution time Memory
31476 2017-08-29T06:29:55 Z aome Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 94212 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 500005;

int n, m;
set<int> G[N];
vector<int> euler;
bool visit[N];

void dfs(int u) {
    while (G[u].size()) {
        int v = *G[u].begin();
        G[u].erase(G[u].begin()), G[v].erase(G[v].find(u));
        dfs(v);
    }
    euler.push_back(u);
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int u, v; cin >> u >> v;
        G[u].insert(v), G[v].insert(u);
    }
    dfs(1);
    vector<int> vCur;
    for (auto i : euler) {
        if (visit[i]) {
            vector<int> vNew;
            vNew.push_back(i);
            cout << i << ' ';
            while (vCur.back() != i) {
                int tmp = vCur.back();
                cout << tmp << ' ';
                visit[tmp] = 0, vCur.pop_back();
            }
            cout << '\n';
        } else {
            vCur.push_back(i), visit[i] = 1;
        }
    }
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 23 ms 23808 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 31 ms 24320 KB Output is correct
5 Correct 20 ms 24040 KB Output is correct
6 Correct 28 ms 24588 KB Output is correct
7 Correct 38 ms 25984 KB Output is correct
8 Correct 24 ms 24132 KB Output is correct
9 Correct 185 ms 37808 KB Output is correct
10 Correct 23 ms 24192 KB Output is correct
11 Correct 21 ms 24168 KB Output is correct
12 Correct 163 ms 37880 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 20 ms 24192 KB Output is correct
5 Correct 18 ms 24064 KB Output is correct
6 Correct 21 ms 24448 KB Output is correct
7 Correct 30 ms 25984 KB Output is correct
8 Correct 21 ms 24060 KB Output is correct
9 Correct 191 ms 37820 KB Output is correct
10 Correct 23 ms 24192 KB Output is correct
11 Correct 24 ms 24192 KB Output is correct
12 Correct 186 ms 37880 KB Output is correct
13 Correct 143 ms 37880 KB Output is correct
14 Correct 144 ms 37880 KB Output is correct
15 Correct 145 ms 37880 KB Output is correct
16 Correct 122 ms 37876 KB Output is correct
17 Correct 174 ms 37900 KB Output is correct
18 Correct 131 ms 35040 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 23816 KB Output is correct
2 Correct 21 ms 23784 KB Output is correct
3 Correct 21 ms 23808 KB Output is correct
4 Correct 23 ms 24192 KB Output is correct
5 Correct 29 ms 23972 KB Output is correct
6 Correct 21 ms 24380 KB Output is correct
7 Correct 32 ms 25944 KB Output is correct
8 Correct 20 ms 24064 KB Output is correct
9 Correct 187 ms 37812 KB Output is correct
10 Correct 19 ms 24192 KB Output is correct
11 Correct 22 ms 24192 KB Output is correct
12 Correct 189 ms 37880 KB Output is correct
13 Correct 107 ms 37880 KB Output is correct
14 Correct 122 ms 37856 KB Output is correct
15 Correct 152 ms 37908 KB Output is correct
16 Correct 116 ms 37852 KB Output is correct
17 Correct 151 ms 37976 KB Output is correct
18 Correct 132 ms 35064 KB Output is correct
19 Execution timed out 593 ms 94212 KB Time limit exceeded
20 Halted 0 ms 0 KB -