oj.uz

Submission #941132

# Submission time Handle Problem Language Result Execution time Memory
941132 2024-03-08T07:47:18 Z Faisal_Saqib Senior Postmen (BOI14_postmen) C++17
38 / 100
 500 ms 28496 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
const int N = 5e5 + 10;
bool mark[N], see[N];
vector<int> adj[N];
pii e[N];
vector<int> tour, st;
 
void dfs(int v){
	for(auto i : adj[v]){
		if(mark[i])continue;
		int u = e[i].F + e[i].S - v;
		mark[i] = true;
		dfs(u);
	}
	tour.pb(v);
 
}
 
int main(){
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(0);
	int n, m; scanf("%d %d", &n ,&m);
	for(int i=0; i<m; i++){
		int u, v; scanf("%d %d", &u, &v);
		adj[u].pb(i);
		adj[v].pb(i);
		e[i] = {u, v};
	}
	dfs(1);
	
	for(auto u : tour){
		if(!see[u]){
			see[u] = true;
			st.pb(u);
		}else{
			while(st.back() != u){
				printf("%d ", st.back());
				see[st.back()] = false;
				st.pop_back();
			}
			printf("%d\n", u);
		}
	}
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:33:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  int n, m; scanf("%d %d", &n ,&m);
      |            ~~~~~^~~~~~~~~~~~~~~~~
postmen.cpp:35:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |   int u, v; scanf("%d %d", &u, &v);
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 6 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 5 ms 15168 KB Output is correct
7 Correct 10 ms 16220 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 82 ms 25660 KB Output is correct
10 Correct 4 ms 14936 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 44 ms 26036 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 5 ms 14940 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 15196 KB Output is correct
7 Correct 9 ms 16220 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 69 ms 25548 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14848 KB Output is correct
12 Correct 44 ms 26056 KB Output is correct
13 Correct 49 ms 28496 KB Output is correct
14 Correct 57 ms 24528 KB Output is correct
15 Execution timed out 1036 ms 27572 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14836 KB Output is correct
4 Correct 5 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 5 ms 15196 KB Output is correct
7 Correct 13 ms 16220 KB Output is correct
8 Correct 4 ms 15192 KB Output is correct
9 Correct 67 ms 25576 KB Output is correct
10 Correct 4 ms 15192 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 44 ms 26064 KB Output is correct
13 Correct 61 ms 28492 KB Output is correct
14 Correct 42 ms 24528 KB Output is correct
15 Execution timed out 1037 ms 27192 KB Time limit exceeded
16 Halted 0 ms 0 KB -