oj.uz

Submission #200219

# Submission time Handle Problem Language Result Execution time Memory
200219 2020-02-05T17:14:30 Z mdn2002 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 431736 KB 
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int n,dp[4][302][302][302];
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;
            for(int j=0;j<ig;j++)
            {
                if(v[1][j]>id)ad++;
            }
            for(int j=0;j<iy;j++)
            {
                if(v[2][j]>id)ad++;
            }
            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;
            for(int j=0;j<ir;j++)
            {
                if(v[0][j]>id)ad++;
            }
            for(int j=0;j<iy;j++)
            {
                if(v[2][j]>id)ad++;
            }
            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;
            for(int j=0;j<ir;j++)
            {
                if(v[0][j]>id)ad++;
            }
            for(int j=0;j<ig;j++)
            {
                if(v[1][j]>id)ad++;
            }
            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;
    }
    int ans=f(3,0,0,0);
    if(ans>=1e8)cout<<-1;
    else 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:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(ig==v[1].size())continue;
                ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:45: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 270 ms 431480 KB Output is correct
2 Correct 252 ms 431584 KB Output is correct
3 Correct 247 ms 431480 KB Output is correct
4 Correct 253 ms 431608 KB Output is correct
5 Correct 250 ms 431608 KB Output is correct
6 Correct 245 ms 431608 KB Output is correct
7 Correct 245 ms 431480 KB Output is correct
8 Correct 244 ms 431584 KB Output is correct
9 Correct 249 ms 431480 KB Output is correct
10 Correct 245 ms 431480 KB Output is correct
11 Correct 240 ms 431608 KB Output is correct
12 Correct 245 ms 431608 KB Output is correct
13 Correct 239 ms 431608 KB Output is correct
14 Correct 243 ms 431480 KB Output is correct
15 Correct 244 ms 431480 KB Output is correct
16 Correct 249 ms 431608 KB Output is correct
17 Correct 240 ms 431608 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 431480 KB Output is correct
2 Correct 252 ms 431584 KB Output is correct
3 Correct 247 ms 431480 KB Output is correct
4 Correct 253 ms 431608 KB Output is correct
5 Correct 250 ms 431608 KB Output is correct
6 Correct 245 ms 431608 KB Output is correct
7 Correct 245 ms 431480 KB Output is correct
8 Correct 244 ms 431584 KB Output is correct
9 Correct 249 ms 431480 KB Output is correct
10 Correct 245 ms 431480 KB Output is correct
11 Correct 240 ms 431608 KB Output is correct
12 Correct 245 ms 431608 KB Output is correct
13 Correct 239 ms 431608 KB Output is correct
14 Correct 243 ms 431480 KB Output is correct
15 Correct 244 ms 431480 KB Output is correct
16 Correct 249 ms 431608 KB Output is correct
17 Correct 240 ms 431608 KB Output is correct
18 Correct 249 ms 431480 KB Output is correct
19 Correct 249 ms 431480 KB Output is correct
20 Correct 249 ms 431480 KB Output is correct
21 Correct 250 ms 431480 KB Output is correct
22 Correct 246 ms 431608 KB Output is correct
23 Correct 247 ms 431480 KB Output is correct
24 Correct 249 ms 431512 KB Output is correct
25 Correct 241 ms 431480 KB Output is correct
26 Correct 257 ms 431608 KB Output is correct
27 Correct 244 ms 431480 KB Output is correct
28 Correct 247 ms 431480 KB Output is correct
29 Correct 245 ms 431480 KB Output is correct
30 Correct 247 ms 431608 KB Output is correct
31 Correct 244 ms 431480 KB Output is correct
32 Correct 244 ms 431608 KB Output is correct
33 Correct 245 ms 431560 KB Output is correct
34 Correct 244 ms 431480 KB Output is correct
35 Correct 247 ms 431612 KB Output is correct
36 Correct 252 ms 431608 KB Output is correct
37 Correct 248 ms 431540 KB Output is correct
38 Correct 250 ms 431608 KB Output is correct
39 Correct 245 ms 431648 KB Output is correct
40 Correct 243 ms 431480 KB Output is correct
41 Correct 245 ms 431484 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 431480 KB Output is correct
2 Correct 245 ms 431608 KB Output is correct
3 Correct 247 ms 431608 KB Output is correct
4 Correct 248 ms 431612 KB Output is correct
5 Correct 254 ms 431608 KB Output is correct
6 Correct 247 ms 431736 KB Output is correct
7 Correct 246 ms 431608 KB Output is correct
8 Correct 244 ms 431608 KB Output is correct
9 Correct 245 ms 431608 KB Output is correct
10 Correct 242 ms 431608 KB Output is correct
11 Correct 243 ms 431608 KB Output is correct
12 Correct 252 ms 431608 KB Output is correct
13 Correct 250 ms 431608 KB Output is correct
14 Correct 248 ms 431608 KB Output is correct
15 Correct 254 ms 431608 KB Output is correct
16 Correct 248 ms 431616 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 431480 KB Output is correct
2 Correct 252 ms 431584 KB Output is correct
3 Correct 247 ms 431480 KB Output is correct
4 Correct 253 ms 431608 KB Output is correct
5 Correct 250 ms 431608 KB Output is correct
6 Correct 245 ms 431608 KB Output is correct
7 Correct 245 ms 431480 KB Output is correct
8 Correct 244 ms 431584 KB Output is correct
9 Correct 249 ms 431480 KB Output is correct
10 Correct 245 ms 431480 KB Output is correct
11 Correct 240 ms 431608 KB Output is correct
12 Correct 245 ms 431608 KB Output is correct
13 Correct 239 ms 431608 KB Output is correct
14 Correct 243 ms 431480 KB Output is correct
15 Correct 244 ms 431480 KB Output is correct
16 Correct 249 ms 431608 KB Output is correct
17 Correct 240 ms 431608 KB Output is correct
18 Correct 249 ms 431480 KB Output is correct
19 Correct 249 ms 431480 KB Output is correct
20 Correct 249 ms 431480 KB Output is correct
21 Correct 250 ms 431480 KB Output is correct
22 Correct 246 ms 431608 KB Output is correct
23 Correct 247 ms 431480 KB Output is correct
24 Correct 249 ms 431512 KB Output is correct
25 Correct 241 ms 431480 KB Output is correct
26 Correct 257 ms 431608 KB Output is correct
27 Correct 244 ms 431480 KB Output is correct
28 Correct 247 ms 431480 KB Output is correct
29 Correct 245 ms 431480 KB Output is correct
30 Correct 247 ms 431608 KB Output is correct
31 Correct 244 ms 431480 KB Output is correct
32 Correct 244 ms 431608 KB Output is correct
33 Correct 245 ms 431560 KB Output is correct
34 Correct 244 ms 431480 KB Output is correct
35 Correct 247 ms 431612 KB Output is correct
36 Correct 252 ms 431608 KB Output is correct
37 Correct 248 ms 431540 KB Output is correct
38 Correct 250 ms 431608 KB Output is correct
39 Correct 245 ms 431648 KB Output is correct
40 Correct 243 ms 431480 KB Output is correct
41 Correct 245 ms 431484 KB Output is correct
42 Correct 244 ms 431480 KB Output is correct
43 Correct 245 ms 431608 KB Output is correct
44 Correct 247 ms 431608 KB Output is correct
45 Correct 248 ms 431612 KB Output is correct
46 Correct 254 ms 431608 KB Output is correct
47 Correct 247 ms 431736 KB Output is correct
48 Correct 246 ms 431608 KB Output is correct
49 Correct 244 ms 431608 KB Output is correct
50 Correct 245 ms 431608 KB Output is correct
51 Correct 242 ms 431608 KB Output is correct
52 Correct 243 ms 431608 KB Output is correct
53 Correct 252 ms 431608 KB Output is correct
54 Correct 250 ms 431608 KB Output is correct
55 Correct 248 ms 431608 KB Output is correct
56 Correct 254 ms 431608 KB Output is correct
57 Correct 248 ms 431616 KB Output is correct
58 Execution timed out 1126 ms 431576 KB Time limit exceeded
59 Halted 0 ms 0 KB -