oj.uz

Submission #920157

# Submission time Handle Problem Language Result Execution time Memory
920157 2024-02-02T06:54:16 Z vjudge1 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 355 ms 1010156 KB 
    #include "bits/stdc++.h"
    #pragma optimize ("Bismillahirrahmanirrahim")
    using namespace std;
    #define pb push_back
    #define ff first
    #define ss second
    #define endl "\n" 
    //#define int long long
    #define double long double
    #define sz(x) ((int)(x).size())
    #define all(x) (x).begin(), (x).end()
    #define rall(x) (x).rbegin(), (x).rend()
    #define what_is(x) cerr << #x << " is " << x << endl;
    //#define m (l+r)/2
    constexpr int N=200005;
    constexpr int MOD=1000000007;
    //constexpr int  INF2 = LLONG_MAX;
    constexpr int INF=(int)1e9;
    constexpr int LOG=30;
    typedef pair<int,int> pii;
    typedef tuple<int,int,int> tp;
    typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
    typedef priority_queue<pii> max_pq;
    typedef long long ll;
    //to think//
    /*
     * graph approach
     * dp
     * dividing the problem to smaller statements
     * finding the real constraint
     * sqrt decomposition
     * greedy approach
     * pigeonhole principle
     * rewriting the problem/equality 
     * bitwise approaches
     * binary search if monotonic
     * divide and conquer
     * combinatorics
     * inclusion - exclusion
     * think like bfs
    */
     
     
     
    inline int in()
    {
      int x;cin >> x;
      return x;
    }
     
    inline string in2()
    {
      string x;cin >> x;
      return x;
    }
     
    string s;
    int n;
    vector<int> poz[3];
     
    int dp[401][401][401][4];
    int pre[404][3];
     
    inline int cost(int a,int b,int c,int r)
    {
      int res=0;
      if(r==0)
      {
        res+=max(0,pre[poz[0][a]][1]-(b==0 ? 0 : pre[poz[1][b-1]][1]));
        res+=max(0,pre[poz[0][a]][2]-(c==0 ? 0 : pre[poz[2][c-1]][2]));
      }
      else if(r==1)
      {
        res+=max(0,pre[poz[1][b]][0]-(a==0 ? 0 : pre[poz[0][a-1]][0]));
        res+=max(0,pre[poz[1][b]][2]-(c==0 ? 0 : pre[poz[2][c-1]][2]));
      }
      else
      {
        res+=max(0,pre[poz[2][c]][0]-(a==0 ? 0 : pre[poz[0][a-1]][0]));
        res+=max(0,pre[poz[2][c]][1]-(b==0 ? 0 : pre[poz[1][b-1]][1]));
      }
      return max(0,res);
    }
     
    inline int f(int a,int b,int c,int fl)
    {
      if(a+b+c>n) return INF;
      if(a+b+c==n) return 0;
      if(dp[a][b][c][fl]!=-1) return dp[a][b][c][fl];
      if(fl==0)
      {
        if(b==sz(poz[1]) && c==sz(poz[2])) return dp[a][b][c][fl]=INF;
        int cev1=INF;
        if(b<sz(poz[1])) cev1=min(cev1,f(a,b+1,c,1)+cost(a,b,c,1));
        if(c<sz(poz[2])) cev1=min(cev1,f(a,b,c+1,2)+cost(a,b,c,2));
        return dp[a][b][c][fl]=cev1;
      }
      else if(fl==1)
      {
        if(a==sz(poz[0]) && c==sz(poz[2])) return dp[a][b][c][fl]=INF;
        int cev1=INF;
        if(a<sz(poz[0])) cev1=min(cev1,f(a+1,b,c,0)+cost(a,b,c,0));
        if(c<sz(poz[2])) cev1=min(cev1,f(a,b,c+1,2)+cost(a,b,c,2));
        return dp[a][b][c][fl]=cev1;
      }
      else if(fl==2)
      {
        if(a==sz(poz[0]) && b==sz(poz[1])) return dp[a][b][c][fl]=INF;
        int cev1=INF;
        if(a<sz(poz[0])) cev1=min(cev1,f(a+1,b,c,0)+cost(a,b,c,0));
        if(b<sz(poz[1])) cev1=min(cev1,f(a,b+1,c,1)+cost(a,b,c,1));
        return dp[a][b][c][fl]=cev1;
      }
      
      if(a==sz(poz[0]) && b==sz(poz[1]) && c==sz(poz[2])) return dp[a][b][c][fl]=INF;
      int cev1=INF;
      if(a<sz(poz[0])) cev1=min(cev1,f(a+1,b,c,0)+cost(a,b,c,0));
      if(b<sz(poz[1])) cev1=min(cev1,f(a,b+1,c,1)+cost(a,b,c,1));
      if(c<sz(poz[2])) cev1=min(cev1,f(a,b,c+1,2)+cost(a,b,c,2));
      return dp[a][b][c][fl]=cev1;
    }
     
    void solve()
    {
      memset(dp,-1,sizeof(dp));
      n=in();s=in2();
      s="$"+ s;
      for(int i=1;i<=n;i++)
      {
        pre[i][0]=pre[i-1][0];
        pre[i][1]=pre[i-1][1];
        pre[i][2]=pre[i-1][2];
        if(s[i]=='R') {poz[0].pb(i);pre[i][0]++;}
        else if(s[i]=='G') {poz[1].pb(i);pre[i][1]++;}
        else {poz[2].pb(i);pre[i][2]++;} 
      }
      int ans=f(0,0,0,3);
      if(ans==INF) cout << -1 << endl;
      else cout << ans << endl;
    }
     
    int32_t main(){
       
     
         cin.tie(0); ios::sync_with_stdio(0);
         cout << fixed <<  setprecision(15);
       
       int t=1;//cin>> t;
     
     for(int i=1;i<=t;i++)
     {
      //  cout << "Case #" << i << ": ";
        solve();
     }
     
     return 0;
    }

Compilation message

joi2019_ho_t3.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 |     #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 1009752 KB Output is correct
2 Correct 256 ms 1009768 KB Output is correct
3 Correct 236 ms 1009916 KB Output is correct
4 Correct 307 ms 1009744 KB Output is correct
5 Correct 231 ms 1009744 KB Output is correct
6 Correct 235 ms 1010156 KB Output is correct
7 Correct 231 ms 1009744 KB Output is correct
8 Correct 234 ms 1010016 KB Output is correct
9 Correct 230 ms 1009744 KB Output is correct
10 Correct 235 ms 1010016 KB Output is correct
11 Correct 236 ms 1009744 KB Output is correct
12 Correct 236 ms 1009744 KB Output is correct
13 Correct 239 ms 1009744 KB Output is correct
14 Correct 235 ms 1009848 KB Output is correct
15 Correct 233 ms 1009880 KB Output is correct
16 Correct 235 ms 1010008 KB Output is correct
17 Correct 234 ms 1009968 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 1009752 KB Output is correct
2 Correct 256 ms 1009768 KB Output is correct
3 Correct 236 ms 1009916 KB Output is correct
4 Correct 307 ms 1009744 KB Output is correct
5 Correct 231 ms 1009744 KB Output is correct
6 Correct 235 ms 1010156 KB Output is correct
7 Correct 231 ms 1009744 KB Output is correct
8 Correct 234 ms 1010016 KB Output is correct
9 Correct 230 ms 1009744 KB Output is correct
10 Correct 235 ms 1010016 KB Output is correct
11 Correct 236 ms 1009744 KB Output is correct
12 Correct 236 ms 1009744 KB Output is correct
13 Correct 239 ms 1009744 KB Output is correct
14 Correct 235 ms 1009848 KB Output is correct
15 Correct 233 ms 1009880 KB Output is correct
16 Correct 235 ms 1010008 KB Output is correct
17 Correct 234 ms 1009968 KB Output is correct
18 Correct 232 ms 1009956 KB Output is correct
19 Correct 232 ms 1009876 KB Output is correct
20 Correct 237 ms 1009712 KB Output is correct
21 Correct 232 ms 1009840 KB Output is correct
22 Correct 235 ms 1010000 KB Output is correct
23 Correct 232 ms 1009852 KB Output is correct
24 Correct 229 ms 1009744 KB Output is correct
25 Correct 229 ms 1009744 KB Output is correct
26 Correct 233 ms 1009744 KB Output is correct
27 Correct 231 ms 1009776 KB Output is correct
28 Correct 241 ms 1009744 KB Output is correct
29 Correct 228 ms 1009928 KB Output is correct
30 Correct 237 ms 1009744 KB Output is correct
31 Correct 236 ms 1009744 KB Output is correct
32 Correct 230 ms 1009744 KB Output is correct
33 Correct 236 ms 1009744 KB Output is correct
34 Correct 235 ms 1009744 KB Output is correct
35 Correct 234 ms 1009808 KB Output is correct
36 Correct 232 ms 1009900 KB Output is correct
37 Correct 229 ms 1009744 KB Output is correct
38 Correct 235 ms 1009744 KB Output is correct
39 Correct 230 ms 1009840 KB Output is correct
40 Correct 235 ms 1010060 KB Output is correct
41 Correct 232 ms 1009744 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 1009832 KB Output is correct
2 Correct 235 ms 1009744 KB Output is correct
3 Correct 235 ms 1009744 KB Output is correct
4 Correct 235 ms 1010092 KB Output is correct
5 Correct 237 ms 1009776 KB Output is correct
6 Correct 238 ms 1009852 KB Output is correct
7 Correct 230 ms 1009864 KB Output is correct
8 Correct 231 ms 1009960 KB Output is correct
9 Correct 230 ms 1009744 KB Output is correct
10 Correct 229 ms 1009744 KB Output is correct
11 Correct 235 ms 1009844 KB Output is correct
12 Correct 233 ms 1009908 KB Output is correct
13 Correct 230 ms 1010000 KB Output is correct
14 Correct 232 ms 1009776 KB Output is correct
15 Correct 236 ms 1009816 KB Output is correct
16 Correct 231 ms 1009744 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 1009752 KB Output is correct
2 Correct 256 ms 1009768 KB Output is correct
3 Correct 236 ms 1009916 KB Output is correct
4 Correct 307 ms 1009744 KB Output is correct
5 Correct 231 ms 1009744 KB Output is correct
6 Correct 235 ms 1010156 KB Output is correct
7 Correct 231 ms 1009744 KB Output is correct
8 Correct 234 ms 1010016 KB Output is correct
9 Correct 230 ms 1009744 KB Output is correct
10 Correct 235 ms 1010016 KB Output is correct
11 Correct 236 ms 1009744 KB Output is correct
12 Correct 236 ms 1009744 KB Output is correct
13 Correct 239 ms 1009744 KB Output is correct
14 Correct 235 ms 1009848 KB Output is correct
15 Correct 233 ms 1009880 KB Output is correct
16 Correct 235 ms 1010008 KB Output is correct
17 Correct 234 ms 1009968 KB Output is correct
18 Correct 232 ms 1009956 KB Output is correct
19 Correct 232 ms 1009876 KB Output is correct
20 Correct 237 ms 1009712 KB Output is correct
21 Correct 232 ms 1009840 KB Output is correct
22 Correct 235 ms 1010000 KB Output is correct
23 Correct 232 ms 1009852 KB Output is correct
24 Correct 229 ms 1009744 KB Output is correct
25 Correct 229 ms 1009744 KB Output is correct
26 Correct 233 ms 1009744 KB Output is correct
27 Correct 231 ms 1009776 KB Output is correct
28 Correct 241 ms 1009744 KB Output is correct
29 Correct 228 ms 1009928 KB Output is correct
30 Correct 237 ms 1009744 KB Output is correct
31 Correct 236 ms 1009744 KB Output is correct
32 Correct 230 ms 1009744 KB Output is correct
33 Correct 236 ms 1009744 KB Output is correct
34 Correct 235 ms 1009744 KB Output is correct
35 Correct 234 ms 1009808 KB Output is correct
36 Correct 232 ms 1009900 KB Output is correct
37 Correct 229 ms 1009744 KB Output is correct
38 Correct 235 ms 1009744 KB Output is correct
39 Correct 230 ms 1009840 KB Output is correct
40 Correct 235 ms 1010060 KB Output is correct
41 Correct 232 ms 1009744 KB Output is correct
42 Correct 229 ms 1009832 KB Output is correct
43 Correct 235 ms 1009744 KB Output is correct
44 Correct 235 ms 1009744 KB Output is correct
45 Correct 235 ms 1010092 KB Output is correct
46 Correct 237 ms 1009776 KB Output is correct
47 Correct 238 ms 1009852 KB Output is correct
48 Correct 230 ms 1009864 KB Output is correct
49 Correct 231 ms 1009960 KB Output is correct
50 Correct 230 ms 1009744 KB Output is correct
51 Correct 229 ms 1009744 KB Output is correct
52 Correct 235 ms 1009844 KB Output is correct
53 Correct 233 ms 1009908 KB Output is correct
54 Correct 230 ms 1010000 KB Output is correct
55 Correct 232 ms 1009776 KB Output is correct
56 Correct 236 ms 1009816 KB Output is correct
57 Correct 231 ms 1009744 KB Output is correct
58 Correct 303 ms 1009948 KB Output is correct
59 Correct 300 ms 1010000 KB Output is correct
60 Correct 314 ms 1010000 KB Output is correct
61 Correct 308 ms 1010000 KB Output is correct
62 Correct 233 ms 1009988 KB Output is correct
63 Correct 230 ms 1009744 KB Output is correct
64 Correct 243 ms 1009748 KB Output is correct
65 Correct 269 ms 1010000 KB Output is correct
66 Correct 312 ms 1009744 KB Output is correct
67 Correct 305 ms 1010068 KB Output is correct
68 Correct 355 ms 1009820 KB Output is correct
69 Correct 310 ms 1009744 KB Output is correct
70 Correct 303 ms 1009956 KB Output is correct
71 Correct 305 ms 1009956 KB Output is correct
72 Correct 242 ms 1009760 KB Output is correct
73 Correct 230 ms 1009920 KB Output is correct