— Dark mode

NOI 2019 Open

Distance Code

  • Start: N/A
  • End: N/A
CSES - NOI 2019 Open - Results
Submission details
Task:Distance Code
Sender:Nootnoot
Submission time:2019-03-09 17:40:06 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#30.01 s1, 2, 3details
#40.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#60.02 s1, 2, 3details
#70.03 s1, 2, 3details
#80.03 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#100.01 s1, 2, 3details
#110.01 s1, 2, 3details
#120.02 s2, 3details
#130.04 s2, 3details
#140.01 s2, 3details
#150.01 s2, 3details
#160.10 s3details
#17--3details
#18--3details
#19--3details
#200.02 s1, 2, 3details

Code

#include <iostream>
#include <vector>
using namespace std;

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);
				B.erase(B.begin() + i);
				i--;
			}
			if (A.size() == 1){
				cout << A[0] << " " << B[0];
				break;
			}
			

			dependent = false;
			for (int y = 0; y < N - 1; 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:

input
1
2
2 1
view save

correct output
(empty)

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
1 3 3 2 
view save

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
(empty)

Error:
double free or corruption (out)

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
(empty)

Error:
double free or corruption (out)

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 3 4 4 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
1 3 3 6 6 5 5 4 
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)

Error:
double free or corruption (out)

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Error:
munmap_chunk(): invalid pointer

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 10 10 9 9 8 8 7 7 6 6 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
(empty)

Error:
double free or corruption (out)

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Error:
double free or corruption (out)

Test 12

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Error:
double free or corruption (out)

Test 13

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Error:
free(): invalid size

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Error:
double free or corruption (out)

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Error:
double free or corruption (out)

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 3 3 2 2 4 4 6 6 5 
view save

Tasks

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

Submissions (Nootnoot)

2019-03-13 15:04:17 03:31:55 03:31:07 02:05:37 02:02:44 0