oj.uz

답안 #362087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362087 2021-02-01T17:15:00 Z AmineWeslati Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 245 ms 168044 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 3e8;
const int MX = 400 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int N,A=0,B=0,C=0;
vi pos[3];
V<V<V<vi>>>memo,v;

void allocate(){
    memo.resize(A+1);
    FOR(i,0,A+1){
        memo[i].resize(B+1);
        FOR(j,0,B+1){
            memo[i][j].resize(C+1);
            FOR(k,0,C+1){
                memo[i][j][k].assign(4,-1);
            }
        }
    }

    v.resize(3);
    FOR(i,0,3){
        v[i].resize(N+1);
        FOR(j,0,N+1){
            v[i][j].resize(3);
            FOR(k,0,3){
                v[i][j][k].assign(N+1,0);
            }
        }
    }
}

void precompute(){
    vi vec={A,B,C};
    FOR(i,0,3) FOR(j,1,vec[i]+1){
        int x=pos[i][j];

        FOR(k,0,3) if(k!=i){
            int cnt=0; v[i][j][k][0]=0;

            FOR(l,1,vec[k]+1){
                if(pos[k][l]>x) cnt++;
                v[i][j][k][l]=cnt;
            }
        }
    }
}

/*int solve(int a, int b, int c, int l){
	if(a==A && b==B && c==C) return 0;

	int &ind=memo[a][b][c][l];
	if(ind!=-1) return ind;

	int ans=INF;
    if(l!=0 && a<A){
        ckmin(ans,solve(a+1,b,c,0)+v[0][a+1][1][b]+v[0][a+1][2][c]);
    }
    if(l!=1 && b<B){
        ckmin(ans,solve(a,b+1,c,1)+v[1][b+1][0][a]+v[1][b+1][2][c]);
    }
    if(l!=2 && c<C){
        ckmin(ans,solve(a,b,c+1,2)+v[2][c+1][0][a]+v[2][c+1][1][b]);
    }

	return ind=ans;
}*/

void solve2(){
    int dp[A+1][B+1][C+1][3];
    FOR(i,0,A+1) FOR(j,0,B+1) FOR(k,0,C+1) FOR(l,0,3) dp[i][j][k][l]=INF;
    FOR(i,0,3) dp[0][0][0][i]=0;

    FOR(a,0,A+1) FOR(b,0,B+1) FOR(c,0,C+1){
        if(!(a+b+c)){
            continue;
        }
        
        if(a) dp[a][b][c][0]=min(dp[a-1][b][c][1],dp[a-1][b][c][2])
        +v[0][a][1][b]+v[0][a][2][c];

        if(b) dp[a][b][c][1]=min(dp[a][b-1][c][0],dp[a][b-1][c][2])
        +v[1][b][0][a]+v[1][b][2][c];

        if(c) dp[a][b][c][2]=min(dp[a][b][c-1][0],dp[a][b][c-1][1])
        +v[2][c][0][a]+v[2][c][1][b];
    }

    int ans=min(min(dp[A][B][C][0],dp[A][B][C][1]),dp[A][B][C][2]);
    if(ans>=INF) ans=-1;
    cout << ans << endl;
}

int main() {
    boost; IO();
    
    cin>>N; 
    pos[0].eb(); pos[1].eb(); pos[2].eb();

    FOR(i,0,N){
    	char c; cin>>c;
    	if(c=='G'){
            A++;
            pos[0].eb(); pos[0][A]=i;
        }
    	else if(c=='R'){
            B++;
            pos[1].eb(); pos[1][B]=i;
        }
    	else{
            C++;
            pos[2].eb(); pos[2][C]=i;
        }
    }

    allocate();

    precompute();

    /*int ans=solve(0,0,0,3);
    if(ans==INF) ans=-1;
    cout << ans << endl;*/

    solve2();

    return 0;
}
//Change your approach

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 1 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1004 KB Output is correct
23 Correct 1 ms 1132 KB Output is correct
24 Correct 1 ms 1004 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 620 KB Output is correct
27 Correct 1 ms 1004 KB Output is correct
28 Correct 1 ms 1132 KB Output is correct
29 Correct 1 ms 1132 KB Output is correct
30 Correct 1 ms 1132 KB Output is correct
31 Correct 1 ms 1132 KB Output is correct
32 Correct 1 ms 1132 KB Output is correct
33 Correct 1 ms 620 KB Output is correct
34 Correct 1 ms 748 KB Output is correct
35 Correct 1 ms 1004 KB Output is correct
36 Correct 1 ms 1004 KB Output is correct
37 Correct 1 ms 1004 KB Output is correct
38 Correct 1 ms 1004 KB Output is correct
39 Correct 2 ms 1132 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 748 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 13 ms 10092 KB Output is correct
3 Correct 11 ms 10112 KB Output is correct
4 Correct 11 ms 10092 KB Output is correct
5 Correct 11 ms 10092 KB Output is correct
6 Correct 12 ms 10092 KB Output is correct
7 Correct 11 ms 10092 KB Output is correct
8 Correct 11 ms 10092 KB Output is correct
9 Correct 11 ms 10092 KB Output is correct
10 Correct 12 ms 10092 KB Output is correct
11 Correct 11 ms 10092 KB Output is correct
12 Correct 3 ms 3052 KB Output is correct
13 Correct 6 ms 4972 KB Output is correct
14 Correct 8 ms 7020 KB Output is correct
15 Correct 11 ms 10092 KB Output is correct
16 Correct 11 ms 10092 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 1 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1004 KB Output is correct
23 Correct 1 ms 1132 KB Output is correct
24 Correct 1 ms 1004 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 620 KB Output is correct
27 Correct 1 ms 1004 KB Output is correct
28 Correct 1 ms 1132 KB Output is correct
29 Correct 1 ms 1132 KB Output is correct
30 Correct 1 ms 1132 KB Output is correct
31 Correct 1 ms 1132 KB Output is correct
32 Correct 1 ms 1132 KB Output is correct
33 Correct 1 ms 620 KB Output is correct
34 Correct 1 ms 748 KB Output is correct
35 Correct 1 ms 1004 KB Output is correct
36 Correct 1 ms 1004 KB Output is correct
37 Correct 1 ms 1004 KB Output is correct
38 Correct 1 ms 1004 KB Output is correct
39 Correct 2 ms 1132 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 748 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 13 ms 10092 KB Output is correct
44 Correct 11 ms 10112 KB Output is correct
45 Correct 11 ms 10092 KB Output is correct
46 Correct 11 ms 10092 KB Output is correct
47 Correct 12 ms 10092 KB Output is correct
48 Correct 11 ms 10092 KB Output is correct
49 Correct 11 ms 10092 KB Output is correct
50 Correct 11 ms 10092 KB Output is correct
51 Correct 12 ms 10092 KB Output is correct
52 Correct 11 ms 10092 KB Output is correct
53 Correct 3 ms 3052 KB Output is correct
54 Correct 6 ms 4972 KB Output is correct
55 Correct 8 ms 7020 KB Output is correct
56 Correct 11 ms 10092 KB Output is correct
57 Correct 11 ms 10092 KB Output is correct
58 Correct 216 ms 166132 KB Output is correct
59 Correct 245 ms 166380 KB Output is correct
60 Correct 227 ms 165228 KB Output is correct
61 Correct 219 ms 166892 KB Output is correct
62 Correct 25 ms 20460 KB Output is correct
63 Correct 39 ms 30700 KB Output is correct
64 Correct 117 ms 86124 KB Output is correct
65 Correct 159 ms 120940 KB Output is correct
66 Correct 220 ms 164588 KB Output is correct
67 Correct 237 ms 164332 KB Output is correct
68 Correct 220 ms 166892 KB Output is correct
69 Correct 241 ms 168044 KB Output is correct
70 Correct 222 ms 167460 KB Output is correct
71 Correct 237 ms 163820 KB Output is correct
72 Correct 62 ms 46988 KB Output is correct
73 Correct 21 ms 16492 KB Output is correct