oj.uz

Submission #399881

# Submission time Handle Problem Language Result Execution time Memory
399881 2021-05-06T19:44:34 Z SavicS Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 97 ms 163040 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 405;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n;
int niz[maxn];
string s;

int dp[maxn][maxn][maxn][3]; // 0 - najmanji broj operacija, 1 - zadnja boja

int cnt[maxn][3];
vector<int> poz[maxn];

int f(char C){
   if(C == 'R')return 0;
   if(C == 'G')return 1;
   if(C == 'Y')return 2;
   assert(false);
}

int main()
{
   ios::sync_with_stdio(false);
   cout.tie(nullptr);
   cin.tie(nullptr);
   cin >> n >> s;
   ff(i,0,n - 1)niz[i + 1] = f(s[i]);

   ff(i,1,n){

      ff(j,0,2)cnt[i][j] = cnt[i - 1][j];
      cnt[i][niz[i]] += 1;

      poz[niz[i]].pb(i);

   }

   if(max({cnt[n][0], cnt[n][1], cnt[n][2]}) > (n + 1) / 2)return cout << -1, 0;
   int R = cnt[n][0], G = cnt[n][1], Y = cnt[n][2];

   ff(a,0,R)ff(b,0,G)ff(c,0,Y)ff(i,0,2)dp[a][b][c][i] = inf;

   dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;
   ff(a,0,R){
      ff(b,0,G){
         ff(c,0,Y){
            ff(i,0,2){

               if(a > 0 && i != 0){
                  // stavaljam R

                  int kol = dp[a - 1][b][c][i];
                  kol += max(0, cnt[poz[0][a - 1]][1] - b);
                  kol += max(0, cnt[poz[0][a - 1]][2] - c);
                  dp[a][b][c][0] = min(dp[a][b][c][0], kol);
               }

               if(b > 0 && i != 1){
                  int kol = dp[a][b - 1][c][i];
                  kol += max(0, cnt[poz[1][b - 1]][0] - a);
                  kol += max(0, cnt[poz[1][b - 1]][2] - c);
                  dp[a][b][c][1] = min(dp[a][b][c][1], kol);
               }

               if(c > 0 && i != 2){
                  int kol = dp[a][b][c - 1][i];
                  kol += max(0, cnt[poz[2][c - 1]][0] - a);
                  kol += max(0, cnt[poz[2][c - 1]][1] - b);
                  dp[a][b][c][2] = min(dp[a][b][c][2], kol);
               }

            }
         }
      }
   }

   int rez = inf;
   ff(i,0,2)rez = min(rez, dp[R][G][Y][i]);
   cout << rez << endl;

   return 0;
}
/**

6
RRGGYY

2
RG

20
YYGYYYGGGGRGYYGRGRYG

5
RRGYY

// probati bojenje sahovski ili slicno

**/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 2 ms 2416 KB Output is correct
22 Correct 2 ms 1612 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 2 ms 1612 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 3020 KB Output is correct
28 Correct 2 ms 2252 KB Output is correct
29 Correct 2 ms 2252 KB Output is correct
30 Correct 2 ms 2252 KB Output is correct
31 Correct 2 ms 1996 KB Output is correct
32 Correct 2 ms 2380 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 1868 KB Output is correct
37 Correct 2 ms 1740 KB Output is correct
38 Correct 2 ms 2124 KB Output is correct
39 Correct 2 ms 2256 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 70 ms 162944 KB Output is correct
3 Correct 69 ms 162080 KB Output is correct
4 Correct 68 ms 162884 KB Output is correct
5 Correct 71 ms 162876 KB Output is correct
6 Correct 69 ms 162892 KB Output is correct
7 Correct 67 ms 162180 KB Output is correct
8 Correct 66 ms 162176 KB Output is correct
9 Correct 69 ms 161348 KB Output is correct
10 Correct 69 ms 163040 KB Output is correct
11 Correct 70 ms 162884 KB Output is correct
12 Correct 21 ms 44048 KB Output is correct
13 Correct 35 ms 77124 KB Output is correct
14 Correct 49 ms 111332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 464 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 2 ms 2416 KB Output is correct
22 Correct 2 ms 1612 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 2 ms 1612 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 3 ms 3020 KB Output is correct
28 Correct 2 ms 2252 KB Output is correct
29 Correct 2 ms 2252 KB Output is correct
30 Correct 2 ms 2252 KB Output is correct
31 Correct 2 ms 1996 KB Output is correct
32 Correct 2 ms 2380 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 1868 KB Output is correct
37 Correct 2 ms 1740 KB Output is correct
38 Correct 2 ms 2124 KB Output is correct
39 Correct 2 ms 2256 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 70 ms 162944 KB Output is correct
44 Correct 69 ms 162080 KB Output is correct
45 Correct 68 ms 162884 KB Output is correct
46 Correct 71 ms 162876 KB Output is correct
47 Correct 69 ms 162892 KB Output is correct
48 Correct 67 ms 162180 KB Output is correct
49 Correct 66 ms 162176 KB Output is correct
50 Correct 69 ms 161348 KB Output is correct
51 Correct 69 ms 163040 KB Output is correct
52 Correct 70 ms 162884 KB Output is correct
53 Correct 21 ms 44048 KB Output is correct
54 Correct 35 ms 77124 KB Output is correct
55 Correct 49 ms 111332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 86 ms 76120 KB Output is correct
59 Correct 94 ms 96616 KB Output is correct
60 Correct 89 ms 87844 KB Output is correct
61 Correct 89 ms 84876 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 77 ms 160132 KB Output is correct
64 Correct 94 ms 150100 KB Output is correct
65 Correct 96 ms 138552 KB Output is correct
66 Correct 89 ms 86124 KB Output is correct
67 Correct 87 ms 82884 KB Output is correct
68 Correct 92 ms 88696 KB Output is correct
69 Correct 97 ms 85472 KB Output is correct
70 Correct 93 ms 92492 KB Output is correct
71 Correct 87 ms 83976 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 1 ms 340 KB Output is correct