CSES - Datatähti 2025 alku - Results
Submission details
Task:Niitty
Sender:Username*
Submission time:2024-10-28 17:42:20 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
#60
Test results
testverdicttimegroup
#10.00 s1, 2, 3, 4, 5, 6details
#20.00 s1, 2, 3, 4, 5, 6details
#3ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#4ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#5ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#60.01 s2, 3, 4, 5, 6details
#70.01 s2, 3, 4, 5, 6details
#8ACCEPTED0.01 s2, 3, 4, 5, 6details
#90.01 s2, 3, 4, 5, 6details
#100.02 s3, 4, 5, 6details
#110.08 s3, 4, 5, 6details
#12ACCEPTED0.01 s3, 4, 5, 6details
#130.03 s3, 4, 5, 6details
#140.10 s4, 5, 6details
#150.63 s4, 5, 6details
#16ACCEPTED0.04 s4, 5, 6details
#170.26 s4, 5, 6details
#180.90 s5, 6details
#19--5, 6details
#20ACCEPTED0.22 s5, 6details
#21--5, 6details
#22--6details
#23--6details
#24--6details
#25--6details

Code

#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
using namespace std;

const int MAX = 500;
int prefix[26][MAX + 1][MAX + 1];

bool hasAll(const unordered_map<char, int>& count, const unordered_set<char>& set) {
    for (char species : set) {
        if (count.at(species) == 0) {
            return false;
        }
    }
    return true;
}

int main() {
    int n;
    cin >> n;
    vector<string> meadow(n);
    unordered_set<char> set;

    for (int i = 0; i < n; ++i) {
        cin >> meadow[i];
        for (int j = 0; j < n; ++j) {
            set.insert(meadow[i][j]);
        }
    }

    for (int s = 0; s < 26; ++s) {
        for (int i = 0; i <= n; ++i) {
            for (int j = 0; j <= n; ++j) {
                prefix[s][i][j] = 0;
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            int sindex = meadow[i][j] - 'A';
            for (int s = 0; s < 26; ++s) {
                prefix[s][i + 1][j + 1] = prefix[s][i + 1][j] + prefix[s][i][j + 1]
                    - prefix[s][i][j] + (s == sindex ? 1 : 0);
            }
        }
    }

    int count = 0;

    for (int top = 0; top < n; ++top) {
        for (int bottom = top; bottom < n; ++bottom) {
            unordered_map<char, int> scount;
            for (char species : set) {
                scount[species] = 0;
            }

            int left = 0;
            for (int right = 0; right < n; ++right) {
                for (char species : set) {
                    int index = species - 'A';
                    int incol = prefix[index][bottom + 1][right + 1]
                        - prefix[index][top][right + 1];
                    scount[species] = incol;
                }
                while (left <= right && hasAll(scount, set)) {
                    count += (n - right);
                    left++;
                    for (char species : set) {
                        int index = species - 'A';
                        int incol = prefix[index][bottom + 1][left]
                            - prefix[index][top][left];
                        scount[species] -= incol;
                    }
                }
            }
        }
    }
    cout << count << endl;
    return 0;
}

Test details

Test 1

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

Verdict:

input
10
TNCTNPNTPC
NPPNTNTPTP
NTNTTCNTCT
NPCPNPPNTT
...

correct output
2035

user output
2287

Test 2

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

Verdict:

input
10
NFWQLWNWYS
DZOQJVXFPJ
CNHXPXMCQD
QRTBVNLTQC
...

correct output
9

user output
21

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:

input
20
BBCBUBOUOBBCUUBBCOUO
BOUCOOCUBCOOOCOBOCUO
UCCUUUOBCOCBCBUBUCOO
BUOBUCUCUOOBCOOUBUOO
...

correct output
38724

user output
41846

Test 7

Group: 2, 3, 4, 5, 6

Verdict:

input
20
CBGLSHGZHYZDWBNDBJUG
SMUXOJQYPXZDTMJUIWOJ
XIDSTNBGHKRKOVUVMINB
MTQGCFRUHQKALXRNCQGS
...

correct output
8334

user output
11409

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:

input
20
AAAAAAAAXAAAAAAAAAAA
AAAWAAAAAAAAAAAAAOAA
AAAAAAAAAAAAAAAAAPAA
AAAAAAAAKAAAAAAAAAAZ
...

correct output
18

user output
20

Test 10

Group: 3, 4, 5, 6

Verdict:

input
50
GRGREEEGREGXRXXEGXXREXGRRRGRRR...

correct output
1584665

user output
1613887

Test 11

Group: 3, 4, 5, 6

Verdict:

input
50
AITIISJUHCCRZNKSDCNQKYSQRINFWJ...

correct output
1077746

user output
1215650

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:

input
50
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...

correct output
1680

user output
2576

Test 14

Group: 4, 5, 6

Verdict:

input
100
NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...

correct output
25325366

user output
25464665

Test 15

Group: 4, 5, 6

Verdict:

input
100
LIMQQIHASECROEVILNVULGWZJPPKOG...

correct output
22342463

user output
23643774

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

input
100
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...

correct output
25502500

user output
25502500

Test 17

Group: 4, 5, 6

Verdict:

input
100
QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
25650

user output
39697

Test 18

Group: 5, 6

Verdict:

input
200
NAANANMMKNKKAKMKMAKNKMNKMMNNAA...

correct output
403292767

user output
403885090

Test 19

Group: 5, 6

Verdict:

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:

input
200
LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...

correct output
14159445

user output
(empty)

Test 22

Group: 6

Verdict:

input
500
VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...

correct output
15683003812

user output
(empty)

Test 23

Group: 6

Verdict:

input
500
OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...

correct output
15575906951

user output
(empty)

Test 24

Group: 6

Verdict:

input
500
IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...

correct output
15687562500

user output
(empty)

Test 25

Group: 6

Verdict:

input
500
WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...

correct output
3058970930

user output
(empty)