oj.uz

Submission #11150

# Submission time Handle Problem Language Result Execution time Memory
11150 2014-11-15T02:55:51 Z tncks0121 Senior Postmen (BOI14_postmen) C++14
100 / 100
 447 ms 18456 KB 
//
//  main.cpp
//  BOI14_postmen
//
//  Created by 박수찬 on 14. 11. 14..
//  Copyright (c) 2014년 박수찬. All rights reserved.
//
 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
#include <list>
#include <iostream>
 
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;
 
const int N_ = 500050, M_ = 2 * 500050;
 
int N, M;
 
bool passed[M_];
bool visited[N_];
int con[M_], lnk[M_], beg[N_], E;
int processed[N_];
 stack<int> stk; 
int main() {
    scanf("%d%d", &N, &M);
    for(int i = 1; i <= M; i++) {
        int u, v; scanf("%d%d", &u, &v);
         
        ++E; lnk[E] = beg[u]; beg[u] = E; con[E] = v;
        ++E; lnk[E] = beg[v]; beg[v] = E; con[E] = u;
    }
     
    memset(processed, -1, sizeof processed);
     
    for(int u = 1; u <= N; u++) {
        stk.push(u);
         
        while(!stk.empty()) {
            int cur = stk.top();
            visited[cur] = true;
             
            int &i = processed[cur];
            if(i < 0) i = beg[cur];
             
            bool updated = false;
            for(; i > 0; i = lnk[i]) {
                int nxt = con[i];
                int e = (i-1)/2+1; if(passed[e]) continue;
                passed[e] = true;
                if(visited[nxt]) {
                    while(!stk.empty() && stk.top() != nxt) {
                        int vt = stk.top(); stk.pop();
                        visited[vt] = false;
                        printf("%d ", vt);
                    }
                    printf("%d\n", nxt);
                } else {
                    stk.push(nxt);
                }
                updated = true;
                break;
            }
            if(!updated && !stk.empty()) stk.pop();
        }
    }
     
     
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:49: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:51:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int u, v; scanf("%d%d", &u, &v);
                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2280 KB Output is correct
2 Correct 6 ms 2280 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 8 ms 2432 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 9 ms 2356 KB Output is correct
7 Correct 14 ms 2688 KB Output is correct
8 Correct 7 ms 2432 KB Output is correct
9 Correct 42 ms 4344 KB Output is correct
10 Correct 7 ms 2432 KB Output is correct
11 Correct 7 ms 2432 KB Output is correct
12 Correct 57 ms 4448 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 5 ms 2304 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 7 ms 2280 KB Output is correct
6 Correct 8 ms 2432 KB Output is correct
7 Correct 14 ms 2560 KB Output is correct
8 Correct 8 ms 2304 KB Output is correct
9 Correct 62 ms 4344 KB Output is correct
10 Correct 7 ms 2432 KB Output is correct
11 Correct 12 ms 2432 KB Output is correct
12 Correct 45 ms 4392 KB Output is correct
13 Correct 66 ms 5476 KB Output is correct
14 Correct 63 ms 5000 KB Output is correct
15 Correct 71 ms 4728 KB Output is correct
16 Correct 53 ms 5472 KB Output is correct
17 Correct 59 ms 4832 KB Output is correct
18 Correct 77 ms 5076 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2316 KB Output is correct
2 Correct 7 ms 2304 KB Output is correct
3 Correct 7 ms 2352 KB Output is correct
4 Correct 7 ms 2352 KB Output is correct
5 Correct 7 ms 2304 KB Output is correct
6 Correct 7 ms 2432 KB Output is correct
7 Correct 12 ms 2560 KB Output is correct
8 Correct 8 ms 2432 KB Output is correct
9 Correct 68 ms 4320 KB Output is correct
10 Correct 7 ms 2432 KB Output is correct
11 Correct 7 ms 2432 KB Output is correct
12 Correct 54 ms 4492 KB Output is correct
13 Correct 53 ms 5432 KB Output is correct
14 Correct 58 ms 4984 KB Output is correct
15 Correct 51 ms 4832 KB Output is correct
16 Correct 53 ms 5536 KB Output is correct
17 Correct 76 ms 4860 KB Output is correct
18 Correct 55 ms 4984 KB Output is correct
19 Correct 383 ms 18456 KB Output is correct
20 Correct 360 ms 15840 KB Output is correct
21 Correct 318 ms 14772 KB Output is correct
22 Correct 368 ms 18452 KB Output is correct
23 Correct 221 ms 12536 KB Output is correct
24 Correct 447 ms 15480 KB Output is correct
25 Correct 376 ms 16236 KB Output is correct