oj.uz

답안 #466801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466801 2021-08-20T16:51:59 Z M4mou 어르신 집배원 (BOI14_postmen) C++17
100 / 100
 481 ms 87620 KB 
#include <bits/stdc++.h>

using namespace std;
bool v[500005],queued[500005];
int next0[500005];
vector<vector<pair<int,int>>> graph;
int dfs(int x, int p){
    if(queued[x]){
        cout << x << " ";
        return x;
    }
    queued[x] = 1;
   // cout << x << endl;
    for(;next0[x]<graph[x].size();next0[x]++){
        auto edge = graph[x][next0[x]];
        if(v[edge.second] || p == x)continue;
        v[edge.second] = 1;
        int y = dfs(edge.first,x);


        if(x != y){
            queued[x] = 0;
            cout << x << " ";
            return y;
        }
        cout << '\n';
    }
    return -1;

}
int main(){
     ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    int n,m;
    cin >> n >> m;
    graph.resize(n+1);
    while(m--){
        int x , y;
        cin >> x >> y;
        graph[x].push_back({y,m});
        graph[y].push_back({x,m});
    }
    for(int i = 1;i<=n;i++)dfs(i,-1);

}

Compilation message

postmen.cpp: In function 'int dfs(int, int)':
postmen.cpp:14:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(;next0[x]<graph[x].size();next0[x]++){
      |          ~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 6 ms 844 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 32 ms 2840 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 37 ms 3144 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 6 ms 836 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 35 ms 2744 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 37 ms 3168 KB Output is correct
13 Correct 62 ms 16264 KB Output is correct
14 Correct 51 ms 5956 KB Output is correct
15 Correct 54 ms 5336 KB Output is correct
16 Correct 78 ms 16324 KB Output is correct
17 Correct 61 ms 5672 KB Output is correct
18 Correct 57 ms 8316 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 5 ms 844 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 32 ms 2752 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 39 ms 3120 KB Output is correct
13 Correct 63 ms 16364 KB Output is correct
14 Correct 50 ms 5960 KB Output is correct
15 Correct 48 ms 5312 KB Output is correct
16 Correct 62 ms 16376 KB Output is correct
17 Correct 56 ms 5592 KB Output is correct
18 Correct 55 ms 8260 KB Output is correct
19 Correct 459 ms 81000 KB Output is correct
20 Correct 396 ms 35780 KB Output is correct
21 Correct 365 ms 31000 KB Output is correct
22 Correct 481 ms 87620 KB Output is correct
23 Correct 169 ms 15652 KB Output is correct
24 Correct 477 ms 33732 KB Output is correct
25 Correct 464 ms 47364 KB Output is correct