oj.uz

답안 #899295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899295 2024-01-05T17:06:19 Z selmahbn 어르신 집배원 (BOI14_postmen) C++17
55 / 100
 500 ms 120824 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<unordered_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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 2 ms 604 KB Output is correct
7 Correct 8 ms 1628 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 54 ms 8900 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 57 ms 9240 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 600 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 2 ms 860 KB Output is correct
7 Correct 8 ms 1880 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 51 ms 8788 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 57 ms 9224 KB Output is correct
13 Correct 86 ms 24252 KB Output is correct
14 Correct 97 ms 19908 KB Output is correct
15 Correct 105 ms 19044 KB Output is correct
16 Correct 95 ms 24400 KB Output is correct
17 Correct 113 ms 18484 KB Output is correct
18 Correct 103 ms 19992 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 8 ms 1628 KB Output is correct
8 Correct 2 ms 856 KB Output is correct
9 Correct 57 ms 8848 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 57 ms 9296 KB Output is correct
13 Correct 115 ms 24596 KB Output is correct
14 Correct 98 ms 19792 KB Output is correct
15 Correct 115 ms 19044 KB Output is correct
16 Correct 86 ms 24404 KB Output is correct
17 Correct 111 ms 18512 KB Output is correct
18 Correct 110 ms 19796 KB Output is correct
19 Execution timed out 603 ms 120824 KB Time limit exceeded
20 Halted 0 ms 0 KB -