Submission #1692027


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
const int N = 100000;

bool mizu(int x,string s){
	if(s[x]=='.')return false;
	return true;
}// 水ならtrue

int dfs(int x,int fi,string s){
	if(x==fi)return 0;
	if(fi-x<4){
		if(mizu(x,s))return 1;
		return 0;
	}
	
	if(mizu(x,s)) {
		return min(dfs(x+1,fi,s),min(dfs(x+2,fi,s),dfs(x+3,fi,s)))+1;
	}
	return min(dfs(x+1,fi,s),min(dfs(x+2,fi,s),dfs(x+3,fi,s)));
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int ans,n;
	string s;
	cin >> n >> s;
	ans = dfs(0,n-1,s);
	cout << ans << endl;

	
	return 0;
}

Submission Info

Submission Time
Task B - 雨上がり
User kenta2997
Language C++14 (GCC 5.4.1)
Score 0
Code Size 717 Byte
Status TLE
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 50
Status
AC × 11
TLE × 32
Set Name Test Cases
All case_000.txt, case_001.txt, case_002.txt, case_003.txt, case_004.txt, case_005.txt, case_006.txt, case_007.txt, case_008.txt, case_009.txt, case_010.txt, case_011.txt, case_012.txt, case_013.txt, case_014.txt, case_015.txt, case_016.txt, case_017.txt, case_018.txt, case_019.txt, case_020.txt, case_021.txt, case_022.txt, case_023.txt, case_024.txt, case_025.txt, case_026.txt, case_027.txt, case_028.txt, case_029.txt, case_030.txt, case_031.txt, case_032.txt, case_033.txt, case_034.txt, case_035.txt, case_036.txt, case_037.txt, case_038.txt, case_039.txt, case_040.txt, case_041.txt, case_042.txt
Case Name Status Exec Time Memory
case_000.txt AC 1 ms 256 KB
case_001.txt AC 1 ms 256 KB
case_002.txt AC 1 ms 256 KB
case_003.txt AC 1 ms 256 KB
case_004.txt AC 1 ms 256 KB
case_005.txt AC 1 ms 256 KB
case_006.txt AC 1 ms 256 KB
case_007.txt AC 1 ms 256 KB
case_008.txt AC 1 ms 256 KB
case_009.txt AC 2 ms 256 KB
case_010.txt TLE 2103 ms 256 KB
case_011.txt TLE 2103 ms 256 KB
case_012.txt AC 1 ms 256 KB
case_013.txt TLE 2103 ms 256 KB
case_014.txt TLE 2103 ms 256 KB
case_015.txt TLE 2103 ms 256 KB
case_016.txt TLE 2103 ms 256 KB
case_017.txt TLE 2103 ms 256 KB
case_018.txt TLE 2103 ms 256 KB
case_019.txt TLE 2103 ms 256 KB
case_020.txt TLE 2103 ms 256 KB
case_021.txt TLE 2103 ms 256 KB
case_022.txt TLE 2103 ms 256 KB
case_023.txt TLE 2103 ms 256 KB
case_024.txt TLE 2103 ms 256 KB
case_025.txt TLE 2103 ms 256 KB
case_026.txt TLE 2103 ms 256 KB
case_027.txt TLE 2103 ms 256 KB
case_028.txt TLE 2103 ms 256 KB
case_029.txt TLE 2103 ms 256 KB
case_030.txt TLE 2103 ms 256 KB
case_031.txt TLE 2103 ms 256 KB
case_032.txt TLE 2103 ms 256 KB
case_033.txt TLE 2103 ms 256 KB
case_034.txt TLE 2103 ms 256 KB
case_035.txt TLE 2103 ms 256 KB
case_036.txt TLE 2103 ms 256 KB
case_037.txt TLE 2103 ms 256 KB
case_038.txt TLE 2103 ms 256 KB
case_039.txt TLE 2103 ms 256 KB
case_040.txt TLE 2103 ms 256 KB
case_041.txt TLE 2103 ms 256 KB
case_042.txt TLE 2103 ms 256 KB