— 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:DSG213
Submission time:2019-03-09 16:35:19 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1, 2, 3details
#2ACCEPTED0.03 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.03 s1, 2, 3details
#6ACCEPTED0.03 s1, 2, 3details
#7ACCEPTED0.02 s1, 2, 3details
#8ACCEPTED0.02 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.16 s3details
#17ACCEPTED0.10 s3details
#18ACCEPTED0.12 s3details
#19ACCEPTED0.09 s3details
#20ACCEPTED0.02 s1, 2, 3details

Compiler report

input/code.cpp: In function 'void usu(int, int)':
input/code.cpp:16:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<pol[v].size();i++){
              ~^~~~~~~~~~~~~~

Code

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
const int mod=1000000007,mxn=100010;
int n;
vector<int> pol[mxn];
void usu(int v,int p){
	for(int i=0;i<pol[v].size();i++){
		if(p!=pol[v][i]){
			usu(pol[v][i],v);
		}
	}
	cout <<v <<" ";
}
void encode(){
	cin >>n;
	int a,b;
	for(int i=0;i<n-1;i++){
		cin >>a >>b;
		pol[a].pb(b);
		pol[b].pb(a);
	}
	usu(1,0);
}
struct wie{
	int ojc;
	vector<int> synowie;
};
vector<wie> graf(mxn);
int akt=1,kt=2,nw=2;
void wgore(){
	if(graf[akt].ojc!=0){
		akt=graf[akt].ojc;
		return;
	}
	cout <<nw <<" "<<akt <<"\n";
	graf[nw].synowie.pb(akt);
	graf[akt].ojc=nw;
	akt=nw;
	nw++;
}
void wdol(){
	graf[akt].synowie.pb(nw);
	graf[nw].ojc=akt;
	cout <<nw <<" " <<akt <<"\n";
	akt=nw;
	nw++;
}
void decode(){
	cin >>n;
	int a;
	for(int i=0;i<n-1;i++){
		cin >>a;
		wgore();
		a--;
		while(a--){
			wdol();
		}
	}
}
int main()
{
	int t;
	cin >>t;
	if(t==1){
		encode();
	}
	else{
		decode();
	}
}

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

Tasks

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

Submissions (DSG213)

0:28:13 100