oj.uz

Submission #11148

# Submission time Handle Problem Language Result Execution time Memory
11148 2014-11-15T02:44:38 Z tncks0121 Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 18568 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_];
typedef list<int>::iterator  lit;
int con[M_], link[M_], beg[N_], E;
int processed[N_];

int main() {
    scanf("%d%d", &N, &M);
    for(int i = 1; i <= M; i++) {
        int u, v; scanf("%d%d", &u, &v);
        
        ++E; link[E] = beg[u]; beg[u] = E; con[E] = v;
        ++E; link[E] = beg[v]; beg[v] = E; con[E] = u;
    }
    
    memset(processed, -1, sizeof processed);
    
    for(int u = 1; u <= N; u++) {
        stack<int> stk; 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 = link[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;
            }
            /*
            processed[cur][0] = it;
            processed[cur][1] = it2;*/
            if(!updated && !stk.empty()) stk.pop();
        }
    }
    
    
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:50: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:52: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 2304 KB Output is correct
2 Correct 8 ms 2304 KB Output is correct
3 Correct 6 ms 2280 KB Output is correct
4 Correct 7 ms 2432 KB Output is correct
5 Correct 6 ms 2304 KB Output is correct
6 Correct 10 ms 2432 KB Output is correct
7 Correct 12 ms 2592 KB Output is correct
8 Correct 7 ms 2304 KB Output is correct
9 Correct 47 ms 4380 KB Output is correct
10 Correct 7 ms 2352 KB Output is correct
11 Correct 8 ms 2432 KB Output is correct
12 Correct 44 ms 4432 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 7 ms 2304 KB Output is correct
4 Correct 9 ms 2432 KB Output is correct
5 Correct 9 ms 2304 KB Output is correct
6 Correct 8 ms 2432 KB Output is correct
7 Correct 11 ms 2560 KB Output is correct
8 Correct 7 ms 2432 KB Output is correct
9 Correct 43 ms 4440 KB Output is correct
10 Correct 8 ms 2432 KB Output is correct
11 Correct 8 ms 2432 KB Output is correct
12 Correct 59 ms 4480 KB Output is correct
13 Correct 112 ms 5464 KB Output is correct
14 Correct 70 ms 4904 KB Output is correct
15 Correct 75 ms 4728 KB Output is correct
16 Correct 96 ms 5524 KB Output is correct
17 Correct 62 ms 4856 KB Output is correct
18 Correct 64 ms 5216 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 6 ms 2304 KB Output is correct
4 Correct 7 ms 2432 KB Output is correct
5 Correct 8 ms 2304 KB Output is correct
6 Correct 8 ms 2416 KB Output is correct
7 Correct 14 ms 2720 KB Output is correct
8 Correct 7 ms 2432 KB Output is correct
9 Correct 43 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 48 ms 4472 KB Output is correct
13 Correct 91 ms 5532 KB Output is correct
14 Correct 70 ms 4984 KB Output is correct
15 Correct 63 ms 4824 KB Output is correct
16 Correct 95 ms 5496 KB Output is correct
17 Correct 69 ms 4856 KB Output is correct
18 Correct 80 ms 4984 KB Output is correct
19 Correct 483 ms 18560 KB Output is correct
20 Correct 413 ms 15832 KB Output is correct
21 Correct 416 ms 14856 KB Output is correct
22 Correct 484 ms 18568 KB Output is correct
23 Correct 290 ms 12536 KB Output is correct
24 Execution timed out 502 ms 15392 KB Time limit exceeded
25 Halted 0 ms 0 KB -