oj.uz

답안 #31551

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31551 2017-08-29T08:16:10 Z YoLo 어르신 집배원 (BOI14_postmen) C++14
38 / 100
 500 ms 22524 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];
stack<int> st;
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:59: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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 18 ms 12064 KB Output is correct
4 Correct 16 ms 12544 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 20 ms 12416 KB Output is correct
7 Correct 32 ms 13312 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 157 ms 19368 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 16 ms 12288 KB Output is correct
12 Correct 88 ms 19576 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 15 ms 12032 KB Output is correct
4 Correct 18 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12368 KB Output is correct
7 Correct 24 ms 13184 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 133 ms 19320 KB Output is correct
10 Correct 13 ms 12264 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 85 ms 19460 KB Output is correct
13 Correct 98 ms 22520 KB Output is correct
14 Correct 94 ms 16764 KB Output is correct
15 Execution timed out 1095 ms 21100 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 16 ms 12416 KB Output is correct
5 Correct 14 ms 12192 KB Output is correct
6 Correct 18 ms 12416 KB Output is correct
7 Correct 23 ms 13236 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 171 ms 19440 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 86 ms 19576 KB Output is correct
13 Correct 108 ms 22524 KB Output is correct
14 Correct 97 ms 16760 KB Output is correct
15 Execution timed out 1053 ms 20992 KB Time limit exceeded
16 Halted 0 ms 0 KB -