답안 #547282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547282 2022-04-10T08:46:12 Z Jomnoi 어르신 집배원 (BOI14_postmen) C++17
100 / 100
427 ms 66236 KB
#include <bits/stdc++.h>
#define DEBUG 0
using namespace std;
 
const int MAX_N = 5e5 + 10;
 
vector <pair <int, int>> graph[MAX_N];
vector <int> order;
bool used[MAX_N], visited[MAX_N];
 
void dfs(int u) {
    while(!graph[u].empty()) {
        auto [v, i] = graph[u].back();
        graph[u].pop_back();

        if(used[i] == false) {
            used[i] = true;
            dfs(v);
        }
    }
    order.push_back(u);
}
 
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        graph[u].emplace_back(v, i);
        graph[v].emplace_back(u, i);
    }

    dfs(1);

    stack <int> ans;
    for(int i = 0; i < order.size(); i++) {
        if(visited[order[i]] == true) {
            cout << order[i] << ' ';
            while(ans.top() != order[i]) {
                visited[ans.top()] = false;
                cout << ans.top() << ' ';
                ans.pop();
            }
            cout << '\n';
        }
        else {
            visited[order[i]] = true;
            ans.push(order[i]);
        }
    }
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i = 0; i < order.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 8 ms 11988 KB Output is correct
3 Correct 8 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 7 ms 12372 KB Output is correct
7 Correct 12 ms 13340 KB Output is correct
8 Correct 8 ms 12244 KB Output is correct
9 Correct 35 ms 19660 KB Output is correct
10 Correct 8 ms 12244 KB Output is correct
11 Correct 8 ms 12244 KB Output is correct
12 Correct 42 ms 20056 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12028 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 8 ms 12464 KB Output is correct
7 Correct 11 ms 13396 KB Output is correct
8 Correct 8 ms 12244 KB Output is correct
9 Correct 37 ms 19644 KB Output is correct
10 Correct 8 ms 12244 KB Output is correct
11 Correct 8 ms 12244 KB Output is correct
12 Correct 46 ms 20016 KB Output is correct
13 Correct 51 ms 21388 KB Output is correct
14 Correct 68 ms 18668 KB Output is correct
15 Correct 56 ms 20920 KB Output is correct
16 Correct 66 ms 21472 KB Output is correct
17 Correct 67 ms 16440 KB Output is correct
18 Correct 58 ms 19652 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12028 KB Output is correct
2 Correct 7 ms 12116 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 8 ms 12244 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 8 ms 12372 KB Output is correct
7 Correct 12 ms 13396 KB Output is correct
8 Correct 7 ms 12244 KB Output is correct
9 Correct 36 ms 19712 KB Output is correct
10 Correct 10 ms 12244 KB Output is correct
11 Correct 7 ms 12200 KB Output is correct
12 Correct 42 ms 20020 KB Output is correct
13 Correct 50 ms 21444 KB Output is correct
14 Correct 60 ms 18560 KB Output is correct
15 Correct 54 ms 20904 KB Output is correct
16 Correct 50 ms 21364 KB Output is correct
17 Correct 59 ms 16596 KB Output is correct
18 Correct 56 ms 19732 KB Output is correct
19 Correct 409 ms 59528 KB Output is correct
20 Correct 351 ms 45580 KB Output is correct
21 Correct 333 ms 61144 KB Output is correct
22 Correct 427 ms 66236 KB Output is correct
23 Correct 164 ms 52624 KB Output is correct
24 Correct 413 ms 40468 KB Output is correct
25 Correct 368 ms 57268 KB Output is correct