oj.uz

답안 #31528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31528 2017-08-29T07:29:51 Z minhtung0404 어르신 집배원 (BOI14_postmen) C++14
55 / 100
 500 ms 141180 KB 
#include<bits/stdc++.h>
const int N = 5e5 + 5;
using namespace std;

set <int> adj[N];
vector <int> mv[N];

int n, m, a, b, cnt;
bool check[N], edge[N];
stack <int> ms;

void dfs(int u){
    while (adj[u].size()){
        int v = *adj[u].begin();
        adj[u].erase(adj[u].begin()); adj[v].erase(u);
        dfs(v);
    }
    if (check[u]){
        while (ms.top() != u){
            printf("%d ", ms.top());
            check[ms.top()] = 0;
            ms.pop();
        }
        printf("%d\n", u);
        ms.pop();
        check[u] = 0;
    }
    check[u] = 1;
    ms.push(u);
}

int main(){
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; i++){
        scanf("%d%d", &a, &b);
        adj[a].insert(b);
        adj[b].insert(a);
    }
    dfs(1);
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
postmen.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 31 ms 36096 KB Output is correct
5 Correct 33 ms 35712 KB Output is correct
6 Correct 33 ms 36480 KB Output is correct
7 Correct 47 ms 38608 KB Output is correct
8 Correct 24 ms 35944 KB Output is correct
9 Correct 204 ms 56260 KB Output is correct
10 Correct 32 ms 36224 KB Output is correct
11 Correct 33 ms 35948 KB Output is correct
12 Correct 181 ms 56312 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 35632 KB Output is correct
2 Correct 25 ms 35608 KB Output is correct
3 Correct 25 ms 35560 KB Output is correct
4 Correct 27 ms 36096 KB Output is correct
5 Correct 27 ms 35712 KB Output is correct
6 Correct 31 ms 36496 KB Output is correct
7 Correct 39 ms 38648 KB Output is correct
8 Correct 26 ms 35968 KB Output is correct
9 Correct 198 ms 56404 KB Output is correct
10 Correct 27 ms 36224 KB Output is correct
11 Correct 29 ms 35840 KB Output is correct
12 Correct 182 ms 56424 KB Output is correct
13 Correct 138 ms 56656 KB Output is correct
14 Correct 156 ms 56656 KB Output is correct
15 Correct 162 ms 56440 KB Output is correct
16 Correct 130 ms 56600 KB Output is correct
17 Correct 171 ms 56572 KB Output is correct
18 Correct 145 ms 48376 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 35612 KB Output is correct
2 Correct 29 ms 35584 KB Output is correct
3 Correct 23 ms 35584 KB Output is correct
4 Correct 32 ms 36216 KB Output is correct
5 Correct 34 ms 35812 KB Output is correct
6 Correct 29 ms 36480 KB Output is correct
7 Correct 54 ms 38648 KB Output is correct
8 Correct 30 ms 35944 KB Output is correct
9 Correct 229 ms 56312 KB Output is correct
10 Correct 25 ms 36224 KB Output is correct
11 Correct 25 ms 35968 KB Output is correct
12 Correct 191 ms 56328 KB Output is correct
13 Correct 143 ms 56568 KB Output is correct
14 Correct 143 ms 56552 KB Output is correct
15 Correct 166 ms 56436 KB Output is correct
16 Correct 125 ms 56568 KB Output is correct
17 Correct 168 ms 56568 KB Output is correct
18 Correct 150 ms 48436 KB Output is correct
19 Execution timed out 632 ms 141180 KB Time limit exceeded
20 Halted 0 ms 0 KB -