oj.uz

답안 #31498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31498 2017-08-29T07:05:51 Z YoLo 어르신 집배원 (BOI14_postmen) C++14
38 / 100
 500 ms 26616 KB 
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#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;
vector<ii> v[500009];
stack<int> st;
void dfs(int u)
{
	//cout << u << endl;
	if(check[u] == 1)
	{
		while(!st.empty())
		{
			int id = st.top();
			cout << id << ' ';
			check[id] = 0;
			st.pop();
			if(id == u)
				break;
		}
		cout << endl;
	}
	check[u] = 1;
	st.push(u);
	for(int i = 0; i < 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);
}
signed 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);
}

Compilation message

postmen.cpp: In function 'void dfs(long long int)':
postmen.cpp:39:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v[u].size(); i++)
                 ~~^~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 10 ms 12032 KB Output is correct
4 Correct 16 ms 12416 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 17 ms 12672 KB Output is correct
7 Correct 27 ms 14080 KB Output is correct
8 Correct 13 ms 12416 KB Output is correct
9 Correct 203 ms 23432 KB Output is correct
10 Correct 15 ms 12416 KB Output is correct
11 Correct 16 ms 12416 KB Output is correct
12 Correct 157 ms 23928 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 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 17 ms 12416 KB Output is correct
5 Correct 13 ms 12192 KB Output is correct
6 Correct 15 ms 12672 KB Output is correct
7 Correct 28 ms 14080 KB Output is correct
8 Correct 14 ms 12336 KB Output is correct
9 Correct 197 ms 23392 KB Output is correct
10 Correct 14 ms 12416 KB Output is correct
11 Correct 16 ms 12544 KB Output is correct
12 Correct 158 ms 23932 KB Output is correct
13 Correct 163 ms 26488 KB Output is correct
14 Correct 151 ms 19404 KB Output is correct
15 Execution timed out 1086 ms 24700 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 14 ms 12160 KB Output is correct
3 Correct 11 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 19 ms 12672 KB Output is correct
7 Correct 28 ms 14080 KB Output is correct
8 Correct 13 ms 12416 KB Output is correct
9 Correct 196 ms 23416 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 13 ms 12416 KB Output is correct
12 Correct 139 ms 23932 KB Output is correct
13 Correct 156 ms 26616 KB Output is correct
14 Correct 153 ms 19340 KB Output is correct
15 Execution timed out 1087 ms 24520 KB Time limit exceeded
16 Halted 0 ms 0 KB -