— 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:mm97
Submission time:2019-03-10 10:53:19 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.03 s1, 2, 3details
#30.02 s1, 2, 3details
#40.01 s1, 2, 3details
#50.02 s1, 2, 3details
#60.03 s1, 2, 3details
#70.01 s1, 2, 3details
#80.01 s1, 2, 3details
#90.02 s1, 2, 3details
#100.03 s1, 2, 3details
#110.01 s1, 2, 3details
#120.02 s2, 3details
#130.03 s2, 3details
#140.01 s2, 3details
#150.02 s2, 3details
#160.11 s3details
#170.12 s3details
#180.12 s3details
#190.12 s3details
#200.02 s1, 2, 3details

Code

#include <bits/stdc++.h>
 
using namespace std;
 
 
int n;
vector <int> mark;
vector <vector<int> >  neigh;
 
int kid(int f) {
  for (auto i: neigh[f]) 
     if (!mark[i])
	return kid(i);
  return f;
}
 
int dec() {
cin >> n;
mark.resize(n);
for (int i=0; i<n; i++) 
mark[i]=0;
neigh.resize(n);
for (int i=0; i<n-1; i++) {
int a,b;
cin >> a>>b;
neigh[a].push_back(b);
neigh[b].push_back(a);
}
stack<int> st;
st.push(0);
while (!st.empty()) {
  int f=st.top();
  int fl=0;
  for (auto i: neigh[f]) 
     if (!mark[i]) {
	st.push(i);
	fl=1;
	}
  if (!fl) {
    cout << f<< " ";
    st.pop();
    mark[f]=1;
  }
}
return 0;
}
 
 
int inc()
{
return 1;
}
 
int main() {
int i;
cin>>i;
if (i==1) 
  return dec();
else return inc();
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

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)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
(empty)

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
(empty)

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

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
(empty)

Test 10

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

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
(empty)

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict:

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

correct output
(empty)

user output
0 
view save

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
0 
view save

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
0 
view save

Test 19

Group: 3

Verdict:

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

correct output
(empty)

user output
0 
view save

Test 20

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Tasks

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

Submissions (mm97)

0:15:56 0