| Task: | Niitty |
| Sender: | a256 |
| Submission time: | 2024-10-29 22:09:22 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 58 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 4 |
| #2 | ACCEPTED | 6 |
| #3 | ACCEPTED | 10 |
| #4 | ACCEPTED | 13 |
| #5 | ACCEPTED | 25 |
| #6 | TIME LIMIT EXCEEDED | 0 |
| 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.00 s | 2, 3, 4, 5, 6 | details |
| #7 | ACCEPTED | 0.01 s | 2, 3, 4, 5, 6 | details |
| #8 | ACCEPTED | 0.00 s | 2, 3, 4, 5, 6 | details |
| #9 | ACCEPTED | 0.00 s | 2, 3, 4, 5, 6 | details |
| #10 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details |
| #11 | ACCEPTED | 0.03 s | 3, 4, 5, 6 | details |
| #12 | ACCEPTED | 0.00 s | 3, 4, 5, 6 | details |
| #13 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details |
| #14 | ACCEPTED | 0.01 s | 4, 5, 6 | details |
| #15 | ACCEPTED | 0.13 s | 4, 5, 6 | details |
| #16 | ACCEPTED | 0.01 s | 4, 5, 6 | details |
| #17 | ACCEPTED | 0.04 s | 4, 5, 6 | details |
| #18 | ACCEPTED | 0.04 s | 5, 6 | details |
| #19 | ACCEPTED | 0.55 s | 5, 6 | details |
| #20 | ACCEPTED | 0.01 s | 5, 6 | details |
| #21 | ACCEPTED | 0.18 s | 5, 6 | details |
| #22 | ACCEPTED | 0.22 s | 6 | details |
| #23 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #24 | ACCEPTED | 0.05 s | 6 | details |
| #25 | TIME LIMIT EXCEEDED | -- | 6 | details |
Code
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define P pair<int,int>
#define S second
#define F first
#define N 501
int n,C[26],d[N][N][26],A;
string s[N];
ll r;
vector<P> v[26];
set<P> w;
static int maxv(int c,int j){
int m=0;
for(int d=0;d<26;++d){
if(!C[d]||c==d) continue;
auto it=lower_bound(v[d].rbegin(),v[d].rend(),j,[](P &a,int b){
return a.S>b;
});
if(it==v[d].rend()) continue;
m=max(m,it->F);
}
return m;
}
static int in(int c,int a){
int m=INT_MAX;
for(int d=0;d<26;++d){
if(!C[d]||c==d) continue;
auto it=lower_bound(v[d].begin(),v[d].end(),make_pair(a,0),[](P &a,P b){
return a.F<b.F;
});
if(it==v[d].end()) continue;
m=min(it->S,m);
}
return m;
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n;
for(int i=0;i<n;++i) cin>>s[i];
for(int i=0;i<n;++i){
for(int e:s[i]) C[e-'A']=1;
}
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j){
for(int c=0;c<26;++c){
if(s[i-1][j-1]-'A'==c) continue;
d[i][j][c]=d[i-1][j][c]+1;
}
}
}
for(int i=1;i<=n;++i){
w.clear();
w.insert({0,0});
for(int c=0;c<26;++c){
if(!C[c]) continue;
v[c].clear();
v[c].push_back({0,0});
}
A=0;
for(int j=1;j<=n;++j){
int z=0;
for(int c=0;c<26;++c){
if(!C[c]) continue;
int h=d[i][j][c];
z=max(h,z);
int k=j;
while(v[c].size()&&v[c].back().F>=h){
auto p=v[c].back();
int l=p.S;
int mv=max(h,maxv(c,l));
while(mv<p.F&&l<k){
int r=min(k,in(c,mv+1));
if(r<=l){
//cerr<<"EITOIMI\n";
return 1;
}
A-=(r-l)*(p.F-mv);
l=r;
mv=max(h,maxv(c,l));
}
k=p.S;
v[c].pop_back();
}
v[c].push_back({h,k});
}
A+=z;
r+=A;
}
//cerr<<r<<'\n';
}
//cerr<<r<<'\n';
r=(ll)n*n*(n+1)*(n+1)/4-r;
cout<<r<<'\n';
}
Test details
Test 1
Group: 1, 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 10 TNCTNPNTPC NPPNTNTPTP NTNTTCNTCT NPCPNPPNTT ... |
| correct output |
|---|
| 2035 |
| user output |
|---|
| 2035 |
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: ACCEPTED
| input |
|---|
| 20 BBCBUBOUOBBCUUBBCOUO BOUCOOCUBCOOOCOBOCUO UCCUUUOBCOCBCBUBUCOO BUOBUCUCUOOBCOOUBUOO ... |
| correct output |
|---|
| 38724 |
| user output |
|---|
| 38724 |
Test 7
Group: 2, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 20 CBGLSHGZHYZDWBNDBJUG SMUXOJQYPXZDTMJUIWOJ XIDSTNBGHKRKOVUVMINB MTQGCFRUHQKALXRNCQGS ... |
| correct output |
|---|
| 8334 |
| user output |
|---|
| 8334 |
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: ACCEPTED
| input |
|---|
| 50 GRGREEEGREGXRXXEGXXREXGRRRGRRR... |
| correct output |
|---|
| 1584665 |
| user output |
|---|
| 1584665 |
Test 11
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 50 AITIISJUHCCRZNKSDCNQKYSQRINFWJ... |
| correct output |
|---|
| 1077746 |
| user output |
|---|
| 1077746 |
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: ACCEPTED
| input |
|---|
| 100 NNCMDCDDCCNNNDNCMMNCDCDCCDCDNM... |
| correct output |
|---|
| 25325366 |
| user output |
|---|
| 25325366 |
Test 15
Group: 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 100 LIMQQIHASECROEVILNVULGWZJPPKOG... |
| correct output |
|---|
| 22342463 |
| user output |
|---|
| 22342463 |
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: ACCEPTED
| input |
|---|
| 200 NAANANMMKNKKAKMKMAKNKMNKMMNNAA... |
| correct output |
|---|
| 403292767 |
| user output |
|---|
| 403292767 |
Test 19
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 200 OMYWATTLURKQPTKEFMGGYAOONXWVSC... |
| correct output |
|---|
| 388111321 |
| user output |
|---|
| 388111321 |
Test 20
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 200 CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC... |
| correct output |
|---|
| 404010000 |
| user output |
|---|
| 404010000 |
Test 21
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 200 LLLLLLLLLLLLLLLLLHLLLLLLLLLLLL... |
| correct output |
|---|
| 14159445 |
| user output |
|---|
| 14159445 |
Test 22
Group: 6
Verdict: ACCEPTED
| input |
|---|
| 500 VVHWVUHVHUWWWVUUUWVUUHUUWHWUVW... |
| correct output |
|---|
| 15683003812 |
| user output |
|---|
| 15683003812 |
Test 23
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 OIMZGEQSBMBDSDXSWRFNKSGFEBBTJE... |
| correct output |
|---|
| 15575906951 |
| user output |
|---|
| (empty) |
Test 24
Group: 6
Verdict: ACCEPTED
| input |
|---|
| 500 IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
| correct output |
|---|
| 15687562500 |
| user output |
|---|
| 15687562500 |
Test 25
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 WWWWWWWWWWWWWWWWWWWWWWWWWWWWWW... |
| correct output |
|---|
| 3058970930 |
| user output |
|---|
| (empty) |
