Submission #46828992

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int dp[303][303], K,n;
char a[303];
int d(int s,int e){
	if(s > e)return 0;
	int&res = dp[s][e];
	if(res != -1)return res;
	res = e - s + 1;
	if(s < e)res = min(res, 1 + d(s + 1, e));
	if(a[s] == 'o'){
		for(int i=s+1; i<=e; i++)
			if(a[i] == 'f' && d(s+1, i-1) == 0)
				res = min(res, max(d(i+1, e) - K, 0));
	}
	return res;
}
int main(){
	scanf("%s%d",a,&K);
	n = strlen(a);
	memset(dp,-1,sizeof(dp));
	printf("%d\n",d(0,n-1));
	return 0;
}

Submission Info

Submission Time
Task G - offence
User maryanna2016
Language C++ 20 (gcc 12.2)
Score 575
Code Size 514 Byte
Status AC
Exec Time 4 ms
Memory 4296 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:19:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   19 |         scanf("%s%d",a,&K);
      |         ~~~~~^~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 575 / 575
Status
AC × 4
AC × 48
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt, sample03.txt
All sample00.txt, sample01.txt, sample02.txt, sample03.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt, testcase35.txt, testcase36.txt, testcase37.txt, testcase38.txt, testcase39.txt, testcase40.txt, testcase41.txt, testcase42.txt, testcase43.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 4216 KiB
sample01.txt AC 1 ms 4204 KiB
sample02.txt AC 1 ms 4080 KiB
sample03.txt AC 1 ms 4076 KiB
testcase00.txt AC 1 ms 4004 KiB
testcase01.txt AC 1 ms 4064 KiB
testcase02.txt AC 1 ms 4208 KiB
testcase03.txt AC 1 ms 4044 KiB
testcase04.txt AC 1 ms 4200 KiB
testcase05.txt AC 1 ms 4028 KiB
testcase06.txt AC 1 ms 4280 KiB
testcase07.txt AC 1 ms 4048 KiB
testcase08.txt AC 1 ms 3936 KiB
testcase09.txt AC 1 ms 4040 KiB
testcase10.txt AC 1 ms 4268 KiB
testcase11.txt AC 1 ms 4040 KiB
testcase12.txt AC 3 ms 4292 KiB
testcase13.txt AC 4 ms 4044 KiB
testcase14.txt AC 3 ms 3952 KiB
testcase15.txt AC 4 ms 4220 KiB
testcase16.txt AC 3 ms 4296 KiB
testcase17.txt AC 4 ms 4064 KiB
testcase18.txt AC 3 ms 4020 KiB
testcase19.txt AC 4 ms 4296 KiB
testcase20.txt AC 3 ms 4292 KiB
testcase21.txt AC 4 ms 4096 KiB
testcase22.txt AC 3 ms 4036 KiB
testcase23.txt AC 3 ms 4180 KiB
testcase24.txt AC 2 ms 4020 KiB
testcase25.txt AC 3 ms 4044 KiB
testcase26.txt AC 3 ms 4164 KiB
testcase27.txt AC 3 ms 4040 KiB
testcase28.txt AC 4 ms 4296 KiB
testcase29.txt AC 3 ms 4040 KiB
testcase30.txt AC 4 ms 4040 KiB
testcase31.txt AC 4 ms 4180 KiB
testcase32.txt AC 1 ms 4228 KiB
testcase33.txt AC 1 ms 4224 KiB
testcase34.txt AC 1 ms 4040 KiB
testcase35.txt AC 1 ms 4096 KiB
testcase36.txt AC 1 ms 4296 KiB
testcase37.txt AC 2 ms 4292 KiB
testcase38.txt AC 2 ms 4040 KiB
testcase39.txt AC 2 ms 4292 KiB
testcase40.txt AC 2 ms 4212 KiB
testcase41.txt AC 2 ms 4224 KiB
testcase42.txt AC 2 ms 4220 KiB
testcase43.txt AC 2 ms 4044 KiB