CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Bjarni Thor
Submission time:	2019-03-06 12:26:08 +0200
Language:	C++
Status:	READY
Result:	68

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	47
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 2, 3	details
#2	ACCEPTED	0.02 s	1, 2, 3	details
#3	ACCEPTED	0.02 s	1, 2, 3	details
#4	ACCEPTED	0.03 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.03 s	1, 2, 3	details
#7	ACCEPTED	0.02 s	1, 2, 3	details
#8	ACCEPTED	0.03 s	1, 2, 3	details
#9	ACCEPTED	0.03 s	1, 2, 3	details
#10	ACCEPTED	0.02 s	1, 2, 3	details
#11	ACCEPTED	0.01 s	1, 2, 3	details
#12	ACCEPTED	0.02 s	2, 3	details
#13	ACCEPTED	0.02 s	2, 3	details
#14	ACCEPTED	0.03 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	ACCEPTED	0.01 s	1, 2, 3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:76:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < dis.size(); i++) {
                   ~~^~~~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;

#define rep(i,a,b) for (__typeof(a) i=(a); i<(b); i++)
#define MP make_pair
#define PB push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define INF 1000000000
#define PI 3.14159265359

vi adj[100010];
int vis[100010];
int remd = 0;
int toTravel;

void dfs(int at)
{
	for (auto u : adj[at]) {
		if (!vis[u]) {
			vis[u] = 1;
			dfs(u);
		}
	}
	if (remd != 0) cout << " ";
	cout << at + 1;
	remd++;
}

/*int findDis(int at, int travelled)
{
	vis[at] = true;
	if (toTravel == travelled) return at;
	for (auto u : adj[at]) {
		if (!vis[u]) {
			vis[u] = true;
			return findDis(u, travelled + 1);
		}
	}
	vis[at] = false;
}*/

int main()
{
    ios_base::sync_with_stdio(false);
	int t, n;
	cin >> t >> n;
	for (int i = 0; i < 100010; i++) {
		adj[i].clear();
		vis[i] = 0;
	}
	if (t == 1) {
		for (int i = 0; i < n - 1; i++) {
			int a, b;
			cin >> a >> b;
			a--; b--;
			adj[a].PB(b);
			adj[b].PB(a);
		}
		vis[0] = 1;
		dfs(0);
	}
	if (t == 2) {
		vi dis;
		for (int i = 0; i < n - 1; i++) {
			int a;
			cin >> a;
			dis.PB(a);
		}
		reverse(dis.begin(), dis.end());
		int at = 0;
		int nodes = 0;
		for (int i = 0; i < dis.size(); i++) {
			for (int i = 0; i < n; i++) vis[i] = 0;
			nodes++;
			toTravel = dis[i] - 1;
			queue<int> q;
			q.push(at);
			int toGo;
			while (!q.empty()) {
				int cur = q.front();
				q.pop();
				if (vis[cur] == toTravel) {
					toGo = cur;
					break;
				}
				for (auto u : adj[cur]) {
					if (vis[u] == 0) {
						vis[u] = vis[cur] + 1;
						q.push(u);
					}
				}
			}
			//cout << "at " << at + 1 << " toTravel " << toTravel << " going to " << toGo + 1 << endl;
			//cout << "connecting " << toGo + 1 << " and " << nodes + 1 << endl;

			//int atDis = findDis(at, 0);
			adj[toGo].PB(nodes);
			adj[nodes].PB(toGo);
			cout << toGo + 1 << " " << nodes + 1 << endl;
			at = nodes;
		}
	}

    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 2 2 1` view save

correct output
(empty)

user output
`1 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
`1 2 1 3` 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
`1 2 1 3 3 4` 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
`1 2 2 3 2 4` 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
`1 2 2 3 1 4 4 5` 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
`1 2 2 3 2 4 1 5` 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
`1 2 2 3 2 4 2 5` 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
`1 2 2 3 2 4 2 5 2 6 ...` 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
`1 2 2 3 3 4 1 5 5 6 ...` 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
`1 2 2 3 3 4 4 5 5 6 ...` 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
`1 2 2 3 2 4 4 5 1 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
`1 2 2 3 2 4 2 5 2 6 ...` Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

NOI 2019

Distance Code

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Bjarni Thor)