CSES - Datatähti 2025 alku

Submission details
Task:	Niitty
Sender:	Pikaksi
Submission time:	2024-11-10 13:20:57 +0200
Language:	C++ (C++11)
Status:	READY
Result:	58

Feedback
group	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	group
#1	ACCEPTED	0.19 s	1, 2, 3, 4, 5, 6	details
#2	ACCEPTED	0.18 s	1, 2, 3, 4, 5, 6	details
#3	ACCEPTED	0.18 s	1, 2, 3, 4, 5, 6	details
#4	ACCEPTED	0.18 s	1, 2, 3, 4, 5, 6	details
#5	ACCEPTED	0.19 s	1, 2, 3, 4, 5, 6	details
#6	ACCEPTED	0.19 s	2, 3, 4, 5, 6	details
#7	ACCEPTED	0.18 s	2, 3, 4, 5, 6	details
#8	ACCEPTED	0.19 s	2, 3, 4, 5, 6	details
#9	ACCEPTED	0.19 s	2, 3, 4, 5, 6	details
#10	ACCEPTED	0.19 s	3, 4, 5, 6	details
#11	ACCEPTED	0.19 s	3, 4, 5, 6	details
#12	ACCEPTED	0.19 s	3, 4, 5, 6	details
#13	ACCEPTED	0.18 s	3, 4, 5, 6	details
#14	ACCEPTED	0.19 s	4, 5, 6	details
#15	ACCEPTED	0.20 s	4, 5, 6	details
#16	ACCEPTED	0.19 s	4, 5, 6	details
#17	ACCEPTED	0.19 s	4, 5, 6	details
#18	ACCEPTED	0.21 s	5, 6	details
#19	ACCEPTED	0.25 s	5, 6	details
#20	ACCEPTED	0.21 s	5, 6	details
#21	ACCEPTED	0.25 s	5, 6	details
#22	ACCEPTED	0.58 s	6	details
#23	ACCEPTED	0.91 s	6	details
#24	ACCEPTED	0.54 s	6	details
#25	TIME LIMIT EXCEEDED	--	6	details

Compiler report

input/code.cpp: In function 'void printRows(int, unsigned int*)':
input/code.cpp:13:13: warning: variable 'prewOrTowerSpace' set but not used [-Wunused-but-set-variable]
   13 |         int prewOrTowerSpace = rowSpace;
      |             ^~~~~~~~~~~~~~~~
input/code.cpp: In function 'long long unsigned int calculateAnsBitMasks(unsigned int, unsigned int*, unsigned int)':
input/code.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'const unsigned int' [-Wsign-compare]
   42 |     for (int y = 0; y < n; y++) {
      |                     ~~^~~
input/code.cpp:68:40: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'const int' [-Wsign-compare]
   68 |         for (unsigned int len = 0; len < nTriangleSize; len++) { // loop orTower bitmasks
      |                                    ~~~~^~~~~~~~~~~~~~~
input/code.cpp:72:53: warning: comparison of integer expressions of different signedness: 'int' and 'const unsign...

Code

#include <bits/stdc++.h>
 
using namespace std;
typedef long long ll;
 
const unsigned int FIELD_SIZE = 500;
const unsigned int FIELD_ROW_OFFSET = FIELD_SIZE * (FIELD_SIZE + 1) / 2;
 
void printRows(int n, unsigned 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";
        }
    }
}
 
unsigned long long calculateAnsBitMasks(const unsigned int n, unsigned int* const field, const unsigned int containedFlowers)
{
    unsigned long long ans = 0;
    const int nTriangleSize = n * (n + 1) / 2;
 
    if (__builtin_popcount(containedFlowers) == 1) {
        ans += n * n;
    }
 
    for (int y = 0; y < n; y++) {
        unsigned int rowSpace = y * FIELD_ROW_OFFSET;
        unsigned int prewOrTowerSpace = rowSpace;
        unsigned int offsetTriangle = n;
 
        for (unsigned int x = 1; x < n; x++) { // loop or tower spaces
 
            unsigned int orTowerSpace = rowSpace + offsetTriangle;
 
            for (unsigned int len = 0; len < n - x; len++) { // loop over or tower
                unsigned int bitMaskCombination = field[prewOrTowerSpace + len] | field[prewOrTowerSpace + len + 1];
                field[orTowerSpace + len] = bitMaskCombination;
 
                ans += bitMaskCombination == containedFlowers;
            }
 
            prewOrTowerSpace = orTowerSpace;
            offsetTriangle += n - x;
        }
    }
 
    //printRows(n, field);
 
    for (unsigned int y = 0; y < n - 1; y++) { // loop rows
        unsigned int rowSpace = y * FIELD_ROW_OFFSET;
 
        for (unsigned int len = 0; len < nTriangleSize; len++) { // loop orTower bitmasks

            unsigned int bitmaskTriangles = field[rowSpace + len];

            for (int orRowIndex = y + 1; orRowIndex < n; orRowIndex++) { // loop other rows to add to main row
 
                unsigned int addRowSpace = orRowIndex * FIELD_ROW_OFFSET;
            
                //cout << "started or triangle\n";
                //cout << "main or tower = " << (mainOrTowerSpace + len) << " add or tower " << (addOrTowerSpace + len) << "\n";
                //__builtin_prefetch(field + addRowSpace + FIELD_ROW_OFFSET + len);
                bitmaskTriangles |= field[addRowSpace + len];
 
                ans += bitmaskTriangles == containedFlowers;
            }
        }
    }
 
    return ans;
}
 
unsigned long long calculateAnsBitMasksFast(const unsigned int n, unsigned int* const field, const unsigned int containedFlowers)
{
    unsigned long long ans = 0;
    const int nTriangleSize = n * (n + 1) / 2;
    unsigned int* calculatedDepth = new unsigned int[nTriangleSize];
 
    if (__builtin_popcount(containedFlowers) == 1) {
        ans += n * n;
    }
 
    for (int y = 0; y < n; y++) {
        unsigned int rowSpace = y * FIELD_ROW_OFFSET;
        unsigned int prewOrTowerSpace = rowSpace;
        unsigned int offsetTriangle = n;
 
        for (unsigned int x = 1; x < n; x++) { // loop or tower spaces
 
            unsigned int orTowerSpace = rowSpace + offsetTriangle;
 
            for (unsigned int len = 0; len < n - x; len++) { // loop over or tower
                unsigned int bitMaskCombination = field[prewOrTowerSpace + len] | field[prewOrTowerSpace + len + 1];
                field[orTowerSpace + len] = bitMaskCombination;
 
                ans += bitMaskCombination == containedFlowers;
            }
 
            prewOrTowerSpace = orTowerSpace;
            offsetTriangle += n - x;
        }
    }
 
    //printRows(n, field);cout << "\n";
    //cout << "ans at start = " << ans << "\n"; 
 
    for (unsigned int y = 0; y < n - 1; y++) { // loop rows
        unsigned int rowSpace = y * FIELD_ROW_OFFSET;

        for (int i = 0; i < nTriangleSize; i++) {
            calculatedDepth[i] = y;
        }
        for (int orRowIndex = y + 1; orRowIndex < n; orRowIndex++) { // loop other rows to add to main row

            int triangleTraverser = 0;
            int currentOrTower = 0;
            int currentOrTowerIndex = 0;
            //cout << "\nstarting triangle y = " << y << " add row = " << orRowIndex << "\n";

            while (true) {
                //cout << "triangle traverser = " << triangleTraverser << " current orTower = " << currentOrTower << " index in orTower = " << currentOrTowerIndex << "\n";

                int depth = calculatedDepth[triangleTraverser];
                //cout << "depth = " << depth << " ";
                for (int i = depth + 1; i <= orRowIndex; i++) {
                    //cout << i << " ";
                    field[rowSpace + triangleTraverser] |= field[i * FIELD_ROW_OFFSET + triangleTraverser];
                }
                calculatedDepth[triangleTraverser] = orRowIndex;

                int flowers = field[rowSpace + triangleTraverser];
                //cout << " flowers = " << flowers << " at = " << (rowSpace + triangleTraverser) << " ";

                if (flowers == containedFlowers) {
                    ans += n - currentOrTower - currentOrTowerIndex;

                    if (currentOrTower == 0) {
                        //cout << "valid at tower = 0\n";
                        if (triangleTraverser == n - 1) {
                            break;
                        }
                        currentOrTowerIndex += 1;
                        triangleTraverser += 1;
                    }
                    else {
                        //cout << "valid at tower >= 1\n";
                        triangleTraverser -= n - currentOrTower;
                        currentOrTower -= 1;
                        currentOrTowerIndex += 1;
                    }
                }
                else {
                    //cout << "not valid\n";
                    if (currentOrTowerIndex == n - currentOrTower - 1) {
                        break;
                    }
                    triangleTraverser += n - currentOrTower;
                    currentOrTower += 1;
                }
            }
            //cout << "ans = " << ans << "\n";
        }
    }

    return ans;
}
 
void shuffle(int n, vector<string>& testField)
{
    testField = vector<string>(n);
    for (int i = 0; i < n; i++) {
        string row = "";
        for (int k = 0; k < n; k++) {
            row += rand() % 26 + 'A';
        }
        //cout << "row = " << row << "\n";
        testField[i] = row;
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //vector<string> testField = {"AAAAA", "AAAAA", "AABAA", "AAACA", "AAADA"};
    //vector<string> testField = {"BAA", "AAB", "AAA"};
    //vector<string> testField = {"Z"};
    //vector<string> testField = {"BC", "AA"};
    //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"};
 
    //vector<string> testField; shuffle(200, testField);


    unsigned int n;
    //n = testField.size();
    cin >> n;
    //auto begin = std::chrono::high_resolution_clock::now();

    // n * n(n+1) / 2
    unsigned int* field = new unsigned int[FIELD_SIZE * FIELD_ROW_OFFSET]{0};
    
    char input[FIELD_SIZE + 1] = {0};
    int containedFlowers = 0;
    for (int i = 0; i < n; i++) {
        //string row = testField[i];
        //scanf("%s", input);
        //gets(input);
        string row; cin >> row;
        //getline(cin, row);
        
        //cout << row << "\n";
        //printf("%s", input);
 
        int rowSpace = i * FIELD_ROW_OFFSET;
        for (int k = 0; k < n; k++) {
            //cout << input[k];
            int bitMask = 1 << (row[k] - 'A');
            field[rowSpace + k] = bitMask;
            containedFlowers |= bitMask;
        }
    }
    //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";
    ll ans = calculateAnsBitMasksFast(n, field, containedFlowers);
    cout << ans;
}

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

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
`388111321` view save

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

input
`500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...` view save

correct output
`15683003812` view save

user output
`15683003812` view save

Test 23

Group: 6

Verdict: ACCEPTED

input
`500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...` view save

correct output
`15575906951` view save

user output
`15575906951` view save

Test 24

Group: 6

Verdict: ACCEPTED

input
`500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...` view save

correct output
`15687562500` view save

user output
`15687562500` view save

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)