oj.uz

Submission #30938

# Submission time Handle Problem Language Result Execution time Memory
30938 2017-08-01T14:07:47 Z Navick Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 22432 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 5e5 + 10;
bool mark[N], see[N];
vector<int> adj[N];
pii e[N];
vector<int> tour, st;

void dfs(int v){
	for(auto i : adj[v]){
		if(mark[i])continue;
		int u = e[i].F + e[i].S - v;
		mark[i] = true;
		dfs(u);
	}
	tour.pb(v);

}

int main(){
	int n, m; scanf("%d %d", &n ,&m);
	for(int i=0; i<m; i++){
		int u, v; scanf("%d %d", &u, &v);
		adj[u].pb(i);
		adj[v].pb(i);
		e[i] = {u, v};
	}
	dfs(1);
	
	for(auto u : tour){
		if(!see[u]){
			see[u] = true;
			st.pb(u);
		}else{
			while(st.back() != u){
				printf("%d ", st.back());
				see[st.back()] = false;
				st.pop_back();
			}
			printf("%d\n", u);
		}
	}
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:30:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, m; scanf("%d %d", &n ,&m);
            ~~~~~^~~~~~~~~~~~~~~~~
postmen.cpp:32:18: 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 13 ms 12032 KB Output is correct
2 Correct 12 ms 12008 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 14 ms 12416 KB Output is correct
5 Correct 14 ms 12136 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 25 ms 13312 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 122 ms 19516 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 74 ms 19804 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 14 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 19 ms 12416 KB Output is correct
5 Correct 15 ms 12144 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 22 ms 13312 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 104 ms 19564 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 79 ms 19696 KB Output is correct
13 Correct 99 ms 22388 KB Output is correct
14 Correct 96 ms 19188 KB Output is correct
15 Execution timed out 1092 ms 20720 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 12 ms 12208 KB Output is correct
3 Correct 13 ms 12160 KB Output is correct
4 Correct 14 ms 12416 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 27 ms 13312 KB Output is correct
8 Correct 16 ms 12288 KB Output is correct
9 Correct 105 ms 19544 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 81 ms 19700 KB Output is correct
13 Correct 109 ms 22432 KB Output is correct
14 Correct 97 ms 19188 KB Output is correct
15 Execution timed out 1092 ms 20432 KB Time limit exceeded
16 Halted 0 ms 0 KB -