oj.uz

Submission #31545

# Submission time Handle Problem Language Result Execution time Memory
31545 2017-08-29T08:04:52 Z YoLo Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 21672 KB 
#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 check[500009], edge[500009], n, m, a, b, cak;
vector<ii> v[500009];
stack<int> st;
void dfs(int u)
{
	//cout << u << endl;
	if(check[u] == 1)
	{
		if(cak == 1)
			printf("\n");
		printf("%d", u);
		while(!st.empty() && st.top() != u)
		{
			int id = st.top();
			printf(" %d", 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++)
	{
		scanf("%d%d", &a, &b);
		v[a].pb(mp(b, i));
		v[b].pb(mp(a, i));
	}
	for(int i = 1; i <= n; i++)
		dfs(i);
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 20 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 16 ms 12392 KB Output is correct
7 Correct 21 ms 13312 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 171 ms 19600 KB Output is correct
10 Correct 14 ms 12160 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 102 ms 19808 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 16 ms 12008 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 13 ms 12136 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 23 ms 13312 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 164 ms 19496 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 87 ms 19832 KB Output is correct
13 Correct 118 ms 21656 KB Output is correct
14 Correct 100 ms 16476 KB Output is correct
15 Execution timed out 1095 ms 20472 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 13 ms 12136 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 27 ms 13312 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 142 ms 19448 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 19 ms 12288 KB Output is correct
12 Correct 100 ms 19832 KB Output is correct
13 Correct 104 ms 21672 KB Output is correct
14 Correct 105 ms 16480 KB Output is correct
15 Execution timed out 1079 ms 20448 KB Time limit exceeded
16 Halted 0 ms 0 KB -