oj.uz

답안 #958098

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958098 2024-04-04T22:32:22 Z shadow_sami Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 360 ms 771840 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
// void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 400+5;
const ll mod = 1e9+7;

// // ==========================(MOD)=============================================================================================== //

// ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
// ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
// ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
// ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
// ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// // ==========================(MOD)=============================================================================================== //

bool f = false;
string s;
ll tnc[mx];
ll a[mx];
ll pref[mx][3];
ll to[mx][3];
ll dp[mx][mx][mx][3];

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n;
        cin>>s;
        fip(0,n){
            if(s[i]=='R')
                a[i] = 0;
            else if(s[i]=='G')
                a[i] = 1;
            else
                a[i] = 2;
        }
        fip(0,n+2)
            fjp(0,n+2)
                fp(k,0,n+2)
                    fp(t,0,3)
                        dp[i][j][k][t] = 1e9;
        fip(0,3)
            dp[0][0][0][i] = 0;
        fip(0,n){
            to[tnc[a[i]]][a[i]] = i;
            tnc[a[i]]++;
            fjp(0,3)
                pref[i][j] = tnc[j];
        }
        fip(0,tnc[0]+1)
            fjp(0,tnc[1]+1)
                fp(k,0,tnc[2]+1){
                    fp(t,0,3){
                        if(t!=0 && i<tnc[0])
                            dp[i+1][j][k][0] = min(dp[i+1][j][k][0] , dp[i][j][k][t] + max(0,pref[to[i][0]][1]-j) + max(0,pref[to[i][0]][2]-k)); 
                        if(t!=1 && j<tnc[1])
                            dp[i][j+1][k][1] = min(dp[i][j+1][k][1] , dp[i][j][k][t] + max(0,pref[to[j][1]][0]-i) + max(0,pref[to[j][1]][2]-k));
                        if(t!=2 && k<tnc[2])
                            dp[i][j][k+1][2] = min(dp[i][j][k+1][2] , dp[i][j][k][t] + max(0,pref[to[k][2]][0]-i) + max(0,pref[to[k][2]][1]-j));
                    }
                }
        ans = 1e9;
        fip(0,3)
            ans = min(ans,dp[tnc[0]][tnc[1]][tnc[2]][i]);
        if(ans==1e9)
            ans = -1;
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 8 ms 31324 KB Output is correct
6 Correct 4 ms 31328 KB Output is correct
7 Correct 4 ms 31324 KB Output is correct
8 Correct 4 ms 31092 KB Output is correct
9 Correct 4 ms 31324 KB Output is correct
10 Correct 4 ms 31320 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 5 ms 31068 KB Output is correct
13 Correct 4 ms 31324 KB Output is correct
14 Correct 4 ms 31324 KB Output is correct
15 Correct 4 ms 31324 KB Output is correct
16 Correct 4 ms 31576 KB Output is correct
17 Correct 4 ms 31324 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 8 ms 31324 KB Output is correct
6 Correct 4 ms 31328 KB Output is correct
7 Correct 4 ms 31324 KB Output is correct
8 Correct 4 ms 31092 KB Output is correct
9 Correct 4 ms 31324 KB Output is correct
10 Correct 4 ms 31320 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 5 ms 31068 KB Output is correct
13 Correct 4 ms 31324 KB Output is correct
14 Correct 4 ms 31324 KB Output is correct
15 Correct 4 ms 31324 KB Output is correct
16 Correct 4 ms 31576 KB Output is correct
17 Correct 4 ms 31324 KB Output is correct
18 Correct 41 ms 119636 KB Output is correct
19 Correct 14 ms 119644 KB Output is correct
20 Correct 14 ms 119576 KB Output is correct
21 Correct 13 ms 119644 KB Output is correct
22 Correct 13 ms 119916 KB Output is correct
23 Correct 14 ms 119644 KB Output is correct
24 Correct 15 ms 119640 KB Output is correct
25 Correct 15 ms 119644 KB Output is correct
26 Correct 13 ms 119644 KB Output is correct
27 Correct 13 ms 119644 KB Output is correct
28 Correct 14 ms 119640 KB Output is correct
29 Correct 13 ms 119644 KB Output is correct
30 Correct 13 ms 119644 KB Output is correct
31 Correct 14 ms 119584 KB Output is correct
32 Correct 14 ms 119452 KB Output is correct
33 Correct 14 ms 117592 KB Output is correct
34 Correct 13 ms 117596 KB Output is correct
35 Correct 13 ms 115368 KB Output is correct
36 Correct 13 ms 117596 KB Output is correct
37 Correct 12 ms 113500 KB Output is correct
38 Correct 14 ms 119512 KB Output is correct
39 Correct 13 ms 119640 KB Output is correct
40 Correct 13 ms 117596 KB Output is correct
41 Correct 13 ms 119644 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8792 KB Output is correct
2 Correct 360 ms 771780 KB Output is correct
3 Correct 257 ms 768336 KB Output is correct
4 Correct 255 ms 771700 KB Output is correct
5 Correct 266 ms 771676 KB Output is correct
6 Correct 263 ms 771672 KB Output is correct
7 Correct 262 ms 768600 KB Output is correct
8 Correct 253 ms 768344 KB Output is correct
9 Correct 257 ms 765324 KB Output is correct
10 Correct 282 ms 771760 KB Output is correct
11 Correct 255 ms 771604 KB Output is correct
12 Correct 63 ms 319732 KB Output is correct
13 Correct 111 ms 438096 KB Output is correct
14 Correct 166 ms 567692 KB Output is correct
15 Correct 290 ms 771664 KB Output is correct
16 Correct 268 ms 771628 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 8 ms 31324 KB Output is correct
6 Correct 4 ms 31328 KB Output is correct
7 Correct 4 ms 31324 KB Output is correct
8 Correct 4 ms 31092 KB Output is correct
9 Correct 4 ms 31324 KB Output is correct
10 Correct 4 ms 31320 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 5 ms 31068 KB Output is correct
13 Correct 4 ms 31324 KB Output is correct
14 Correct 4 ms 31324 KB Output is correct
15 Correct 4 ms 31324 KB Output is correct
16 Correct 4 ms 31576 KB Output is correct
17 Correct 4 ms 31324 KB Output is correct
18 Correct 41 ms 119636 KB Output is correct
19 Correct 14 ms 119644 KB Output is correct
20 Correct 14 ms 119576 KB Output is correct
21 Correct 13 ms 119644 KB Output is correct
22 Correct 13 ms 119916 KB Output is correct
23 Correct 14 ms 119644 KB Output is correct
24 Correct 15 ms 119640 KB Output is correct
25 Correct 15 ms 119644 KB Output is correct
26 Correct 13 ms 119644 KB Output is correct
27 Correct 13 ms 119644 KB Output is correct
28 Correct 14 ms 119640 KB Output is correct
29 Correct 13 ms 119644 KB Output is correct
30 Correct 13 ms 119644 KB Output is correct
31 Correct 14 ms 119584 KB Output is correct
32 Correct 14 ms 119452 KB Output is correct
33 Correct 14 ms 117592 KB Output is correct
34 Correct 13 ms 117596 KB Output is correct
35 Correct 13 ms 115368 KB Output is correct
36 Correct 13 ms 117596 KB Output is correct
37 Correct 12 ms 113500 KB Output is correct
38 Correct 14 ms 119512 KB Output is correct
39 Correct 13 ms 119640 KB Output is correct
40 Correct 13 ms 117596 KB Output is correct
41 Correct 13 ms 119644 KB Output is correct
42 Correct 1 ms 8792 KB Output is correct
43 Correct 360 ms 771780 KB Output is correct
44 Correct 257 ms 768336 KB Output is correct
45 Correct 255 ms 771700 KB Output is correct
46 Correct 266 ms 771676 KB Output is correct
47 Correct 263 ms 771672 KB Output is correct
48 Correct 262 ms 768600 KB Output is correct
49 Correct 253 ms 768344 KB Output is correct
50 Correct 257 ms 765324 KB Output is correct
51 Correct 282 ms 771760 KB Output is correct
52 Correct 255 ms 771604 KB Output is correct
53 Correct 63 ms 319732 KB Output is correct
54 Correct 111 ms 438096 KB Output is correct
55 Correct 166 ms 567692 KB Output is correct
56 Correct 290 ms 771664 KB Output is correct
57 Correct 268 ms 771628 KB Output is correct
58 Correct 297 ms 771672 KB Output is correct
59 Correct 296 ms 771740 KB Output is correct
60 Correct 283 ms 765324 KB Output is correct
61 Correct 285 ms 768472 KB Output is correct
62 Correct 283 ms 771788 KB Output is correct
63 Correct 263 ms 771648 KB Output is correct
64 Correct 279 ms 771840 KB Output is correct
65 Correct 288 ms 768360 KB Output is correct
66 Correct 288 ms 762128 KB Output is correct
67 Correct 282 ms 771776 KB Output is correct
68 Correct 281 ms 768384 KB Output is correct
69 Correct 284 ms 771772 KB Output is correct
70 Correct 298 ms 771792 KB Output is correct
71 Correct 293 ms 768384 KB Output is correct
72 Correct 259 ms 768680 KB Output is correct
73 Correct 254 ms 771784 KB Output is correct