oj.uz

Submission #899278

# Submission time Handle Problem Language Result Execution time Memory
899278 2024-01-05T16:46:22 Z selmahbn Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 77032 KB 
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    int n, m;
    cin >> n >> m;
    vector<multiset<int>> adj(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        adj[a].insert(b);
        adj[b].insert(a);
    }
    stack<int> s;
    int visited[n] = {};
    for (int i = 0; i < n; i++) {
        if (!adj[i].empty()) s.push(i);
        while (!s.empty()) {
            int current = s.top();
            if (visited[current] == 1) {
                cout << current+1 << " ";
                s.pop();
                while (s.top() != current) {
                    cout << s.top()+1 << " ";
                    visited[s.top()] = 0;
                    s.pop();
                }
                cout << endl;
            }
            visited[current] = 1;
            if (!adj[current].empty()) {
                auto it = adj[current].begin();
                s.push(*it);
                adj[current].erase(it);
                adj[*it].erase(adj[*it].find(current));
            } else {
                s.pop();
                visited[current] = 0;
            }
        }
    }
    return 0;
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 11 ms 1884 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 96 ms 10168 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 94 ms 10324 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 11 ms 1884 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 94 ms 10056 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 114 ms 10388 KB Output is correct
13 Correct 43 ms 15696 KB Output is correct
14 Correct 75 ms 14416 KB Output is correct
15 Correct 111 ms 13648 KB Output is correct
16 Correct 46 ms 15668 KB Output is correct
17 Correct 89 ms 13600 KB Output is correct
18 Correct 88 ms 14160 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 11 ms 1880 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 98 ms 10196 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 99 ms 10204 KB Output is correct
13 Correct 46 ms 15740 KB Output is correct
14 Correct 99 ms 14236 KB Output is correct
15 Correct 87 ms 13624 KB Output is correct
16 Correct 45 ms 15700 KB Output is correct
17 Correct 115 ms 13744 KB Output is correct
18 Correct 79 ms 14344 KB Output is correct
19 Correct 443 ms 77032 KB Output is correct
20 Execution timed out 604 ms 70468 KB Time limit exceeded
21 Halted 0 ms 0 KB -