— 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:Hugo Eberhard
Submission time:2019-03-06 11:23:59 +0200
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED47
#3ACCEPTED32
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#10ACCEPTED0.02 s1, 2, 3details
#11ACCEPTED0.03 s1, 2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#14ACCEPTED0.02 s2, 3details
#15ACCEPTED0.02 s2, 3details
#16ACCEPTED0.12 s3details
#17ACCEPTED0.14 s3details
#18ACCEPTED0.14 s3details
#19ACCEPTED0.14 s3details
#20ACCEPTED0.02 s1, 2, 3details

Code

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

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define inf 9000000000000000000
#define all(x) x.begin(),x.end()
#define sz(x) (ll)(x).size()
#define trav(a,x) for(auto& a : x)

vector<vi> edges;
vector<ii> es;
vi _,vis,ans,dist,cur;
void dfs(ll v){
  ans.push_back(v);
  rep(i,0,sz(edges[v])){
    ll u = edges[v][i];
    if(!vis[u]){
      vis[u] = 1;
      dfs(u);
    }
  }
}

void dfs2(ll v, ll i){
  if (i < 0) return;
  while (dist[i] > 1) {
    cur.pop_back();
    dist[i]--;
  }
  es.push_back({cur.back(),v});
  cur.push_back(v);
  dfs2(v+1,i-1);
}

int main(){
  ios::sync_with_stdio(0);
  ll n,t; cin >> t >> n;
  if (t == 1){
    edges.assign(n,_);
    rep(i,0,n-1){
      ll u,v;
      cin >> u >> v; u--; v--;
      edges[u].push_back(v);
      edges[v].push_back(u);
    }
    vis.assign(n,0);
    vis[0] = 1;
    dfs(0);
    reverse(all(ans));
    rep(i,0,n) cout << ans[i]+1 << " ";
    cout << endl;
  } else {
    dist.assign(n-1,0);
    rep(i,0,n-1) cin >> dist[i];
    cur.push_back(0);
    dfs2(1,n-2);
    rep(i,0,n-1) cout << es[i].first+1 << " " << es[i].second+1 << endl;
  }

}

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
2 3
1 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
1 3
3 4
3 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
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
1 2
1 3
3 4
1 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
3 4
4 5
5 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
1 3
3 4
4 5
4 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: ACCEPTED

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

correct output
(empty)

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

Tasks

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

Submissions (Hugo Eberhard)

2019-03-06 14:22:49 02019-03-06 11:23:59 100