oj.uz

답안 #899277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899277 2024-01-05T16:44:54 Z selmahbn 어르신 집배원 (BOI14_postmen) C++17
55 / 100
 500 ms 77220 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;
    vector<int> visited(n, 0);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 2140 KB Output is correct
8 Correct 1 ms 696 KB Output is correct
9 Correct 103 ms 10068 KB Output is correct
10 Correct 3 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 95 ms 10328 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 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 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 11 ms 1884 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 115 ms 10264 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 122 ms 10312 KB Output is correct
13 Correct 45 ms 15536 KB Output is correct
14 Correct 74 ms 14252 KB Output is correct
15 Correct 95 ms 13568 KB Output is correct
16 Correct 44 ms 15584 KB Output is correct
17 Correct 84 ms 13692 KB Output is correct
18 Correct 104 ms 14244 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 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 11 ms 1880 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 113 ms 10192 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 99 ms 10360 KB Output is correct
13 Correct 49 ms 15696 KB Output is correct
14 Correct 87 ms 14416 KB Output is correct
15 Correct 86 ms 13652 KB Output is correct
16 Correct 67 ms 15604 KB Output is correct
17 Correct 96 ms 13652 KB Output is correct
18 Correct 78 ms 14216 KB Output is correct
19 Correct 417 ms 77220 KB Output is correct
20 Execution timed out 603 ms 70604 KB Time limit exceeded
21 Halted 0 ms 0 KB -