제출 #31540

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
31540		YoLo	어르신 집배원 (BOI14_postmen)	C++14	38 / 100	1080 ms	22748 KiB

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 / 38
• Subtask 2: 0 / 17
• Subtask 3: 0 / 45