Submission #243973

# Submission time Handle Problem Language Result Execution time Memory
243973 2020-07-02T12:20:17 Z TadijaSebez Senior Postmen (BOI14_postmen) C++11
55 / 100
500 ms 71268 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=500050;
int was[N],wse[N];
vector<pair<int,int>> E[N];
vector<int> tmp;
vector<vector<int>> ans;
int DFS(int u){
	was[u]=1;
	while(E[u].size()){
		auto e=E[u].back();
		if(wse[e.second])E[u].pop_back();
		else{
			int v=e.first;
			wse[e.second]=1;
			if(was[v]){
				tmp.clear();
				tmp.pb(u);
				was[u]=0;
				return v;
			}else{
				int t=DFS(v);
				if(t!=u){
					tmp.pb(u);
					was[u]=0;
					return t;
				}
				tmp.pb(u);
				ans.pb(tmp);
			}
		}
	}
	return -1;
}
int main(){
	int n,m;
	scanf("%i %i",&n,&m);
	for(int i=1,u,v;i<=m;i++)scanf("%i %i",&u,&v),E[u].pb({v,i}),E[v].pb({u,i});
	for(int i=1;i<=n;i++)DFS(i);
	for(auto cyc:ans){
		for(int u:cyc)printf("%i ",u);
		printf("\n");
	}
	return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
postmen.cpp:39:62: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1,u,v;i<=m;i++)scanf("%i %i",&u,&v),E[u].pb({v,i}),E[v].pb({u,i});
                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 13 ms 12288 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 19 ms 12800 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 50 ms 15992 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 63 ms 16504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12288 KB Output is correct
7 Correct 18 ms 12928 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 55 ms 16120 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 62 ms 16504 KB Output is correct
13 Correct 83 ms 23668 KB Output is correct
14 Correct 91 ms 18676 KB Output is correct
15 Correct 78 ms 18796 KB Output is correct
16 Correct 88 ms 23796 KB Output is correct
17 Correct 93 ms 19120 KB Output is correct
18 Correct 83 ms 20084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 12 ms 12160 KB Output is correct
4 Correct 14 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 20 ms 12800 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 52 ms 15992 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 56 ms 16504 KB Output is correct
13 Correct 81 ms 23796 KB Output is correct
14 Correct 93 ms 18676 KB Output is correct
15 Correct 78 ms 18796 KB Output is correct
16 Correct 88 ms 23924 KB Output is correct
17 Correct 110 ms 19176 KB Output is correct
18 Correct 83 ms 20084 KB Output is correct
19 Execution timed out 587 ms 71268 KB Time limit exceeded
20 Halted 0 ms 0 KB -