— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
  • Contest has ended
CSES - NOI 2019 Open - Results
Submission details
Task:Distance Code
Sender:zscoder
Submission time:2019-03-08 08:37:23 +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.02 s1, 2, 3details
#4ACCEPTED0.03 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.03 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#10ACCEPTED0.03 s1, 2, 3details
#11ACCEPTED0.02 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.06 s3details
#17ACCEPTED0.06 s3details
#18ACCEPTED0.06 s3details
#19ACCEPTED0.06 s3details
#20ACCEPTED0.02 s1, 2, 3details

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
 
vi adj[123456];
int h[123456];
vi V;
 
void dfs(int u, int p)
{
	for(int v:adj[u])
	{
		if(v==p) continue;
		dfs(v,u);
	}
	V.pb(u);
}
 
vector<ii> edges;
 
void add_edge(int u, int v)
{
	edges.pb({u,v});
}
 
int D[111111];
 
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int t; cin>>t;
	int n; cin>>n;
	if(t==1)
	{
		for(int i=0;i<n-1;i++)
		{
			int u,v; cin>>u>>v; u--; v--;
			adj[u].pb(v); adj[v].pb(u);
		}
		dfs(0,-1);
		for(int i=0;i<n;i++)
		{
			cout<<V[i]+1;
			if(i+1<n) cout<<' ';
		}
		cout<<'\n';
	}
	else
	{
		for(int i=1;i<n;i++)
		{
			cin>>D[i];
		}
		stack<vi> C;
		C.push({0});
		for(int i=1;i<n;i++)
		{
			if(D[i]==1)
			{
				for(int v:C.top())
				{
					add_edge(v,i);
				}
				C.pop();
				if(C.empty()) C.push({i});
				else C.top().pb(i);
			}
			else
			{
				for(int j=0;j<D[i]-2;j++)
				{
					C.push({});
				}
				C.top().pb(i);
			}
		}
		for(int i=0;i<n-1;i++)
		{
			cout<<edges[i].fi+1<<' '<<edges[i].se+1<<'\n';
		}
	}
}

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 3
2 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
2 4
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 3
2 3
3 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
3 4
2 5
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
2 4
3 4
1 5
4 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 4
2 4
3 4
4 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 9
2 9
3 9
4 9
5 9
...
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
4 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
2 3
5 6
6 7
7 8
4 9
...
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
3 4
4 5
6 7
...
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 499
2 499
3 499
4 499
5 499
...
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
4 5
5 7
6 7
3 8
7 8
...
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: ACCEPTED

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

correct output
(empty)

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

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Tasks

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

Submissions (zscoder)

2019-03-08 08:37:23 100