| Task: | Niitty |
| Sender: | asonnine |
| Submission time: | 2024-10-29 20:55:25 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| 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 | 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 | ACCEPTED | 0.00 s | 1, 2, 3, 4, 5, 6 | details |
| #6 | WRONG ANSWER | 0.28 s | 2, 3, 4, 5, 6 | details |
| #7 | WRONG ANSWER | 0.01 s | 2, 3, 4, 5, 6 | details |
| #8 | WRONG ANSWER | 0.35 s | 2, 3, 4, 5, 6 | details |
| #9 | WRONG ANSWER | 0.00 s | 2, 3, 4, 5, 6 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 3, 4, 5, 6 | details |
| #13 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 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>
using namespace std;
int char_to_int(char in) {
return (int)in - 65;
}
int recurseh(int n, int x, int dx, vector<string> &field, vector<int> species) {
int out = 0;
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) {
out += recurseh(n, x+1, dx-1, field, new_species);
}
bool right = true;
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) {
out += recurseh(n, x, dx-1, field, new_species);
}
return out + 1;
}
int recursev(int n, int y, int dy, vector<string> &field, vector<int> species) {
int out = 0;
bool up = true;
vector<int> new_species = species;
for (int i = 0; i < n; 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 += recursev(n, y+1, dy-1, field, new_species);
}
bool down = true;
new_species = species;
for (int i = 0; i < n; 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 += recursev(n, y, dy-1, field, new_species);
}
return out + 1;
}
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)]++;
}
}
cout << recurseh(n, 0, n-1, field, species) * recursev(n, 0, n-1, field, species) << "\n";
}
Test details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ... |
| correct output |
|---|
| 2035 |
| user output |
|---|
| 862389 |
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
| correct output |
|---|
| 9 |
| user output |
|---|
| 12 |
Test 3
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ... |
| correct output |
|---|
| 3025 |
| user output |
|---|
| 1046529 |
Test 4
Group: 1, 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 15 |
Test 5
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1 X |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 6
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
| correct output |
|---|
| 38724 |
| user output |
|---|
| -2097151 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
| correct output |
|---|
| 8334 |
| user output |
|---|
| 1576897295 |
Test 8
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ... |
| correct output |
|---|
| 44100 |
| user output |
|---|
| -2097151 |
Test 9
Group: 2, 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
| correct output |
|---|
| 18 |
| user output |
|---|
| 45 |
Test 10
Group: 3, 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
| correct output |
|---|
| 1584665 |
| user output |
|---|
| (empty) |
Test 11
Group: 3, 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
| correct output |
|---|
| 1077746 |
| user output |
|---|
| (empty) |
Test 12
Group: 3, 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO... |
| correct output |
|---|
| 1625625 |
| user output |
|---|
| (empty) |
Test 13
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
| correct output |
|---|
| 1680 |
| user output |
|---|
| 32195736 |
Test 14
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
| correct output |
|---|
| 25325366 |
| user output |
|---|
| (empty) |
Test 15
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
| correct output |
|---|
| 22342463 |
| user output |
|---|
| (empty) |
Test 16
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
| correct output |
|---|
| 25502500 |
| user output |
|---|
| (empty) |
Test 17
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
| correct output |
|---|
| 25650 |
| user output |
|---|
| (empty) |
Test 18
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA... |
| correct output |
|---|
| 403292767 |
| user output |
|---|
| (empty) |
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 OMYWATTLURKQPTKEFMGGYAOONXWVSC... |
| correct output |
|---|
| 388111321 |
| user output |
|---|
| (empty) |
Test 20
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
| correct output |
|---|
| 404010000 |
| user output |
|---|
| (empty) |
Test 21
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
| correct output |
|---|
| 14159445 |
| user output |
|---|
| (empty) |
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW... |
| correct output |
|---|
| 15683003812 |
| user output |
|---|
| (empty) |
Test 23
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE... |
| correct output |
|---|
| 15575906951 |
| user output |
|---|
| (empty) |
Test 24
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
| correct output |
|---|
| 15687562500 |
| user output |
|---|
| (empty) |
Test 25
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW... |
| correct output |
|---|
| 3058970930 |
| user output |
|---|
| (empty) |
