| Task: | Distance Code |
| Sender: | erimm |
| Submission time: | 2019-03-09 15:52:31 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #9 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #10 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #11 | WRONG ANSWER | 0.03 s | 1, 2, 3 | details |
| #12 | ACCEPTED | 0.03 s | 2, 3 | details |
| #13 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #14 | WRONG ANSWER | 0.02 s | 2, 3 | details |
| #15 | WRONG ANSWER | 0.03 s | 2, 3 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #20 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:94:46: warning: 'parent' may be used uninitialized in this function [-Wmaybe-uninitialized]
distances[j][current]=distances[j][parent]+1;
^Code
/*
* src.cpp
*
* Created on: 9. mar. 2019
* Author: mingj
*/
#include <bits/stdc++.h>
#include <climits>
using namespace std;
struct node {
vector<int> edge;
int total;
};
int main () {
int t;
cin>>t;
if(t==1) {
int n;
cin>>n;
vector<node> tree(n);
vector<bool> leaf(n,true);
for(int i=0; i<n; i++){
tree[i].total=0;
}
int a,b;
for(int i=0; i<n-1; i++){
cin>>a>>b;
a=a-1;
b=b-1;
tree[a].edge.push_back(b);
tree[b].edge.push_back(a);
if(tree[a].edge.size()>1)
leaf[a]=false;
if(tree[b].edge.size()>1)
leaf[b]=false;
tree[a].total++;
tree[b].total++;
}
bool flag=true;
while(flag){
int i;
flag=false;
for(i=0; i<n; i++)
if(leaf[i]){
flag=true;
break;
}
if(!flag)
break;
cout<<i+1<<endl;
cerr<<i<<" "<<tree[i].total<<endl;
leaf[i]=false;
tree[i].total=0;
for(auto it=tree[i].edge.begin(); it!=tree[i].edge.end(); it++){
tree[*it].total--;
if(tree[*it].total==1)
leaf[*it]=true;
}
}
}
if(t==2) {
int n;
cin>>n;
vector<int> free;
vector<vector<int>> distances;
for(int i=0; i<n; i++){
free.push_back(i);
vector<int> temp(n, INT_MAX);
temp[i]=0;
distances.push_back(temp);
}
vector<int> record;
for(int i=0; i<n-1; i++){
int k;
cin>>k;
record.push_back(k);
}
int current=0;
for(int i=n-2; i>=0; i--){
int parent;
for(int j=0; j<n; j++){
if(distances[current][j]==record[i]-1){
parent=j;
break;
}
}
current=*free.rbegin();
free.erase(free.end()-1);
for(int j=0; j<n; j++){
distances[j][current]=distances[j][parent]+1;
distances[current][j]=distances[j][current];
}
}
for(int i=0; i<n; i++){
for(int j=i; j<n; j++){
if(distances[i][j]==1)
cout<<i+1<<' '<<j+1<<endl;
}
}
}
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 2 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 3 3 1 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 4 3 2 2 1 4 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 4 2 3 3 4 1 3 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 5 3 5 4 1 1 3 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 5 3 2 3 4 5 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 4 3 1 4 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 |
Test 8
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 10 9 3 8 9 2 9 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 ... |
Test 9
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 9 2 5 8 7 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 ... |
Test 10
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 10 4 9 1 4 7 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 7 1 8 1 9 1 10 |
Test 11
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 2 6 4 3 3 5 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 ... |
Test 12
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 500 10 6 6 255 6 428 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 ... Truncated |
Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 152 466 451 313 158 479 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 ... Truncated |
Test 14
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 109 440 330 190 443 161 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 27 1 29 1 36 1 41 1 80 ... Truncated |
Test 15
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 144 373 257 233 341 318 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 ... Truncated |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 100000 54983 75172 93807 75172 44082 75172 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 100000 88863 19059 86423 76688 98536 95984 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 18
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 100000 59979 6389 19097 24999 27846 82330 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 19
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 100000 58761 66001 25102 51081 98625 67861 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 20
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 6 2 1 3 2 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 1 3 1 4 1 5 1 6 |