— Dark mode

NOI 2019

Distance Code

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

Compiler report

input/code.cpp: In function 'int numberNodes(long long int, long long int)':
input/code.cpp:21:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (ll i = 0; i < nodes[val].size(); i++){
                  ~~^~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:58:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (ll i = 0; i < difs.size(); i++){
                    ~~^~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;

#define ll long long

ll t, n;
vector<vector<ll> > nodes;
vector<bool> visited;
vector<ll> numbers;
vector<ll> order;
vector<ll> difs;
vector<ll> current;

int numberNodes(ll val, ll deep){
  if (visited[val] == true){
    return 0;
  }
  visited[val] = true;
  order.push_back(val);
  numbers[val] = deep;
  for (ll i = 0; i < nodes[val].size(); i++){
    numberNodes(nodes[val][i], deep+1);
  }
  return 1;
}

int main(){
  cin >> t >> n;
  nodes.assign(n+1, vector<ll>(0, 0));
  visited.assign(n+1, false);
  numbers.assign(n+1, -1);
  current.assign(n+1, -1);
  difs.assign(n-1, -1);

  if (t == 1){
    for (ll i = 0; i < n-1; i++){
      ll a, b;
      cin >> a >> b;
      nodes[a].push_back(b);
      nodes[b].push_back(a);
    }
    numberNodes(1, 0);

    for (ll i = order.size()-1; i > -1; i--){
      cout << order[i] << " ";
    }
    cout << endl;
  }
  else{
    for (ll i = 0; i < n-1; i++){
      ll a;
      cin >> a;
      difs[n-2-i] = a;
    }
    current[0] = 1;
    ll index = 0;

    for (ll i = 0; i < difs.size(); i++){
      index -= difs[i]-2;
      current[index] = i+2;
      cout << i+2 << " " << current[index-1] << endl;
    }
  }
}

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

Tasks

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

Submissions (Axel Nilsson)

2019-03-06 14:32:21 100