Submission #1631272
Source Code Expand
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF (1<<30)
#define INFL (1<<62)
#define pe(str) return cout<<(str)<<endl,0
#define px(str) cout<<(str)<<endl,exit(0)
#define accu(ac,v) cout<<setprecision(ac)<<v<<endl
#define bpc(a) __builtin_popcount(a)
#define pr(str) cout<<(str)<<endl
#define prpr(str) cout<<str<<endl
#define db(str) cerr<<"debug:"<<(str)<<endl
#define dbdb(str) cerr<<"debugs:"<<str<<endl
#define re(i,n) for(int i=0;i<(n);i++)
#define rre(i,n) for(int i=(n);i>=0;i--)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b);i>=(a);i--)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
#define hello cout<<"hello"<<endl
#define spre(a) setprecision(a)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define IF(C,T,F) ((C)?(T):(F))
#define max3(a,b,c) max((a),max((b),(c)))
#define min3(a,b,c) min((a),min((b),(c)))
#define max4(a,b,c,d) max((a),max((b),max((c),(d))))
#define min4(a,b,c,d) min((a),min((b),min((c),(d))))
#define enl cout<<endl
#define declare(t,n) t n;cin>>n
#define EPS 1e-6
#define EPSIN(a,b) ((b)-EPS<=(a)&&(a)<=(b)+EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef complex<int> point;
template<class InputIterator>
void dump(InputIterator first,InputIterator last,char delim=' '){
for(InputIterator it=first;it!=last;it++){
if(it!=first)cout<<delim;
cout<<*it;
}
}
ull p(ull x,ull y){
if(y==0) return 1;
ull A=p(x,y/2)%MOD;
return (y&1?((A*A)%MOD*x)%MOD: (A*A)%MOD);
// return (y&1?((A*A)*x):(A*A));
}
template<class T>
void swp(T &a,T &b){
T t=a; a=b; b=t;
}
int main(void){
string s;
string t="";
int c=0;
ll a=0;
cin>>s;
re(i,s.size()-1){
if(s[i]=='2'&&s[i+1]=='5')t+='A',i++;
else t+='B';
}
re(i,t.size()){
if(t[i]=='A')c++;
else{
a+=(ll)c*(ll)(c+1)/2;
c=0;
}
}
a+=(ll)c*(ll)(c+1)/(ll)2;
pe(a);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - ニコニコ文字列 |
User |
takubokudori |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
2026 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
640 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
Subtask1 |
subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
1 ms |
256 KB |
subtask0_sample_02.txt |
AC |
1 ms |
256 KB |
subtask0_sample_03.txt |
AC |
1 ms |
256 KB |
subtask0_sample_04.txt |
AC |
1 ms |
256 KB |
subtask0_sample_05.txt |
AC |
1 ms |
256 KB |
subtask1_01.txt |
AC |
1 ms |
256 KB |
subtask1_02.txt |
AC |
2 ms |
256 KB |
subtask1_03.txt |
AC |
1 ms |
256 KB |
subtask1_04.txt |
AC |
2 ms |
256 KB |
subtask1_05.txt |
AC |
2 ms |
256 KB |
subtask1_06.txt |
AC |
2 ms |
256 KB |
subtask1_07.txt |
AC |
1 ms |
256 KB |
subtask1_08.txt |
AC |
1 ms |
256 KB |
subtask1_09.txt |
AC |
1 ms |
256 KB |
subtask1_10.txt |
AC |
1 ms |
256 KB |
subtask1_11.txt |
AC |
1 ms |
256 KB |
subtask1_12.txt |
AC |
1 ms |
256 KB |
subtask1_13.txt |
AC |
1 ms |
256 KB |
subtask2_01.txt |
AC |
5 ms |
512 KB |
subtask2_02.txt |
AC |
5 ms |
640 KB |
subtask2_03.txt |
AC |
5 ms |
512 KB |
subtask2_04.txt |
AC |
5 ms |
640 KB |
subtask2_05.txt |
AC |
5 ms |
512 KB |
subtask2_06.txt |
AC |
5 ms |
640 KB |
subtask2_07.txt |
AC |
5 ms |
512 KB |
subtask2_08.txt |
AC |
5 ms |
512 KB |
subtask2_09.txt |
AC |
2 ms |
256 KB |
subtask2_10.txt |
AC |
2 ms |
256 KB |
subtask2_11.txt |
AC |
2 ms |
256 KB |
subtask2_12.txt |
AC |
2 ms |
256 KB |