CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Niitty
Sender:	Pikaksi
Submission time:	2024-11-06 18:43:12 +0200
Language:	C++ (C++20)
Status:	READY
Result:	10

Feedback
group	verdict	score
#1	ACCEPTED	4
#2	ACCEPTED	6
#3	TIME LIMIT EXCEEDED	0
#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.01 s	2, 3, 4, 5, 6	details
#7	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#8	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#9	ACCEPTED	0.01 s	2, 3, 4, 5, 6	details
#10	ACCEPTED	0.56 s	3, 4, 5, 6	details
#11	ACCEPTED	0.53 s	3, 4, 5, 6	details
#12	TIME LIMIT EXCEEDED	--	3, 4, 5, 6	details
#13	TIME LIMIT EXCEEDED	--	3, 4, 5, 6	details
#14	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#15	TIME LIMIT EXCEEDED	--	4, 5, 6	details
#16	TIME LIMIT EXCEEDED	--	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 'll bruteForce(std::vector<std::__cxx11::basic_string<char> >&)':
input/code.cpp:56:36: warning: narrowing conversion of 'x' from 'int' to 'uint16_t' {aka 'short unsigned int'} [-Wnarrowing]
   56 |                     Fence fence = {x, y, z, w};
      |                                    ^
input/code.cpp:56:39: warning: narrowing conversion of 'y' from 'int' to 'uint16_t' {aka 'short unsigned int'} [-Wnarrowing]
   56 |                     Fence fence = {x, y, z, w};
      |                                       ^
input/code.cpp:56:42: warning: narrowing conversion of 'z' from 'int' to 'uint16_t' {aka 'short unsigned int'} [-Wnarrowing]
   56 |                     Fence fence = {x, y, z, w};
      |                                          ^
input/code.cpp:56:45: warning: narrowing conversion of 'w' from 'int' to 'uint16_t' {aka 'short unsigned int'} [-Wnarrowing]
   56 |                     Fence fence = {x, y, z, w};
      |...

Code

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

const int FIELD_SIZE = 500;
const int FIELD_ROW_OFFSET = FIELD_SIZE * (FIELD_SIZE + 1) / 2;

int containedFlowers = 0;





union Fence
{
    struct {
        uint16_t x;
        uint16_t y;
        uint16_t sizeX;
        uint16_t sizeY;
    };
    ll bytes;
};

void getFlowerCount(Fence fence, array<int, 26>& flowerCount, vector<vector<char>>& field)
{
    //printFence(fence);
    for (int y = 0; y < fence.sizeY; y++) {
        for (int x = 0; x < fence.sizeX; x++) {
            flowerCount[field[fence.y + y][fence.x + x]] += 1;
        }
    }
}

ll bruteForce(vector<string>& fieldText)
{
    int n = fieldText.size();
    vector<vector<char>> field = vector<vector<char>>(n, vector<char>(n));
    array<bool, 26> containedNumbers = {0};

    for (int i = 0; i < n; i++) {
        for (int k = 0; k < n; k++) {
            int number = fieldText[i][k] - 'A';
            field[i][k] = number;
            containedNumbers[number] = true;
        }
    }

    ll ans = 0;
 
    for (int x = 0; x < n; x++) {
        for (int y = 0; y < n; y++) {
            for (int z = 1; z < n - x + 1; z++) {
                for (int w = 1; w < n - y + 1; w++) {
                    Fence fence = {x, y, z, w};
                    
                    array<int, 26> flowerCount = {0};
                    getFlowerCount(fence, flowerCount, field);
                    bool hasAll = true;
                    for (int i = 0; i < 26; i++) {
                        if (containedNumbers[i] && flowerCount[i] <= 0) {
                            hasAll = false;
                            break;
                        }
                    }
                    if (hasAll) {
                        ans += 1;
                    }
                }
            }
        }
    }
    return ans;
}

void printRows(int n, int* field)
{
    for (int y = 0; y < n; y++) {
        int rowSpace = y * FIELD_ROW_OFFSET;
        int prewOrTowerSpace = rowSpace;
        int offsetTriangle = 0;

        cout << "row:\n";

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

            int orTowerSpace = rowSpace + offsetTriangle;

            for (int len = 0; len < n - x; len++) {
                cout << field[orTowerSpace + len] << " at " << (orTowerSpace + len) << "   ";
            }

            prewOrTowerSpace = orTowerSpace;
            offsetTriangle += n - x;
            cout << "\n";
        }
    }
}

ll calculateAnsBitMasks(int n, int* field)
{
    ll ans = 0;
 
    for (int y = 0; y < n; y++) {
        int rowSpace = y * FIELD_ROW_OFFSET;
        int prewOrTowerSpace = rowSpace;
        int offsetTriangle = n;

        for (int x = 1; x < n; x++) { // loop or tower spaces

            int orTowerSpace = rowSpace + offsetTriangle;

            for (int len = 0; len < n - x; len++) { // loop over or tower
                int bitMaskCombination = field[prewOrTowerSpace + len] | field[prewOrTowerSpace + len + 1];
                field[orTowerSpace + len] = bitMaskCombination;

                if (bitMaskCombination == containedFlowers) {
                    ans += 1;
                }
            }

            prewOrTowerSpace = orTowerSpace;
            offsetTriangle += n - x;
        }
    }

    //printRows(n, field);

    for (int y = 0; y < n - 1; y++) { // loop rows
        int rowSpace = y * FIELD_ROW_OFFSET;

        for (int orRowIndex = y + 1; orRowIndex < n; orRowIndex++) { // loop other rows to add to main row

            int addRowSpace = orRowIndex * FIELD_ROW_OFFSET;
            int offsetTriangle = 0;
            
            for (int x = 0; x < n; x++) { // loop orTowers

                int mainOrTowerSpace = rowSpace + offsetTriangle;
                int addOrTowerSpace = addRowSpace + offsetTriangle;

                for (int len = 0; len < n - x; len++) { // loop orTower bitmasks
                    field[mainOrTowerSpace + len] |= field[addOrTowerSpace + len];

                    if (field[mainOrTowerSpace + len] == containedFlowers) {
                        ans += 1;
                    }
                }

                offsetTriangle += n - x;
            }
        }
    }

    return ans;
}

 
void randomTest(int n)
{
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < n; k++) {
        }
    }
 
    for (int i = 0; i < 26; i++) {
    }
    for (int i = 0; i < n; i++) {
        for (int k = 0; k < n; k++) {
        }
    }
}


 
int main()
{
    //vector<string> testField = {"AAAAA", "AAAAA", "AABAA", "AAACA", "AAADA"};
    //vector<string> testField = {"BAA", "AAB", "AAA"};
    //vector<string> testField = {"Z"};
    //vector<string> testField = {"AZ", "ZA"};
    //vector<string> testField = {"AAAC", "ABAA", "ABAA", "AAAA"};
    //vector<string> testField = {"AAAAA", "AAAAA", "AAAAA", "AAAAA", "AAAAA"};
    //vector<string> testField = {"ZAAAA", "AAAAA", "AAAAA", "AAAAA", "AAAAK"};
    //vector<string> testField = {"AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA","AAAAAAAAAA",};
    //vector<string> testField = {"AUFCHGK","GXAPVWB","NUHYMEA","HSCSNSI","IMBMTJS","TPVRJUF","SIKDVWY"};

    int n;
    //n = testField.size();
    cin >> n;
    //auto begin = std::chrono::high_resolution_clock::now();
    
    // n * n(n+1) / 2
    /*int* field = new int[FIELD_SIZE * FIELD_ROW_OFFSET]{0};

    if (n == 1) {
        cout << 1;
        return 0;
    }

    for (int i = 0; i < n; i++) {
        string row;
        //row = testField[i];
        cin >> row;

        for (int k = 0; k < row.size(); k++) {

            int bitMask = 1 << (row[k] - 'A');
            field[i * FIELD_ROW_OFFSET + k] = bitMask;
            containedFlowers |= bitMask;
        }
    }*/
    //ll ans = calculateAnsBitMasks(n, field);
    //cout << ans << "\n";

    vector<string> test;
    for (int i = 0; i < n; i++) {
        string text;
        cin >> text;
        test.push_back(text);
    }
    ll bruteForceAns = bruteForce(test);
    cout << bruteForceAns;
    /*for (int i = 0; i < n; i++) {
        for (int k = 0; k < n; k++) {
            cout << field[i * FIELD_ROW_OFFSET + k] << " ";
        }
        cout << "\n";
    }*/

    //auto end = std::chrono::high_resolution_clock::now();
    //auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(end-begin).count();
    //std::cout << " ms: " << duration << "\n";
}

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

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
(empty)

Test 13

Group: 3, 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
(empty)

Test 14

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
(empty)

Test 15

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
(empty)

Test 16

Group: 4, 5, 6

Verdict: TIME LIMIT EXCEEDED

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
(empty)

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