| Task: | Niitty |
| Sender: | Verlet |
| Submission time: | 2024-11-09 20:56:11 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 33 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 4 |
| #2 | ACCEPTED | 6 |
| #3 | ACCEPTED | 10 |
| #4 | ACCEPTED | 13 |
| #5 | TIME LIMIT EXCEEDED | 0 |
| #6 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1, 2, 3, 4, 5, 6 | details |
| #2 | ACCEPTED | 0.04 s | 1, 2, 3, 4, 5, 6 | details |
| #3 | ACCEPTED | 0.04 s | 1, 2, 3, 4, 5, 6 | details |
| #4 | ACCEPTED | 0.04 s | 1, 2, 3, 4, 5, 6 | details |
| #5 | ACCEPTED | 0.04 s | 1, 2, 3, 4, 5, 6 | details |
| #6 | ACCEPTED | 0.04 s | 2, 3, 4, 5, 6 | details |
| #7 | ACCEPTED | 0.04 s | 2, 3, 4, 5, 6 | details |
| #8 | ACCEPTED | 0.04 s | 2, 3, 4, 5, 6 | details |
| #9 | ACCEPTED | 0.04 s | 2, 3, 4, 5, 6 | details |
| #10 | ACCEPTED | 0.06 s | 3, 4, 5, 6 | details |
| #11 | ACCEPTED | 0.10 s | 3, 4, 5, 6 | details |
| #12 | ACCEPTED | 0.05 s | 3, 4, 5, 6 | details |
| #13 | ACCEPTED | 0.05 s | 3, 4, 5, 6 | details |
| #14 | ACCEPTED | 0.18 s | 4, 5, 6 | details |
| #15 | ACCEPTED | 0.71 s | 4, 5, 6 | details |
| #16 | ACCEPTED | 0.10 s | 4, 5, 6 | details |
| #17 | ACCEPTED | 0.05 s | 4, 5, 6 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #20 | ACCEPTED | 0.74 s | 5, 6 | details |
| #21 | ACCEPTED | 0.78 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 <iostream>
#include <vector>
#include <set>
using namespace std;
typedef vector<int> v1i;
typedef vector<v1i> v2i;
typedef vector<v2i> v3i;
set<int> s;
v3i t(501, v2i(501, v1i(26)));
void initPrefixSum(int n)
{
for (int l = 0; l < 26; l++)
{
for (int j = 1; j <= n; j++)
{
for (int i = 1; i <= n; i++)
{
t[i][j][l] += t[i-1][j][l];
}
for (int i = 1; i <= n; i++)
{
t[i][j][l] += t[i][j-1][l];
}
}
}
}
int sum(int l, int sx, int sy, int ex, int ey)
{
return t[ex][ey][l] - t[sx][ey][l] - t[ex][sy][l] + t[sx][sy][l];
}
bool containsAllSpecies(int sx, int sy, int ex, int ey)
{
for (int species : s)
{
if (sum(species, sx, sy, ex, ey) == 0) return false;
}
return true;
}
int solve(int n)
{
int solutions = 0;
for (int sx = 0; sx < n; sx++)
{
if (!containsAllSpecies(sx, 0, n, n)) continue;
for (int sy = 0; sy < n; sy++)
{
if (!containsAllSpecies(sx, sy, n, n)) continue;
for (int ex = sx + 1; ex <= n; ex++)
{
if (!containsAllSpecies(sx, sy, ex, n)) continue;
int a = sy + 1;
int b = n;
while (a <= b)
{
int k = (a + b) / 2;
bool v1 = containsAllSpecies(sx, sy, ex, k);
bool v2 = containsAllSpecies(sx, sy, ex, k - 1);
if (v1 == true && v2 == false)
{
solutions += n - k + 1;
break;
}
if (v1) b = k - 1;
else a = k + 1;
}
}
}
}
return solutions;
}
int main()
{
int n;
cin >> n;
for (int j = 1; j <= n; j++)
for (int i = 1; i <= n; i++)
{
char c;
cin >> c;
s.insert(c - 65);
t[i][j][c - 65] = 1;
}
initPrefixSum(n);
cout << solve(n);
}Test details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ... |
| correct output |
|---|
| 2035 |
| user output |
|---|
| 2035 |
Test 2
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 NFWQLWNWYS DZOQJVXFPJ CNHXPXMCQD QRTBVNLTQC ... |
| correct output |
|---|
| 9 |
| user output |
|---|
| 9 |
Test 3
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX XXXXXXXXXX ... |
| correct output |
|---|
| 3025 |
| user output |
|---|
| 3025 |
Test 4
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 FFFFFFFFFF FFFFFCFFFF FFFFFFJFFF FFFFFFFFFF ... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 12 |
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: ACCEPTED
| input |
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
| correct output |
|---|
| 38724 |
| user output |
|---|
| 38724 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
| correct output |
|---|
| 8334 |
| user output |
|---|
| 8334 |
Test 8
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK KKKKKKKKKKKKKKKKKKKK ... |
| correct output |
|---|
| 44100 |
| user output |
|---|
| 44100 |
Test 9
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 AAAAAAAAXAAAAAAAAAAA AAAWAAAAAAAAAAAAAOAA AAAAAAAAAAAAAAAAAPAA AAAAAAAAKAAAAAAAAAAZ ... |
| correct output |
|---|
| 18 |
| user output |
|---|
| 18 |
Test 10
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
| correct output |
|---|
| 1584665 |
| user output |
|---|
| 1584665 |
Test 11
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
| correct output |
|---|
| 1077746 |
| user output |
|---|
| 1077746 |
Test 12
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO... |
| correct output |
|---|
| 1625625 |
| user output |
|---|
| 1625625 |
Test 13
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF... |
| correct output |
|---|
| 1680 |
| user output |
|---|
| 1680 |
Test 14
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
| correct output |
|---|
| 25325366 |
| user output |
|---|
| 25325366 |
Test 15
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
| correct output |
|---|
| 22342463 |
| user output |
|---|
| 22342463 |
Test 16
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT... |
| correct output |
|---|
| 25502500 |
| user output |
|---|
| 25502500 |
Test 17
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ... |
| correct output |
|---|
| 25650 |
| user output |
|---|
| 25650 |
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: ACCEPTED
| input |
|---|
| 200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
| correct output |
|---|
| 404010000 |
| user output |
|---|
| 404010000 |
Test 21
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
| correct output |
|---|
| 14159445 |
| user output |
|---|
| 14159445 |
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) |
