oj.uz

Submission #707048

# Submission time Handle Problem Language Result Execution time Memory
707048 2023-03-08T11:01:11 Z epicci23 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
60 / 100
 10 ms 1364 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)1e18;
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];
map<array<int,4>,int> dp;
int pre[204][3];

int cost(int a,int b,int c,int r)
{
  //cout << "a: " << a << " b: " << b << " c: " << c << " r: " << r << endl;
  int res=0;
  if(r==0)
  {
    if(b<sz(poz[1])) res+=max(0LL,pre[poz[0][a]][1]-(b==0 ? 0 : pre[poz[1][b-1]][1]));
    //cout << "res: " << res << endl;
    if(c<sz(poz[2])) res+=max(0LL,pre[poz[0][a]][2]-(c==0 ? 0 : pre[poz[2][c-1]][2]));
    //cout << "res: " << res << endl;
  }
  else if(r==1)
  {
    if(a<sz(poz[0])) res+=max(0LL,pre[poz[1][b]][0]-(a==0 ? 0 : pre[poz[0][a-1]][0]));
    //cout << "res: " << res << endl;
    if(c<sz(poz[2])) res+=max(0LL,pre[poz[1][b]][2]-(c==0 ? 0 : pre[poz[2][c-1]][2]));
    //cout << "res: " << res << endl;
  }
  else
  {
    if(a<sz(poz[0])) res+=max(0LL,pre[poz[2][c]][0]-(a==0 ? 0 : pre[poz[0][a-1]][0]));
    //cout << "res: " << res << endl;
    if(b<sz(poz[1])) res+=max(0LL,pre[poz[2][c]][1]-(b==0 ? 0 : pre[poz[1][b-1]][1]));
    //cout << "res: " << res << endl;
  }
  return max(0LL,res);
}

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.count({a,b,c,fl})) 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));
   /* cout << "hesap\n";
    cout << "a: " << a << " b: " << b << " c: " << c  << endl;
    cout << "cev1: " << cev1 << endl;*/
    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));
    /*cout << "hesap\n";
    cout << "a: " << a << " b: " << b << " c: " << c  << endl;
    cout << "cev1: " << cev1 << endl;*/
    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));
    /*cout << "hesap\n";
    cout << "a: " << a << " b: " << b << " c: " << c  << endl;
    cout << "cev1: " << cev1 << endl;*/
    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));
  /*cout << "hesap\n";
  cout << "a: " << a << " b: " << b << " c: " << c  << endl;
  cout << "cev1: " << cev1 << endl;*/
  return dp[{a,b,c,fl}]=cev1;
}

void solve()
{
  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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 10 ms 1284 KB Output is correct
19 Correct 7 ms 1236 KB Output is correct
20 Correct 7 ms 1236 KB Output is correct
21 Correct 7 ms 1364 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 7 ms 1364 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 7 ms 980 KB Output is correct
28 Correct 8 ms 1364 KB Output is correct
29 Correct 7 ms 1364 KB Output is correct
30 Correct 7 ms 1332 KB Output is correct
31 Correct 7 ms 1236 KB Output is correct
32 Correct 7 ms 1236 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 5 ms 980 KB Output is correct
38 Correct 6 ms 1108 KB Output is correct
39 Correct 7 ms 1364 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 10 ms 1284 KB Output is correct
19 Correct 7 ms 1236 KB Output is correct
20 Correct 7 ms 1236 KB Output is correct
21 Correct 7 ms 1364 KB Output is correct
22 Correct 5 ms 980 KB Output is correct
23 Correct 7 ms 1364 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 7 ms 980 KB Output is correct
28 Correct 8 ms 1364 KB Output is correct
29 Correct 7 ms 1364 KB Output is correct
30 Correct 7 ms 1332 KB Output is correct
31 Correct 7 ms 1236 KB Output is correct
32 Correct 7 ms 1236 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 7 ms 1236 KB Output is correct
37 Correct 5 ms 980 KB Output is correct
38 Correct 6 ms 1108 KB Output is correct
39 Correct 7 ms 1364 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Runtime error 1 ms 468 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -