oj.uz

Submission #883202

# Submission time Handle Problem Language Result Execution time Memory
883202 2023-12-04T18:59:51 Z mychecksedad Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 301 ms 774216 KB 
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 405, M = 1e5+10, K = 52, MX = 30;


int n, dp[N][N][N][3], pref[N][3];
string s, c = "RGY";
int m(char x){
  if(x==c[0]) return 0;
  if(x==c[1]) return 1;
  return 2;
}
void solve(){
  cin >> n >> s;
  array<int, 3> x = {0, 0, 0};
  for(int i = 0 ;i < n; ++i){
    x[m(s[i])]++;
  }
  if(max({x[0], x[1], x[2]}) > (n+1)/2){
    cout << -1;
    return;
  }
  vector<int> v[3];
  for(int i = 0; i < n; ++i){
    v[m(s[i])].pb(i + 1);
  }
  // for(auto x: v[0]) cout << x << ' '; en;
  // for(auto x: v[1]) cout << x << ' '; en;
  // for(auto x: v[2]) cout << x << ' '; en;
  for(int i = 0; i <= n; ++i) for(int j = 0; j <= n; ++j) for(int l = 0; l <= n; ++l) dp[i][j][l][0] = dp[i][j][l][1] = dp[i][j][l][2] = MOD;
  dp[0][0][0][0] = 0;
  dp[0][0][0][1] = 0;
  dp[0][0][0][2] = 0;

  pref[0][0] = pref[0][1] = pref[0][2] = 0;
  for(int i = 1; i <= n; ++i){
    pref[i][0] = pref[i - 1][0];
    pref[i][1] = pref[i - 1][1];
    pref[i][2] = pref[i - 1][2];
    pref[i][m(s[i-1])]++;
  }

  for(int i = 1; i <= n; ++i){
    for(int j = 0; j <= min(i, x[0]); ++j){
      for(int l = 0; l <= min(i - j, x[1]); ++l){
        for(int x1 = 0; x1 < 3; ++x1){
          array<int, 3> y = {j, l, i-j-l};
          if(y[0] > x[0]) continue;
          if(y[1] > x[1]) continue;
          if(y[2] > x[2]) continue;
           
          if(y[x1] == 0) continue;

          int cost = v[x1][y[x1] - 1];

          int add = 0;
          for(int t = 0; t < 3; ++t){
            add += min(pref[cost - 1][t], y[t] - (t == x1));
          }
          cost += i - add - 1;

          if(x1 == 0) y[0]--;
          if(x1 == 1) y[1]--;
          if(x1 == 2) y[2]--;

          for(int x2 = 0; x2 < 3; ++x2){
            if(x1==x2) continue;
            dp[i][j][l][x1] = min(dp[i][j][l][x1], dp[i - 1][y[0]][y[1]][x2] + cost - i);
          }
        }
        // en;
      }
    }
  }
  cout << min({dp[n][x[0]][x[1]][0], dp[n][x[0]][x[1]][1], dp[n][x[0]][x[1]][2]});
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:88:15: warning: unused variable 'aa' [-Wunused-variable]
   88 |   int tt = 1, aa;
      |               ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4580 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 20828 KB Output is correct
5 Correct 4 ms 31284 KB Output is correct
6 Correct 3 ms 31068 KB Output is correct
7 Correct 3 ms 31068 KB Output is correct
8 Correct 3 ms 31068 KB Output is correct
9 Correct 4 ms 31068 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 31268 KB Output is correct
12 Correct 4 ms 31068 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 29020 KB Output is correct
15 Correct 4 ms 31068 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4580 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 20828 KB Output is correct
5 Correct 4 ms 31284 KB Output is correct
6 Correct 3 ms 31068 KB Output is correct
7 Correct 3 ms 31068 KB Output is correct
8 Correct 3 ms 31068 KB Output is correct
9 Correct 4 ms 31068 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 31268 KB Output is correct
12 Correct 4 ms 31068 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 29020 KB Output is correct
15 Correct 4 ms 31068 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 23 ms 117548 KB Output is correct
19 Correct 13 ms 117596 KB Output is correct
20 Correct 12 ms 117400 KB Output is correct
21 Correct 13 ms 117596 KB Output is correct
22 Correct 12 ms 117516 KB Output is correct
23 Correct 12 ms 117596 KB Output is correct
24 Correct 12 ms 117436 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 117596 KB Output is correct
28 Correct 13 ms 117616 KB Output is correct
29 Correct 13 ms 117748 KB Output is correct
30 Correct 13 ms 117512 KB Output is correct
31 Correct 13 ms 117596 KB Output is correct
32 Correct 14 ms 117596 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 12 ms 113240 KB Output is correct
36 Correct 12 ms 115548 KB Output is correct
37 Correct 14 ms 111196 KB Output is correct
38 Correct 13 ms 117532 KB Output is correct
39 Correct 13 ms 117596 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 247 ms 773972 KB Output is correct
3 Correct 188 ms 772268 KB Output is correct
4 Correct 175 ms 773976 KB Output is correct
5 Correct 175 ms 774124 KB Output is correct
6 Correct 171 ms 774216 KB Output is correct
7 Correct 172 ms 772084 KB Output is correct
8 Correct 183 ms 772012 KB Output is correct
9 Correct 165 ms 770188 KB Output is correct
10 Correct 187 ms 773992 KB Output is correct
11 Correct 174 ms 774116 KB Output is correct
12 Correct 55 ms 398676 KB Output is correct
13 Correct 85 ms 529932 KB Output is correct
14 Correct 119 ms 638756 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 4580 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 20828 KB Output is correct
5 Correct 4 ms 31284 KB Output is correct
6 Correct 3 ms 31068 KB Output is correct
7 Correct 3 ms 31068 KB Output is correct
8 Correct 3 ms 31068 KB Output is correct
9 Correct 4 ms 31068 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 31268 KB Output is correct
12 Correct 4 ms 31068 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 29020 KB Output is correct
15 Correct 4 ms 31068 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 23 ms 117548 KB Output is correct
19 Correct 13 ms 117596 KB Output is correct
20 Correct 12 ms 117400 KB Output is correct
21 Correct 13 ms 117596 KB Output is correct
22 Correct 12 ms 117516 KB Output is correct
23 Correct 12 ms 117596 KB Output is correct
24 Correct 12 ms 117436 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 12 ms 117596 KB Output is correct
28 Correct 13 ms 117616 KB Output is correct
29 Correct 13 ms 117748 KB Output is correct
30 Correct 13 ms 117512 KB Output is correct
31 Correct 13 ms 117596 KB Output is correct
32 Correct 14 ms 117596 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 12 ms 113240 KB Output is correct
36 Correct 12 ms 115548 KB Output is correct
37 Correct 14 ms 111196 KB Output is correct
38 Correct 13 ms 117532 KB Output is correct
39 Correct 13 ms 117596 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 247 ms 773972 KB Output is correct
44 Correct 188 ms 772268 KB Output is correct
45 Correct 175 ms 773976 KB Output is correct
46 Correct 175 ms 774124 KB Output is correct
47 Correct 171 ms 774216 KB Output is correct
48 Correct 172 ms 772084 KB Output is correct
49 Correct 183 ms 772012 KB Output is correct
50 Correct 165 ms 770188 KB Output is correct
51 Correct 187 ms 773992 KB Output is correct
52 Correct 174 ms 774116 KB Output is correct
53 Correct 55 ms 398676 KB Output is correct
54 Correct 85 ms 529932 KB Output is correct
55 Correct 119 ms 638756 KB Output is correct
56 Correct 0 ms 352 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 228 ms 774216 KB Output is correct
59 Correct 219 ms 773984 KB Output is correct
60 Correct 217 ms 769872 KB Output is correct
61 Correct 224 ms 772168 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 183 ms 773968 KB Output is correct
64 Correct 210 ms 773972 KB Output is correct
65 Correct 207 ms 771924 KB Output is correct
66 Correct 242 ms 767824 KB Output is correct
67 Correct 293 ms 771404 KB Output is correct
68 Correct 301 ms 767976 KB Output is correct
69 Correct 296 ms 770564 KB Output is correct
70 Correct 301 ms 770616 KB Output is correct
71 Correct 224 ms 772112 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct