Submission #971226

#	Time	Username	Problem	Language	Result	Execution time	Memory
971226		vyshniak_n	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	168 ms	230456 KiB

dango_maker

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

const ll INF = 2e18 + 10;
const ll inf = 2e9 + 10;
const ll N = 3e3 + 10;
const ll mod = 1e9 + 7;
const ll K = 200;
const ll LOG = 16;

ll dp[N][N][3];
char a[N][N];

void solve() {
    ll n, m;
    cin >> n >> m;

    for (ll i = 1; i <= n; i++) 
        for (ll j = 1; j <= m; j++)
            cin >> a[i][j];

    for (ll i = 1; i <= n; i++) {
        for (ll j = 1; j <= m; j++) {
            dp[i][j][0] = max({dp[i - 1][j + 1][0], dp[i - 1][j + 1][1], dp[i - 1][j + 1][2]});
            if (a[i][j] != 'G')
                continue;

            if (a[i][j - 1] == 'R' && a[i][j + 1] == 'W')
                dp[i][j][1] = max(dp[i - 1][j + 1][0], dp[i - 1][j + 1][1]) + 1;
            if (a[i - 1][j] == 'R' && a[i + 1][j] == 'W')
                dp[i][j][2] = max(dp[i - 1][j + 1][0], dp[i - 1][j + 1][2]) + 1;
        }
    }

    ll ans = 0;
    for (ll i = 1; i <= n; i++)
        ans += max({dp[i][1][0], dp[i][1][1], dp[i][1][2]});
    for (ll i = 1; i <= m; i++)
        ans += max({dp[n][i][0], dp[n][i][1], dp[n][i][2]});
    ans -= max({dp[n][1][0], dp[n][1][1], dp[n][1][2]});

    cout << ans << el;
    return;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        solve();
    return 0;
}
/*

*/

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