oj.uz

Submission #227182

# Submission time Handle Problem Language Result Execution time Memory
227182 2020-04-26T11:15:47 Z tushar_2658 Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 22816 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 500005;
vector<pair<int, int>> edges[maxn];
int used[maxn]; 
vector<int> path;

void dfs(int x){
	for(auto i : edges[x]){
		if(used[i.second] == 0){
			used[i.second] = 1; 
			dfs(i.first);
		}
	}
	path.push_back(x);
}

int main(int argc, char const *argv[])
{
//	freopen("in.txt", "r", stdin); 
	int n, m;
	scanf("%d %d", &n, &m); 
	for(int i = 0; i < m; ++i){
		int x, y;
		scanf("%d %d", &x, &y); 
		edges[x].push_back(make_pair(y, i)); 
		edges[y].push_back(make_pair(x, i));
	}
	dfs(1);
	path.pop_back();
	vector<vector<int>> ans;
	vector<bool> vis(n + 1, 0);
	stack<int> st;
	vector<int> v;
	for(auto i : path){
		if(vis[i]){
			v.clear();
			while(st.top() != i){
				v.push_back(st.top());
				vis[st.top()] = 0;
				st.pop();
			}
			if(st.top() == i){
				vis[st.top()] = 0;
				v.push_back(st.top());
				st.pop();
			}
			ans.push_back(v);
		}
		vis[i] = 1;
		st.push(i);
	}
	v.clear();
	while(!st.empty()){
		v.push_back(st.top());
		st.pop();
	}
	ans.push_back(v);
	for(auto i : ans){
		for(auto j : i){
			printf("%d ", j);
		}
		printf("\n");
	}

	return 0;
}

Compilation message

postmen.cpp: In function 'int main(int, const char**)':
postmen.cpp:23:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m); 
  ~~~~~^~~~~~~~~~~~~~~~~
postmen.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &x, &y); 
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 14 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 19 ms 13440 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 105 ms 20520 KB Output is correct
10 Correct 12 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 75 ms 20696 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 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 14 ms 12416 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 20 ms 13488 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 103 ms 20348 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 73 ms 20600 KB Output is correct
13 Correct 78 ms 22816 KB Output is correct
14 Correct 78 ms 19952 KB Output is correct
15 Execution timed out 1097 ms 20588 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 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 11 ms 12032 KB Output is correct
4 Correct 17 ms 12416 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 19 ms 13440 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 103 ms 20348 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 74 ms 20724 KB Output is correct
13 Correct 77 ms 22816 KB Output is correct
14 Correct 78 ms 19952 KB Output is correct
15 Execution timed out 1100 ms 20712 KB Time limit exceeded
16 Halted 0 ms 0 KB -