oj.uz

Submission #564696

# Submission time Handle Problem Language Result Execution time Memory
564696 2022-05-19T13:29:36 Z farhan132 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 466 ms 163064 KB 
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
//const int inf = numeric_limits<int>::max()-1;
const int inf = 1e9;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 405;

ll dp[N][N][N][3];
ll pre[3][N];

vector < ll > v[N];

void solve(){

  ll n; cin >> n;
  string s; cin >> s;
  mem(pre, 0);
  for(ll i = 0; i < n; i++){
    
    if(s[i] == 'R') v[0].pb(i + 1), pre[0][i+1]++;
    if(s[i] == 'G') v[1].pb(i + 1), pre[1][i+1]++;
    if(s[i] == 'Y') v[2].pb(i + 1), pre[2][i+1]++;
    for(ll j = 0; j < 3; j++) pre[j][i + 1] += pre[j][i];

  }

  
  char a[] = {'R', 'G', 'Y'};
  ll ans = inf;
  dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;
  for(ll i = 0; i <= v[0].size(); i++){
    for(ll j = 0; j <= v[1].size(); j++){
      for(ll k = 0; k <= v[2].size(); k++){
        if(max({i, j, k}) == 0) continue;
        for(ll now = 0; now <= 2; now++){
          dp[i][j][k][now] = inf;
          vector < ll > c(3, 0);
          vector < ll > w = {i-1, j-1, k-1};
          c[now] = -1;
          if(min({i + c[0], j + c[1], k + c[2]}) < 0) continue;
          for(ll last = 0; last <= 2; last++){
            if(now == last) continue;  
            ll b = v[now][w[now]];
            ll vv = b;
            for(ll t = 0; t < 3; t++){
              if(w[t] >= 0) vv -= pre[t][min(b, v[t][w[t]])];
            }
            dp[i][j][k][now] = min(dp[i][j][k][now] , dp[i + c[0]][j + c[1]][k + c[2]][last] + vv);
          }
          if(i + j + k == n) ans = min(dp[i][j][k][now] , ans);
         
        }
      }
    }
  }
  if(ans == inf) ans = -1;
  cout << ans << '\n';


  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){
        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'void solve()':
joi2019_ho_t3.cpp:92:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |   for(ll i = 0; i <= v[0].size(); i++){
      |                 ~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:93:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(ll j = 0; j <= v[1].size(); j++){
      |                   ~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:94:23: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |       for(ll k = 0; k <= v[2].size(); k++){
      |                     ~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:89:8: warning: unused variable 'a' [-Wunused-variable]
   89 |   char a[] = {'R', 'G', 'Y'};
      |        ^
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:135:15: warning: unused variable 'CT' [-Wunused-variable]
  135 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 3 ms 2260 KB Output is correct
19 Correct 4 ms 1940 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct
21 Correct 5 ms 2388 KB Output is correct
22 Correct 2 ms 1620 KB Output is correct
23 Correct 3 ms 2092 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 3 ms 3028 KB Output is correct
28 Correct 5 ms 2260 KB Output is correct
29 Correct 3 ms 2260 KB Output is correct
30 Correct 3 ms 2260 KB Output is correct
31 Correct 4 ms 2000 KB Output is correct
32 Correct 5 ms 2388 KB Output is correct
33 Correct 2 ms 3796 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 3 ms 1876 KB Output is correct
37 Correct 3 ms 1748 KB Output is correct
38 Correct 3 ms 2132 KB Output is correct
39 Correct 3 ms 2260 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 2132 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 64 ms 162968 KB Output is correct
3 Correct 64 ms 162140 KB Output is correct
4 Correct 65 ms 162952 KB Output is correct
5 Correct 67 ms 162916 KB Output is correct
6 Correct 72 ms 163064 KB Output is correct
7 Correct 69 ms 162092 KB Output is correct
8 Correct 67 ms 162132 KB Output is correct
9 Correct 70 ms 161388 KB Output is correct
10 Correct 65 ms 162888 KB Output is correct
11 Correct 64 ms 162940 KB Output is correct
12 Correct 22 ms 44028 KB Output is correct
13 Correct 31 ms 77068 KB Output is correct
14 Correct 45 ms 111304 KB Output is correct
15 Correct 76 ms 162892 KB Output is correct
16 Correct 66 ms 162888 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 3 ms 2260 KB Output is correct
19 Correct 4 ms 1940 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct
21 Correct 5 ms 2388 KB Output is correct
22 Correct 2 ms 1620 KB Output is correct
23 Correct 3 ms 2092 KB Output is correct
24 Correct 2 ms 1620 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 3 ms 4180 KB Output is correct
27 Correct 3 ms 3028 KB Output is correct
28 Correct 5 ms 2260 KB Output is correct
29 Correct 3 ms 2260 KB Output is correct
30 Correct 3 ms 2260 KB Output is correct
31 Correct 4 ms 2000 KB Output is correct
32 Correct 5 ms 2388 KB Output is correct
33 Correct 2 ms 3796 KB Output is correct
34 Correct 2 ms 3540 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 3 ms 1876 KB Output is correct
37 Correct 3 ms 1748 KB Output is correct
38 Correct 3 ms 2132 KB Output is correct
39 Correct 3 ms 2260 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 2132 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 64 ms 162968 KB Output is correct
44 Correct 64 ms 162140 KB Output is correct
45 Correct 65 ms 162952 KB Output is correct
46 Correct 67 ms 162916 KB Output is correct
47 Correct 72 ms 163064 KB Output is correct
48 Correct 69 ms 162092 KB Output is correct
49 Correct 67 ms 162132 KB Output is correct
50 Correct 70 ms 161388 KB Output is correct
51 Correct 65 ms 162888 KB Output is correct
52 Correct 64 ms 162940 KB Output is correct
53 Correct 22 ms 44028 KB Output is correct
54 Correct 31 ms 77068 KB Output is correct
55 Correct 45 ms 111304 KB Output is correct
56 Correct 76 ms 162892 KB Output is correct
57 Correct 66 ms 162888 KB Output is correct
58 Correct 452 ms 76148 KB Output is correct
59 Correct 443 ms 96588 KB Output is correct
60 Correct 425 ms 87796 KB Output is correct
61 Correct 466 ms 84808 KB Output is correct
62 Correct 108 ms 160728 KB Output is correct
63 Correct 113 ms 160168 KB Output is correct
64 Correct 274 ms 150088 KB Output is correct
65 Correct 344 ms 138548 KB Output is correct
66 Correct 442 ms 86028 KB Output is correct
67 Correct 429 ms 82880 KB Output is correct
68 Correct 415 ms 88696 KB Output is correct
69 Correct 421 ms 85412 KB Output is correct
70 Correct 413 ms 92572 KB Output is correct
71 Correct 395 ms 83912 KB Output is correct
72 Correct 112 ms 41604 KB Output is correct
73 Correct 25 ms 2832 KB Output is correct