Submission #1026852


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
typedef long long ll;

const int MAX_S_LEN=1e5;

char S[MAX_S_LEN+1];


int len;
ll tri[MAX_S_LEN/2+1];

int findNico(int x){
	int res=0;
	while(x<len-1 && S[x]=='2' && S[x+1]=='5'){
		x+=2;
		res++;
	}
	return res;
}

int main(){
	scanf("%s",S);
	len=strlen(S);
	tri[1]=1;
	FOR(i,2,len/2+1){
		tri[i]=tri[i-1]+i;
	}
	ll ans=0;
	REP(i,len){
		if (i<len-1 && S[i]=='2' && S[i+1]=='5'){
			int l=findNico(i);
			ans+=tri[l];
			i+=2*l;
			i--;
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User addeight
Language C++ (G++ 4.6.4)
Score 100
Code Size 645 Byte
Status AC
Exec Time 21 ms
Memory 1308 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 5
AC × 18
AC × 30
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 20 ms 796 KB
subtask0_sample_02.txt AC 19 ms 792 KB
subtask0_sample_03.txt AC 17 ms 796 KB
subtask0_sample_04.txt AC 19 ms 964 KB
subtask0_sample_05.txt AC 17 ms 924 KB
subtask1_01.txt AC 19 ms 924 KB
subtask1_02.txt AC 17 ms 924 KB
subtask1_03.txt AC 19 ms 920 KB
subtask1_04.txt AC 18 ms 920 KB
subtask1_05.txt AC 19 ms 920 KB
subtask1_06.txt AC 20 ms 920 KB
subtask1_07.txt AC 19 ms 924 KB
subtask1_08.txt AC 18 ms 924 KB
subtask1_09.txt AC 20 ms 920 KB
subtask1_10.txt AC 19 ms 796 KB
subtask1_11.txt AC 20 ms 860 KB
subtask1_12.txt AC 17 ms 916 KB
subtask1_13.txt AC 17 ms 792 KB
subtask2_01.txt AC 20 ms 1304 KB
subtask2_02.txt AC 20 ms 1308 KB
subtask2_03.txt AC 21 ms 1300 KB
subtask2_04.txt AC 20 ms 1308 KB
subtask2_05.txt AC 20 ms 1308 KB
subtask2_06.txt AC 20 ms 1296 KB
subtask2_07.txt AC 21 ms 1304 KB
subtask2_08.txt AC 20 ms 1296 KB
subtask2_09.txt AC 19 ms 920 KB
subtask2_10.txt AC 19 ms 920 KB
subtask2_11.txt AC 18 ms 916 KB
subtask2_12.txt AC 20 ms 920 KB