oj.uz

Submission #899294

# Submission time Handle Problem Language Result Execution time Memory
899294 2024-01-05T17:05:04 Z selmahbn Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 76976 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<set<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()) continue;
        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(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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 848 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 860 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 10068 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 96 ms 10324 KB Output is correct

Subtask #2
17.0 / 17.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 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 106 ms 10120 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 94 ms 10308 KB Output is correct
13 Correct 45 ms 15520 KB Output is correct
14 Correct 75 ms 14240 KB Output is correct
15 Correct 89 ms 13648 KB Output is correct
16 Correct 42 ms 15696 KB Output is correct
17 Correct 86 ms 13820 KB Output is correct
18 Correct 76 ms 14160 KB Output is correct

Subtask #3
0 / 45.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 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 3 ms 860 KB Output is correct
7 Correct 13 ms 1880 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 97 ms 10104 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 93 ms 10212 KB Output is correct
13 Correct 45 ms 15516 KB Output is correct
14 Correct 91 ms 14672 KB Output is correct
15 Correct 96 ms 13556 KB Output is correct
16 Correct 45 ms 15700 KB Output is correct
17 Correct 87 ms 14160 KB Output is correct
18 Correct 75 ms 14248 KB Output is correct
19 Correct 416 ms 76976 KB Output is correct
20 Execution timed out 611 ms 70588 KB Time limit exceeded
21 Halted 0 ms 0 KB -