Submission #1631263


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';
	}
	cout<<t<<endl;
	re(i,t.size()){
		if(t[i]=='A')c++;
		else{
			a+=c*(c+1)/2;
			c=0;
		}
	}
	a+=(ll)c*(ll)(c+1)/(ll)2;
	pe(a);
	return 0;

}

Submission Info

Submission Time
Task A - プレミアム会員
User takubokudori
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2035 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 4
WA × 22
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_random09.txt, subtask1_random10.txt, subtask1_random11.txt, subtask1_random12.txt, subtask1_random13.txt, subtask1_random14.txt, subtask1_random15.txt, subtask1_random16.txt, subtask1_random17.txt, subtask1_random18.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt WA 1 ms 256 KB
subtask0_sample_02.txt WA 1 ms 256 KB
subtask0_sample_03.txt WA 1 ms 256 KB
subtask0_sample_04.txt WA 1 ms 256 KB
subtask1_random01.txt WA 1 ms 256 KB
subtask1_random02.txt WA 1 ms 256 KB
subtask1_random03.txt WA 1 ms 256 KB
subtask1_random04.txt WA 1 ms 256 KB
subtask1_random05.txt WA 1 ms 256 KB
subtask1_random06.txt WA 1 ms 256 KB
subtask1_random07.txt WA 1 ms 256 KB
subtask1_random08.txt WA 1 ms 256 KB
subtask1_random09.txt WA 1 ms 256 KB
subtask1_random10.txt WA 1 ms 256 KB
subtask1_random11.txt WA 1 ms 256 KB
subtask1_random12.txt WA 1 ms 256 KB
subtask1_random13.txt WA 1 ms 256 KB
subtask1_random14.txt WA 1 ms 256 KB
subtask1_random15.txt WA 1 ms 256 KB
subtask1_random16.txt WA 1 ms 256 KB
subtask1_random17.txt WA 1 ms 256 KB
subtask1_random18.txt WA 1 ms 256 KB