| Task: | Distance Code |
| Sender: | Nootnoot |
| Submission time: | 2019-03-09 19:06:24 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | RUNTIME ERROR | 0 |
| #2 | RUNTIME ERROR | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #2 | RUNTIME ERROR | 0.02 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.03 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.02 s | 1, 2, 3 | details |
| #6 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #7 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
| #9 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #10 | RUNTIME ERROR | 0.01 s | 1, 2, 3 | details |
| #11 | RUNTIME ERROR | 0.02 s | 1, 2, 3 | details |
| #12 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #14 | RUNTIME ERROR | 0.02 s | 2, 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 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.01 s | 1, 2, 3 | details |
Code
#include <iostream>
#include <vector>
using namespace std;
// 1 11 1 2 2 9 3 9 3 6 4 9 4 5 5 9 5 7 6 9 7 8
int main(){
int t;
int N;
cin >> t;
cin >> N;
vector <int> A;
vector <int> B;
vector <int> distances;
if (t == 1){
for (int i = 0; i < N - 1; i++){
int a;
int b;
cin >> a;
cin >> b;
A.push_back(a);
B.push_back(b);
}
int i = 0;
while (true){
bool dependent = false;
for (int y = 0; y < N - 1; y++){
if (i == y){y++;}
if (A[i] == A[y] || A[i] == B[y]){
dependent = true;
break;
}
}
if (!dependent){
cout << A[i] << " ";
A.erase(A.begin() + i);
A.pop_back();
B.erase(B.begin() + i);
B.pop_back();
i--;
}
if (A.size() == 1){
cout << A[0] << " " << B[0];
break;
}
if (i < 0){i = 0;}
dependent = false;
for (int y = 0; (unsigned)y < A.size(); y++){
if (i == y){y++;}
if (B[i] == A[y] || B[i] == B[y]){
dependent = true;
break;
}
}
if (!dependent){
cout << B[i] << " ";
A.erase(A.begin() + i);
B.erase(B.begin() + i);
i--;
}
if (A.size() == 1){
cout << A[0] << " " << B[0];
break;
}
i++;
if ((unsigned)i == A.size()){i = 0;}
}
}
else{
for (int i = 0; i < N - 1; i++){
int distance;
cin >> distance;
distances.push_back(distance);
}
vector <int> A;
vector <int> B;
A.push_back(1);
for (int i = 0; i < N - 2; i++){
bool negative = true;
for (int y = 0; (unsigned)y < A.size(); y++){
if (A[i] - distances[i] <= 0 || A[i] - distances[i] == A[y]){
negative = false;
}
}
if (negative){
A.push_back(A[i] - distances[i]);
}
else{
A.push_back(A[i] + distances[i]);
}
}
for (int i = 1; i < N - 1; i++){
B.push_back(A[i]);
}
bool negative = true;
for (int y = 0; (unsigned)y < A.size(); y++){
if (A[N - 2] - distances[N - 2] <= 0 || A[N - 2] - distances[N - 2] == A[y]){
negative = false;
}
}
if (negative){
B.push_back(A[N - 2] - distances[N - 2]);
}
else{
B.push_back(A[N - 2] + distances[N - 2]);
}
for (int i = 0; i < N - 1; i++){
cout << A[i] << " " << B[i] << " ";
}
}
}
Test details
Test 1
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 2 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 2
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 3 3 1 2 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 4 3 2 2 1 4 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 2 1 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 4 2 3 3 4 1 3 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 2 3 4 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 5 3 5 4 1 1 3 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 1 2 2 3 3 4 4 5 |
Test 6
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 5 3 2 3 4 5 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 7
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 5 4 3 1 4 4 2 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 1 4 2 |
Test 8
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 10 9 3 8 9 2 9 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 3 8 1 10 7 2 9 |
Test 9
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 10 9 2 5 8 7 1 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 10
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 10 10 4 9 1 4 7 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 11
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 10 2 6 4 3 3 5 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 12
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1 500 10 6 6 255 6 428 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| 10 255 428 7 157 326 108 273 2... Truncated |
Test 13
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 500 152 466 451 313 158 479 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 14
Group: 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 500 109 440 330 190 443 161 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 15
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 500 144 373 257 233 341 318 ... |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
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 4 2 5 3 |