CSES - Datatähti 2025 alku

Submission details
Task:	Niitty
Sender:	nikke5
Submission time:	2024-11-10 22:31:32 +0200
Language:	C++ (C++11)
Status:	READY
Result:	20

Feedback
group	verdict	score
#1	ACCEPTED	4
#2	ACCEPTED	6
#3	ACCEPTED	10
#4	TIME LIMIT EXCEEDED	0
#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.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.00 s	2, 3, 4, 5, 6	details
#7	ACCEPTED	0.01 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.13 s	3, 4, 5, 6	details
#12	ACCEPTED	0.01 s	3, 4, 5, 6	details
#13	ACCEPTED	0.04 s	3, 4, 5, 6	details
#14	ACCEPTED	0.10 s	4, 5, 6	details
#15	ACCEPTED	0.90 s	4, 5, 6	details
#16	ACCEPTED	0.09 s	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

Compiler report

input/code.cpp: In function 'std::vector<bool> findLettersFromRectOptimized(int, int, int)':
input/code.cpp:53:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<bool> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for (int i = minX; i<FoundTracker.size(); i++){
      |                        ~^~~~~~~~~~~~~~~~~~~~
input/code.cpp:59:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<flower> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for (int f = 0; f<flist.size(); f++){
      |                         ~^~~~~~~~~~~~~
input/code.cpp:67:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<bool> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     if (maxX >= FoundTracker.size()){
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main...

Code

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>
#include <algorithm>

typedef long long ll;
using namespace std;

struct flower{

    int x, y;

    int id;
};

vector<vector<flower>> flist;

vector<vector<bool>> FoundTracker;
bool FoundTrackerReset = true;

int idList[200] = {0};

int letterGrid[501][501];

// int iterations;

vector<bool> findLettersFromRect(int minX, int maxX, int minY, int maxY, int n){

    vector<bool> foundLetters = vector<bool>(flist.size(), false);

    for (int x = minX; x <= maxX; x++)
        {
            for (int y = minY; y <= maxY; y++)
            {
                foundLetters[letterGrid[x][y]] = true;
                // iterations++;
            }
        }

    return foundLetters;


}

vector<bool> findLettersFromRectOptimized(int minX, int maxX, int n){

    vector<bool> foundLetters = vector<bool>(flist.size(), false);
    for (int i = minX; i<FoundTracker.size(); i++){

        if (i > maxX){
            break;
        }

        for (int f = 0; f<flist.size(); f++){
            if(FoundTracker[i][f]){
                foundLetters[f] = true;
            }
            // iterations++;
        }
    }

    if (maxX >= FoundTracker.size()){

        FoundTracker.push_back(vector<bool>(flist.size(), false));

        for (int y = 0; y <= n - 1; y++)
        {
            foundLetters[letterGrid[maxX][y]] = true;
            FoundTracker[maxX][letterGrid[maxX][y]] = true;
            // iterations++;
        }
    }


    return foundLetters;


}


int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    fill_n(idList, 200, -1);

    int n;

    cin >> n;
    cin.ignore(1,'\n');

    int id = 0;
    vector<string> sI;

    for (int y = n-1; y>=0; y--){

        
        sI.push_back(string());
        getline(cin, sI[sI.size()-1]);

    }

    int c = n-1;

    for (int y = n - 1; y >= 0; y--)
    {
        
        string s = sI[c];

        c--;

        for (int x = 0; x < n; x++)
        {
            flower f;

            if (idList[(int)s[x]] == -1)
            {
                idList[(int)s[x]] = id;
                flist.push_back(vector<flower>());
                id++;
            }

            // f.id = idList[(int)s[x]];

            letterGrid[x][y] = idList[(int)s[x]];

            // iterations++;
        }
    }

    // vector<vector<char>> visualization;

    

    // for (int y = 0; y<n; y++){
    //     visualization.push_back(vector<char>());
    //     for(int x = 0; x<n; x++){
    //         visualization[y].push_back(sI[y][x]);
    //     }
    // }

    int v = 0;
    int maxMinYIteration = 501;
    int minMaxYIteration = 0;

    vector<pair<int,int>> goodRows;
    int biggestRectXDifference = 0;
    int biggestRectXDifferenceID = -1;

    for (int minX = 0; minX<n; minX++){ // Etsitään, onko eri pystyriveissä kaikki.
        for (int maxX = minX; maxX<n; maxX++){
            int notFound = flist.size();

            vector<bool> currentRectLetters;

            currentRectLetters = findLettersFromRectOptimized(minX, maxX, n);

            if (maxX-minX > biggestRectXDifference){
                biggestRectXDifference = maxX-minX;
                biggestRectXDifferenceID = goodRows.size();
            }

            for (int i = 0; i < flist.size(); i++)
            {
                if (currentRectLetters[i])
                {
                    notFound--;
                }
                // iterations++;
            }

            if (notFound == 0)
            {
                goodRows.push_back(make_pair(minX, maxX));
                // for (int y = 0; y <= n-1; y++)
                // {
                //     for (int x = minX; x <= maxX; x++)
                //     {
                //         cout << visualization[y][x] << " ";
                //     }
                //     cout << "\n";
                // }
                // cout << "\n";
            }
        }
    }

    for (int minY = 0; minY < min(n,maxMinYIteration); minY++) // LOOPPAA ENSIN ISOIN SUORAKULMA
    {

        for (int maxY = max(minY,minMaxYIteration); maxY < n; maxY++)
        {
            int notFound = flist.size();

            vector<bool> currentRectLetters;

            currentRectLetters = findLettersFromRect(goodRows[biggestRectXDifferenceID].first, goodRows[biggestRectXDifferenceID].second, minY, maxY, n);

            // for (int y = minY; y <= maxY; y++)
            // {
            //     for (int x = goodRows[biggestRectXDifferenceID].first; x <= goodRows[biggestRectXDifferenceID].second; x++)
            //     {
            //         cout << visualization[y][x] << " ";
            //     }
            //     cout << "\n";
            // }
            // cout << "\n";

            for (int i = 0; i < flist.size(); i++)
            {
                if (currentRectLetters[i])
                {
                    notFound--;
                }
                // iterations++;
            }

            if (notFound == 0)
            {
                v += n - maxY; // Jos tästä lähtien kaikista suorakulmista löytyy kaikki kirjaimet, lisää niiden määrä vastaukseen ja mene seuraavaan maxX iteraatioon.
                break;
            }
            else
            {
                // if (maxY == n - 1 && maxMinYIteration == 501)
                // {
                //     maxMinYIteration = minY;
                //     break;
                // }
                // if (minY == 0)
                // {
                //     minMaxYIteration = maxY + 1;
                // }
            }
        }
    }

    for (int i = 0; i<goodRows.size(); i++){

        if (i == biggestRectXDifferenceID){
            continue;
        }

        for (int minY = 0; minY<min(n,maxMinYIteration); minY++){

            bool nextGoodRow = false;

            for(int maxY = max(minY,minMaxYIteration); maxY < n; maxY++){
                int notFound = flist.size();

                vector<bool> currentRectLetters;

                currentRectLetters = findLettersFromRect(goodRows[i].first, goodRows[i].second, minY, maxY, n);

                // for (int y = minY; y <= maxY; y++)
                // {
                //     for (int x = goodRows[i].first; x <= goodRows[i].second; x++)
                //     {
                //         cout << visualization[y][x] << " ";
                //     }
                //     cout << "\n";
                // }
                // cout << "\n";

                for (int i = 0; i < flist.size(); i++)
                {
                    if (currentRectLetters[i])
                    {
                        notFound--;
                    }
                    // iterations++;
                }

                if (notFound == 0)
                {
                    v += n - maxY; // Jos tästä lähtien kaikista suorakulmista löytyy kaikki kirjaimet, lisää niiden määrä vastaukseen ja mene seuraavaan maxX iteraatioon.

                    break;
                }
                else
                {
                    if (maxY == n - 1)
                    {
                        nextGoodRow = true;
                        break;
                    }
                }
            }

            if (nextGoodRow){
                break;
            }

        }
    }

    cout << v;

}

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: TIME LIMIT EXCEEDED

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
(empty)

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
(empty)

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: TIME LIMIT EXCEEDED

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
(empty)

Test 21

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
(empty)

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

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