oj.uz

Submission #832737

# Submission time Handle Problem Language Result Execution time Memory
832737 2023-08-21T14:18:56 Z serifefedartar Senior Postmen (BOI14_postmen) C++17
100 / 100
 441 ms 80052 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 300005
 
vector<vector<pair<int,int>>> graph;
vector<bool> active;
vector<int> pathVis;

int go_back = 0;
void dfs(int node, int parent) {
	pathVis[node] = true;
	for (auto u : graph[node]) {
		if (u.f == parent || !active[u.s])
			continue;
 
		if (pathVis[u.f]) {
			printf("%d ", u.f);
			go_back = u.f;
			active[u.s] = false;
		} else
			dfs(u.f, node);
 
		if (go_back) {
			if (go_back == node) {
				go_back = 0;
				active[u.s] = false;
				printf("\n");
				continue ;
			}
			printf("%d ", node);
			active[u.s] = false;
			pathVis[node] = false;
			return ;
		}
	}
	pathVis[node] = false;
}
 
int main() {
    int N, M, a, b;
    scanf("%d %d", &N, &M);
 
    graph = vector<vector<pair<int,int>>>(N+1, vector<pair<int,int>>());
    active = vector<bool>(M, true); 
    pathVis = vector<int>(N+1, false);
    for (int i = 0; i < M; i++) {
    	scanf("%d %d", &a, &b);
    	graph[a].push_back({b, i});
    	graph[b].push_back({a, i});
    }
 
    for (int i = 1; i <= N; i++)
    	dfs(i, i);
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%d %d", &N, &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~
postmen.cpp:54:11: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |      scanf("%d %d", &a, &b);
      |      ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 5 ms 800 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 52 ms 2616 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 32 ms 3084 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 53 ms 2724 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 32 ms 3036 KB Output is correct
13 Correct 42 ms 16072 KB Output is correct
14 Correct 35 ms 5796 KB Output is correct
15 Correct 32 ms 5200 KB Output is correct
16 Correct 45 ms 16160 KB Output is correct
17 Correct 37 ms 5488 KB Output is correct
18 Correct 37 ms 8204 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 64 ms 2696 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 45 ms 3000 KB Output is correct
13 Correct 49 ms 16028 KB Output is correct
14 Correct 36 ms 5772 KB Output is correct
15 Correct 42 ms 5240 KB Output is correct
16 Correct 42 ms 16140 KB Output is correct
17 Correct 38 ms 5404 KB Output is correct
18 Correct 37 ms 8128 KB Output is correct
19 Correct 367 ms 80052 KB Output is correct
20 Correct 299 ms 28360 KB Output is correct
21 Correct 254 ms 25192 KB Output is correct
22 Correct 361 ms 80008 KB Output is correct
23 Correct 441 ms 11160 KB Output is correct
24 Correct 299 ms 32956 KB Output is correct
25 Correct 315 ms 46508 KB Output is correct