— Dark mode

Datatähti 2021 alku

Arpakuutiot

  • Start: 2020-09-28 00:00:00
  • End: 2020-10-12 00:00:00
CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Epe
Submission time:2020-10-04 17:12:21 +0300
Language:C++ (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:166:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int p = 0; p < u1.size(); p++){
                   ~~^~~~~~~~~~~
input/code.cpp:170: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;

#define trulse false

char arr[25];
vector<pair<int,int>> z(){
	vector<pair<int,int>> v(0);

	set<int> nn = {1,2,3,4,5,6};

	for(int y = 1; y < 4; y++){
		for(int x = 0; x < 4; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index+1] != '.'){
				int index2 = (y-1)*5+x;
				if(arr[index2] != '.'){
					int index3 = (y+1)*5+x+1;
					if(arr[index3] != '.'){
						/*
						 * A
						 * XX
						 *  B
						 */
						int a = arr[index2]-48, b = arr[index3]-48;
						nn.erase(a);nn.erase(b);
						//cout << "CASE A X:" << x << " Y:" << y << endl;
						if(a > b) swap(a,b);
						v.push_back(make_pair(a,b));
					}
				} else {
					index2++;
					if(arr[index2] != '.'){
						int index3 = (y+1)*5+x;
						if(arr[index3] != '.'){
							/*
							 *  A
							 * XX
							 * B
							 */

							//cout << "CASE B X:" << x << " Y:" << y << endl;
							int a = arr[index2]-48, b = arr[index3]-48;
							nn.erase(a);nn.erase(b);
							if(a > b) swap(a,b);
							v.push_back(make_pair(a,b));
						}
					}
				}
			}
		}
	}

	for(int y = 0; y < 4; y++){
		for(int x = 1; x < 4; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index+5] != '.'){
				int index2 = index-1;//A
				if(arr[index2] != '.'){
					int index3 = (y+1)*5+x+1;//B
					if(arr[index3] != '.'){
						/*
						 * A?
						 *  XB
						 */
						int a = arr[index2]-48, b = arr[index3]-48;
						//cout << "CASE A2 X:" << x << " Y:" << y << endl;
						nn.erase(a);nn.erase(b);
						if(a > b) swap(a,b);
						v.push_back(make_pair(a,b));
					}
				} else {
					index2+=5;//A
					if(arr[index2] != '.'){
						int index3 = y*5+x+1;//B
						if(arr[index3] != '.'){
							/*
							 *  XB
							 * AX
							 */

							//cout << "CASE B2 X:" << x << " Y:" << y << endl;
							int a = arr[index2]-48, b = arr[index3]-48;
							nn.erase(a);nn.erase(b);
							if(a > b) swap(a,b);
							v.push_back(make_pair(a,b));
						}
					}
				}
			}
		}
	}

	for(int y = 1; y < 4; y++){
		for(int x = 0; x < 5; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index-5] != '.' && arr[index+5] != '.'){
				int a = arr[index-5]-48, b = arr[index+5]-48;
				nn.erase(a);nn.erase(b);
				if(a > b) swap(a,b);
				v.push_back(make_pair(a,b));
			}
		}
	}

	for(int y = 0; y < 5; y++){
		for(int x = 1; x < 4; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index-1] != '.' && arr[index+1] != '.'){
				int a = arr[index-1]-48, b = arr[index+1]-48;
				nn.erase(a);nn.erase(b);
				if(a > b) swap(a,b);
				v.push_back(make_pair(a,b));
			}
		}
	}

	if(nn.size() == 2){
		int a = *nn.begin();
		int b = *prev(nn.end());
		v.push_back(make_pair(a,b));
	}

	return v;
}
int main(){
	int n;
	cin >> n;

	int mm[n];
	map<int, vector<int>> m;
	for(int t = 0; t < n; t++) {
		bzero(arr, 25);
		for (int i = 0; i<5; i++) {
			std::string str;
			std::cin >> str;

			strncpy(arr+5*i, str.c_str(), 5);
		}

		cout << "a" << t << endl;
		vector<pair<int,int>> p = z();
		sort(p.begin(), p.end());
		for(pair<int,int> v: p){
			cout << v.first << " - " << v.second << endl;
		}
		exit(p.size());
		int u = p[0].first + p[0].second*10 + (p[1].first + p[1].second * 10) * 1000 + (p[2].first + p[2].second * 10) * 1000000;
		mm[t] = u;
		auto it = m.find(u);
		if(it == m.end()){
			vector<int> u1 = {t};
			m[u] = 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 << "-" << endl;
		} 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...
...
view save

correct output
3
-
1
view save

user output
a0
1 - 5
2 - 4
3 - 6
view save

Test 2

Group: 1, 2

Verdict:

input
5
264..
.5...
.3...
.1...
...
view save

correct output
3
4 5
1
2 5
2 4
view save

user output
a0
1 - 5
2 - 4
3 - 6
view save

Test 3

Group: 1, 2

Verdict:

input
5
152..
.4...
.3...
.6...
...
view save

correct output
3 5
4
1 5
2
1 3
view save

user output
a0
1 - 2
3 - 5
4 - 6
view save

Test 4

Group: 1, 2

Verdict:

input
5
142..
.6...
.3...
.5...
...
view save

correct output
4 5
3
2
1 5
1 4
view save

user output
a0
1 - 2
3 - 4
5 - 6
view save

Test 5

Group: 1, 2

Verdict:

input
5
123..
.4...
.6...
.5...
...
view save

correct output
3
4 5
1
2 5
2 4
view save

user output
a0
1 - 3
2 - 6
4 - 5
view save

Test 6

Group: 1, 2

Verdict:

input
5
213..
.6...
.4...
.5...
...
view save

correct output
4 5
3
2
1 5
1 4
view save

user output
a0
1 - 4
2 - 3
5 - 6
view save

Test 7

Group: 1, 2

Verdict:

input
5
314..
.5...
.2...
.6...
...
view save

correct output
3
4 5
1
2 5
2 4
view save

user output
a0
1 - 2
3 - 4
5 - 6
view save

Test 8

Group: 1, 2

Verdict:

input
5
163..
.2...
.5...
.4...
...
view save

correct output
4 5
3
2
1 5
1 4
view save

user output
a0
1 - 3
2 - 4
5 - 6
view save

Test 9

Group: 1, 2

Verdict:

input
5
264..
.1...
.3...
.5...
...
view save

correct output
2 3
1 3
1 2
5
4
view save

user output
a0
1 - 5
2 - 4
3 - 6
view save

Test 10

Group: 1, 2

Verdict:

input
5
214..
.3...
.5...
.6...
...
view save

correct output
5
3 4
2 4
2 3
1
view save

user output
a0
1 - 5
2 - 4
3 - 6
view save

Test 11

Group: 2

Verdict:

input
10
.41..
.5...
.2...
36...
...
view save

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

user output
a0
1 - 3
2 - 4
5 - 6
view save

Test 12

Group: 2

Verdict:

input
10
5....
1436.
.2...
.....
...
view save

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

user output
a0
1 - 3
2 - 5
4 - 6
view save

Test 13

Group: 2

Verdict:

input
10
2....
41...
.63..
.5...
...
view save

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

user output
a0
1 - 5
2 - 6
3 - 4
view save

Test 14

Group: 2

Verdict:

input
10
1....
634..
..52.
.....
...
view save

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
...
view save

user output
a0
1 - 5
2 - 3
4 - 6
view save

Test 15

Group: 2

Verdict:

input
10
.2...
4516.
3....
.....
...
view save

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

user output
a0
1 - 4
2 - 3
5 - 6
view save

Test 16

Group: 2

Verdict:

input
10
.56..
.2...
.4...
31...
...
view save

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

user output
a0
1 - 2
3 - 6
4 - 5
view save

Test 17

Group: 2

Verdict:

input
10
..62.
.31..
45...
.....
...
view save

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

user output
a0
1 - 4
2 - 3
5 - 6
view save

Test 18

Group: 2

Verdict:

input
10
532..
.4...
.1...
.6...
...
view save

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

user output
a0
1 - 3
2 - 5
4 - 6
view save

Test 19

Group: 2

Verdict:

input
10
.64..
.1...
.3...
52...
...
view save

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

user output
a0
1 - 2
3 - 6
4 - 5
view save

Test 20

Group: 2

Verdict:

input
10
.4...
326..
.1...
.5...
...
view save

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

user output
a0
1 - 4
2 - 5
3 - 6
view save

Test 21

Group: 2

Verdict:

input
20
.6...
.4...
31...
.25..
...
view save

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

user output
a0
1 - 6
2 - 4
3 - 5
view save

Test 22

Group: 2

Verdict:

input
20
3....
5614.
..2..
.....
...
view save

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

user output
a0
1 - 5
2 - 3
4 - 6
view save

Test 23

Group: 2

Verdict:

input
20
42...
.316.
.5...
.....
...
view save

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

user output
a0
1 - 4
2 - 5
3 - 6
view save

Test 24

Group: 2

Verdict:

input
20
..5..
.623.
41...
.....
...
view save

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

user output
a0
1 - 5
2 - 4
3 - 6
view save

Test 25

Group: 2

Verdict:

input
20
.46..
53...
.1...
.2...
...
view save

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
...
view save

user output
a0
1 - 4
2 - 3
5 - 6
view save

Test 26

Group: 2

Verdict:

input
20
.61..
.4...
35...
.2...
...
view save

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

user output
a0
1 - 3
2 - 4
5 - 6
view save

Test 27

Group: 2

Verdict:

input
20
..2..
1463.
.5...
.....
...
view save

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
...
view save

user output
a0
1 - 6
2 - 5
3 - 4
view save

Test 28

Group: 2

Verdict:

input
20
...4.
5132.
6....
.....
...
view save

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
...
view save

user output
a0
1 - 2
3 - 5
4 - 6
view save

Test 29

Group: 2

Verdict:

input
20
.2...
.31..
45...
6....
...
view save

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

user output
a0
1 - 4
2 - 5
3 - 6
view save

Test 30

Group: 2

Verdict:

input
20
3....
452..
.1...
.6...
...
view save

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
...
view save

user output
a0
1 - 3
2 - 4
5 - 6
view save

Test 31

Group: 1, 2

Verdict:

input
2
546..
.3...
.2...
.1...
...
view save

correct output
-
-
view save

user output
a0
1 - 3
2 - 4
5 - 6
view save

Tasks

A Sanalista-B Ratsun reitit-C Alitaulukot-D 2021-luvut-E Arpakuutiot-

Submissions (Epe)

2020-10-10 08:01:50 1002020-10-09 02:17:49 02020-10-09 01:44:33 02020-10-09 01:38:27 02020-10-09 01:38:14 02020-10-09 01:27:14 02020-10-09 01:06:23 02020-10-09 01:04:09 02020-10-09 00:43:02 02020-10-09 00:39:03 02020-10-09 00:34:26 02020-10-09 00:33:30 02020-10-09 00:32:26 02020-10-09 00:27:28 02020-10-09 00:05:53 02020-10-08 23:40:09 02020-10-08 23:39:22 02020-10-08 23:38:45 02020-10-08 23:11:44 02020-10-08 23:09:15 02020-10-08 23:08:31 02020-10-08 23:08:15 02020-10-08 23:02:27 02020-10-08 22:50:30 02020-10-08 22:14:00 02020-10-08 22:10:42 02020-10-08 22:09:48 02020-10-08 22:06:58 02020-10-08 22:05:17 02020-10-08 22:04:35 02020-10-08 22:02:55 02020-10-08 21:08:59 02020-10-08 21:04:17 02020-10-08 20:56:46 02020-10-08 20:52:30 02020-10-08 20:50:44 02020-10-08 20:45:51 02020-10-04 17:16:37 02020-10-04 17:12:54 02020-10-04 17:12:21 02020-10-04 17:06:58 02020-10-04 17:06:09 02020-10-04 14:58:48 02020-10-04 14:44:11 02020-10-04 14:40:23 02020-10-04 14:40:12 02020-10-04 14:39:28 02020-10-04 08:51:01 02020-10-04 08:50:22 02020-10-04 08:50:02 02020-10-04 08:49:54 02020-10-04 08:37:58 02020-10-04 08:37:28 02020-10-04 05:55:44 02020-10-04 05:53:33 02020-10-04 05:45:52 02020-10-04 05:38:37 02020-10-04 05:28:35 02020-10-04 05:25:12 0