— Dark mode

NOI 2019

Distance Code

  • Start: 2019-03-06 11:00:00
  • End: 2019-03-06 16:00:00
CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Tuomas Katajisto
Submission time:2019-03-06 11:59:25 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#20.02 s1, 2, 3details
#30.02 s1, 2, 3details
#40.01 s1, 2, 3details
#50.01 s1, 2, 3details
#60.01 s1, 2, 3details
#70.01 s1, 2, 3details
#80.02 s1, 2, 3details
#90.02 s1, 2, 3details
#100.02 s1, 2, 3details
#110.01 s1, 2, 3details
#120.01 s2, 3details
#130.03 s2, 3details
#140.01 s2, 3details
#150.03 s2, 3details
#160.02 s3details
#170.01 s3details
#180.02 s3details
#190.02 s3details
#200.03 s1, 2, 3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:25:28: warning: statement has no effect [-Wunused-value]
  if(t[i].size() != 0) false;
                            ^

Code

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

int main() {
  int t; cin>>t;
  if(t == 1) {
    int n; cin >> n;
    set<int> t[501];
    for(int i = 0; i < n-1; i++) {
      int a,b; cin >> a >> b;
      t[a].insert(b);
      t[b].insert(a);
    }
    /*for(int i = 1; i <= n; i++) {
      cout << t[i].size() << " ";
    }
    cout << "\n";*/
    vector<int> rm;
    bool dq = false;
    while(!dq) {
      dq = true;
      vector<pair<int,int>> tr;
      for(int i = 1; i <= n; i++) {
	//cout << i << " :: " << t[i].size() << "\n";
	if(t[i].size() != 0) false;
	if(t[i].size() == 1) {
	  //cout << "LOL: " << i << "\n";
	  rm.push_back(i);
	  for(auto u : t[i]) {
	    tr.push_back({u,i});
	  }
	}
      }
      for(auto u : tr) {
	t[u.first].erase(u.second);
	if(t[u.first].size() == 0) rm.push_back(u.first);
      }
    }
    for(auto u : rm) cout << u << " ";
  }
  else {
    
  }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
2
2 1
view save

correct output
(empty)

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict:

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
3 4 
view save

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict:

input
1
5
3 5
4 1
1 3
...
view save

correct output
(empty)

user output
2 5 
view save

Test 6

Group: 1, 2, 3

Verdict:

input
1
5
3 2
3 4
5 1
...
view save

correct output
(empty)

user output
2 4 5 
view save

Test 7

Group: 1, 2, 3

Verdict:

input
1
5
4 3
1 4
4 2
...
view save

correct output
(empty)

user output
(empty)

Test 8

Group: 1, 2, 3

Verdict:

input
1
10
9 3
8 9
2 9
...
view save

correct output
(empty)

user output
(empty)

Test 9

Group: 1, 2, 3

Verdict:

input
1
10
9 2
5 8
7 1
...
view save

correct output
(empty)

user output
4 5 
view save

Test 10

Group: 1, 2, 3

Verdict:

input
1
10
10 4
9 1
4 7
...
view save

correct output
(empty)

user output
3 5 9 10 
view save

Test 11

Group: 1, 2, 3

Verdict:

input
1
10
2 6
4 3
3 5
...
view save

correct output
(empty)

user output
4 9 10 
view save

Test 12

Group: 2, 3

Verdict:

input
1
500
10 6
6 255
6 428
...
view save

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 3

Verdict:

input
1
500
152 466
451 313
158 479
...
view save

correct output
(empty)

user output
72 106 
view save

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
2 3 5 6 7 8 10 12 13 15 16 17 ...
Truncated

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
25 28 33 39 52 74 78 111 120 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
(empty)

Test 19

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict:

input
1
6
2 1
3 2
4 2
...
view save

correct output
(empty)

user output
1 4 5 6 
view save

Tasks

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

Submissions (Tuomas Katajisto)

2019-03-06 15:52:42 2019-03-06 15:50:07 02019-03-06 15:49:31 02019-03-06 15:42:45 02019-03-06 15:38:42 02019-03-06 15:31:43 02019-03-06 15:20:10 02019-03-06 14:52:19 02019-03-06 12:07:59 02019-03-06 11:59:25 0