Submission #199445

# Submission time Handle Problem Language Result Execution time Memory
199445 2020-02-01T12:45:35 Z TadijaSebez Senior Postmen (BOI14_postmen) C++11
55 / 100
500 ms 64460 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 12 ms 12160 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 14 ms 12160 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 14 ms 12288 KB Output is correct
7 Correct 18 ms 12672 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 51 ms 15224 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 67 ms 15608 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 11 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12136 KB Output is correct
6 Correct 16 ms 12288 KB Output is correct
7 Correct 19 ms 12776 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 53 ms 15208 KB Output is correct
10 Correct 14 ms 12264 KB Output is correct
11 Correct 14 ms 12264 KB Output is correct
12 Correct 66 ms 15608 KB Output is correct
13 Correct 105 ms 22600 KB Output is correct
14 Correct 92 ms 17524 KB Output is correct
15 Correct 87 ms 17900 KB Output is correct
16 Correct 92 ms 22620 KB Output is correct
17 Correct 101 ms 18096 KB Output is correct
18 Correct 110 ms 19028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 11 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 12084 KB Output is correct
6 Correct 13 ms 12288 KB Output is correct
7 Correct 17 ms 12672 KB Output is correct
8 Correct 13 ms 12328 KB Output is correct
9 Correct 59 ms 15224 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 68 ms 15632 KB Output is correct
13 Correct 102 ms 22568 KB Output is correct
14 Correct 101 ms 17500 KB Output is correct
15 Correct 95 ms 17856 KB Output is correct
16 Correct 88 ms 22516 KB Output is correct
17 Correct 101 ms 18096 KB Output is correct
18 Correct 110 ms 18932 KB Output is correct
19 Execution timed out 574 ms 64460 KB Time limit exceeded
20 Halted 0 ms 0 KB -