oj.uz

Submission #209257

# Submission time Handle Problem Language Result Execution time Memory
209257 2020-03-13T14:00:31 Z AryaKnight Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 263044 KB 
//#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
//#pragma GCC target("avx2")  //Enable AVX
#include<bits/stdc++.h>
using namespace std;

#define all(a) begin(a),end(a)
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

void clr(auto &a,int n){
  a.clear();
  a.resize(n);
}

template <typename A, typename B>
istream& operator>>(istream& input,pair<A,B>& x) {
  input>>x.F>>x.S;
  return input;
}

template <typename A>
istream& operator>>(istream& input,vector<A>& x) {
  for(auto& i:x)
    input>>i;
  return input;
}

template<typename A>
ostream& operator<<(ostream& output,vector<A>& x) {
  for(auto& i:x)
    output<<i<<' ';
  return output;
}

template<typename T>
vector<pair<T,int>> getvec(int n){
  vector<pair<T,int>>a(n);
  for(int i=0;i<a.size();i++){
    cin>>a[i].F;
    a[i].S=i;
  }
  return a;
}

const int mod=1e9+7;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int mul(int a,int b){
  return ((a)*1ll*(b))%mod;
}

void add(int &a,int b){
  a+=b;
  if(a>=mod)a-=mod;
}

int sub(int a,int b){
  a-=b;
  if(a<0){
    a+=mod;
  }
  return a;
}

int powz(int a,int b){
  int res=1;
  while(b){
    if(b&1){
      res=mul(res,a);
    }
    b/=2;
    a=mul(a,a);
  }
  return res;
}

const int N=405;

int dp[405][405][3],new_dp[405][405][3];
vector<int>adj[3];
struct ordered_set {
  int sz = 0, bit[N];
  
  int size() {
    return sz;
  }
  
  void update(int k, int x) {
    k++;
    while (k < N) {
      bit[k] += x;
      k += k & -k;
    }
    sz += x;
  }
  
  int find_by_order(int k) {
    int ans = 0, sum = 0;
    for (int j = 17; j >= 0; --j) {
      ans += 1 << j;
      if (ans < N && sum + bit[ans] < k) {
	sum += bit[ans];
      } else {
	ans -= 1 << j;
      }
    }
    return ans + 1;
  }
  
  int order_of_key(int k) {
    k++;
    int ans = 0;
    while (k >= 1) {
      ans += bit[k];
      k -= k & -k;
    }
    return ans - 1;
  }
}st[405][405];

void solve(){
  int n;
  cin>>n;
  string s;
  cin>>s;
  for(int i=0;i<s.length();i++){
    if(s[i]=='R'){
      adj[0].pb(i);
    }
    else if(s[i]=='G'){
      adj[1].pb(i);
    }
    else{
      adj[2].pb(i);
    }
  }
  int mx=max({(int)adj[0].size(),(int)adj[1].size(),(int)adj[2].size()});
  if(mx*2>(n+10)){
    cout<<-1;
    return;
  }
  for(int i=0;i<=adj[0].size();i++){
    for(int j=0;j<=adj[1].size();j++){
      for(int k=0;k<n;k++){
	st[i][j].update(k,1);
      }
      for(int k=0;k<i;k++){
	st[i][j].update(adj[0][k],-1);
      }
      for(int k=0;k<j;k++){
	st[i][j].update(adj[1][k],-1);
      }
    }
  }
  // for(int i=0;i<2;i++){
    for(int j=0;j<=adj[0].size();j++){
      for(int k=0;k<=adj[1].size();k++){
	for(int l=0;l<3;l++){
	  dp[j][k][l]=new_dp[j][k][l]=1e9;
	}
      }
    }
    //}
  dp[0][0][0]=0;
  dp[0][0][1]=0;
  dp[0][0][2]=0;
  for(int i=0;i<n;i++){
    for(int j=0;j<=min(i,(int)adj[0].size());j++){
      for(int k=0;k<=min(i,(int)adj[1].size());k++){
	if(i-(j+k)<0){
	  break;
	}
	for(int l=0;l<3;l++){
	  if(dp[j][k][l]==1e9){
	    continue;
	  }
	  for(int put=0;put<3;put++){
	    if(put==l){
	      continue;
	    }
	    if(put==0){
	      if(j+1>adj[0].size()){
		continue;
	      }
	      int fnd=st[j][k].order_of_key(adj[0][j]);
	      new_dp[j+1][k][0]=min(new_dp[j+1][k][0],dp[j][k][l]+fnd);
	    }
	    else if(put==1){
	      if(k+1>adj[1].size()){
		continue;
	      }
	      int fnd=st[j][k].order_of_key(adj[1][k]);
	      new_dp[j][k+1][1]=min(new_dp[j][k+1][1],dp[j][k][l]+fnd);
	    }
	    else{
	      if((i-(j+k)+1)>adj[2].size()){
		continue;
	      }
	      int fnd=st[j][k].order_of_key(adj[2][i-(j+k)]);
	      new_dp[j][k][2]=min(new_dp[j][k][2],dp[j][k][l]+fnd);
	    }
	  }
	}
      }
    }
    for(int j=0;j<=min(i+1,(int)adj[0].size());j++){
      for(int k=0;k<=min(i+1,(int)adj[1].size());k++){
	if(i-(j+k)<0){
	  break;
	}
	if(i+1-(j+k)>adj[2].size()){
	  continue;
	}
	st[j][k].update(adj[2][i-(j+k)],-1);
      }
    }
    for(int j=0;j<=(int)adj[0].size();j++){
      for(int k=0;k<=(int)adj[1].size();k++){
	for(int l=0;l<3;l++){
	  dp[j][k][l]=new_dp[j][k][l];
	  new_dp[j][k][l]=1e9;
	}
      }
    }
  }
  int ans=1e9;
  ans=min(ans,dp[adj[0].size()][adj[1].size()][0]);
  ans=min(ans,dp[adj[0].size()][adj[1].size()][1]);
  ans=min(ans,dp[adj[0].size()][adj[1].size()][2]);
  if(ans==1e9){
    ans=-1;
  }
  cout<<ans;  
}

signed main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc=1;
  //cin>>tc;
  for(int _=0;_<tc;_++){
    // cout<<"Case #"<<_+1<<": ";
    solve();
    if(_!=tc-1){
      cout<<'\n';
    }
  }
}

Compilation message

joi2019_ho_t3.cpp: In function 'void solve()':
joi2019_ho_t3.cpp:139:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<s.length();i++){
               ~^~~~~~~~~~~
joi2019_ho_t3.cpp:155:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<=adj[0].size();i++){
               ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:156:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<=adj[1].size();j++){
                 ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:169:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<=adj[0].size();j++){
                 ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:170:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int k=0;k<=adj[1].size();k++){
                   ~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:195:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if(j+1>adj[0].size()){
           ~~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:202:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if(k+1>adj[1].size()){
           ~~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:209:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if((i-(j+k)+1)>adj[2].size()){
           ~~~~~~~~~~~^~~~~~~~~~~~~~
joi2019_ho_t3.cpp:224:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(i+1-(j+k)>adj[2].size()){
     ~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 260996 KB Output is correct
2 Correct 117 ms 260984 KB Output is correct
3 Correct 115 ms 260988 KB Output is correct
4 Correct 121 ms 260984 KB Output is correct
5 Correct 121 ms 261036 KB Output is correct
6 Correct 124 ms 260972 KB Output is correct
7 Correct 117 ms 260984 KB Output is correct
8 Correct 119 ms 260984 KB Output is correct
9 Correct 118 ms 260984 KB Output is correct
10 Correct 120 ms 261112 KB Output is correct
11 Correct 120 ms 260984 KB Output is correct
12 Correct 120 ms 260984 KB Output is correct
13 Correct 119 ms 261048 KB Output is correct
14 Correct 123 ms 260984 KB Output is correct
15 Correct 119 ms 260984 KB Output is correct
16 Correct 116 ms 261108 KB Output is correct
17 Correct 122 ms 261172 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 260996 KB Output is correct
2 Correct 117 ms 260984 KB Output is correct
3 Correct 115 ms 260988 KB Output is correct
4 Correct 121 ms 260984 KB Output is correct
5 Correct 121 ms 261036 KB Output is correct
6 Correct 124 ms 260972 KB Output is correct
7 Correct 117 ms 260984 KB Output is correct
8 Correct 119 ms 260984 KB Output is correct
9 Correct 118 ms 260984 KB Output is correct
10 Correct 120 ms 261112 KB Output is correct
11 Correct 120 ms 260984 KB Output is correct
12 Correct 120 ms 260984 KB Output is correct
13 Correct 119 ms 261048 KB Output is correct
14 Correct 123 ms 260984 KB Output is correct
15 Correct 119 ms 260984 KB Output is correct
16 Correct 116 ms 261108 KB Output is correct
17 Correct 122 ms 261172 KB Output is correct
18 Correct 133 ms 261112 KB Output is correct
19 Correct 122 ms 261152 KB Output is correct
20 Correct 121 ms 261240 KB Output is correct
21 Correct 120 ms 261120 KB Output is correct
22 Correct 124 ms 261200 KB Output is correct
23 Correct 122 ms 261112 KB Output is correct
24 Correct 121 ms 261112 KB Output is correct
25 Correct 121 ms 260984 KB Output is correct
26 Correct 129 ms 261240 KB Output is correct
27 Correct 127 ms 261240 KB Output is correct
28 Correct 118 ms 261240 KB Output is correct
29 Correct 121 ms 261220 KB Output is correct
30 Correct 121 ms 261112 KB Output is correct
31 Correct 123 ms 261112 KB Output is correct
32 Correct 121 ms 261112 KB Output is correct
33 Correct 122 ms 261240 KB Output is correct
34 Correct 119 ms 261240 KB Output is correct
35 Correct 120 ms 261276 KB Output is correct
36 Correct 122 ms 261180 KB Output is correct
37 Correct 122 ms 261112 KB Output is correct
38 Correct 118 ms 261112 KB Output is correct
39 Correct 120 ms 261112 KB Output is correct
40 Correct 120 ms 261004 KB Output is correct
41 Correct 117 ms 260984 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 260984 KB Output is correct
2 Correct 449 ms 262904 KB Output is correct
3 Correct 436 ms 262904 KB Output is correct
4 Correct 451 ms 262904 KB Output is correct
5 Correct 446 ms 263032 KB Output is correct
6 Correct 450 ms 263044 KB Output is correct
7 Correct 449 ms 262904 KB Output is correct
8 Correct 451 ms 262904 KB Output is correct
9 Correct 448 ms 262904 KB Output is correct
10 Correct 442 ms 262904 KB Output is correct
11 Correct 463 ms 262868 KB Output is correct
12 Correct 165 ms 261904 KB Output is correct
13 Correct 233 ms 262424 KB Output is correct
14 Correct 307 ms 262520 KB Output is correct
15 Correct 452 ms 263032 KB Output is correct
16 Correct 447 ms 262968 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 260996 KB Output is correct
2 Correct 117 ms 260984 KB Output is correct
3 Correct 115 ms 260988 KB Output is correct
4 Correct 121 ms 260984 KB Output is correct
5 Correct 121 ms 261036 KB Output is correct
6 Correct 124 ms 260972 KB Output is correct
7 Correct 117 ms 260984 KB Output is correct
8 Correct 119 ms 260984 KB Output is correct
9 Correct 118 ms 260984 KB Output is correct
10 Correct 120 ms 261112 KB Output is correct
11 Correct 120 ms 260984 KB Output is correct
12 Correct 120 ms 260984 KB Output is correct
13 Correct 119 ms 261048 KB Output is correct
14 Correct 123 ms 260984 KB Output is correct
15 Correct 119 ms 260984 KB Output is correct
16 Correct 116 ms 261108 KB Output is correct
17 Correct 122 ms 261172 KB Output is correct
18 Correct 133 ms 261112 KB Output is correct
19 Correct 122 ms 261152 KB Output is correct
20 Correct 121 ms 261240 KB Output is correct
21 Correct 120 ms 261120 KB Output is correct
22 Correct 124 ms 261200 KB Output is correct
23 Correct 122 ms 261112 KB Output is correct
24 Correct 121 ms 261112 KB Output is correct
25 Correct 121 ms 260984 KB Output is correct
26 Correct 129 ms 261240 KB Output is correct
27 Correct 127 ms 261240 KB Output is correct
28 Correct 118 ms 261240 KB Output is correct
29 Correct 121 ms 261220 KB Output is correct
30 Correct 121 ms 261112 KB Output is correct
31 Correct 123 ms 261112 KB Output is correct
32 Correct 121 ms 261112 KB Output is correct
33 Correct 122 ms 261240 KB Output is correct
34 Correct 119 ms 261240 KB Output is correct
35 Correct 120 ms 261276 KB Output is correct
36 Correct 122 ms 261180 KB Output is correct
37 Correct 122 ms 261112 KB Output is correct
38 Correct 118 ms 261112 KB Output is correct
39 Correct 120 ms 261112 KB Output is correct
40 Correct 120 ms 261004 KB Output is correct
41 Correct 117 ms 260984 KB Output is correct
42 Correct 119 ms 260984 KB Output is correct
43 Correct 449 ms 262904 KB Output is correct
44 Correct 436 ms 262904 KB Output is correct
45 Correct 451 ms 262904 KB Output is correct
46 Correct 446 ms 263032 KB Output is correct
47 Correct 450 ms 263044 KB Output is correct
48 Correct 449 ms 262904 KB Output is correct
49 Correct 451 ms 262904 KB Output is correct
50 Correct 448 ms 262904 KB Output is correct
51 Correct 442 ms 262904 KB Output is correct
52 Correct 463 ms 262868 KB Output is correct
53 Correct 165 ms 261904 KB Output is correct
54 Correct 233 ms 262424 KB Output is correct
55 Correct 307 ms 262520 KB Output is correct
56 Correct 452 ms 263032 KB Output is correct
57 Correct 447 ms 262968 KB Output is correct
58 Execution timed out 516 ms 262136 KB Time limit exceeded
59 Halted 0 ms 0 KB -