— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
CSES - NOI 2019 Open - Results
Submission details
Task:Distance Code
Sender:Lorenzo
Submission time:2019-03-10 11:51:40 +0200
Language:C++
Status:READY
Result:21
Feedback
groupverdictscore
#1ACCEPTED21
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.03 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.02 s1, 2, 3details
#8ACCEPTED0.02 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.03 s1, 2, 3details
#11ACCEPTED0.02 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.03 s2, 3details
#140.02 s2, 3details
#150.02 s2, 3details
#16--3details
#17--3details
#180.40 s3details
#190.41 s3details
#20ACCEPTED0.02 s1, 2, 3details

Code

#include <bits/stdc++.h>

using namespace std;

int n;

void encoder(){
  std::vector<int> ne (n, 0);
  std::vector<std::vector<pair<int, int> > > e (n);
  int a, b;
  for(int i=0; i<n-1; i++){
    cin >> a >> b;
    a--;
    b--;
    e[a].push_back({b, 1});
    e[b].push_back({a, 1});
    ne[a]++;
    ne[b]++;
  }
//  cout << "in"<<endl;
  int c=0;
  while (c<n) {
    for(int i=0; i<n; i++)
      if(ne[i]<=1){
        cout << i+1<< " ";
        c++;
        if(ne[i]==1){
          int j=-1;
          for(auto &x: e[i])
            if(x.second){
              j=x.first;
              x.second=0;
              break;
            }
          if(j==-1)
            cout << "j=-1"<<endl;
          ne[j]--;
          for(auto &x: e[j])
            if(x.second && x.first==i){
              x.second=0;
              break;
            }
        }
        ne[i]=n;
      }
  }
  cout << endl;
}

int first=0, last=1;
std::vector<std::vector<int> > e;

void connect(int i, int j){ //append j on i
  if(i==-1)
    return ;
  //cout << i << " c"<<j << endl;
  e[i].push_back(j);
  e[j].push_back(i);
  if(i==last)
    last=j;
  if(i==first)
    first=j;
}

int best(int i, int d){
  std::vector<pair<int, int>> st;
  std::vector<char> ma (n, 0);
  int p=-1;
  st.push_back({i, 0});
  while(!st.empty()){
    int a, dis;
    tie(a, dis)=st.back();
    st.pop_back();
  //  cout << a << "dfs "<<dis << endl;
    if(ma[a])
      continue;
    ma[a]=1;
    if(dis>=d)
      continue;
    if(dis==d-1){
      p=a;
      if(p==first || p==last)
        return p;
    } else
      for(int &x: e[a])
        if(!ma[x])
          st.push_back({x, dis+1});
  }
//  cout << i << " best"<<d << " "<<p<<endl;
  if(p==-1)
    cout << "p=-1" << endl;
  return p;
}

void decoder(){
  e.resize(n);
  std::vector<int> d(n-1, 0);
  //int a;
  for(int i=0; i<n-1; i++){
    cin >> d[i];
  }
  e[0].push_back(1);
  e[1].push_back(0);
  first=0;
  last=1;
  //cout << n << endl;
  for(int i=n-3; i>=0; i--){
//    cout << i << "for "<<d[i]<<endl;
    if(d[i]==1)
      connect(n-2-i, n-1-i);
    else
      connect(best(n-2-i, d[i]), n-1-i);
  }
  for(int i=0; i<n; i++)
    for(int &x: e[i])
      if(x>i)
        cout << i+1 <<" "<< x+1 <<endl;
}

int main(){
  ios_base::sync_with_stdio(false);
  int t;
  cin >> t >> n;
  if(t==1)
    encoder();
  else
    decoder();
}

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

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
p=-1
p=-1
p=-1
p=-1
p=-1
...
Truncated

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
p=-1
p=-1
p=-1
p=-1
p=-1
...
Truncated

Test 16

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
p=-1
p=-1
p=-1
p=-1
p=-1
...
Truncated

Test 19

Group: 3

Verdict:

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

correct output
(empty)

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

Tasks

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

Submissions (Lorenzo)

2:28:17 212:13:35 212:11:03 212:06:38 212:06:04 212:04:21 212:02:55 01:19:01 00:39:59 0