CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Epe
Submission time:2020-10-08 23:08:15 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s1, 2details
#30.01 s1, 2details
#40.01 s1, 2details
#50.01 s1, 2details
#60.01 s1, 2details
#70.01 s1, 2details
#80.01 s1, 2details
#90.01 s1, 2details
#100.01 s1, 2details
#110.01 s2details
#120.01 s2details
#130.01 s2details
#140.01 s2details
#150.01 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details
#250.01 s2details
#260.01 s2details
#270.01 s2details
#280.01 s2details
#290.01 s2details
#300.01 s2details
#310.01 s1, 2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:11:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < nline.length(); i++){
                 ~~^~~~~~~~~~~~~~~~
input/code.cpp:113:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int p = 0; p < u1.size(); p++){
                   ~~^~~~~~~~~~~
input/code.cpp:117:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(p != u1.size()-1){
         ~~^~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
#include <cstring>

using namespace std;

int main(){

	int n = 0;
	string nline;
	getline(cin, nline);
	for(int i = 0; i < nline.length(); i++){
		char c = nline[i];
		if(c > 47){
			n = n*10 + c-48;
		} else {
			break;
		}
	}



	vector<pair<int,int>> mm[n];
	map<vector<pair<int,int> >, vector<int>> m;
	for(int t = 0; t < n; t++){
		char arr[5][5];
		memset(arr, 0, 5*5);

		//int sx = -1, sy = -1, ex = 0, ey = 0;
		for(int y = 0; y < 5; y++){
			string line;
			getline(cin, line);

			for(int x = 0; x < 5; x++){
				arr[y][x] = line[x];
				/*
				if(z != 46) {
					if (sx==-1 || x < sx) {
						sx = x;
					}
					if (sy==-1 || y < sy) {
						sy = y;
					}
					if(x > ex){
						ex = x;
					}
					if(y > ey){
						ey = y;
					}

				} else {
					arr[y][x] = '-';
				}*/

			}
		}
		string line;
		getline(cin, line);


		/*
		for(int y = 0; y < 5; y++){
			for(int x = 0; x < 5; x++){
				cout << arr[y][x];
			}
			cout << endl;
		}*/

		for(int i = 0; i < 3; i++){
			if(arr[0][i] < 48) exit(1);
			if(arr[i+1][1] < 48) exit(1);
		}


		vector<pair<int,int>>p;
		int a = arr[0][0]-48;
		int b = arr[0][2]-48;
		if(a>b)swap(a,b);
		p.push_back(make_pair(a,b));

		int c = arr[0][1]-48;
		int d = arr[2][1]-48;
		if(c>d)swap(c,d);
		p.push_back(make_pair(c,d));

		int e = arr[1][1]-48;
		int f = arr[3][1]-48;
		if(e>f)swap(e,f);
		p.push_back(make_pair(e,f));

		sort(p.begin(), p.end());
		cout << "t:" << t << endl;
		//cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;
		for(pair<int,int> pp : p){
			cout << pp.first << " " << pp.second << endl;
		}


		//int u = (p[0].first + p[0].second*12) + ((p[1].first + p[1].second * 12) * 10000) + ((p[2].first + p[2].second * 12) * 10000000);
		mm[t] = p;
		auto it = m.find(p);
		if(it == m.end()){
			vector<int> u1 = {t};
			m[p] = u1;
		} else {
			(*it).second.push_back(t);
		}
	}
	for(int i = 0; i < n; i++){
		vector<int> u1 = (*(m.find(mm[i]))).second;
		if(u1.size() == 1){
			cout << "-\n";
		} else {
			for(int p = 0; p < u1.size(); p++){
				int u2 = u1[p];
				if(u2 != i){
					cout << (1+u2);
					if(p != u1.size()-1){
						cout << " ";
					}
				}
			}
			cout << endl;
		}
	}

}

Test details

Test 1

Group: 1, 2

Verdict:

input
3
165..
.4...
.3...
.2...
...

correct output
3
-
1

user output
t:0
1 5
2 4
3 6
t:1
...

Test 2

Group: 1, 2

Verdict:

input
5
264..
.5...
.3...
.1...
...

correct output
3
4 5
1
2 5
2 4

user output
t:0
1 5
2 4
3 6
t:1
...

Test 3

Group: 1, 2

Verdict:

input
5
152..
.4...
.3...
.6...
...

correct output
3 5
4
1 5
2
1 3

user output
t:0
1 2
3 5
4 6
t:1
...

Test 4

Group: 1, 2

Verdict:

input
5
142..
.6...
.3...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output
t:0
1 2
3 4
5 6
t:1
...

Test 5

Group: 1, 2

Verdict:

input
5
123..
.4...
.6...
.5...
...

correct output
3
4 5
1
2 5
2 4

user output
t:0
1 3
2 6
4 5
t:1
...

Test 6

Group: 1, 2

Verdict:

input
5
213..
.6...
.4...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output
t:0
1 4
2 3
5 6
t:1
...

Test 7

Group: 1, 2

Verdict:

input
5
314..
.5...
.2...
.6...
...

correct output
3
4 5
1
2 5
2 4

user output
t:0
1 2
3 4
5 6
t:1
...

Test 8

Group: 1, 2

Verdict:

input
5
163..
.2...
.5...
.4...
...

correct output
4 5
3
2
1 5
1 4

user output
t:0
1 3
2 4
5 6
t:1
...

Test 9

Group: 1, 2

Verdict:

input
5
264..
.1...
.3...
.5...
...

correct output
2 3
1 3
1 2
5
4

user output
t:0
1 5
2 4
3 6
t:1
...

Test 10

Group: 1, 2

Verdict:

input
5
214..
.3...
.5...
.6...
...

correct output
5
3 4
2 4
2 3
1

user output
t:0
1 5
2 4
3 6
t:1
...

Test 11

Group: 2

Verdict:

input
10
.41..
.5...
.2...
36...
...

correct output
9
4 6 8
7 10
2 6 8
-
...

user output
(empty)

Test 12

Group: 2

Verdict:

input
10
5....
1436.
.2...
.....
...

correct output
5 8
6 10
4 7 9
3 7 9
1 8
...

user output
(empty)

Test 13

Group: 2

Verdict:

input
10
2....
41...
.63..
.5...
...

correct output
4 9 10
5 6 7 8
-
1 9 10
2 6 7 8
...

user output
(empty)

Test 14

Group: 2

Verdict:

input
10
1....
634..
..52.
.....
...

correct output
2 3 4 5 6 9 10
1 3 4 5 6 9 10
1 2 4 5 6 9 10
1 2 3 5 6 9 10
1 2 3 4 6 9 10
...

user output
(empty)

Test 15

Group: 2

Verdict:

input
10
.2...
4516.
3....
.....
...

correct output
5 7 9 10
8
4 6
3 6
1 7 9 10
...

user output
(empty)

Test 16

Group: 2

Verdict:

input
10
.56..
.2...
.4...
31...
...

correct output
4 9
3 5 10
2 5 10
1 9
2 3 10
...

user output
(empty)

Test 17

Group: 2

Verdict:

input
10
..62.
.31..
45...
.....
...

correct output
2 3 4 8
1 3 4 8
1 2 4 8
1 2 3 8
6 7 9 10
...

user output
(empty)

Test 18

Group: 2

Verdict:

input
10
532..
.4...
.1...
.6...
...

correct output
3 8 9
5 6
1 8 9
7 10
2 6
...

user output
t:0
1 3
2 5
4 6

Test 19

Group: 2

Verdict:

input
10
.64..
.1...
.3...
52...
...

correct output
2 5 6 7 8 9
1 5 6 7 8 9
4 10
3 10
1 2 6 7 8 9
...

user output
(empty)

Test 20

Group: 2

Verdict:

input
10
.4...
326..
.1...
.5...
...

correct output
4 7 8
6 9 10
5
1 7 8
3
...

user output
(empty)

Test 21

Group: 2

Verdict:

input
20
.6...
.4...
31...
.25..
...

correct output
3 7 11 16
6
1 7 11 16
5 19
4 19
...

user output
(empty)

Test 22

Group: 2

Verdict:

input
20
3....
5614.
..2..
.....
...

correct output
7 10 11 17 20
12
4 9 13 15 18
3 9 13 15 18
8 14 16
...

user output
(empty)

Test 23

Group: 2

Verdict:

input
20
42...
.316.
.5...
.....
...

correct output
5 12 13 15 18
16 20
6 8 14
9 19
1 12 13 15 18
...

user output
(empty)

Test 24

Group: 2

Verdict:

input
20
..5..
.623.
41...
.....
...

correct output
2 6 11 12 13
1 6 11 12 13
5 16 18
7 14
3 16 18
...

user output
(empty)

Test 25

Group: 2

Verdict:

input
20
.46..
53...
.1...
.2...
...

correct output
2 3 5 7 15 17 19
1 3 5 7 15 17 19
1 2 5 7 15 17 19
8 10 11 14
1 2 3 7 15 17 19
...

user output
(empty)

Test 26

Group: 2

Verdict:

input
20
.61..
.4...
35...
.2...
...

correct output
8 10 20
3 17 18 19
2 17 18 19
14 15
6 7 9 13
...

user output
(empty)

Test 27

Group: 2

Verdict:

input
20
..2..
1463.
.5...
.....
...

correct output
2 3 5 6 9 20
1 3 5 6 9 20
1 2 5 6 9 20
11 19
1 2 3 6 9 20
...

user output
(empty)

Test 28

Group: 2

Verdict:

input
20
...4.
5132.
6....
.....
...

correct output
2 8 10 12 13 19
1 8 10 12 13 19
4 5 15 16 17
3 5 15 16 17
3 4 15 16 17
...

user output
(empty)

Test 29

Group: 2

Verdict:

input
20
.2...
.31..
45...
6....
...

correct output
5 8 9 14 17
3 10 16
2 10 16
13 15 19
1 8 9 14 17
...

user output
(empty)

Test 30

Group: 2

Verdict:

input
20
3....
452..
.1...
.6...
...

correct output
3 7 8 9 14 15 16 19
4 12 13 17
1 7 8 9 14 15 16 19
2 12 13 17
11 20
...

user output
(empty)

Test 31

Group: 1, 2

Verdict:

input
2
546..
.3...
.2...
.1...
...

correct output
-
-

user output
t:0
1 3
2 4
5 6
t:1
...