oj.uz

Submission #31560

# Submission time Handle Problem Language Result Execution time Memory
31560 2017-08-29T09:43:09 Z Dat160601 Senior Postmen (BOI14_postmen) C++14
100 / 100
 358 ms 25368 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
int n,u,v,m,vis[500007],hav[500007],cnt=0,ed[1000007],to[1000007],last[1000007],pre[1000007];
stack <int> res;
vector <int> ans;
inline void addedge(int u,int v,int i){
    cnt++;
    to[cnt]=v;
    ed[cnt]=i;
    pre[cnt]=last[u];
    last[u]=cnt;
    cnt++;
    to[cnt]=u;
    ed[cnt]=i;
    pre[cnt]=last[v];
    last[v]=cnt;
}
inline void dfs(int k){
    stack <int> st;
    st.push(k);
    while(!st.empty()){
        int u=st.top(),ok=0;
        for(int i=last[u];i;i=pre[i]){
            int v=to[i];
            int id=ed[i];
            last[u]=pre[i];
            if(vis[id]==1) continue;
            vis[id]=1;
            ok=1;
            st.push(v);
            break;
        }
        if(!ok){
            ans.pb(u);
            st.pop();
        }
    }
}
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%d %d",&u,&v);
        addedge(u,v,i);
    }
    dfs(1);
    stack <int> stl;
    for(int i=0;i<(int)ans.size();i++){
        u=ans[i];
        if(hav[u]){
            while(!stl.empty() && stl.top()!=u){
                printf("%d ",stl.top());
                hav[stl.top()]=0;
                stl.pop();
            }
            printf("%d\n",u);
        }
        else{
            hav[u]=1;
            stl.push(u);
        }
    }
}

Compilation message

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

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 10 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 10 ms 1024 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 41 ms 4212 KB Output is correct
10 Correct 7 ms 544 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 47 ms 4292 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 436 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 12 ms 1072 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 44 ms 4212 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 57 ms 4420 KB Output is correct
13 Correct 49 ms 5280 KB Output is correct
14 Correct 50 ms 4976 KB Output is correct
15 Correct 45 ms 4896 KB Output is correct
16 Correct 49 ms 5256 KB Output is correct
17 Correct 62 ms 4812 KB Output is correct
18 Correct 49 ms 5028 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 304 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 7 ms 564 KB Output is correct
7 Correct 11 ms 1000 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 42 ms 4216 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 59 ms 4360 KB Output is correct
13 Correct 68 ms 5328 KB Output is correct
14 Correct 54 ms 4848 KB Output is correct
15 Correct 59 ms 4896 KB Output is correct
16 Correct 52 ms 5284 KB Output is correct
17 Correct 54 ms 4820 KB Output is correct
18 Correct 53 ms 5024 KB Output is correct
19 Correct 349 ms 25368 KB Output is correct
20 Correct 333 ms 23328 KB Output is correct
21 Correct 308 ms 21248 KB Output is correct
22 Correct 353 ms 25368 KB Output is correct
23 Correct 192 ms 18204 KB Output is correct
24 Correct 358 ms 22196 KB Output is correct
25 Correct 323 ms 23716 KB Output is correct