CSES - Datatähti 2025 alku

Submission details
Task:	Niitty
Sender:	zli0122
Submission time:	2024-11-05 11:29:55 +0200
Language:	C++ (C++11)
Status:	READY
Result:	33

Feedback
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 results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#2	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#3	ACCEPTED	0.01 s	1, 2, 3, 4, 5, 6	details
#4	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#5	ACCEPTED	0.00 s	1, 2, 3, 4, 5, 6	details
#6	ACCEPTED	0.00 s	2, 3, 4, 5, 6	details
#7	ACCEPTED	0.00 s	2, 3, 4, 5, 6	details
#8	ACCEPTED	0.00 s	2, 3, 4, 5, 6	details
#9	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#10	ACCEPTED	0.01 s	3, 4, 5, 6	details
#11	ACCEPTED	0.02 s	3, 4, 5, 6	details
#12	ACCEPTED	0.01 s	3, 4, 5, 6	details
#13	ACCEPTED	0.01 s	3, 4, 5, 6	details
#14	ACCEPTED	0.05 s	4, 5, 6	details
#15	ACCEPTED	0.18 s	4, 5, 6	details
#16	ACCEPTED	0.03 s	4, 5, 6	details
#17	ACCEPTED	0.01 s	4, 5, 6	details
#18	ACCEPTED	0.49 s	5, 6	details
#19	TIME LIMIT EXCEEDED	--	5, 6	details
#20	ACCEPTED	0.29 s	5, 6	details
#21	ACCEPTED	0.20 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>
using namespace std;

int main() {
    int n;
    cin >> n;
    
    // Initialize prefix sum array
    vector<vector<vector<int>>> prefix_lawn(n + 1, vector<vector<int>>(n + 1, vector<int>(26, 0)));
    unordered_set<char> types;
    char current;
    
    // Populate prefix sum array and identify present flower species
    for (int r = 1; r <= n; r++) {
        for (int c = 1; c <= n; c++) {
            cin >> current;
            int flower_index = current - 'A';
            types.insert(current); // Track distinct flower species
            
            for (int x = 0; x < 26; x++) {
                prefix_lawn[r][c][x] = prefix_lawn[r][c - 1][x] + prefix_lawn[r - 1][c][x] - prefix_lawn[r - 1][c - 1][x];
            }
            prefix_lawn[r][c][flower_index]++; // Update for current cell
        }
    }
    
    long long solutions = 0;
    int a, b;
    // Iterate over all possible submatrices
    for (int rl = 1; rl <= n; rl++) {
        for (int cl = 1; cl <= n; cl++) {
            for (int rg = rl; rg <= n; rg++) {
                // check if it's doomed to begin with
                bool valid = true;
                for (char flower : types) {
                    int flower_index = flower - 'A';
                    int count = prefix_lawn[rg][n][flower_index]
                                - prefix_lawn[rl - 1][n][flower_index]
                                - prefix_lawn[rg][cl - 1][flower_index]
                                + prefix_lawn[rl - 1][cl - 1][flower_index];
                    if (count == 0) {
                        valid = false;
                        break;
                    }
                }
                if (!valid) continue;
                a = cl;
                b = n+1;
                while (a < b) {
                    valid = true;
                    int mid = (a + b) / 2;
                    for (char flower : types) {
                        int flower_index = flower - 'A';
                        int count = prefix_lawn[rg][mid][flower_index]
                                    - prefix_lawn[rl - 1][mid][flower_index]
                                    - prefix_lawn[rg][cl - 1][flower_index]
                                    + prefix_lawn[rl - 1][cl - 1][flower_index];
                        if (count == 0) {
                            valid = false;
                            break;
                        }
                    }
                    if (!valid) {
                        a = mid + 1;  // Move `a` up since `s[mid]` is less than the target
                    } else {
                        b = mid;      // Keep `b` at `mid`, as `s[mid] >= target`
                    }
                }
                
                solutions += (n-a) + 1;                
            }
        }
    }
    
    cout << solutions << endl;
}

Test details

Test 1

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

Verdict: ACCEPTED

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

correct output
`2035` view save

user output
`2035` view save

Test 2

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

Verdict: ACCEPTED

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

correct output
`9` view save

user output
`9` view save

Test 3

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

Verdict: ACCEPTED

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

correct output
`3025` view save

user output
`3025` view save

Test 4

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

Verdict: ACCEPTED

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

correct output
`12` view save

user output
`12` view save

Test 5

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

Verdict: ACCEPTED

input
`1 X` view save

correct output
`1` view save

user output
`1` view save

Test 6

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`38724` view save

user output
`38724` view save

Test 7

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`8334` view save

user output
`8334` view save

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`44100` view save

user output
`44100` view save

Test 9

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

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

correct output
`18` view save

user output
`18` view save

Test 10

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`1584665` view save

Test 11

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`1077746` view save

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`1625625` view save

Test 13

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`1680` view save

Test 14

Group: 4, 5, 6

Verdict: ACCEPTED

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
`25325366` view save

Test 15

Group: 4, 5, 6

Verdict: ACCEPTED

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
`22342463` view save

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
`25502500` view save

Test 17

Group: 4, 5, 6

Verdict: ACCEPTED

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
`25650` view save

Test 18

Group: 5, 6

Verdict: ACCEPTED

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
`403292767` view save

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
(empty)

Test 20

Group: 5, 6

Verdict: ACCEPTED

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
`404010000` view save

Test 21

Group: 5, 6

Verdict: ACCEPTED

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
`14159445` 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 (zli0122)