Submission #958097

#TimeUsernameProblemLanguageResultExecution timeMemory
958097shadow_samiGrowing Vegetable is Fun 3 (JOI19_ho_t3)C++17
0 / 100
3 ms2396 KiB
#include<bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef int ll; typedef vector<ll> vi; typedef vector<vector<ll>> vvi; typedef pair<ll,ll> pi; typedef map<ll,ll> mi; typedef long double ld; typedef vector<ld> vd; typedef vector<vector<ld>> vvd; typedef pair<ld,ld> pd; #define ff first #define ss second #define srt(a) sort(a.begin(),a.end()); #define fip(k, n) for (ll i = k; i < n; i++) #define fjp(k, n) for (ll j = k; j < n; j++) #define fin(k, n) for (ll i = k; i >= n; i--) #define fjn(k, n) for (ll j = k; j >= n; j--) #define fp(k, n, m) for (ll k = n; k < m; k++) #define fn(k, n, m) for (ll k = n; k >= m; k--) #define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update> #define totalOne(n) __builtin_popcount(n) #define backZero(n) __builtin_ctzll(n) #define frontZero(n) __builtin_clzll(n) #define fx(k) for ( auto x : k ) #define test ll t;cin >> t;while (t--) #define nli "\n" // ==========================(debug)============================================================================================== // #ifndef ONLINE_JUDGE #define debug(x) cerr << #x <<" "; _printn(x); cerr << nli; #else #define debug(x) #endif void _printn(ll x){ cerr<<x<<" "; } // void _printn(int x){ cerr<<x<<" "; } void _printn(ld x){ cerr<<x<<" "; } void _printn(double x){ cerr<<x<<" "; } void _printn(string x){ cerr<<x<<" "; } void _printn(char x){ cerr<<x<<" "; } void _printn(bool x){ cerr<<x<<" "; } template<class T,class V>void _printn(pair<T,V> vv); template<class T> void _printn(vector<T> vv); template<class T> void _printn(set<T> vv); template<class T,class V> void _printn(map<T,V> vv); template<class T> void _printn(multiset<T> vv); template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";} template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; }; template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; }; template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; }; template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; }; // ==========================(debug)============================================================================================== // ll n,m,tp,tp2,res,cnt,sum,tptp,ans; const ll mx = 400+5; const ll mod = 1e9+7; // // ==========================(MOD)=============================================================================================== // // ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; } // ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; } // ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; } // ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; } // ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; } // // ==========================(MOD)=============================================================================================== // bool f = false; string s; ll tnc[mx]; ll a[mx]; ll pref[mx][3]; ll to[mx][3]; ll dp[mx][mx][mx][3]; int main(){ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #ifndef ONLINE_JUDGE freopen("input1.txt", "r", stdin); freopen("output1.txt", "w", stdout); freopen("error1.txt", "w", stderr); #endif // ONLINE_JUDGE cin>>n; cin>>s; fip(0,n){ if(s[i]=='R') a[i] = 0; else if(s[i]=='G') a[i] = 1; else a[i] = 2; } fip(0,n+2) fjp(0,n+2) fp(k,0,n+2) fp(t,0,3) dp[i][j][k][t] = 1e9; fip(0,3) dp[0][0][0][i] = 0; fip(0,n){ to[tnc[a[i]]][a[i]] = i; tnc[a[i]]++; fjp(0,3) pref[i][j] = tnc[j]; } fip(0,tnc[0]+1) fjp(0,tnc[1]+1) fp(k,0,tnc[2]+1){ fp(t,0,3){ if(t!=0 && i<tnc[0]) dp[i+1][j][k][0] = min(dp[i+1][j][k][0] , dp[i][j][k][t] + max(0,pref[to[i][0]][1]-j) + max(0,pref[to[i][0]][2]-k)); if(t!=1 && j<tnc[1]) dp[i][j+1][k][1] = min(dp[i][j+1][k][1] , dp[i][j][k][t] + max(0,pref[to[j][1]][0]-i) + max(0,pref[to[j][1]][2]-k)); if(t!=2 && k<tnc[2]) dp[i][j][k+1][2] = min(dp[i][j][k+1][2] , dp[i][j][k][t] + max(0,pref[to[k][2]][0]-i) + max(0,pref[to[k][2]][1]-j)); } } ans = 1e9; fip(0,3) ans = min(ans,dp[tnc[0]][tnc[1]][tnc[2]][i]); if(ans==1e9) ans = -1; cout<<ans<<nli; cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n"; return 0; }

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen("input1.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen("output1.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:87:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |         freopen("error1.txt", "w", stderr);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...