Submission #369291

#TimeUsernameProblemLanguageResultExecution timeMemory
369291Return_0Growing Vegetable is Fun 3 (JOI19_ho_t3)C++17
100 / 100
491 ms769044 KiB
#pragma GCC optimize("Ofast,unroll-loops") // #pragma comment(linker, "/stack:200000000") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef int ll; typedef long double ld; typedef pair <ll, ll> pll; #ifdef SINA #define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); } #define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush(); #else #define dbg(...) 0 #define dbg2(x, j, n) 0 #endif #define SZ(x) ((ll)((x).size())) #define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout); #define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i]; #define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n'); #define kill(x) return cout<< x << endl, 0 #define cl const ll #define fr first #define sc second #define lc (v << 1) #define rc (lc | 1) #define mid ((l + r) >> 1) #define All(x) (x).begin(), (x).end() cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353; template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';} template <class A> ostream& operator << (ostream& out, const vector<A> &a) { out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; } template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>; cl N = 4e2 + 3; ll dp [N][N][N][3], cnt [3][N], pos [3][N], n; char c; inline ll conv () { if (c == 'R') return 0; if (c == 'G') return 1; return 2; } int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>> n; for (ll i = 1, x; i <= n; i++) { cin>> c, x = conv(); cnt[0][i] = cnt[0][i - 1]; cnt[1][i] = cnt[1][i - 1]; cnt[2][i] = cnt[2][i - 1]; cnt[x][i]++; pos[x][cnt[x][i]] = i; } memset(dp, 61, sizeof dp); memset(dp[0][0][0], 0, sizeof dp[0][0][0]); ll t [3], p1, p2, p3, ow, lst, tmp; for (t[0] = 0; t[0] <= cnt[0][n]; t[0]++) for (t[1] = 0; t[1] <= cnt[1][n]; t[1]++) for (t[2] = 0; t[2] <= cnt[2][n]; t[2]++) for (ll cur = 0; cur < 3; cur++) if (t[cur] < cnt[cur][n]) { lst = cur; lst = (lst + 1) % 3; ow = 3 ^ lst ^ cur; p1 = pos[cur][t[cur] + 1]; p2 = pos[lst][t[lst]]; p3 = pos[ow][t[ow]]; tmp = dp[t[0]][t[1]][t[2]][lst]; tmp += max(0, cnt[lst][p1] - cnt[lst][p2]); tmp += max(0, cnt[ow][p1] - cnt[ow][p3]); t[cur]++; dp[t[0]][t[1]][t[2]][cur] = min(dp[t[0]][t[1]][t[2]][cur], tmp); t[cur]--; lst = (lst + 1) % 3; ow = 3 ^ lst ^ cur; p1 = pos[cur][t[cur] + 1]; p2 = pos[lst][t[lst]]; p3 = pos[ow][t[ow]]; tmp = dp[t[0]][t[1]][t[2]][lst]; tmp += max(0, cnt[lst][p1] - cnt[lst][p2]); tmp += max(0, cnt[ow][p1] - cnt[ow][p3]); t[cur]++; dp[t[0]][t[1]][t[2]][cur] = min(dp[t[0]][t[1]][t[2]][cur], tmp); t[cur]--; } ow = inf; for (ll i = 0; i < 3; i++) ow = min(dp[cnt[0][n]][cnt[1][n]][cnt[2][n]][i], ow); if (ow >= inf) ow = -1; //cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; kill(ow); return 0; } /* 5 RRGYY 6 RRRRRG 20 YYGYYYGGGGRGYYGRGRYG */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...