1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; long long n,r[4005],g[4005],b[4005],ans; string s; int main() { cin>>n>>s; s='0'+s; for(int i=1;i<=n;i++) { r[i]=r[i-1],g[i]=g[i-1],b[i]=b[i-1]; if(s[i]=='R')r[i]++; if(s[i]=='G')g[i]++; if(s[i]=='B')b[i]++; } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i+j>n)continue; long long k1=i+j,k2=i+2*j,sum=0; if(s[i]=='R' && s[k1]=='G' || s[i]=='G' && s[k1]=='R')sum+=b[n]-b[k1]; if(s[i]=='R' && s[k1]=='B' || s[i]=='B' && s[k1]=='R')sum+=g[n]-g[k1]; if(s[i]=='B' && s[k1]=='G' || s[i]=='G' && s[k1]=='B')sum+=r[n]-r[k1]; if(s[k2]!=s[k1] && s[k2]!=s[i] && s[k1]!=s[i] && k2<=n)sum--; if(sum>0)ans+=sum; } }cout<<ans; return 0; }
- 1
Information
- ID
- 758
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 3
- Accepted
- 2
- Uploaded By