Submission #334291

#TimeUsernameProblemLanguageResultExecution timeMemory
334291HoneyBadgerGrowing Vegetable is Fun 3 (JOI19_ho_t3)C++17
0 / 100
1 ms496 KiB
#include <iostream> #include <iomanip> #include <cstdio> #include <vector> #include <bitset> #include <string> #include <cstring> #include <map> #include <set> #include <stack> #include <queue> #include <deque> #include <utility> #include <algorithm> #include <random> #include <cmath> #include <cassert> #include <climits> #include <ctime> #include <chrono> /* #pragma GCC optimize("Ofast") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native") */ #ifdef LOCAL #define dbg(x) cout << #x << " : " << x << endl; #else #define dbg(x) #endif #define int long long #define pb push_back #define ppb pop_back() #define mp make_pair #define fi(a, b) for (int i = a; i < b; i++) #define fj(a, b) for (int j = a; j < b; j++) #define fk(a, b) for (int k = a; k < b; k++) #define fi1(a, b) for (int i = a - 1; i >= b; i--) #define fj1(a, b) for (int j = a - 1; j >= b; j--) #define fk1(a, b) for (int k = a - 1; k >= b; k--) #define fx(x, a) for (auto& x : a) #define rep(i, a, b) for (int i = a; i < b; ++i) #define rep1(i, a, b) for (int i = a - 1; i >= b; --i) #define siz(x) (int)x.size() #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() using namespace std; template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; } template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; } ostream& operator << (ostream &out, const vector<int> &b) { for (auto k : b) out << k << ' '; return out; } typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef char ch; typedef string str; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<pii> vpii; typedef vector<vpii> vvpii; typedef vector<ch> vch; typedef vector<vch> vvch; typedef vector<str> vs; const int MOD = 1000000007; const int INF = 1000000050; const long long BIG = (long long)2e18 + 50; #ifdef LOCAL const int MX = 20; #else const int MX = 200010; #endif const double EPS = 1e-9; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n; int cnt[MX][3]; vi cur; int ans = INF; map<vector<int>, int> mem; void gen(int i = 0, int pr = -1, int cost = 0) { auto it = mem.find(cur); if (it != mem.end() && it->second <= cost) { return; } mem[cur] = cost; if (i == n) { mine(ans, cost / 2); return; } fj(0, 3) { if (j == pr || cur[j] == cnt[n - 1][j]) continue; ++cur[j]; int d = 0; fk(0, 3) { d += abs(cur[k] - cnt[i][k]); } gen(i + 1, j, cost + d); --cur[j]; } } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cur = vi(3, 0); cin >> n; vi a(n); fx(x, a) { char c; cin >> c; if (c == 'R') x = 0; else if (c == 'G') x = 1; else x = 2; } fi(0, n) { fj(0, 3) { if (i) { cnt[i][j] = cnt[i - 1][j]; } } cnt[i][a[i]]++; } gen(); cout << (ans == INF ? -1 : ans) << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...