oj.uz

답안 #31516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31516 2017-08-29T07:22:31 Z ngkan146 어르신 집배원 (BOI14_postmen) C++11
55 / 100
 500 ms 53788 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[500005];
vector <edge> G[500005];
bool visited[500005];
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);
}
stack <int> st;
bool used[500005];
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++){
        int x,y;
        cin >> 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.top() != euler[i]){
                used[st.top()] = 0;
                printf("%d ",st.top());
                st.pop();
            };
            printf("%d\n",euler[i]);
        }
        else{
            st.push(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);
     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 18 ms 12336 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 23 ms 13184 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 91 ms 18168 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 101 ms 18564 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 23 ms 13184 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 96 ms 18180 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 108 ms 18524 KB Output is correct
13 Correct 169 ms 20484 KB Output is correct
14 Correct 147 ms 18112 KB Output is correct
15 Correct 136 ms 19604 KB Output is correct
16 Correct 164 ms 20344 KB Output is correct
17 Correct 152 ms 16652 KB Output is correct
18 Correct 148 ms 18868 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 11 ms 12120 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 18 ms 12288 KB Output is correct
5 Correct 16 ms 12160 KB Output is correct
6 Correct 17 ms 12416 KB Output is correct
7 Correct 25 ms 13184 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 106 ms 18292 KB Output is correct
10 Correct 15 ms 12168 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 105 ms 18548 KB Output is correct
13 Correct 154 ms 20444 KB Output is correct
14 Correct 160 ms 18236 KB Output is correct
15 Correct 143 ms 19620 KB Output is correct
16 Correct 175 ms 20300 KB Output is correct
17 Correct 145 ms 16776 KB Output is correct
18 Correct 155 ms 18856 KB Output is correct
19 Execution timed out 891 ms 53788 KB Time limit exceeded
20 Halted 0 ms 0 KB -