oj.uz

답안 #288647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288647 2020-09-01T17:42:08 Z LordOfIran 어르신 집배원 (BOI14_postmen) C++17
55 / 100
 500 ms 59104 KB 
//                             In The Name Of Allah                                           
#include <bits/stdc++.h>
#define	ss second
#define ff first
#define use_fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define se(n) cout << setprecision(n) << fixed
#define pb push_back
//#define ll long long
#define ld long double
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std; 
const int N = 5e5 + 100, OO = 1e9 + 7, K = 1e7 + 4, T = 22, M = 1e9 + 7, P = 6151, SQ = 1300, lg = 22;
typedef pair <int, int> pii;
bool mark[N];
int num[N], ET[N], l[N], r[N], nw[N], ht[N], nxt = 0;
vector <int> v[N];

inline void dfs(int x) {
	for(; nw[x] < (int)v[x].size(); nw[x]++) {
		int p = v[x][nw[x]];
		if(mark[p])
			continue;
		mark[p] = true;
		dfs(l[p] ^ r[p] ^ x);
		ET[nxt++] = x;
	}
}

int32_t main() {
	use_fast;
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		cin >> l[i] >> r[i];
		v[r[i]].pb(i);
		v[l[i]].pb(i);
	}
	dfs(1);
	int sz = -1;
//	for(int i = 0; i < nxt; i++)
//		cout << ET[i] << " ";
//	return 0;
	for(int i = 0; i < nxt; i++) {
		int u = ET[i];
		if(num[u]) {
			cout << u;
			while(ht[sz] != u) 	
				cout << " " << ht[sz], num[ht[sz]]--, sz--;
			cout << endl;
		}
		else 
			ht[++sz] = u, num[u]++;
	}
	for(int i = 0; i <= sz; i++)
		cout << ht[i] << " ";
	cout << endl;
	return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12160 KB Output is correct
2 Correct 8 ms 12160 KB Output is correct
3 Correct 8 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 11 ms 12416 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 9 ms 12288 KB Output is correct
9 Correct 51 ms 17912 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 11 ms 12288 KB Output is correct
12 Correct 61 ms 18168 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12160 KB Output is correct
2 Correct 8 ms 12160 KB Output is correct
3 Correct 8 ms 12160 KB Output is correct
4 Correct 12 ms 12416 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 11 ms 12416 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 9 ms 12288 KB Output is correct
9 Correct 52 ms 17912 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 11 ms 12288 KB Output is correct
12 Correct 62 ms 18168 KB Output is correct
13 Correct 77 ms 21368 KB Output is correct
14 Correct 121 ms 18792 KB Output is correct
15 Correct 137 ms 19824 KB Output is correct
16 Correct 77 ms 21368 KB Output is correct
17 Correct 144 ms 17184 KB Output is correct
18 Correct 124 ms 19320 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12160 KB Output is correct
2 Correct 8 ms 12160 KB Output is correct
3 Correct 8 ms 12160 KB Output is correct
4 Correct 12 ms 12288 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 11 ms 12416 KB Output is correct
7 Correct 16 ms 13056 KB Output is correct
8 Correct 11 ms 12288 KB Output is correct
9 Correct 54 ms 17912 KB Output is correct
10 Correct 12 ms 12544 KB Output is correct
11 Correct 11 ms 12288 KB Output is correct
12 Correct 60 ms 18168 KB Output is correct
13 Correct 77 ms 21368 KB Output is correct
14 Correct 120 ms 18648 KB Output is correct
15 Correct 134 ms 19828 KB Output is correct
16 Correct 78 ms 21496 KB Output is correct
17 Correct 138 ms 17144 KB Output is correct
18 Correct 126 ms 19352 KB Output is correct
19 Execution timed out 535 ms 59104 KB Time limit exceeded
20 Halted 0 ms 0 KB -