oj.uz

Submission #31529

# Submission time Handle Problem Language Result Execution time Memory
31529 2017-08-29T07:29:59 Z ngkan146 Senior Postmen (BOI14_postmen) C++
55 / 100
 500 ms 65508 KB 
#include <bits/stdc++.h>
using namespace std;
struct edge{
    int v=0, id=0;
    edge(int v=0,int id=0):id(id),v(v){}
};
int ctrl[1000005];
vector <edge> G[1000005];
bool visited[1000005];
int n,m;
vector <int> euler;
void dfs(int u){
    for(;ctrl[u]<G[u].size();++ctrl[u]){
        int v = G[u][ctrl[u]].v;
        int id = G[u][ctrl[u]].id;
        if (visited[id]) continue;
        visited[id] = 1;
        dfs(v);
    }
    euler.push_back(u);
}
int st[1000005], stsize;
bool used[1000005];
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;++i){
        int x,y;
        scanf("%d %d",&x,&y);
        G[x].push_back(edge(y,i));
        G[y].push_back(edge(x,i));
    }

    dfs(1);

    for(int i=0;i<euler.size();++i){
        if (used[euler[i]]){
            while(st[stsize-1] != euler[i]){
                printf("%d ",st[stsize-1]);
                used[st[stsize-1]] = 0;
                --stsize;
            };
            printf("%d\n",euler[i]);
        }
        else{
            st[stsize++] = euler[i];
            used[euler[i]] = 1;
        }
    }
}

Compilation message

postmen.cpp: In constructor 'edge::edge(int, int)':
postmen.cpp:4:17: warning: 'edge::id' will be initialized after [-Wreorder]
     int v=0, id=0;
                 ^
postmen.cpp:4:11: warning:   'int edge::v' [-Wreorder]
     int v=0, id=0;
           ^
postmen.cpp:5:5: warning:   when initialized here [-Wreorder]
     edge(int v=0,int id=0):id(id),v(v){}
     ^~~~
postmen.cpp: In function 'void dfs(int)':
postmen.cpp:13:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(;ctrl[u]<G[u].size();++ctrl[u]){
          ~~~~~~~^~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:35:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<euler.size();++i){
                 ~^~~~~~~~~~~~~
postmen.cpp:25: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:28: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 22 ms 23808 KB Output is correct
2 Correct 24 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 22 ms 24004 KB Output is correct
5 Correct 20 ms 23912 KB Output is correct
6 Correct 27 ms 24192 KB Output is correct
7 Correct 32 ms 24960 KB Output is correct
8 Correct 19 ms 24040 KB Output is correct
9 Correct 62 ms 29948 KB Output is correct
10 Correct 20 ms 24040 KB Output is correct
11 Correct 21 ms 24064 KB Output is correct
12 Correct 67 ms 30224 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23856 KB Output is correct
2 Correct 17 ms 23808 KB Output is correct
3 Correct 23 ms 23784 KB Output is correct
4 Correct 22 ms 24048 KB Output is correct
5 Correct 19 ms 23936 KB Output is correct
6 Correct 21 ms 24192 KB Output is correct
7 Correct 26 ms 24864 KB Output is correct
8 Correct 18 ms 23936 KB Output is correct
9 Correct 65 ms 29924 KB Output is correct
10 Correct 21 ms 23936 KB Output is correct
11 Correct 19 ms 24064 KB Output is correct
12 Correct 71 ms 30248 KB Output is correct
13 Correct 96 ms 32332 KB Output is correct
14 Correct 96 ms 30004 KB Output is correct
15 Correct 83 ms 31424 KB Output is correct
16 Correct 126 ms 32116 KB Output is correct
17 Correct 112 ms 28528 KB Output is correct
18 Correct 110 ms 30708 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 17 ms 23808 KB Output is correct
4 Correct 20 ms 24064 KB Output is correct
5 Correct 19 ms 23912 KB Output is correct
6 Correct 22 ms 24192 KB Output is correct
7 Correct 26 ms 24960 KB Output is correct
8 Correct 23 ms 24048 KB Output is correct
9 Correct 60 ms 29948 KB Output is correct
10 Correct 20 ms 23936 KB Output is correct
11 Correct 21 ms 24064 KB Output is correct
12 Correct 66 ms 30196 KB Output is correct
13 Correct 112 ms 32116 KB Output is correct
14 Correct 112 ms 30092 KB Output is correct
15 Correct 95 ms 31340 KB Output is correct
16 Correct 105 ms 32152 KB Output is correct
17 Correct 92 ms 28532 KB Output is correct
18 Correct 111 ms 30708 KB Output is correct
19 Execution timed out 587 ms 65508 KB Time limit exceeded
20 Halted 0 ms 0 KB -