CSES - Datatähti 2025 alku

CSES - Datatähti 2025 alku - Results

Submission details
Task:	Niitty
Sender:	Pikaksi
Submission time:	2024-11-09 16:35:19 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0
#5	WRONG ANSWER	0
#6	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.19 s	1, 2, 3, 4, 5, 6	details
#2	WRONG ANSWER	0.19 s	1, 2, 3, 4, 5, 6	details
#3	WRONG ANSWER	0.19 s	1, 2, 3, 4, 5, 6	details
#4	WRONG ANSWER	0.19 s	1, 2, 3, 4, 5, 6	details
#5	WRONG ANSWER	0.19 s	1, 2, 3, 4, 5, 6	details
#6	WRONG ANSWER	0.19 s	2, 3, 4, 5, 6	details
#7	WRONG ANSWER	0.19 s	2, 3, 4, 5, 6	details
#8	WRONG ANSWER	0.19 s	2, 3, 4, 5, 6	details
#9	WRONG ANSWER	0.19 s	2, 3, 4, 5, 6	details
#10	WRONG ANSWER	0.20 s	3, 4, 5, 6	details
#11	WRONG ANSWER	0.19 s	3, 4, 5, 6	details
#12	WRONG ANSWER	0.20 s	3, 4, 5, 6	details
#13	WRONG ANSWER	0.19 s	3, 4, 5, 6	details
#14	WRONG ANSWER	0.22 s	4, 5, 6	details
#15	WRONG ANSWER	0.22 s	4, 5, 6	details
#16	WRONG ANSWER	0.22 s	4, 5, 6	details
#17	WRONG ANSWER	0.22 s	4, 5, 6	details
#18	WRONG ANSWER	0.69 s	5, 6	details
#19	WRONG ANSWER	0.69 s	5, 6	details
#20	WRONG ANSWER	0.69 s	5, 6	details
#21	WRONG ANSWER	0.69 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

Compiler report

input/code.cpp: In function 'void printRows(int, 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:49: warning: comparison of integer expressions of different signedness: 'int' and 'const unsigned int' [-Wsign-compare]
   68 |         for (int orRowIndex = y + 1; orRowIndex < n; orRowIndex++) { // loop other rows to add to main row
      |                                      ~~~~~~~~~~~^~~
input/code.cpp:73:44: warning: comparison of integer expressions of different signedness: 'unsigned int' and...

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, 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 (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";
            for (unsigned int len = 0; len < nTriangleSize; len++) { // loop orTower bitmasks
                //cout << "main or tower = " << (mainOrTowerSpace + len) << " add or tower " << (addOrTowerSpace + len) << "\n";
                field[rowSpace + len] |= field[addRowSpace + len];

                ans += field[rowSpace + len] == containedFlowers;
            }
        }
    }

    return ans;
}
 
unsigned long long calculateAnsBitMasksOther(const unsigned int n, unsigned int* const field, const unsigned int containedFlowers)
{
    unsigned long long ans = 0;
 
    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 (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];
 
                    ans += field[mainOrTowerSpace + len] == containedFlowers;
                }
 
                offsetTriangle += n - x;
            }
        }
    }

    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() % 1 + 'A';
        }
        //cout << "row = " << row << "\n";
        testField[i] = row;
    }
}
 
int main()
{
    //vector<string> testField = {"AAAAA", "AAAAA", "AABAA", "AAACA", "AAADA"};
    //vector<string> testField = {"BAA", "AAB", "AAA"};
    //vector<string> testField = {"Z"};
    //vector<string> testField = {"AA", "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(500, 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};
 
    int containedFlowers = 0;
    for (int i = 0; i < n; i++) {
        string row;
        //row = testField[i];
        //cout << row << "\n";
        cin >> row;
 
        int rowSpace = i * FIELD_ROW_OFFSET;
        for (int k = 0; k < row.size(); k++) {
 
            int bitMask = 1 << (row[k] - 'A');
            field[rowSpace + k] = bitMask;
            containedFlowers |= bitMask;
        }
    }
    auto end = std::chrono::high_resolution_clock::now();
    ll ans = calculateAnsBitMasksOther(n, field, containedFlowers);
    cout << ans;
 
    /*vector<string> test;
    for (int i = 0; i < n; i++) {
        string text;
        cin >> text;
        test.push_back(text);
    }*/
    //cout << "\n";
    //ll bruteForceAns = bruteForce(testField);
    //cout << bruteForceAns;
 
    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: WRONG ANSWER

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

correct output
`2035` view save

user output
`2035 ms: 161` view save

Test 2

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

Verdict: WRONG ANSWER

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

correct output
`9` view save

user output
`9 ms: 160` view save

Test 3

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

Verdict: WRONG ANSWER

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

correct output
`3025` view save

user output
`3025 ms: 159` view save

Test 4

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

Verdict: WRONG ANSWER

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

correct output
`12` view save

user output
`12 ms: 161` view save

Test 5

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

Verdict: WRONG ANSWER

input
`1 X` view save

correct output
`1` view save

user output
`1 ms: 160` view save

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

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

correct output
`38724` view save

user output
`38724 ms: 161` view save

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

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

correct output
`8334` view save

user output
`8334 ms: 160` view save

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

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

correct output
`44100` view save

user output
`44100 ms: 160` view save

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

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

correct output
`18` view save

user output
`18 ms: 161` view save

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 GRGREEEGREGXRXXEGXXREXGRRRGRRR...` view save

correct output
`1584665` view save

user output
`1584665 ms: 161` view save

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ...` view save

correct output
`1077746` view save

user output
`1077746 ms: 159` view save

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...` view save

correct output
`1625625` view save

user output
`1625625 ms: 163` view save

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

input
`50 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...` view save

correct output
`1680` view save

user output
`1680 ms: 163` view save

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...` view save

correct output
`25325366` view save

user output
`25325366 ms: 160` view save

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 LIMQQIHASECROEVILNVULGWZJPPKOG...` view save

correct output
`22342463` view save

user output
`22342463 ms: 160` view save

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...` view save

correct output
`25502500` view save

user output
`25502500 ms: 160` view save

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

input
`100 QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...` view save

correct output
`25650` view save

user output
`25650 ms: 160` view save

Test 18

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA...` view save

correct output
`403292767` view save

user output
`403292767 ms: 164` view save

Test 19

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 OMYWATTLURKQPTKEFMGGYAOONXWVSC...` view save

correct output
`388111321` view save

user output
`388111321 ms: 161` view save

Test 20

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...` view save

correct output
`404010000` view save

user output
`404010000 ms: 163` view save

Test 21

Group: 5, 6

Verdict: WRONG ANSWER

input
`200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...` view save

correct output
`14159445` view save

user output
`14159445 ms: 163` 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

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)