oj.uz

답안 #208095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208095 2020-03-10T02:43:28 Z coldEr66 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 457 ms 780536 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%d (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=4e2+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

int R,G,Y;
int rg[MAXn],ry[MAXn];
int gr[MAXn],gy[MAXn];
int yr[MAXn],yg[MAXn];
int dp[MAXn][MAXn][MAXn][3];
int main(){
    IOS();
    int n;
    cin >> n;
    string s;
    cin >> s;
    REP (i,n) {
        if (s[i] == 'R') {
            rg[R] = G;
            ry[R++] = Y;
        }
        else if (s[i] == 'G') {
            gr[G] = R;
            gy[G++] = Y;
        }
        else {
            yr[Y] = R;
            yg[Y++] = G;
        }
    }
    debug(R,G,Y);
    RST(dp,INF);
    REP (i,3) dp[0][0][0][i] = 0;
    REP (i,R+1) REP (j,G+1) REP (k,Y+1) REP (l,3) {
        int ret = dp[i][j][k][l];
        if (i < R && l != 0) {
            dp[i+1][j][k][0] = min(dp[i+1][j][k][0],ret + max(rg[i]-j,0) + max(ry[i]-k,0));
        }
        if (j < G && l != 1) {
            dp[i][j+1][k][1] = min(dp[i][j+1][k][1],ret + max(gr[j]-i,0) + max(gy[j]-k,0));
        }
        if (k < Y && l != 2) {
            dp[i][j][k+1][2] = min(dp[i][j][k+1][2],ret + max(yr[k]-i,0) + max(yg[k]-j,0));
        }
    }
    int ans = INF;
    REP (i,3) ans = min(ans,dp[R][G][Y][i]);
    if (ans == INF) cout << -1 << endl;
    else cout << ans << endl;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 780280 KB Output is correct
2 Correct 396 ms 780408 KB Output is correct
3 Correct 379 ms 780360 KB Output is correct
4 Correct 377 ms 780280 KB Output is correct
5 Correct 391 ms 780452 KB Output is correct
6 Correct 381 ms 780280 KB Output is correct
7 Correct 382 ms 780376 KB Output is correct
8 Correct 379 ms 780408 KB Output is correct
9 Correct 390 ms 780520 KB Output is correct
10 Correct 382 ms 780280 KB Output is correct
11 Correct 387 ms 780436 KB Output is correct
12 Correct 383 ms 780280 KB Output is correct
13 Correct 402 ms 780356 KB Output is correct
14 Correct 387 ms 780280 KB Output is correct
15 Correct 389 ms 780412 KB Output is correct
16 Correct 379 ms 780280 KB Output is correct
17 Correct 375 ms 780280 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 780280 KB Output is correct
2 Correct 396 ms 780408 KB Output is correct
3 Correct 379 ms 780360 KB Output is correct
4 Correct 377 ms 780280 KB Output is correct
5 Correct 391 ms 780452 KB Output is correct
6 Correct 381 ms 780280 KB Output is correct
7 Correct 382 ms 780376 KB Output is correct
8 Correct 379 ms 780408 KB Output is correct
9 Correct 390 ms 780520 KB Output is correct
10 Correct 382 ms 780280 KB Output is correct
11 Correct 387 ms 780436 KB Output is correct
12 Correct 383 ms 780280 KB Output is correct
13 Correct 402 ms 780356 KB Output is correct
14 Correct 387 ms 780280 KB Output is correct
15 Correct 389 ms 780412 KB Output is correct
16 Correct 379 ms 780280 KB Output is correct
17 Correct 375 ms 780280 KB Output is correct
18 Correct 384 ms 780284 KB Output is correct
19 Correct 382 ms 780408 KB Output is correct
20 Correct 379 ms 780408 KB Output is correct
21 Correct 381 ms 780408 KB Output is correct
22 Correct 377 ms 780280 KB Output is correct
23 Correct 378 ms 780280 KB Output is correct
24 Correct 381 ms 780280 KB Output is correct
25 Correct 379 ms 780280 KB Output is correct
26 Correct 389 ms 780280 KB Output is correct
27 Correct 385 ms 780408 KB Output is correct
28 Correct 382 ms 780336 KB Output is correct
29 Correct 380 ms 780384 KB Output is correct
30 Correct 384 ms 780280 KB Output is correct
31 Correct 376 ms 780408 KB Output is correct
32 Correct 383 ms 780300 KB Output is correct
33 Correct 376 ms 780280 KB Output is correct
34 Correct 396 ms 780280 KB Output is correct
35 Correct 386 ms 780408 KB Output is correct
36 Correct 391 ms 780408 KB Output is correct
37 Correct 371 ms 780408 KB Output is correct
38 Correct 389 ms 780280 KB Output is correct
39 Correct 417 ms 780384 KB Output is correct
40 Correct 401 ms 780408 KB Output is correct
41 Correct 387 ms 780352 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 430 ms 780388 KB Output is correct
2 Correct 411 ms 780360 KB Output is correct
3 Correct 451 ms 780384 KB Output is correct
4 Correct 393 ms 780280 KB Output is correct
5 Correct 407 ms 780536 KB Output is correct
6 Correct 391 ms 780304 KB Output is correct
7 Correct 418 ms 780416 KB Output is correct
8 Correct 399 ms 780408 KB Output is correct
9 Correct 413 ms 780308 KB Output is correct
10 Correct 396 ms 780408 KB Output is correct
11 Correct 405 ms 780424 KB Output is correct
12 Correct 403 ms 780284 KB Output is correct
13 Correct 433 ms 780348 KB Output is correct
14 Correct 406 ms 780384 KB Output is correct
15 Correct 417 ms 780372 KB Output is correct
16 Correct 416 ms 780372 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 780280 KB Output is correct
2 Correct 396 ms 780408 KB Output is correct
3 Correct 379 ms 780360 KB Output is correct
4 Correct 377 ms 780280 KB Output is correct
5 Correct 391 ms 780452 KB Output is correct
6 Correct 381 ms 780280 KB Output is correct
7 Correct 382 ms 780376 KB Output is correct
8 Correct 379 ms 780408 KB Output is correct
9 Correct 390 ms 780520 KB Output is correct
10 Correct 382 ms 780280 KB Output is correct
11 Correct 387 ms 780436 KB Output is correct
12 Correct 383 ms 780280 KB Output is correct
13 Correct 402 ms 780356 KB Output is correct
14 Correct 387 ms 780280 KB Output is correct
15 Correct 389 ms 780412 KB Output is correct
16 Correct 379 ms 780280 KB Output is correct
17 Correct 375 ms 780280 KB Output is correct
18 Correct 384 ms 780284 KB Output is correct
19 Correct 382 ms 780408 KB Output is correct
20 Correct 379 ms 780408 KB Output is correct
21 Correct 381 ms 780408 KB Output is correct
22 Correct 377 ms 780280 KB Output is correct
23 Correct 378 ms 780280 KB Output is correct
24 Correct 381 ms 780280 KB Output is correct
25 Correct 379 ms 780280 KB Output is correct
26 Correct 389 ms 780280 KB Output is correct
27 Correct 385 ms 780408 KB Output is correct
28 Correct 382 ms 780336 KB Output is correct
29 Correct 380 ms 780384 KB Output is correct
30 Correct 384 ms 780280 KB Output is correct
31 Correct 376 ms 780408 KB Output is correct
32 Correct 383 ms 780300 KB Output is correct
33 Correct 376 ms 780280 KB Output is correct
34 Correct 396 ms 780280 KB Output is correct
35 Correct 386 ms 780408 KB Output is correct
36 Correct 391 ms 780408 KB Output is correct
37 Correct 371 ms 780408 KB Output is correct
38 Correct 389 ms 780280 KB Output is correct
39 Correct 417 ms 780384 KB Output is correct
40 Correct 401 ms 780408 KB Output is correct
41 Correct 387 ms 780352 KB Output is correct
42 Correct 430 ms 780388 KB Output is correct
43 Correct 411 ms 780360 KB Output is correct
44 Correct 451 ms 780384 KB Output is correct
45 Correct 393 ms 780280 KB Output is correct
46 Correct 407 ms 780536 KB Output is correct
47 Correct 391 ms 780304 KB Output is correct
48 Correct 418 ms 780416 KB Output is correct
49 Correct 399 ms 780408 KB Output is correct
50 Correct 413 ms 780308 KB Output is correct
51 Correct 396 ms 780408 KB Output is correct
52 Correct 405 ms 780424 KB Output is correct
53 Correct 403 ms 780284 KB Output is correct
54 Correct 433 ms 780348 KB Output is correct
55 Correct 406 ms 780384 KB Output is correct
56 Correct 417 ms 780372 KB Output is correct
57 Correct 416 ms 780372 KB Output is correct
58 Correct 443 ms 780388 KB Output is correct
59 Correct 434 ms 780408 KB Output is correct
60 Correct 414 ms 780280 KB Output is correct
61 Correct 447 ms 780280 KB Output is correct
62 Correct 405 ms 780280 KB Output is correct
63 Correct 402 ms 780296 KB Output is correct
64 Correct 404 ms 780408 KB Output is correct
65 Correct 413 ms 780408 KB Output is correct
66 Correct 454 ms 780408 KB Output is correct
67 Correct 441 ms 780388 KB Output is correct
68 Correct 439 ms 780408 KB Output is correct
69 Correct 438 ms 780464 KB Output is correct
70 Correct 430 ms 780408 KB Output is correct
71 Correct 457 ms 780528 KB Output is correct
72 Correct 428 ms 780484 KB Output is correct
73 Correct 383 ms 780372 KB Output is correct