CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Árni
Submission time:	2019-03-06 14:19:33 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.02 s	1, 2, 3	details
#2	WRONG ANSWER	0.02 s	1, 2, 3	details
#3	WRONG ANSWER	0.02 s	1, 2, 3	details
#4	WRONG ANSWER	0.01 s	1, 2, 3	details
#5	WRONG ANSWER	0.03 s	1, 2, 3	details
#6	WRONG ANSWER	0.02 s	1, 2, 3	details
#7	WRONG ANSWER	0.02 s	1, 2, 3	details
#8	WRONG ANSWER	0.02 s	1, 2, 3	details
#9	WRONG ANSWER	0.01 s	1, 2, 3	details
#10	WRONG ANSWER	0.02 s	1, 2, 3	details
#11	WRONG ANSWER	0.02 s	1, 2, 3	details
#12	WRONG ANSWER	0.01 s	2, 3	details
#13	TIME LIMIT EXCEEDED	--	2, 3	details
#14	TIME LIMIT EXCEEDED	--	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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:42:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int l = 0; l < pris[1].size(); l++) {
                      ~~^~~~~~~~~~~~~~~~
input/code.cpp:49:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int l = 0; l < pris[0].size(); l++) {
                      ~~^~~~~~~~~~~~~~~~

Code

#include <iostream>
#include<vector>
#include <string>
#include <math.h>

using namespace std;

int main() {
	int a, b, c;
	cin >> a >> b >> c;
	vector<int> thief(a+1);
	for (int i = 1; i < a+1; i++) {
		thief[i] = i;
	}
	vector<string> move1(c);
	vector<int> move2(c);
	for(int i = 0; i < c; i++) {
		cin >> move1[i] >> move2[i];
	}
	for (int i = 0; i < pow(2, c); i++) {
		for (int i = 1; i < a + 1; i++) {
			thief[i] = i;
		}
		vector<vector<int>> pris(2, vector<int>(10,0));
		int p = 0;
		int q = 0;
		for (int j = 0; j < c; j++) {
			if (move1[j] == "C" && thief[move2[j]] != 0 ) {
				if ((i >> j) & 1) {
					pris[1][p] = move2[j];
					p++;
					thief[move2[j]] = 0;
				}
				else {
					pris[0][q] = move2[j];
					q++;
					thief[move2[j]] = 0;
				}
			}
			else if(move1[j] == "O" && thief[move2[j]] !=0){
				if ((i >> j) && 1 && pris[1][0] != 0) {
					for (int l = 0; l < pris[1].size(); l++) {
						thief[pris[1][l]] = pris[1][l];
						pris[1][l] = 0;
					}
					p = 0;
				}
				else if (pris[0][0] != 0) {
					for (int l = 0; l < pris[0].size(); l++) {
						thief[pris[0][l]] = pris[0][l];
						pris[0][l] = 0;
					}
					q = 0;
				}
				else {
					break;
				}
			}
			else {
				break;
			}
			if (j == c-1) {
				for (int h = 0; h < c; h++) {
					if ((i >> h) && 1) {
						cout << 2 << " ";
					}
					else {
						cout << 1 << " ";						}
				}
				return 0;
			}
		}
	}
	cout << "IMPOSSIBLE";
	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 2 2 1` view save

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 4 3 2 2 1 4 1` view save

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 4 2 3 3 4 1 3` view save

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 8

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 9

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 10

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 11

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 12

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

Test 13

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 14

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict: WRONG ANSWER

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

correct output
(empty)

user output
`IMPOSSIBLE` view save

NOI 2019

Distance Code

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Árni)