Submission #31540

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
31540	2017-08-29T07:58:53 Z	YoLo	Senior Postmen (BOI14_postmen)	C++14	38 / 100	500 ms	22748 KB

postmen

#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define N 100000
#define pi acos(-1)
#define tora acos(-1)/180
#define tode 180/acos(-1)
#define pque priority_queue
typedef pair < int, int > ii;
typedef vector < int > vi;
typedef vector < vi > vii;
int mod = 1000000007 ;
int n, m, a, b, cak;
bool check[500009], edge[500009];
vector<ii> v[500009];
stack<int> st;
void dfs(int u)
{
	//cout << u << endl;
	if(check[u] == 1)
	{
		if(cak == 1)
			cout << endl;
		cout << u;
		while(!st.empty() && st.top() != u)
		{
			int id = st.top();
			cout << ' ' << id;
			check[id] = 0;
			st.pop();
			if(id == u)
				break;
		}
		cak = 1;
	}
	else
	{
		check[u] = 1;
		st.push(u);
	}
	for(int i = 0; i < (int)v[u].size(); i++)
		if(edge[v[u][i].se] == 0 && check[u] == 1)
		{
			edge[v[u][i].se] = 1;
			dfs(v[u][i].fi);
		}
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= m; i++)
	{
		cin >> a >> b;
		v[a].pb(mp(b, i));
		v[b].pb(mp(a, i));
	}
	for(int i = 1; i <= n; i++)
		dfs(i);
}

Subtask #1

38.0 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	12032 KB	Output is correct
2	Correct	14 ms	12032 KB	Output is correct
3	Correct	11 ms	12160 KB	Output is correct
4	Correct	22 ms	12416 KB	Output is correct
5	Correct	14 ms	12160 KB	Output is correct
6	Correct	18 ms	12544 KB	Output is correct
7	Correct	29 ms	13540 KB	Output is correct
8	Correct	16 ms	12264 KB	Output is correct
9	Correct	185 ms	20728 KB	Output is correct
10	Correct	20 ms	12288 KB	Output is correct
11	Correct	13 ms	12416 KB	Output is correct
12	Correct	81 ms	21240 KB	Output is correct

Subtask #2

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	12136 KB	Output is correct
2	Correct	13 ms	12080 KB	Output is correct
3	Correct	13 ms	12032 KB	Output is correct
4	Correct	16 ms	12392 KB	Output is correct
5	Correct	12 ms	12160 KB	Output is correct
6	Correct	13 ms	12544 KB	Output is correct
7	Correct	21 ms	13568 KB	Output is correct
8	Correct	15 ms	12288 KB	Output is correct
9	Correct	150 ms	20824 KB	Output is correct
10	Correct	12 ms	12288 KB	Output is correct
11	Correct	13 ms	12288 KB	Output is correct
12	Correct	92 ms	21084 KB	Output is correct
13	Correct	115 ms	22724 KB	Output is correct
14	Correct	84 ms	16096 KB	Output is correct
15	Execution timed out	1064 ms	21180 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	12160 KB	Output is correct
2	Correct	13 ms	12136 KB	Output is correct
3	Correct	15 ms	12136 KB	Output is correct
4	Correct	16 ms	12416 KB	Output is correct
5	Correct	12 ms	12160 KB	Output is correct
6	Correct	14 ms	12544 KB	Output is correct
7	Correct	25 ms	13544 KB	Output is correct
8	Correct	14 ms	12288 KB	Output is correct
9	Correct	154 ms	20876 KB	Output is correct
10	Correct	14 ms	12288 KB	Output is correct
11	Correct	14 ms	12392 KB	Output is correct
12	Correct	78 ms	21132 KB	Output is correct
13	Correct	117 ms	22748 KB	Output is correct
14	Correct	79 ms	15996 KB	Output is correct
15	Execution timed out	1080 ms	21112 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-