oj.uz

Submission #109012

# Submission time Handle Problem Language Result Execution time Memory
109012 2019-05-04T02:22:46 Z thebes Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 25312 KB 
#include <bits/stdc++.h>
using namespace std;

const int MN = 5e5+5;
int mo[MN], f, n, m, i, x, y, st[MN];
vector<pair<int,int>> adj[MN];
stack<pair<int,int>> s;

void dfs(int n,int p){
    st[n] = 1; s.push({n,p});
    for(auto v : adj[n]){
        if(v.second==p||mo[v.second]) continue;
        else if(st[v.first]){
            f = 1;
            mo[v.second]=1;
            printf("%d ",v.first);
            while(s.size()&&s.top().first!=v.first){
                mo[s.top().second]=1;
                printf("%d ",s.top().first);
                s.pop();
            }
            printf("\n");
        }
        else dfs(v.first, v.second);
        if(f) break;
    }
    if(s.size()&&s.top().first==n) s.pop();
    st[n] = 0;
}

int main(){
    for(scanf("%d%d",&n,&m),i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        adj[x].push_back({y,i});
        adj[y].push_back({x,i});
    }
    i=1;
    while(i<=n){
        f=0; dfs(i,-1);
        if(!f) i++;
    }
    return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:32:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d%d",&n,&m),i=1;i<=m;i++){
         ~~~~~~~~~~~~~~~~~~~^~~~
postmen.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&x,&y);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 13 ms 12160 KB Output is correct
4 Correct 14 ms 12160 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 15 ms 12264 KB Output is correct
7 Correct 27 ms 12672 KB Output is correct
8 Correct 14 ms 12416 KB Output is correct
9 Correct 119 ms 14840 KB Output is correct
10 Correct 16 ms 12160 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 137 ms 15224 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 14 ms 12160 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 16 ms 12288 KB Output is correct
7 Correct 20 ms 12672 KB Output is correct
8 Correct 13 ms 12416 KB Output is correct
9 Correct 115 ms 14840 KB Output is correct
10 Correct 18 ms 12160 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 147 ms 15132 KB Output is correct
13 Correct 117 ms 25208 KB Output is correct
14 Correct 158 ms 16376 KB Output is correct
15 Execution timed out 991 ms 15824 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 19 ms 12160 KB Output is correct
6 Correct 13 ms 12160 KB Output is correct
7 Correct 21 ms 12672 KB Output is correct
8 Correct 16 ms 12416 KB Output is correct
9 Correct 147 ms 14968 KB Output is correct
10 Correct 14 ms 12160 KB Output is correct
11 Correct 21 ms 12288 KB Output is correct
12 Correct 134 ms 15224 KB Output is correct
13 Correct 111 ms 25312 KB Output is correct
14 Correct 91 ms 16244 KB Output is correct
15 Execution timed out 1008 ms 16064 KB Time limit exceeded
16 Halted 0 ms 0 KB -