CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Niitty
Sender:	asonnine
Submission time:	2024-10-29 22:41:21 +0200
Language:	C++ (C++17)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#2	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#3	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#4	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#5	WRONG ANSWER	0.00 s	1, 2, 3, 4, 5, 6	details
#6	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#7	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#8	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#9	WRONG ANSWER	0.00 s	2, 3, 4, 5, 6	details
#10	WRONG ANSWER	0.01 s	3, 4, 5, 6	details
#11	WRONG ANSWER	0.01 s	3, 4, 5, 6	details
#12	WRONG ANSWER	0.01 s	3, 4, 5, 6	details
#13	WRONG ANSWER	0.00 s	3, 4, 5, 6	details
#14	WRONG ANSWER	0.05 s	4, 5, 6	details
#15	WRONG ANSWER	0.02 s	4, 5, 6	details
#16	WRONG ANSWER	0.06 s	4, 5, 6	details
#17	WRONG ANSWER	0.00 s	4, 5, 6	details
#18	WRONG ANSWER	0.38 s	5, 6	details
#19	WRONG ANSWER	0.13 s	5, 6	details
#20	WRONG ANSWER	0.40 s	5, 6	details
#21	WRONG ANSWER	0.06 s	5, 6	details
#22	TIME LIMIT EXCEEDED	--	6	details
#23	TIME LIMIT EXCEEDED	--	6	details
#24	TIME LIMIT EXCEEDED	--	6	details
#25	TIME LIMIT EXCEEDED	--	6	details

Code

#include <bits/stdc++.h>
#include <vector>
using namespace std;

int extra = 0;

int char_to_int(char in) {
	return (int)in - 65;
}

int recursev(int n, int x, int dx, int y, int dy, vector<string> &field, vector<int> species, vector<vector<bool>> &used) {
	int out = 0;
	
	if (y == n - 1) {
		return 0;
	}
	
	if (used[y+1][dy-1]) {
		used[y+1][dy-1] = false;
		bool up = true;
		vector<int> new_species = species;
		for (int i = x; i <= x+dx; i++) {
			if (new_species[char_to_int(field[y][i])] != 1) {
				new_species[char_to_int(field[y][i])]--;
			} else {
				up = false;
				break;
			}
		}
		if (up) {
			out++;
			out += recursev(n, x, dx, y+1, dy-1, field, new_species, used);
		}
	}
	
	if (used[y][dy-1]) {
		used[y][dy-1] = false;
		bool down = true;
		vector<int> new_species = species;
		for (int i = x; i <= x+dx; i++) {
			if (new_species[char_to_int(field[y+dy][i])] != 1) {
				new_species[char_to_int(field[y+dy][i])]--;
			} else {
				down = false;
				break;
			}
		}
		if (down) {
			out++;
			out += recursev(n, x, dx, y, dy-1, field, new_species, used);
		}
	}
	
	return out;
}

int vertical(int n, int x, int dx, vector<string> &field, vector<int> species) {
	vector<vector<bool>> used(n);
	vector<bool> temp(n);
	fill(temp.begin(), temp.end(), true);
	fill(used.begin(), used.end(), temp);
	return recursev(n, x, dx, 0, n-1, field, species, used)+1;
}

int recurseh(int n, int x, int dx, vector<string> &field, vector<int> species, vector<vector<bool>> &used) {
	int out = 0;
	bool called = false;
	
	if (x == n - 1) {
		extra += vertical(n, x, dx, field, species);
		return -1;
	}
	
	
	if (used[x+1][dx-1]) {
		used[x+1][dx-1] = false;
		bool left = true;
		vector<int> new_species = species;
		for (int i = 0; i < n; i++) {
			if (new_species[char_to_int(field[i][x])] != 1) {
				new_species[char_to_int(field[i][x])]--;
			} else {
				left = false;
				break;
			}
		}
		if (left) {
			called = true;
			out++;
			out += recurseh(n, x+1, dx-1, field, new_species, used);
		}
	}
	
	if (used[x][dx-1]) {
		used[x][dx-1] = false;
		bool right = true;
		vector<int> new_species = species;
		for (int i = 0; i < n; i++) {
			if (new_species[char_to_int(field[i][x+dx])] != 1) {
				new_species[char_to_int(field[i][x+dx])]--;
			} else {
				right = false;
				break;
			}
		}
		if (right) {
			called = true;
			out++;
			out += recurseh(n, x, dx-1, field, new_species, used);
		}
	}
	
	if (!called) {
		extra += vertical(n, x, dx, field, species);
		out--;
	}
	return out;
}

int main() {
	int n;
	cin >> n;
	vector<string> field(n);
	vector<int> species(26);
	for (int i = 0; i < n; i++) {
		cin >> field[i];
	}
	for (auto i : field) {
		for (auto j : i) {
			species[char_to_int(j)]++;
		}
	}
	vector<vector<bool>> used(n);
	vector<bool> temp(n);
	fill(temp.begin(), temp.end(), true);
	fill(used.begin(), used.end(), temp);
	int h = recurseh(n, 0, n-1, field, species, used)+1;
	fill(temp.begin(), temp.end(), true);
	fill(used.begin(), used.end(), temp);
	int v = recursev(n, 0, n-1, 0, n-1, field, species, used)+1;
	cout << h << endl << v << endl << extra << endl;
	cout << h*v+extra << "\n";
}

Test details

Test 1

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ...` view save

correct output
`2035` view save

user output
`45 51 139 2434` view save

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ...` view save

correct output
`9` view save

user output
`3 3 2 11` view save

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ...` view save

correct output
`3025` view save

user output
`45 55 550 3025` view save

Test 4

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ...` view save

correct output
`12` view save

user output
`2 4 4 12` view save

Test 5

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`1 X` view save

correct output
`1` view save

user output
`0 1 1 1` view save

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ...` view save

correct output
`38724` view save

user output
`190 210 1909 41809` view save

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ...` view save

correct output
`8334` view save

user output
`110 123 155 13685` view save

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ...` view save

correct output
`44100` view save

user output
`190 210 4200 44100` view save

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ...` view save

correct output
`18` view save

user output
`3 4 6 18` view save

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`1225 1275 47219 1609094` view save

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`1142 1200 7967 1378367` view save

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`1225 1275 63750 1625625` view save

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`48 56 144 2832` view save

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
`4950 5050 434247 25431747` view save

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
`4904 5019 87843 24701019` view save

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
`4950 5050 505000 25502500` view save

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
`195 241 486 47481` view save

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
`19900 20100 3734392 403724392` view save

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
`19895 20097 1103387 400933202` view save

Test 20

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
`19900 20100 4020000 404010000` view save

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
`5436 6796 117978 37061034` view save

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...` view save

correct output
`15683003812` view save

user output
(empty)

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...` view save

correct output
`15575906951` view save

user output
(empty)

Test 24

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...` view save

correct output
`15687562500` view save

user output
(empty)

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...` view save

correct output
`3058970930` view save

user output
(empty)

Datatähti 2025 alku

Niitty

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

Test 21

Test 22

Test 23

Test 24

Test 25

Tasks

Submissions (asonnine)