oj.uz

Submission #899291

# Submission time Handle Problem Language Result Execution time Memory
899291 2024-01-05T16:56:42 Z selmahbn Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 77120 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();
            visited[current] = 1;
            if (!adj[current].empty()) {
                auto it = adj[current].begin();
                int neigh = *it;
                if (visited[neigh] == 1) {
                    cout << neigh+1 << " ";
                    while (s.top() != neigh) {
                        cout << s.top()+1 << " ";
                        visited[s.top()] = 0;
                        s.pop();
                    }
                    cout << endl;
                }
                else s.push(neigh);
                adj[current].erase(it);
                adj[neigh].erase(adj[neigh].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 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 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 95 ms 9964 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 92 ms 10320 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 5 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 99 ms 10188 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 98 ms 10224 KB Output is correct
13 Correct 46 ms 15696 KB Output is correct
14 Correct 86 ms 14432 KB Output is correct
15 Correct 87 ms 13476 KB Output is correct
16 Correct 44 ms 15700 KB Output is correct
17 Correct 95 ms 13648 KB Output is correct
18 Correct 77 ms 14180 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 1 ms 344 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 860 KB Output is correct
7 Correct 13 ms 1884 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 103 ms 10148 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 97 ms 10324 KB Output is correct
13 Correct 54 ms 15696 KB Output is correct
14 Correct 74 ms 14416 KB Output is correct
15 Correct 86 ms 13652 KB Output is correct
16 Correct 42 ms 15700 KB Output is correct
17 Correct 88 ms 13860 KB Output is correct
18 Correct 76 ms 14344 KB Output is correct
19 Correct 430 ms 77120 KB Output is correct
20 Execution timed out 602 ms 70468 KB Time limit exceeded
21 Halted 0 ms 0 KB -