oj.uz

Submission #564695

# Submission time Handle Problem Language Result Execution time Memory
564695 2022-05-19T13:27:08 Z farhan132 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 447 ms 164800 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 long long 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 = 0;
            for(ll t = 0; t < 3; t++){
              if(c[t] == -1) b = v[t][w[t]];
            }
            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 'long long int'} and 'std::vector<long long 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 'long long int'} and 'std::vector<long long 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 'long long int'} and 'std::vector<long long 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:138:15: warning: unused variable 'CT' [-Wunused-variable]
  138 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 1 ms 476 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 604 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 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 1 ms 476 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 604 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 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 2388 KB Output is correct
19 Correct 3 ms 2004 KB Output is correct
20 Correct 3 ms 2392 KB Output is correct
21 Correct 3 ms 2516 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 3 ms 2260 KB Output is correct
24 Correct 2 ms 1752 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 3 ms 2516 KB Output is correct
29 Correct 3 ms 2388 KB Output is correct
30 Correct 3 ms 2388 KB Output is correct
31 Correct 3 ms 2132 KB Output is correct
32 Correct 3 ms 2516 KB Output is correct
33 Correct 3 ms 3924 KB Output is correct
34 Correct 3 ms 3668 KB Output is correct
35 Correct 3 ms 2772 KB Output is correct
36 Correct 3 ms 2004 KB Output is correct
37 Correct 2 ms 1876 KB Output is correct
38 Correct 3 ms 2260 KB Output is correct
39 Correct 3 ms 2392 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 2260 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 66 ms 164084 KB Output is correct
3 Correct 65 ms 163276 KB Output is correct
4 Correct 64 ms 164036 KB Output is correct
5 Correct 67 ms 164000 KB Output is correct
6 Correct 64 ms 164008 KB Output is correct
7 Correct 66 ms 163184 KB Output is correct
8 Correct 67 ms 163188 KB Output is correct
9 Correct 66 ms 162428 KB Output is correct
10 Correct 65 ms 163972 KB Output is correct
11 Correct 66 ms 164020 KB Output is correct
12 Correct 19 ms 44372 KB Output is correct
13 Correct 32 ms 77652 KB Output is correct
14 Correct 44 ms 112048 KB Output is correct
15 Correct 70 ms 164084 KB Output is correct
16 Correct 66 ms 164032 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 524 KB Output is correct
7 Correct 1 ms 476 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 604 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 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 2388 KB Output is correct
19 Correct 3 ms 2004 KB Output is correct
20 Correct 3 ms 2392 KB Output is correct
21 Correct 3 ms 2516 KB Output is correct
22 Correct 3 ms 1748 KB Output is correct
23 Correct 3 ms 2260 KB Output is correct
24 Correct 2 ms 1752 KB Output is correct
25 Correct 2 ms 3924 KB Output is correct
26 Correct 2 ms 4180 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 3 ms 2516 KB Output is correct
29 Correct 3 ms 2388 KB Output is correct
30 Correct 3 ms 2388 KB Output is correct
31 Correct 3 ms 2132 KB Output is correct
32 Correct 3 ms 2516 KB Output is correct
33 Correct 3 ms 3924 KB Output is correct
34 Correct 3 ms 3668 KB Output is correct
35 Correct 3 ms 2772 KB Output is correct
36 Correct 3 ms 2004 KB Output is correct
37 Correct 2 ms 1876 KB Output is correct
38 Correct 3 ms 2260 KB Output is correct
39 Correct 3 ms 2392 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 2260 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 66 ms 164084 KB Output is correct
44 Correct 65 ms 163276 KB Output is correct
45 Correct 64 ms 164036 KB Output is correct
46 Correct 67 ms 164000 KB Output is correct
47 Correct 64 ms 164008 KB Output is correct
48 Correct 66 ms 163184 KB Output is correct
49 Correct 67 ms 163188 KB Output is correct
50 Correct 66 ms 162428 KB Output is correct
51 Correct 65 ms 163972 KB Output is correct
52 Correct 66 ms 164020 KB Output is correct
53 Correct 19 ms 44372 KB Output is correct
54 Correct 32 ms 77652 KB Output is correct
55 Correct 44 ms 112048 KB Output is correct
56 Correct 70 ms 164084 KB Output is correct
57 Correct 66 ms 164032 KB Output is correct
58 Correct 447 ms 120544 KB Output is correct
59 Correct 435 ms 137928 KB Output is correct
60 Correct 434 ms 130124 KB Output is correct
61 Correct 442 ms 128204 KB Output is correct
62 Correct 91 ms 163592 KB Output is correct
63 Correct 114 ms 164800 KB Output is correct
64 Correct 258 ms 164560 KB Output is correct
65 Correct 341 ms 159064 KB Output is correct
66 Correct 423 ms 128392 KB Output is correct
67 Correct 437 ms 125584 KB Output is correct
68 Correct 441 ms 131388 KB Output is correct
69 Correct 434 ms 129056 KB Output is correct
70 Correct 438 ms 134904 KB Output is correct
71 Correct 424 ms 126260 KB Output is correct
72 Correct 120 ms 49696 KB Output is correct
73 Correct 27 ms 5376 KB Output is correct