oj.uz

답안 #74657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
74657 2018-09-05T23:13:51 Z tmwilliamlin168 어르신 집배원 (BOI14_postmen) C++14
55 / 100
 500 ms 55704 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN=5e5;
int n, m, eu[mxN], ev[mxN];
vector<int> adj[mxN], a1, a2;
bool a[mxN], b[mxN];

void dfs(int u) {
	while(adj[u].size()) {
		int e=adj[u].back();
		adj[u].pop_back();
		if(a[e])
			continue;
		a[e]=1;
		dfs(eu[e]^ev[e]^u);
	}
	a1.push_back(u);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	for(int i=0; i<m; ++i) {
		cin >> eu[i] >> ev[i], --eu[i], --ev[i];
		adj[eu[i]].push_back(i);
		adj[ev[i]].push_back(i);
	}
	dfs(0);
	for(int i=0; i<a1.size(); ++i) {
		if(b[a1[i]]) {
			while(a2.back()!=a1[i]) {
				cout << a2.back()+1 << " ";
				b[a2.back()]=0;
				a2.pop_back();
			}
			cout << a1[i]+1 << "\n";
		} else {
			a2.push_back(a1[i]);
			b[a1[i]]=1;
		}
	}
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:32:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<a1.size(); ++i) {
               ~^~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 19 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 15 ms 12392 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 13 ms 12296 KB Output is correct
9 Correct 46 ms 18032 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 49 ms 18264 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12160 KB Output is correct
2 Correct 13 ms 12160 KB Output is correct
3 Correct 12 ms 12136 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 16 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 18 ms 13184 KB Output is correct
8 Correct 14 ms 12416 KB Output is correct
9 Correct 44 ms 18032 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 17 ms 12264 KB Output is correct
12 Correct 54 ms 18264 KB Output is correct
13 Correct 104 ms 20864 KB Output is correct
14 Correct 90 ms 18392 KB Output is correct
15 Correct 81 ms 19564 KB Output is correct
16 Correct 91 ms 20936 KB Output is correct
17 Correct 99 ms 16752 KB Output is correct
18 Correct 108 ms 19032 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 14 ms 12152 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 14 ms 12416 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 22 ms 13176 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 62 ms 18040 KB Output is correct
10 Correct 14 ms 12264 KB Output is correct
11 Correct 15 ms 12264 KB Output is correct
12 Correct 52 ms 18264 KB Output is correct
13 Correct 106 ms 20796 KB Output is correct
14 Correct 112 ms 18384 KB Output is correct
15 Correct 84 ms 19544 KB Output is correct
16 Correct 107 ms 20836 KB Output is correct
17 Correct 73 ms 16752 KB Output is correct
18 Correct 96 ms 19016 KB Output is correct
19 Execution timed out 585 ms 55704 KB Time limit exceeded
20 Halted 0 ms 0 KB -