oj.uz

답안 #899276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899276 2024-01-05T16:42:35 Z selmahbn 어르신 집배원 (BOI14_postmen) C++17
55 / 100
 500 ms 83540 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++) {
        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 1 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 860 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 600 KB Output is correct
9 Correct 99 ms 10876 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 92 ms 11192 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 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 860 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 100 ms 10896 KB Output is correct
10 Correct 3 ms 1272 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 93 ms 11208 KB Output is correct
13 Correct 47 ms 16724 KB Output is correct
14 Correct 79 ms 15444 KB Output is correct
15 Correct 89 ms 14516 KB Output is correct
16 Correct 47 ms 16720 KB Output is correct
17 Correct 97 ms 14752 KB Output is correct
18 Correct 80 ms 15444 KB Output is correct

Subtask #3
0 / 45.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 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 864 KB Output is correct
7 Correct 11 ms 1996 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 100 ms 10836 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 92 ms 11072 KB Output is correct
13 Correct 44 ms 16724 KB Output is correct
14 Correct 89 ms 15548 KB Output is correct
15 Correct 88 ms 14416 KB Output is correct
16 Correct 43 ms 16700 KB Output is correct
17 Correct 84 ms 14928 KB Output is correct
18 Correct 73 ms 15444 KB Output is correct
19 Correct 403 ms 83540 KB Output is correct
20 Execution timed out 594 ms 77256 KB Time limit exceeded
21 Halted 0 ms 0 KB -