oj.uz

Submission #412797

# Submission time Handle Problem Language Result Execution time Memory
412797 2021-05-27T14:29:45 Z fvogel499 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 68616 KB 
/*
File created on 05/27/2021 at 15:50:04.
Link to problem: https://oj.uz/problem/view/BOI14_postmen
Description: Hierholzer's algorithm for eulerian cycle + separation in "mini" cycles
Time complexity: O(N+M)
Space complexity: O(N+M)
Status: TLE
Copyright: Ⓒ 2021 Francois Vogel
*/

#include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>

using namespace std;

#define pii pair<int, int>
#define pib pair<int, *obj>
#define f first
#define s second

#define pb push_back
#define ins insert

#define int ll
#define ll long long

int encode(int a, int b) { return (min(a, b)*1000000+max(a, b)); }

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    int n, nbEdges;
    cin >> n >> nbEdges;

    vector<int> graph [n];
    for (int i = 0; i < nbEdges; i++) {
        int nodeA, nodeB;
        cin >> nodeA >> nodeB;
        nodeA--;
        nodeB--;
        graph[nodeA].pb(nodeB);
        graph[nodeB].pb(nodeA);
    }

    unordered_set<int> usedEdges;
    vector<int> circuit;
    vector<int> path;
    path.pb(0);
    while (!path.empty()) {
        while (!graph[path.back()].empty() and usedEdges.find(encode(path.back(), graph[path.back()].back())) != usedEdges.end()) graph[path.back()].pop_back();
        if (graph[path.back()].empty()) {
            circuit.pb(path.back());
            path.pop_back();
        }
        else {
            int nn = graph[path.back()].back();
            graph[path.back()].pop_back();
            usedEdges.insert(encode(path.back(), nn));
            path.pb(nn);
        }
    }

    bool as [n];
    memset(as, false, n);
    vector<int> st;
    for (int i : circuit) {
        if (as[i]) {
            while (st.back() != i) {
                as[st.back()] = false;
                cout << st.back()+1 << " ";
                st.pop_back();
            }
            st.pop_back();
            cout << i+1 << " " << endl;
        }
        as[i] = true;
        st.pb(i);
    }

    int d = 0;
    d++;
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 10 ms 1740 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 65 ms 9532 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 70 ms 9880 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 10 ms 1720 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 67 ms 9576 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 70 ms 9900 KB Output is correct
13 Correct 85 ms 14468 KB Output is correct
14 Correct 133 ms 12120 KB Output is correct
15 Correct 122 ms 12072 KB Output is correct
16 Correct 70 ms 14320 KB Output is correct
17 Correct 127 ms 10540 KB Output is correct
18 Correct 112 ms 11688 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 10 ms 1740 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 63 ms 9488 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 70 ms 9900 KB Output is correct
13 Correct 70 ms 14308 KB Output is correct
14 Correct 108 ms 12004 KB Output is correct
15 Correct 119 ms 12060 KB Output is correct
16 Correct 71 ms 14348 KB Output is correct
17 Correct 128 ms 10540 KB Output is correct
18 Correct 111 ms 11704 KB Output is correct
19 Execution timed out 534 ms 68616 KB Time limit exceeded
20 Halted 0 ms 0 KB -