CSES - Datatähti 2025 alku - Results
Submission details
Task:Niitty
Sender:anotn
Submission time:2024-11-04 12:34:01 +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
#2ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#3ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#4ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#5ACCEPTED0.00 s1, 2, 3, 4, 5, 6details
#60.00 s2, 3, 4, 5, 6details
#70.00 s2, 3, 4, 5, 6details
#8ACCEPTED0.00 s2, 3, 4, 5, 6details
#9ACCEPTED0.00 s2, 3, 4, 5, 6details
#100.00 s3, 4, 5, 6details
#110.01 s3, 4, 5, 6details
#12ACCEPTED0.00 s3, 4, 5, 6details
#13ACCEPTED0.00 s3, 4, 5, 6details
#140.01 s4, 5, 6details
#150.01 s4, 5, 6details
#16ACCEPTED0.01 s4, 5, 6details
#17ACCEPTED0.01 s4, 5, 6details
#180.01 s5, 6details
#190.02 s5, 6details
#20ACCEPTED0.01 s5, 6details
#210.08 s5, 6details
#220.07 s6details
#230.08 s6details
#24ACCEPTED0.07 s6details
#25--6details

Code

#include <iostream>
#include <unordered_map>
using namespace std;
using ll = long long;
int tree_size = 1;
int tree_range( int* &tree, int a, int b ) {
a += tree_size;
b += tree_size;
int s = 0;
while (a <= b) {
if (a%2 == 1) s |= tree[a++];
if (b%2 == 0) s |= tree[b--];
a /= 2; b /= 2;
}
return s;
}
void tree_insert ( int* &tree, int x, int i ) {
i += tree_size;
tree[i] = x;
for ( i /= 2; i >= 1; i /= 2 )
tree[i] = tree[i*2] | tree[i*2+1];
}
int main () {
int n;
cin >> n;
while ( tree_size < n )
tree_size <<= 1;
unordered_map<char, int> flowers;
int **field = new int*[n];
int **field_vertical = new int*[n];
for ( int i = 0; i < n; ++i ) {
field[i] = new int[2*tree_size]();
field_vertical[i] = new int[2*tree_size]();
}
for ( int i = 0; i < n; ++i ) {
for ( int j = 0; j < n; j++ ) {
char c;
cin >> c;
if ( flowers.find(c) == flowers.end() )
flowers[c] = flowers.size();
tree_insert(field[i], 1<<flowers[c], j);
tree_insert(field_vertical[j], 1<<flowers[c], i);
}
}
ll count = 0;
for ( int y1 = 0; y1 < n; ++y1 ) {
int prevcounty = count;
for ( int x1 = 0; x1 < n; ++x1 ) {
int xceil = n;
int yceil = n;
int prevcountx = count;
while ( (x1 < xceil) && (y1 < yceil) ) {
int x2 = x1;
int y2 = y1;
int current = 0;
while ( y2 < yceil && current != ((1<<flowers.size())-1) )
current |= tree_range(field[y2++], x1, xceil-1);
y2 -= current == ((1<<flowers.size())-1);
if ( y2 == yceil )
break;
current = 0;
while ( x2 < xceil && current != ((1<<flowers.size())-1) )
current |= tree_range(field_vertical[x2++], y1, yceil-1);
x2 -= current == ((1<<flowers.size())-1);
if ( x2 == xceil )
break;
count += ll(xceil - x2) * ll(yceil - y2);
xceil = x2;
yceil = y2;
}
if ( (count - prevcountx) == 0 )
break;
}
if ( (count - prevcounty) == 0 )
break;
}
cout << count;
for ( int i = 0; i < n; i++ ) {
delete[] field[i];
delete[] field_vertical[i];
}
delete[] field;
delete[] field_vertical;
}

Test details

Test 1

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

Verdict:

input
10
TNCTNPNTPC
NPPNTNTPTP
NTNTTCNTCT
NPCPNPPNTT
...

correct output
2035

user output
2405

Test 2

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

Verdict: ACCEPTED

input
10
NFWQLWNWYS
DZOQJVXFPJ
CNHXPXMCQD
QRTBVNLTQC
...

correct output
9

user output
9

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

input
10
FFFFFFFFFF
FFFFFCFFFF
FFFFFFJFFF
FFFFFFFFFF
...

correct output
12

user output
12

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
42433

Test 7

Group: 2, 3, 4, 5, 6

Verdict:

input
20
CBGLSHGZHYZDWBNDBJUG
SMUXOJQYPXZDTMJUIWOJ
XIDSTNBGHKRKOVUVMINB
MTQGCFRUHQKALXRNCQGS
...

correct output
8334

user output
9987

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

input
20
AAAAAAAAXAAAAAAAAAAA
AAAWAAAAAAAAAAAAAOAA
AAAAAAAAAAAAAAAAAPAA
AAAAAAAAKAAAAAAAAAAZ
...

correct output
18

user output
18

Test 10

Group: 3, 4, 5, 6

Verdict:

input
50
GRGREEEGREGXRXXEGXXREXGRRRGRRR...

correct output
1584665

user output
1619869

Test 11

Group: 3, 4, 5, 6

Verdict:

input
50
AITIISJUHCCRZNKSDCNQKYSQRINFWJ...

correct output
1077746

user output
1271028

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

input
50
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF...

correct output
1680

user output
1680

Test 14

Group: 4, 5, 6

Verdict:

input
100
NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM...

correct output
25325366

user output
25491357

Test 15

Group: 4, 5, 6

Verdict:

input
100
LIMQQIHASECROEVILNVULGWZJPPKOG...

correct output
22342463

user output
24190994

Test 16

Group: 4, 5, 6

Verdict: ACCEPTED

input
100
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTT...

correct output
25502500

user output
25502500

Test 17

Group: 4, 5, 6

Verdict: ACCEPTED

input
100
QXQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
25650

user output
25650

Test 18

Group: 5, 6

Verdict:

input
200
NAANANMMKNKKAKMKMAKNKMNKMMNNAA...

correct output
403292767

user output
403986982

Test 19

Group: 5, 6

Verdict:

input
200
OMYWATTLURKQPTKEFMGGYAOONXWVSC...

correct output
388111321

user output
400408234

Test 20

Group: 5, 6

Verdict: ACCEPTED

input
200
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC...

correct output
404010000

user output
404010000

Test 21

Group: 5, 6

Verdict:

input
200
LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL...

correct output
14159445

user output
15308988

Test 22

Group: 6

Verdict:

input
500
VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW...

correct output
15683003812

user output
15687507714

Test 23

Group: 6

Verdict:

input
500
OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE...

correct output
15575906951

user output
15678876262

Test 24

Group: 6

Verdict: ACCEPTED

input
500
IIIIIIIIIIIIIIIIIIIIIIIIIIIIII...

correct output
15687562500

user output
15687562500

Test 25

Group: 6

Verdict:

input
500
WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW...

correct output
3058970930

user output
(empty)