oj.uz

Submission #31555

# Submission time Handle Problem Language Result Execution time Memory
31555 2017-08-29T08:55:19 Z YoLo Senior Postmen (BOI14_postmen) C++
38 / 100
 500 ms 22496 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, x[500009], y[500009], f[500009], cnt;
vi v[500009];
void dfs(int u)
{
	//cout << u << endl;
	if(check[u] == 1)
	{
		if(cak == 1)
			printf("\n");
		printf("%d", u);
		while(cnt > 0 && f[cnt] != u)
		{
			printf(" %d", f[cnt]);
			check[f[cnt]] = 0;
			f[cnt] = 0;
			cnt --;
		}
		cak = 1;
	}
	else
	{
		check[u] = 1;
		cnt ++;
		f[cnt] = u;
	}
	for(int i = 0; i < (int)v[u].size(); i++)
		if(edge[v[u][i]] == 0 && check[u] == 1)
		{
			edge[v[u][i]] = 1;
			if(x[v[u][i]] != u)
				dfs(x[v[u][i]]);
			else
				dfs(y[v[u][i]]);
		}
}
int main()
{
	//ios_base::sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= m; i++)
	{
		scanf("%d%d", &x[i], &y[i]);
		v[x[i]].pb(i);
		v[y[i]].pb(i);
	}
	for(int i = 1; i <= n; i++)
		dfs(i);
}

Compilation message

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

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12148 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 15 ms 12416 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 15 ms 12416 KB Output is correct
7 Correct 25 ms 13184 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 127 ms 19320 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 79 ms 19576 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 15 ms 12032 KB Output is correct
4 Correct 21 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 17 ms 12416 KB Output is correct
7 Correct 31 ms 13312 KB Output is correct
8 Correct 15 ms 12288 KB Output is correct
9 Correct 209 ms 19320 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 12 ms 12340 KB Output is correct
12 Correct 92 ms 19576 KB Output is correct
13 Correct 97 ms 22472 KB Output is correct
14 Correct 93 ms 16736 KB Output is correct
15 Execution timed out 1085 ms 21276 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 12160 KB Output is correct
2 Correct 12 ms 12136 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 18 ms 12332 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 22 ms 13184 KB Output is correct
8 Correct 14 ms 12468 KB Output is correct
9 Correct 144 ms 19320 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 90 ms 19576 KB Output is correct
13 Correct 95 ms 22496 KB Output is correct
14 Correct 101 ms 16836 KB Output is correct
15 Execution timed out 1097 ms 21112 KB Time limit exceeded
16 Halted 0 ms 0 KB -