CSES - Datatähti 2025 alku

Submission details
Task:	Niitty
Sender:	adex720
Submission time:	2026-09-15 19:35:53 +0300
Language:	C++ (C++20)
Status:	READY
Result:	58

Feedback
subtask	verdict	score
#1	ACCEPTED	4
#2	ACCEPTED	6
#3	ACCEPTED	10
#4	ACCEPTED	13
#5	ACCEPTED	25
#6	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	subtask
#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.00 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.01 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.00 s	2, 3, 4, 5, 6	details
#10	ACCEPTED	0.01 s	3, 4, 5, 6	details
#11	ACCEPTED	0.01 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.01 s	4, 5, 6	details
#15	ACCEPTED	0.02 s	4, 5, 6	details
#16	ACCEPTED	0.01 s	4, 5, 6	details
#17	ACCEPTED	0.01 s	4, 5, 6	details
#18	ACCEPTED	0.04 s	5, 6	details
#19	ACCEPTED	0.12 s	5, 6	details
#20	ACCEPTED	0.03 s	5, 6	details
#21	ACCEPTED	0.15 s	5, 6	details
#22	ACCEPTED	0.32 s	6	details
#23	TIME LIMIT EXCEEDED	--	6	details
#24	ACCEPTED	0.24 s	6	details
#25	TIME LIMIT EXCEEDED	--	6	details

Compiler report

input/code.cpp:1:55: warning: bad option '-fstrict-overflow' to pragma 'optimize' [-Wpragmas]
    1 | #pragma GCC optimize("03,unroll-loops,strict-overflow")
      |                                                       ^
input/code.cpp:11:10: warning: bad option '-fstrict-overflow' to attribute 'optimize' [-Wattributes]
   11 | int main()
      |          ^

Code

#pragma GCC optimize("03,unroll-loops,strict-overflow")
// #pragma GCC target("arch=skylake")

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

using ll = long long;

int maarat[502][501][26];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll summa = 0ll;
    string s;
    bool kelpo;
    int n, min, max, keski;
    cin >> n;

    int sisaltyvat[26];

    // summataulukon nollaus
    for (int y = 0; y <= n; y++)
    {
        for (int x = 0; x <= n; x++)
        {
            for (int i = 0; i < 26; i++)
            {
                maarat[y][x][i] = 0;
            }
        }
    }

    for (int i = 0; i < 26; i++)
    {
        sisaltyvat[i] = 0;
    }

    // syötteen kukkien merkitseminen
    for (int y = 1; y <= n; y++)
    {
        cin >> s;
        for (int x = 0; x < n; x++)
        {
            maarat[y][x + 1][s[x] - 'A'] = 1;
            sisaltyvat[s[x] - 'A'] = 1;
        }
    }

    // ensimmäisen rivin ja sarakkeen nollaus
    for (int y = 1; y <= n; y++)
    {
        for (int i = 0; i < 26; i++)
        {
            maarat[y][0][i] = sisaltyvat[i] ? maarat[y][0][i] + maarat[y - 1][0][i] : y;
        }
    }
    for (int x = 1; x <= n; x++)
    {
        for (int i = 0; i < 26; i++)
        {
            maarat[0][x][i] = sisaltyvat[i] ? maarat[0][x][i] + maarat[0][x - 1][i] : x;
        }
    }

    // summien lasekminen
    for (int y = 1; y <= n; y++)
    {
        for (int x = 1; x <= n; x++)
        {
            for (int i = 0; i < 26; i++)
            {
                maarat[y][x][i] += maarat[y - 1][x][i] + maarat[y][x - 1][i] - maarat[y - 1][x - 1][i] + 1 - sisaltyvat[i];
            }
        }
    }

    // alin rivi täytyeen hyvin suuria lukuja, jotta tilanteet, joissa mikään korkeus ei ole kelvollinen, käsitellään oikein

    for (int x = 0; x <= n; x++)
    {
        for (int i = 0; i < 26; i++)
        {
            maarat[501][x][i] = INT_MAX;
        }
    }

    // käydään läpi jokainen ruutu, ja lasketaan, monenko mahdollisen alueen vasen yläkulma se on
    for (int alkuY = 0; alkuY < n; alkuY++)
    {
        for (int alkuX = 0; alkuX < n; alkuX++)
        {
            // käydään kaikki leveydet läpi, ja etsitään binäärihaulla minimikorkeus
            max = n;

            for (int loppuX = alkuX; loppuX < n; loppuX++)
            {
                min = alkuY;
                while (max > min)
                {
                    keski = (min + max) >> 1;

                    kelpo = true;
                    for (int c = 0; c < 26; c++)
                    {
                        if (maarat[keski + 1][loppuX + 1][c] - maarat[keski + 1][alkuX][c] - maarat[alkuY][loppuX + 1][c] + maarat[alkuY][alkuX][c] == 0)
                        {
                            kelpo = false;
                            break;
                        }
                    }

                    if (kelpo)
                        max = keski;
                    else
                        min = keski + 1;
                }

                max = min;
                summa += (n - min);
            }
        }
    }

    cout << summa;

    return 0;
}

Test details

Test 1

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 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

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`1584665` view save

Test 11

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`1077746` view save

Test 12

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`1625625` view save

Test 13

Subtask: 3, 4, 5, 6

Verdict: ACCEPTED

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`1680` view save

Test 14

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
`25325366` view save

Test 15

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
`22342463` view save

Test 16

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
`25502500` view save

Test 17

Subtask: 4, 5, 6

Verdict: ACCEPTED

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
`25650` view save

Test 18

Subtask: 5, 6

Verdict: ACCEPTED

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
`403292767` view save

Test 19

Subtask: 5, 6

Verdict: ACCEPTED

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
`388111321` view save

Test 20

Subtask: 5, 6

Verdict: ACCEPTED

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
`404010000` view save

Test 21

Subtask: 5, 6

Verdict: ACCEPTED

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
`14159445` view save

Test 22

Subtask: 6

Verdict: ACCEPTED

input
`500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...` view save

correct output
`15683003812` view save

user output
`15683003812` view save

Test 23

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...` view save

correct output
`15575906951` view save

user output
(empty)

Test 24

Subtask: 6

Verdict: ACCEPTED

input
`500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...` view save

correct output
`15687562500` view save

user output
`15687562500` view save

Test 25

Subtask: 6

Verdict: TIME LIMIT EXCEEDED

input
`500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...` view save

correct output
`3058970930` view save

user output
(empty)

Datatähti 2025 alku

Niitty

Compiler report

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 (adex720)