Submission #424988


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int n,b;
string s;
int hai[1000];
int count;
int flag;
int fflag;
int t;
int main()
{
	cin>>n>>b;
	cin>>s;
	for(int i=n-1;i>=0;i--)
	{
		if(s[i]=='.')
		{t=i;
		flag=1;
		break;
		}
	}
	if(flag==0)
	{
		cout<<0<<endl;
		return 0;
	}
	if(t<b)
	{
		cout<<1<<endl;
		return 0;
	}
	rep(i,n)
	{
		if(s[i]!='.')hai[i]=1;
	}
	rep(i,n-b+1)
	{
		if(hai[i]==0||i+b-1==t)
		{
			count++;
			rep(j,b)
			{
				hai[i+j]=1;
			}
		}
		if(i+b-1==t)break;
	}
	cout<<count+t-b+1<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - 直線塗り
User tainohimono
Language C++ (GCC 4.9.2)
Score 100
Code Size 715 Byte
Status AC
Exec Time 26 ms
Memory 932 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 21
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt
Case Name Status Exec Time Memory
01-01.txt AC 24 ms 928 KiB
01-02.txt AC 23 ms 796 KiB
01-03.txt AC 23 ms 928 KiB
01-04.txt AC 23 ms 800 KiB
01-05.txt AC 23 ms 928 KiB
01-06.txt AC 24 ms 800 KiB
01-07.txt AC 24 ms 796 KiB
01-08.txt AC 23 ms 924 KiB
01-09.txt AC 23 ms 924 KiB
01-10.txt AC 26 ms 800 KiB
01-11.txt AC 25 ms 800 KiB
01-12.txt AC 25 ms 920 KiB
01-13.txt AC 24 ms 924 KiB
01-14.txt AC 24 ms 924 KiB
01-15.txt AC 24 ms 932 KiB
01-16.txt AC 25 ms 928 KiB
01-17.txt AC 24 ms 800 KiB
01-18.txt AC 24 ms 928 KiB
sample-01.txt AC 25 ms 924 KiB
sample-02.txt AC 23 ms 916 KiB
sample-03.txt AC 25 ms 932 KiB