oj.uz

Submission #936957

# Submission time Handle Problem Language Result Execution time Memory
936957 2024-03-03T06:05:56 Z Maite_Morale Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 361 ms 224340 KB 
    #include<bits/stdc++.h>
    #define F first
    #define S second
    #define MAX 405
    #define oo 1e18
    #define mod 1000000007
    #define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
    using namespace std;
    typedef long long ll;
    #define pll pair<ll , ll>
    #define vll vector<ll>
    #define vvll vector<vll>
    #define vpll vector<pll>
     
    ll n,t[5][405];
    vll v[5];
    string a;
    ll dp[400][400][400][3],s[10]={0,0,0};
    ll cost(vll x,ll z){
        ll r=0;ll p=v[z][x[z]-1]-1;
        for(int i=0;i<3;i++){
            if(i==z)continue;
            r+=max(0LL,t[i][p]-x[i]);
        }
    return r;
    }
    int main(){
        fast_in
        cin>>n>>a;
        for(int i=0;i<n;i++){
            if(a[i]=='R'){v[0].push_back(i+1);t[0][i]++;}
            if(a[i]=='G'){v[1].push_back(i+1);t[1][i]++;}
            if(a[i]=='Y'){v[2].push_back(i+1);t[2][i]++;}
            if(i==0)continue;
            t[0][i]+=t[0][i-1];
            t[1][i]+=t[1][i-1];
            t[2][i]+=t[2][i-1];
        }
        for(int i=0;i<=v[0].size();i++){
            for(int j=0;j<=v[1].size();j++){
                for(int k=0;k<=v[2].size();k++){
                    for(int h=0;h<3;h++){
                        if(i+j+k==0){
                            dp[i][j][k][h]=0;
                          //  cout<<i<<" "<<j<<" "<<k<<" "<<h<<" "<<dp[i][j][k][h]<<".\n";
                            continue;
                        }
                        s[h]=1;dp[i][j][k][h]=oo;
                        if(min(i-s[0],min(j-s[1],k-s[2]))<0){
                            s[h]=0;
                           // cout<<i<<" "<<j<<" "<<k<<" "<<h<<" "<<dp[i][j][k][h]<<"_\n";
                            continue;
                        }
                        for(int h1=0;h1<3;h1++){
                            if(h1==h)continue;
                            ll z=dp[i][j][k][h],w=dp[i-s[0]][j-s[1]][k-s[2]][h1],w1=cost({i,j,k},h);
                            dp[i][j][k][h]=min(z,w+w1);
                        }
                       // cout<<i<<" "<<j<<" "<<k<<" "<<h<<" "<<dp[i][j][k][h]<<"\n";
                        s[h]=0;
                    }
                }
            }
        }
        sort(dp[v[0].size()][v[1].size()][v[2].size()],dp[v[0].size()][v[1].size()][v[2].size()]+3);
        if(dp[v[0].size()][v[1].size()][v[2].size()][0]==oo)dp[v[0].size()][v[1].size()][v[2].size()][0]=-1;
        cout<<dp[v[0].size()][v[1].size()][v[2].size()][0];
    return 0;
    }

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int i=0;i<=v[0].size();i++){
      |                     ~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:40:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for(int j=0;j<=v[1].size();j++){
      |                         ~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:41:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |                 for(int k=0;k<=v[2].size();k++){
      |                             ~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 20828 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10748 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 1 ms 344 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 20828 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10748 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 7 ms 47708 KB Output is correct
19 Correct 6 ms 39516 KB Output is correct
20 Correct 8 ms 51808 KB Output is correct
21 Correct 6 ms 45660 KB Output is correct
22 Correct 7 ms 49756 KB Output is correct
23 Correct 6 ms 39516 KB Output is correct
24 Correct 4 ms 24920 KB Output is correct
25 Correct 10 ms 74588 KB Output is correct
26 Correct 9 ms 72280 KB Output is correct
27 Correct 8 ms 60244 KB Output is correct
28 Correct 7 ms 45660 KB Output is correct
29 Correct 7 ms 45660 KB Output is correct
30 Correct 6 ms 39516 KB Output is correct
31 Correct 6 ms 35420 KB Output is correct
32 Correct 8 ms 41560 KB Output is correct
33 Correct 8 ms 62044 KB Output is correct
34 Correct 7 ms 53852 KB Output is correct
35 Correct 8 ms 51804 KB Output is correct
36 Correct 6 ms 41564 KB Output is correct
37 Correct 4 ms 31272 KB Output is correct
38 Correct 5 ms 35416 KB Output is correct
39 Correct 7 ms 43612 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 3 ms 22872 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 59 ms 222848 KB Output is correct
3 Correct 62 ms 222080 KB Output is correct
4 Correct 64 ms 221012 KB Output is correct
5 Correct 60 ms 224340 KB Output is correct
6 Correct 58 ms 222800 KB Output is correct
7 Correct 58 ms 220224 KB Output is correct
8 Correct 66 ms 220388 KB Output is correct
9 Correct 58 ms 221132 KB Output is correct
10 Correct 58 ms 221008 KB Output is correct
11 Correct 59 ms 221008 KB Output is correct
12 Correct 22 ms 107928 KB Output is correct
13 Correct 32 ms 140636 KB Output is correct
14 Correct 49 ms 172840 KB Output is correct
15 Correct 58 ms 222548 KB Output is correct
16 Correct 67 ms 222804 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 3 ms 20828 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 2 ms 10748 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 3 ms 22876 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 7 ms 47708 KB Output is correct
19 Correct 6 ms 39516 KB Output is correct
20 Correct 8 ms 51808 KB Output is correct
21 Correct 6 ms 45660 KB Output is correct
22 Correct 7 ms 49756 KB Output is correct
23 Correct 6 ms 39516 KB Output is correct
24 Correct 4 ms 24920 KB Output is correct
25 Correct 10 ms 74588 KB Output is correct
26 Correct 9 ms 72280 KB Output is correct
27 Correct 8 ms 60244 KB Output is correct
28 Correct 7 ms 45660 KB Output is correct
29 Correct 7 ms 45660 KB Output is correct
30 Correct 6 ms 39516 KB Output is correct
31 Correct 6 ms 35420 KB Output is correct
32 Correct 8 ms 41560 KB Output is correct
33 Correct 8 ms 62044 KB Output is correct
34 Correct 7 ms 53852 KB Output is correct
35 Correct 8 ms 51804 KB Output is correct
36 Correct 6 ms 41564 KB Output is correct
37 Correct 4 ms 31272 KB Output is correct
38 Correct 5 ms 35416 KB Output is correct
39 Correct 7 ms 43612 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 3 ms 22872 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 59 ms 222848 KB Output is correct
44 Correct 62 ms 222080 KB Output is correct
45 Correct 64 ms 221012 KB Output is correct
46 Correct 60 ms 224340 KB Output is correct
47 Correct 58 ms 222800 KB Output is correct
48 Correct 58 ms 220224 KB Output is correct
49 Correct 66 ms 220388 KB Output is correct
50 Correct 58 ms 221132 KB Output is correct
51 Correct 58 ms 221008 KB Output is correct
52 Correct 59 ms 221008 KB Output is correct
53 Correct 22 ms 107928 KB Output is correct
54 Correct 32 ms 140636 KB Output is correct
55 Correct 49 ms 172840 KB Output is correct
56 Correct 58 ms 222548 KB Output is correct
57 Correct 67 ms 222804 KB Output is correct
58 Correct 327 ms 172116 KB Output is correct
59 Correct 339 ms 192876 KB Output is correct
60 Correct 334 ms 182868 KB Output is correct
61 Correct 328 ms 178584 KB Output is correct
62 Correct 80 ms 224280 KB Output is correct
63 Correct 110 ms 220728 KB Output is correct
64 Correct 204 ms 220816 KB Output is correct
65 Correct 256 ms 214008 KB Output is correct
66 Correct 336 ms 180332 KB Output is correct
67 Correct 323 ms 174540 KB Output is correct
68 Correct 361 ms 183944 KB Output is correct
69 Correct 351 ms 180052 KB Output is correct
70 Correct 334 ms 188720 KB Output is correct
71 Correct 333 ms 179984 KB Output is correct
72 Correct 96 ms 120396 KB Output is correct
73 Correct 20 ms 15016 KB Output is correct