— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
Submission details
Task:Distance Code
Sender:wakaka
Submission time:2019-03-16 09:32:14 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.03 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.03 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.03 s1, 2, 3details
#8ACCEPTED0.03 s1, 2, 3details
#9ACCEPTED0.03 s1, 2, 3details
#10ACCEPTED0.03 s1, 2, 3details
#11ACCEPTED0.02 s1, 2, 3details
#12ACCEPTED0.03 s2, 3details
#13ACCEPTED0.01 s2, 3details
#14ACCEPTED0.03 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.04 s3details
#17ACCEPTED0.05 s3details
#18ACCEPTED0.06 s3details
#19ACCEPTED0.04 s3details
#20ACCEPTED0.02 s1, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &t, &n);
  ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:22:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &a, &b);
    ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:33:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &d);
    ~~~~~^~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) cerr << _x << ", "; cerr << endl
#define dba(a, n) cerr << #a << "="; for (int _i = 0; _i < (n); ++_i) cerr << a[_i] << ", "; cerr << endl
typedef long long ll;
typedef long double ld;
vector<int> E[100005];
void go(int x, int p = -1) {
	for (int y : E[x])
		if (y != p) go(y, x);
	printf("%d ", x);
}
int main() {
	int t, n;
	scanf("%d%d", &t, &n);
	if (t == 1) {
		for (int i = 1; i < n; ++i) {
			int a, b;
			scanf("%d%d", &a, &b);
			E[a].push_back(b);
			E[b].push_back(a);
		}
		go(1);
	} else {
		stack<pair<int, int>> st;
		st.push({1, 0});
		int cur = 0;
		for (int i = 2; i <= n; ++i) {
			int d;
			scanf("%d", &d);
			if (d == 1) {
				while (!st.empty() && st.top().second == cur) {
					printf("%d %d\n", i, st.top().first);
					st.pop();
				}
				--cur;
			} else {
				cur += d - 2;
			}
			st.push({i, cur});
		}
		assert(st.size() == 1);
	}
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
2
2 1
view save

correct output
(empty)

user output
2 1
view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
3 2
3 1
view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
2 1
4 3
4 2
view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
3 2
3 1
4 3
view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 5
4 1
1 3
...
view save

correct output
(empty)

user output
2 1
4 3
5 4
5 2
view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
3 2
3 4
5 1
...
view save

correct output
(empty)

user output
4 3
4 2
5 4
5 1
view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
5
4 3
1 4
4 2
...
view save

correct output
(empty)

user output
4 3
4 2
4 1
5 4
view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 3
8 9
2 9
...
view save

correct output
(empty)

user output
9 8
9 7
9 6
9 5
9 4
...
view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
9 2
5 8
7 1
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
view save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
10 4
9 1
4 7
...
view save

correct output
(empty)

user output
3 2
6 5
7 6
8 7
9 8
...
view save

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
10
2 6
4 3
3 5
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
7 6
...
view save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
1
500
10 6
6 255
6 428
...
view save

correct output
(empty)

user output
499 498
499 497
499 496
499 495
499 494
...
Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
1
500
152 466
451 313
158 479
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
1
500
109 440
330 190
443 161
...
view save

correct output
(empty)

user output
5 4
7 6
7 5
8 7
8 3
...
Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

input
1
500
144 373
257 233
341 318
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 16

Group: 3

Verdict: ACCEPTED

input
1
100000
54983 75172
93807 75172
44082 75172
...
view save

correct output
(empty)

user output
99999 99998
99999 99997
99999 99996
99999 99995
99999 99994
...
Truncated

Test 17

Group: 3

Verdict: ACCEPTED

input
1
100000
88863 19059
86423 76688
98536 95984
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 18

Group: 3

Verdict: ACCEPTED

input
1
100000
59979 6389
19097 24999
27846 82330
...
view save

correct output
(empty)

user output
5 4
7 6
7 5
7 3
9 8
...
Truncated

Test 19

Group: 3

Verdict: ACCEPTED

input
1
100000
58761 66001
25102 51081
98625 67861
...
view save

correct output
(empty)

user output
2 1
3 2
4 3
5 4
6 5
...
Truncated

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
6
2 1
3 2
4 2
...
view save

correct output
(empty)

user output
3 2
3 1
5 4
5 3
6 5
view save

Tasks

A Distance Code-B Thieves and Prisons-C Graph Ordering-

Submissions (wakaka)

2019-03-16 09:32:14 100