CSES - Datatähti 2025 alku - Results
Submission details
Task:Niitty
Sender:Hattless
Submission time:2024-11-03 11:28:04 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
#60
Test results
testverdicttimegroup
#10.00 s1, 2, 3, 4, 5, 6details
#20.01 s1, 2, 3, 4, 5, 6details
#3ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#40.00 s1, 2, 3, 4, 5, 6details
#5ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#60.01 s2, 3, 4, 5, 6details
#70.02 s2, 3, 4, 5, 6details
#8ACCEPTED0.00 s2, 3, 4, 5, 6details
#90.01 s2, 3, 4, 5, 6details
#100.03 s3, 4, 5, 6details
#110.20 s3, 4, 5, 6details
#12ACCEPTED0.01 s3, 4, 5, 6details
#130.27 s3, 4, 5, 6details
#140.33 s4, 5, 6details
#15--4, 5, 6details
#16ACCEPTED0.07 s4, 5, 6details
#17--4, 5, 6details
#18--5, 6details
#19--5, 6details
#20--5, 6details
#21--5, 6details
#22--6details
#23--6details
#24--6details
#25--6details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:67:30: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   67 |             if(types.find(d) == -1) {
      |                ~~~~~~~~~~~~~~^~~~~

Code

#include <bits/stdc++.h>
#define ln "\n"
using namespace std;
using ll = long long;
int n;
int ans = 0;
string types = "";
vector<string> vec;

void countSides(int side,int startX, int startY, map<char,int> table) {
        bool hasAll = true;
        map<char,bool> missingY;
        pair<int,int> amountMissing = {0,0};
        pair<int,int> dif = {n-side-startY,n-side-startX};
        for(char v: types) {
            if(table[v] == 0) {
                hasAll = false;
                if(!missingY[v]) {
                    amountMissing.first++;
                    amountMissing.second++;
                }
                missingY[v] = true;
            }
        }
        if(hasAll) {
            ans++;
            ans += dif.first;
            ans += dif.second;
        } else {
            map<char,bool> missingX = missingY;
            while(amountMissing.first > 0 && dif.first >= 0) {
                dif.first--;
                int xAxis = side + startX-1;
                for(int i = startY; i < side+startY; i++) {
                    char val = vec[i][xAxis];
                    if(missingX[val]) {
                        missingX[val] = false;
                        amountMissing.first--;
                    }
                }
            }
            while(amountMissing.second > 0 && dif.second>= 0) {
                dif.second--;
                int yAxis = side + startY-1;
                for(int i = startX; i < side + startX; i++) {

                    char val = vec[yAxis][i];
                    if(missingY[val]) {
                        missingY[val] = false;
                        amountMissing.second--;
                    }
                }
            }
            ans += dif.first+1;
            ans += dif.second+1;
        }
}

int main() {
    cin >> n;
    vec.resize(n);
    for(int i = 0; i < n; i++) {
        cin >> vec[i];
    }
    for(int i = 0; i < n; i++) {
        for(char d:vec[i]) {
            if(types.find(d) == -1) {
                types += d;
            }
        }
    }

    for(int side = n; side > 0; side--) {
        map<char,int> table;
        for(int i = 0; i < side; i++) {
            for(int j = 0; j < side; j++) {
                table[vec[i][j]]++;
            }
        }
        map<char,int> temp = table;
        for(int i = 0; i <= n-side; i++) {
            for(int j = 0; j <= n-side; j++) {
                countSides(side,i,j,temp);
                if(j < n-side) {
                    for(int v = i; v < side+i; v++) {
                        temp[vec[v][j]]--;
                    }
                    for(int v = i; v < side+i; v++) {
                        temp[vec[v][j+side]]++;
                    }
                }
            }
            if(i < n-side) {
                for(int j = 0; j < side; j++) {
                    table[vec[i][j]]--;
                }
                for(int j = 0; j < side; j++) {
                    table[vec[i+side][j]]++;
                }
                temp = table;
            }
        }

    }
    cout << ans << ln;
}

Test details

Test 1

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

Verdict:

input
10
TNCTNPNTPC
NPPNTNTPTP
NTNTTCNTCT
NPCPNPPNTT
...

correct output
2035

user output
1589

Test 2

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

Verdict:

input
10
NFWQLWNWYS
DZOQJVXFPJ
CNHXPXMCQD
QRTBVNLTQC
...

correct output
9

user output
11

Test 3

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

Verdict: ACCEPTED

input
10
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
XXXXXXXXXX
...

correct output
3025

user output
3025

Test 4

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

Verdict:

input
10
FFFFFFFFFF
FFFFFCFFFF
FFFFFFJFFF
FFFFFFFFFF
...

correct output
12

user output
7

Test 5

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

Verdict: ACCEPTED

input
1
X

correct output
1

user output
1

Test 6

Group: 2, 3, 4, 5, 6

Verdict:

input
20
BBCBUBOUOBBCUUBBCOUO
BOUCOOCUBCOOOCOBOCUO
UCCUUUOBCOCBCBUBUCOO
BUOBUCUCUOOBCOOUBUOO
...

correct output
38724

user output
30915

Test 7

Group: 2, 3, 4, 5, 6

Verdict:

input
20
CBGLSHGZHYZDWBNDBJUG
SMUXOJQYPXZDTMJUIWOJ
XIDSTNBGHKRKOVUVMINB
MTQGCFRUHQKALXRNCQGS
...

correct output
8334

user output
4868

Test 8

Group: 2, 3, 4, 5, 6

Verdict: ACCEPTED

input
20
KKKKKKKKKKKKKKKKKKKK
KKKKKKKKKKKKKKKKKKKK
KKKKKKKKKKKKKKKKKKKK
KKKKKKKKKKKKKKKKKKKK
...

correct output
44100

user output
44100

Test 9

Group: 2, 3, 4, 5, 6

Verdict:

input
20
AAAAAAAAXAAAAAAAAAAA
AAAWAAAAAAAAAAAAAOAA
AAAAAAAAAAAAAAAAAPAA
AAAAAAAAKAAAAAAAAAAZ
...

correct output
18

user output
15

Test 10

Group: 3, 4, 5, 6

Verdict:

input
50
GRGREEEGREGXRXXEGXXREXGRRRGRRR...

correct output
1584665

user output
1411022

Test 11

Group: 3, 4, 5, 6

Verdict:

input
50
AITIISJUHCCRZNKSDCNQKYSQRINFWJ...

correct output
1077746

user output
742547

Test 12

Group: 3, 4, 5, 6

Verdict: ACCEPTED

input
50
OOOOOOOOOOOOOOOOOOOOOOOOOOOOOO...

correct output
1625625

user output
1625625

Test 13

Group: 3, 4, 5, 6

Verdict:

input
50
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...

correct output
1680

user output
1191

Test 14

Group: 4, 5, 6

Verdict:

input
100
NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...

correct output
25325366

user output
23743973

Test 15

Group: 4, 5, 6

Verdict:

input
100
LIMQQIHASECROEVILNVULGWZJPPKOG...

correct output
22342463

user output
(empty)

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

input
100
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...

correct output
25502500

user output
25502500

Test 17

Group: 4, 5, 6

Verdict:

input
100
QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
25650

user output
(empty)

Test 18

Group: 5, 6

Verdict:

input
200
NAANANMMKNKKAKMKMAKNKMNKMMNNAA...

correct output
403292767

user output
(empty)

Test 19

Group: 5, 6

Verdict:

input
200
OMYWATTLURKQPTKEFMGGYAOONXWVSC...

correct output
388111321

user output
(empty)

Test 20

Group: 5, 6

Verdict:

input
200
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...

correct output
404010000

user output
(empty)

Test 21

Group: 5, 6

Verdict:

input
200
LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...

correct output
14159445

user output
(empty)

Test 22

Group: 6

Verdict:

input
500
VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...

correct output
15683003812

user output
(empty)

Test 23

Group: 6

Verdict:

input
500
OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...

correct output
15575906951

user output
(empty)

Test 24

Group: 6

Verdict:

input
500
IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...

correct output
15687562500

user output
(empty)

Test 25

Group: 6

Verdict:

input
500
WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...

correct output
3058970930

user output
(empty)