oj.uz

Submission #240984

# Submission time Handle Problem Language Result Execution time Memory
240984 2020-06-22T00:13:23 Z aggu_01000101 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 766776 KB 
#include <iostream>
#include <cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define INF 100000000
//#define int long long
#define lchild(i) (i*2 + 1)
#define rchild(i) (i*2 + 2)
#define mid(l, u) ((l+u)/2)
#define x(p) p.first
#define y(p) p.second
#define MOD 998244353
#define ordered_set tree<pair<int, int>, null_type,less<pair<int, int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
int n;
const int N = 405;
int dp[N][N][N][3];
int g[3][N];
int cc[] = {0, 0, 0};
int cmp[N][3];
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n;
    char c;
    for(int i = 1;i<=n;i++){
        cmp[i][0] = cc[0];
        cmp[i][1] = cc[1];
        cmp[i][2] = cc[2];
        cin>>c;
        if(c=='R') g[0][cc[0]++] = i;
        else if(c=='G') g[1][cc[1]++] = i;
        else g[2][cc[2]++] = i;
    }
    if(n==1){
        cout<<0<<endl;
        return 0;
    }
    for(int i = 0;i<=n;i++) for(int j = 0;j<=n;j++) for(int k = 0;k<=n;k++) for(int x = 0;x<3;x++) dp[i][j][k][x] = INF;
    for(int i = n-1;i>=1;i--){
        for(int aused = n;aused>=0;aused--){
            for(int bused = n;bused >= 0 ;bused--){
                int cused = i - (aused + bused);
                int ause = INF, buse = INF, cuse = INF;
                if(aused>cc[0] || bused>cc[1] || cused>cc[2]) continue;
                if(cused<0) continue;
                int currind;
                //calculate use[0]
                if(cc[0] > aused) {
                    currind = g[0][aused] + max((int) 0, bused - cmp[g[0][aused]][1]) +
                              max((int) 0, cused - cmp[g[0][aused]][2]);
                    ause = (currind - (i + 1)) + ((i == (n - 1)) ? 0 : dp[i + 1][aused + 1][bused][0]);
                }
                //calculate buse
                if(cc[1] > bused) {
                    currind = g[1][bused] + max((int) 0, aused - cmp[g[1][bused]][0]) +
                              max((int) 0, cused - cmp[g[1][bused]][2]);
                    buse = (currind - (i + 1)) + ((i == (n - 1)) ? 0 : dp[i + 1][aused][bused + 1][1]);
                }
                //calculate cuse
                if(cc[2] > cused) {
                    currind = g[2][cused] + max((int) 0, aused - cmp[g[2][cused]][0]) +
                              max((int) 0, bused - cmp[g[2][cused]][1]);
                    cuse = (currind - (i + 1)) + ((i == (n - 1)) ? 0 : dp[i + 1][aused][bused][2]);
                }

                dp[i][aused][bused][0] = min(buse, cuse);
                dp[i][aused][bused][1] = min(ause, cuse);
                dp[i][aused][bused][2] = min(buse, ause);
            }
        }
    }
    int ans = INF;
    if(cc[0]) {
        ans = min(ans, (g[0][0] - 1) + dp[1][1][0][0]);
    }
    if(cc[1]) {
        ans = min(ans, (g[1][0] - 1) + dp[1][0][1][1]);
    }
    if(cc[2]) {
        ans = min(ans, (g[2][0] - 1) + dp[1][0][0][2]);
    }
    if(ans>=INF) ans = -1;
    cout<<ans<<"\n";
}
//2^(2k - 1) - 2^(k-1)
/*
4 4
RGWR
GRRG
WGGW
WWWR

5 5
RGRGW
GRRGW
WGGWR
RWRGW
RGWGW

20
YYGYYYGGGGRGYYGRGRYG
 */

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 5 ms 1408 KB Output is correct
9 Correct 6 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 5 ms 1280 KB Output is correct
15 Correct 5 ms 1536 KB Output is correct
16 Correct 5 ms 1408 KB Output is correct
17 Correct 5 ms 1280 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 5 ms 1408 KB Output is correct
9 Correct 6 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 5 ms 1280 KB Output is correct
15 Correct 5 ms 1536 KB Output is correct
16 Correct 5 ms 1408 KB Output is correct
17 Correct 5 ms 1280 KB Output is correct
18 Correct 13 ms 18048 KB Output is correct
19 Correct 15 ms 18048 KB Output is correct
20 Correct 15 ms 18176 KB Output is correct
21 Correct 14 ms 18176 KB Output is correct
22 Correct 13 ms 18176 KB Output is correct
23 Correct 13 ms 18048 KB Output is correct
24 Correct 13 ms 18048 KB Output is correct
25 Correct 13 ms 18304 KB Output is correct
26 Correct 13 ms 18048 KB Output is correct
27 Correct 13 ms 18048 KB Output is correct
28 Correct 13 ms 18048 KB Output is correct
29 Correct 13 ms 18048 KB Output is correct
30 Correct 16 ms 18176 KB Output is correct
31 Correct 14 ms 18048 KB Output is correct
32 Correct 13 ms 18176 KB Output is correct
33 Correct 13 ms 17536 KB Output is correct
34 Correct 13 ms 17536 KB Output is correct
35 Correct 13 ms 16896 KB Output is correct
36 Correct 13 ms 17536 KB Output is correct
37 Correct 13 ms 16256 KB Output is correct
38 Correct 14 ms 18176 KB Output is correct
39 Correct 14 ms 18048 KB Output is correct
40 Correct 14 ms 17536 KB Output is correct
41 Correct 13 ms 18048 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 468 ms 766580 KB Output is correct
3 Correct 485 ms 762908 KB Output is correct
4 Correct 472 ms 766584 KB Output is correct
5 Correct 464 ms 766584 KB Output is correct
6 Correct 485 ms 766584 KB Output is correct
7 Correct 466 ms 762948 KB Output is correct
8 Correct 473 ms 762872 KB Output is correct
9 Correct 474 ms 759032 KB Output is correct
10 Correct 474 ms 766776 KB Output is correct
11 Correct 472 ms 766712 KB Output is correct
12 Correct 117 ms 204792 KB Output is correct
13 Correct 229 ms 360952 KB Output is correct
14 Correct 311 ms 522616 KB Output is correct
15 Correct 466 ms 766584 KB Output is correct
16 Correct 477 ms 766584 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 896 KB Output is correct
5 Correct 5 ms 1408 KB Output is correct
6 Correct 5 ms 1408 KB Output is correct
7 Correct 5 ms 1408 KB Output is correct
8 Correct 5 ms 1408 KB Output is correct
9 Correct 6 ms 1408 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1408 KB Output is correct
13 Correct 5 ms 1408 KB Output is correct
14 Correct 5 ms 1280 KB Output is correct
15 Correct 5 ms 1536 KB Output is correct
16 Correct 5 ms 1408 KB Output is correct
17 Correct 5 ms 1280 KB Output is correct
18 Correct 13 ms 18048 KB Output is correct
19 Correct 15 ms 18048 KB Output is correct
20 Correct 15 ms 18176 KB Output is correct
21 Correct 14 ms 18176 KB Output is correct
22 Correct 13 ms 18176 KB Output is correct
23 Correct 13 ms 18048 KB Output is correct
24 Correct 13 ms 18048 KB Output is correct
25 Correct 13 ms 18304 KB Output is correct
26 Correct 13 ms 18048 KB Output is correct
27 Correct 13 ms 18048 KB Output is correct
28 Correct 13 ms 18048 KB Output is correct
29 Correct 13 ms 18048 KB Output is correct
30 Correct 16 ms 18176 KB Output is correct
31 Correct 14 ms 18048 KB Output is correct
32 Correct 13 ms 18176 KB Output is correct
33 Correct 13 ms 17536 KB Output is correct
34 Correct 13 ms 17536 KB Output is correct
35 Correct 13 ms 16896 KB Output is correct
36 Correct 13 ms 17536 KB Output is correct
37 Correct 13 ms 16256 KB Output is correct
38 Correct 14 ms 18176 KB Output is correct
39 Correct 14 ms 18048 KB Output is correct
40 Correct 14 ms 17536 KB Output is correct
41 Correct 13 ms 18048 KB Output is correct
42 Correct 5 ms 384 KB Output is correct
43 Correct 468 ms 766580 KB Output is correct
44 Correct 485 ms 762908 KB Output is correct
45 Correct 472 ms 766584 KB Output is correct
46 Correct 464 ms 766584 KB Output is correct
47 Correct 485 ms 766584 KB Output is correct
48 Correct 466 ms 762948 KB Output is correct
49 Correct 473 ms 762872 KB Output is correct
50 Correct 474 ms 759032 KB Output is correct
51 Correct 474 ms 766776 KB Output is correct
52 Correct 472 ms 766712 KB Output is correct
53 Correct 117 ms 204792 KB Output is correct
54 Correct 229 ms 360952 KB Output is correct
55 Correct 311 ms 522616 KB Output is correct
56 Correct 466 ms 766584 KB Output is correct
57 Correct 477 ms 766584 KB Output is correct
58 Correct 491 ms 766716 KB Output is correct
59 Correct 484 ms 766584 KB Output is correct
60 Correct 496 ms 759040 KB Output is correct
61 Correct 484 ms 762744 KB Output is correct
62 Correct 482 ms 766584 KB Output is correct
63 Correct 487 ms 766584 KB Output is correct
64 Correct 486 ms 766584 KB Output is correct
65 Correct 480 ms 762872 KB Output is correct
66 Correct 486 ms 755192 KB Output is correct
67 Execution timed out 503 ms 766712 KB Time limit exceeded
68 Halted 0 ms 0 KB -