Submission #893853

#	Time	Username	Problem	Language	Result	Execution time	Memory
893853		kigash	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	100 / 100	213 ms	774348 KiB

joi2019_ho_t3

#include "bits/stdc++.h"
using namespace std;       

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; }

const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 405;
#define ll int
ll pr[N][3], pos[N][3], dp[N][N][N][3];

void kigash() {
    ll n, r = 0, g = 0, y = 0;
    string s;
    cin>>n>>s;
    s = ' '+s;
    for(ll i=1; i<=n; i++) {
        for(ll j=0; j<3; j++) pr[i][j] = pr[i-1][j];
        if(s[i]=='R') pr[i][0]++, pos[++r][0] = i;
        if(s[i]=='G') pr[i][1]++, pos[++g][1] = i;
        if(s[i]=='Y') pr[i][2]++, pos[++y][2] = i;
    }
    for(ll i=0; i<=n; i++) {
        for(ll j=0; j<=n; j++) {
            for(ll k=0; k<=n; k++) {
                dp[i][j][k][0] = mod;
                dp[i][j][k][1] = mod;
                dp[i][j][k][2] = mod;
            }
        }
    }
    dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;
    for(ll i=0; i<=r; i++) {
        for(ll j=0; j<=g; j++) {
            for(ll k=0; k<=y; k++) {
                if(i) {
                    ll x = max(0, pr[pos[i][0]][1]-j)+max(0, pr[pos[i][0]][2]-k);
                    dp[i][j][k][0] = min(dp[i][j][k][0], min(dp[i-1][j][k][1], dp[i-1][j][k][2])+x);
                }
                if(j) {   
                    ll x = max(0, pr[pos[j][1]][0]-i)+max(0, pr[pos[j][1]][2]-k);
                    dp[i][j][k][1] = min(dp[i][j][k][1], min(dp[i][j-1][k][0], dp[i][j-1][k][2])+x);
                }
                if(k) {
                    ll x = max(0, pr[pos[k][2]][0]-i)+max(0, pr[pos[k][2]][1]-j);
                    dp[i][j][k][2] = min(dp[i][j][k][2], min(dp[i][j][k-1][0], dp[i][j][k-1][1])+x);
                }
            }
        }
    }
    ll ans = min({dp[r][g][y][0], dp[r][g][y][1], dp[r][g][y][2]});
    if(ans>=mod) cout<<"-1\n";
    else cout<<ans<<"\n";
    return;
}

signed main(/*Kigash Amir*/) {
    // freopen("");
    IOIGold2024_InshAllah();
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        kigash();
    }
}

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'void freopen(std::string)':
joi2019_ho_t3.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 55 / 55
• Subtask 3: 15 / 15
• Subtask 4: 25 / 25