oj.uz

Submission #116050

# Submission time Handle Problem Language Result Execution time Memory
116050 2019-06-10T09:28:21 Z MAMBA Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 62676 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h> 

using namespace std;

#define rep(i , j , k) for (int i = j; i < (int)k; i++)
#define pb push_back
typedef vector<int> vi;

constexpr int N = 5e5 + 10;

int n, m, a[N], b[N];
vector<int> adj[N];
int ptr[N];
bitset<N> mark, mark2;

int st[N], R;
void dfs(int v) {
	for (int &id = ptr[v]; id < (int)adj[v].size(); id++) {
		int e = adj[v][id];
		if (!mark[e]) {
			mark[e] = true;
			dfs(a[e] ^ b[e] ^ v);
		}
	}
	if (mark2[v]) {
		while (mark2[v]) {
			printf("%d" , st[R]);
			if (st[R] == v) printf("\n");
			else printf(" ");
			mark2[st[R]] = false;
			R--;
		}
	} 
	mark2[v] = true;
	st[++R] = v;

}

int main() {
	scanf("%d%d" , &n , &m);
	rep(i , 0 , m) {
		scanf("%d%d" , a + i , b + i);
		adj[a[i]].pb(i);
		adj[b[i]].pb(i);
	}

	dfs(1);

	return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:41: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:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d" , a + i , b + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 15 ms 12392 KB Output is correct
5 Correct 13 ms 12136 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 21 ms 13184 KB Output is correct
8 Correct 14 ms 12288 KB Output is correct
9 Correct 65 ms 18956 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 13 ms 12260 KB Output is correct
12 Correct 72 ms 19168 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12160 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 15 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 14 ms 12416 KB Output is correct
7 Correct 24 ms 13184 KB Output is correct
8 Correct 16 ms 12356 KB Output is correct
9 Correct 59 ms 18936 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 17 ms 12288 KB Output is correct
12 Correct 64 ms 19192 KB Output is correct
13 Correct 94 ms 22136 KB Output is correct
14 Correct 99 ms 18624 KB Output is correct
15 Correct 100 ms 20720 KB Output is correct
16 Correct 106 ms 22136 KB Output is correct
17 Correct 112 ms 16616 KB Output is correct
18 Correct 108 ms 19704 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12136 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct
3 Correct 12 ms 12148 KB Output is correct
4 Correct 16 ms 12288 KB Output is correct
5 Correct 13 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 19 ms 13184 KB Output is correct
8 Correct 16 ms 12264 KB Output is correct
9 Correct 62 ms 18936 KB Output is correct
10 Correct 14 ms 12288 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 62 ms 19192 KB Output is correct
13 Correct 98 ms 22136 KB Output is correct
14 Correct 88 ms 18680 KB Output is correct
15 Correct 100 ms 20720 KB Output is correct
16 Correct 106 ms 22084 KB Output is correct
17 Correct 111 ms 16612 KB Output is correct
18 Correct 113 ms 19808 KB Output is correct
19 Execution timed out 621 ms 62676 KB Time limit exceeded
20 Halted 0 ms 0 KB -