제출 #1229810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1229810		PlayVoltz	Dango Maker (JOI18_dango_maker)	C++20	100 / 100	577 ms	10440 KiB

dango_maker

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m, ans=0;
	cin>>n>>m;
	vector<string> vect(n);
	for (int i=0; i<n; ++i)cin>>vect[i];
	for (int d=0; d<n+m-1; ++d){
		vector<vector<int> > dp(m, vector<int>(2, 0));
		int res=0;
		for (int i=m-1; i>=0; --i)if (i<=d&&d<n+i){
			dp[i][0]=max((i+1<m?dp[i+1][0]:0), (i+3<m?max(dp[i+3][0], dp[i+3][1]):0))+(i+2<m&&vect[d-i][i]=='R'&&vect[d-i][i+1]=='G'&&vect[d-i][i+2]=='W');
			dp[i][1]=(i+1<m?max(dp[i+1][0], dp[i+1][1]):0)+(d-i+2<n&&vect[d-i][i]=='R'&&vect[d-i+1][i]=='G'&&vect[d-i+2][i]=='W');
			res=max(dp[i][0], dp[i][1]);
		}
		ans+=res;
	}
	cout<<ans;
}

• Subtask 1: 13 / 13
• Subtask 2: 20 / 20
• Subtask 3: 67 / 67