oj.uz

Submission #200237

# Submission time Handle Problem Language Result Execution time Memory
200237 2020-02-05T17:31:56 Z mdn2002 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 496 ms 56444 KB 
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int n,dp[4][202][133][133];
vector<int>v[4];
string s;
int f(int x,int ir,int ig,int iy)
{
    if(ir+ig+iy==n)return 0;
    if(dp[x][ir][ig][iy]!=-1)return dp[x][ir][ig][iy];
    int ans=1e9,ind=ir+ig+iy,id;
    for(int i=0;i<3;i++)
    {
        if(i==x)continue;
        if(i==0)
        {
            if(ir==v[0].size())continue;
            int id=v[i][ir],ad=0;
            ad-=lower_bound(v[1].begin(),v[1].begin()+ig,id)-v[1].begin();
            ad+=ig;
            ad-=lower_bound(v[2].begin(),v[2].begin()+iy,id)-v[2].begin();
            ad+=iy;
            ans=min(ans,f(0,ir+1,ig,iy)+abs((id+ad)-ind));
        }
        if(i==1)
        {
            if(ig==v[1].size())continue;
            int id=v[i][ig],ad=0;
            ad-=lower_bound(v[0].begin(),v[0].begin()+ir,id)-v[0].begin();
            ad+=ir;
            ad-=lower_bound(v[2].begin(),v[2].begin()+iy,id)-v[2].begin();
            ad+=iy;
            ans=min(ans,f(1,ir,ig+1,iy)+abs((id+ad)-ind));
        }
        if(i==2)
        {
            if(iy==v[2].size())continue;
            int id=v[i][iy],ad=0;
            ad-=lower_bound(v[1].begin(),v[1].begin()+ig,id)-v[1].begin();
            ad+=ig;
            ad-=lower_bound(v[0].begin(),v[0].begin()+ir,id)-v[0].begin();
            ad+=ir;
            ans=min(ans,f(2,ir,ig,iy+1)+abs((id+ad)-ind));
        }
    }
    return dp[x][ir][ig][iy]=ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen("dec.in","r",stdin);
    //freopen("dec.out","w",stdout);
    memset(dp,-1,sizeof dp);
    cin>>n>>s;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='R')v[0].push_back(i);
        if(s[i]=='G')v[1].push_back(i);
        if(s[i]=='Y')v[2].push_back(i);
    }
    int mx=max(v[0].size(),max(v[1].size(),v[2].size()));
    if(mx-1>n-mx)
    {
        cout<<-1;
        return 0;
    }
    for(int i=1;i<3;i++)
    {
        if(v[0].size()<v[i].size())swap(v[0],v[i]);
    }
    int ans=f(3,0,0,0);
    cout<<ans;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int f(int, int, int, int)':
joi2019_ho_t3.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(ir==v[0].size())continue;
                ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:27:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(ig==v[1].size())continue;
                ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:37:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(iy==v[2].size())continue;
                ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:11:30: warning: unused variable 'id' [-Wunused-variable]
     int ans=1e9,ind=ir+ig+iy,id;
                              ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 56312 KB Output is correct
2 Correct 36 ms 56312 KB Output is correct
3 Correct 36 ms 56312 KB Output is correct
4 Correct 36 ms 56312 KB Output is correct
5 Correct 37 ms 56312 KB Output is correct
6 Correct 38 ms 56312 KB Output is correct
7 Correct 36 ms 56312 KB Output is correct
8 Correct 37 ms 56312 KB Output is correct
9 Correct 36 ms 56312 KB Output is correct
10 Correct 36 ms 56312 KB Output is correct
11 Correct 36 ms 56312 KB Output is correct
12 Correct 36 ms 56312 KB Output is correct
13 Correct 38 ms 56312 KB Output is correct
14 Correct 38 ms 56312 KB Output is correct
15 Correct 36 ms 56312 KB Output is correct
16 Correct 37 ms 56312 KB Output is correct
17 Correct 36 ms 56316 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 56312 KB Output is correct
2 Correct 36 ms 56312 KB Output is correct
3 Correct 36 ms 56312 KB Output is correct
4 Correct 36 ms 56312 KB Output is correct
5 Correct 37 ms 56312 KB Output is correct
6 Correct 38 ms 56312 KB Output is correct
7 Correct 36 ms 56312 KB Output is correct
8 Correct 37 ms 56312 KB Output is correct
9 Correct 36 ms 56312 KB Output is correct
10 Correct 36 ms 56312 KB Output is correct
11 Correct 36 ms 56312 KB Output is correct
12 Correct 36 ms 56312 KB Output is correct
13 Correct 38 ms 56312 KB Output is correct
14 Correct 38 ms 56312 KB Output is correct
15 Correct 36 ms 56312 KB Output is correct
16 Correct 37 ms 56312 KB Output is correct
17 Correct 36 ms 56316 KB Output is correct
18 Correct 40 ms 56216 KB Output is correct
19 Correct 39 ms 56312 KB Output is correct
20 Correct 39 ms 56440 KB Output is correct
21 Correct 38 ms 56312 KB Output is correct
22 Correct 38 ms 56312 KB Output is correct
23 Correct 38 ms 56312 KB Output is correct
24 Correct 37 ms 56312 KB Output is correct
25 Correct 37 ms 56312 KB Output is correct
26 Correct 36 ms 56312 KB Output is correct
27 Correct 37 ms 56312 KB Output is correct
28 Correct 39 ms 56312 KB Output is correct
29 Correct 36 ms 56312 KB Output is correct
30 Correct 36 ms 56312 KB Output is correct
31 Correct 38 ms 56316 KB Output is correct
32 Correct 37 ms 56312 KB Output is correct
33 Correct 40 ms 56312 KB Output is correct
34 Correct 37 ms 56312 KB Output is correct
35 Correct 37 ms 56312 KB Output is correct
36 Correct 37 ms 56312 KB Output is correct
37 Correct 37 ms 56312 KB Output is correct
38 Correct 37 ms 56316 KB Output is correct
39 Correct 38 ms 56312 KB Output is correct
40 Correct 37 ms 56312 KB Output is correct
41 Correct 37 ms 56312 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 56312 KB Output is correct
2 Correct 38 ms 56312 KB Output is correct
3 Correct 36 ms 56312 KB Output is correct
4 Correct 36 ms 56312 KB Output is correct
5 Correct 36 ms 56312 KB Output is correct
6 Correct 37 ms 56312 KB Output is correct
7 Correct 36 ms 56312 KB Output is correct
8 Correct 37 ms 56312 KB Output is correct
9 Correct 37 ms 56312 KB Output is correct
10 Correct 35 ms 56312 KB Output is correct
11 Correct 38 ms 56312 KB Output is correct
12 Correct 37 ms 56312 KB Output is correct
13 Correct 37 ms 56312 KB Output is correct
14 Correct 36 ms 56312 KB Output is correct
15 Correct 36 ms 56312 KB Output is correct
16 Correct 37 ms 56312 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 56312 KB Output is correct
2 Correct 36 ms 56312 KB Output is correct
3 Correct 36 ms 56312 KB Output is correct
4 Correct 36 ms 56312 KB Output is correct
5 Correct 37 ms 56312 KB Output is correct
6 Correct 38 ms 56312 KB Output is correct
7 Correct 36 ms 56312 KB Output is correct
8 Correct 37 ms 56312 KB Output is correct
9 Correct 36 ms 56312 KB Output is correct
10 Correct 36 ms 56312 KB Output is correct
11 Correct 36 ms 56312 KB Output is correct
12 Correct 36 ms 56312 KB Output is correct
13 Correct 38 ms 56312 KB Output is correct
14 Correct 38 ms 56312 KB Output is correct
15 Correct 36 ms 56312 KB Output is correct
16 Correct 37 ms 56312 KB Output is correct
17 Correct 36 ms 56316 KB Output is correct
18 Correct 40 ms 56216 KB Output is correct
19 Correct 39 ms 56312 KB Output is correct
20 Correct 39 ms 56440 KB Output is correct
21 Correct 38 ms 56312 KB Output is correct
22 Correct 38 ms 56312 KB Output is correct
23 Correct 38 ms 56312 KB Output is correct
24 Correct 37 ms 56312 KB Output is correct
25 Correct 37 ms 56312 KB Output is correct
26 Correct 36 ms 56312 KB Output is correct
27 Correct 37 ms 56312 KB Output is correct
28 Correct 39 ms 56312 KB Output is correct
29 Correct 36 ms 56312 KB Output is correct
30 Correct 36 ms 56312 KB Output is correct
31 Correct 38 ms 56316 KB Output is correct
32 Correct 37 ms 56312 KB Output is correct
33 Correct 40 ms 56312 KB Output is correct
34 Correct 37 ms 56312 KB Output is correct
35 Correct 37 ms 56312 KB Output is correct
36 Correct 37 ms 56312 KB Output is correct
37 Correct 37 ms 56312 KB Output is correct
38 Correct 37 ms 56316 KB Output is correct
39 Correct 38 ms 56312 KB Output is correct
40 Correct 37 ms 56312 KB Output is correct
41 Correct 37 ms 56312 KB Output is correct
42 Correct 36 ms 56312 KB Output is correct
43 Correct 38 ms 56312 KB Output is correct
44 Correct 36 ms 56312 KB Output is correct
45 Correct 36 ms 56312 KB Output is correct
46 Correct 36 ms 56312 KB Output is correct
47 Correct 37 ms 56312 KB Output is correct
48 Correct 36 ms 56312 KB Output is correct
49 Correct 37 ms 56312 KB Output is correct
50 Correct 37 ms 56312 KB Output is correct
51 Correct 35 ms 56312 KB Output is correct
52 Correct 38 ms 56312 KB Output is correct
53 Correct 37 ms 56312 KB Output is correct
54 Correct 37 ms 56312 KB Output is correct
55 Correct 36 ms 56312 KB Output is correct
56 Correct 36 ms 56312 KB Output is correct
57 Correct 37 ms 56312 KB Output is correct
58 Correct 487 ms 56312 KB Output is correct
59 Correct 496 ms 56444 KB Output is correct
60 Correct 463 ms 56312 KB Output is correct
61 Correct 490 ms 56312 KB Output is correct
62 Correct 37 ms 56312 KB Output is correct
63 Correct 40 ms 56312 KB Output is correct
64 Correct 89 ms 56312 KB Output is correct
65 Correct 189 ms 56312 KB Output is correct
66 Correct 283 ms 56312 KB Output is correct
67 Correct 280 ms 56312 KB Output is correct
68 Correct 311 ms 56312 KB Output is correct
69 Correct 352 ms 56312 KB Output is correct
70 Correct 371 ms 56440 KB Output is correct
71 Correct 416 ms 56312 KB Output is correct
72 Correct 37 ms 56312 KB Output is correct
73 Correct 36 ms 56312 KB Output is correct