Submission #288644

# Submission time Handle Problem Language Result Execution time Memory
288644 2020-09-01T17:37:17 Z LordOfIran Senior Postmen (BOI14_postmen) C++17
55 / 100
500 ms 55160 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], nw[N], ht[N], nxt = 0;
vector <pii> v[N];

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

int32_t main() {
	use_fast;
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		v[x].pb({y, i});
		v[y].pb({x, 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;
}

# Verdict Execution time Memory 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 10 ms 12416 KB Output is correct
7 Correct 16 ms 13184 KB Output is correct
8 Correct 9 ms 12288 KB Output is correct
9 Correct 51 ms 18040 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 11 ms 12288 KB Output is correct
12 Correct 59 ms 18424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 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 10 ms 12416 KB Output is correct
7 Correct 16 ms 13312 KB Output is correct
8 Correct 9 ms 12288 KB Output is correct
9 Correct 53 ms 18044 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 11 ms 12288 KB Output is correct
12 Correct 59 ms 18424 KB Output is correct
13 Correct 78 ms 20728 KB Output is correct
14 Correct 118 ms 18480 KB Output is correct
15 Correct 137 ms 19316 KB Output is correct
16 Correct 76 ms 20728 KB Output is correct
17 Correct 144 ms 16828 KB Output is correct
18 Correct 114 ms 19064 KB Output is correct
# Verdict Execution time Memory 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 19 ms 13184 KB Output is correct
8 Correct 10 ms 12288 KB Output is correct
9 Correct 50 ms 18040 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 11 ms 12288 KB Output is correct
12 Correct 59 ms 18424 KB Output is correct
13 Correct 106 ms 20728 KB Output is correct
14 Correct 112 ms 18444 KB Output is correct
15 Correct 135 ms 19304 KB Output is correct
16 Correct 72 ms 20600 KB Output is correct
17 Correct 135 ms 16760 KB Output is correct
18 Correct 116 ms 19064 KB Output is correct
19 Correct 474 ms 55160 KB Output is correct
20 Execution timed out 698 ms 44032 KB Time limit exceeded
21 Halted 0 ms 0 KB -