oj.uz

Submission #31517

# Submission time Handle Problem Language Result Execution time Memory
31517 2017-08-29T07:24:02 Z YoLo Senior Postmen (BOI14_postmen) C++14
0 / 100
 31 ms 13968 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, cak, num[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] == 1)
			num[u] --;
		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++)
		num[i] = v[i].size();
	for(int i = 1; i <= n; i++)
		if(num[i] > 0)
			dfs(i);
}

Subtask #1
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12160 KB Output is correct
2 Correct 12 ms 12136 KB Output is correct
3 Correct 15 ms 12192 KB Output is correct
4 Correct 20 ms 12496 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 17 ms 12560 KB Output is correct
7 Incorrect 24 ms 13904 KB Some edges were not used
8 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12160 KB Output is correct
4 Correct 18 ms 12416 KB Output is correct
5 Correct 15 ms 12160 KB Output is correct
6 Correct 18 ms 12544 KB Output is correct
7 Incorrect 29 ms 13800 KB Some edges were not used
8 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12156 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 25 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12544 KB Output is correct
7 Incorrect 31 ms 13968 KB Some edges were not used
8 Halted 0 ms 0 KB -