Submission #896814

#TimeUsernameProblemLanguageResultExecution timeMemory
896814vjudge1Growing Vegetable is Fun 3 (JOI19_ho_t3)C++17
20 / 100
1057 ms604 KiB
#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; //#pragma GCC optimization("g", on) //#pragma GCC optimization("03") //#pragma comment(linker, "/stack:200000000") //#pragma GCC optimize("Ofast") //#pragma GCC optimize("inline") //#pragma GCC optimize("-fgcse,-fgcse-lm") //#pragma GCC optimize("-ftree-pre,-ftree-vrp") //#pragma GCC optimize("-ffast-math") //#pragma GCC optimize("-fipa-sra") //#pragma GCC optimize("-fpeephole2") //#pragma GCC optimize("-fsched-spec") //#pragma GCC optimize("Ofast,no-stack-protector") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //#pragma GCC optimize("unroll-loops") #define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define br break; #define sp " " #define en "\n" #define pb push_back #define sz(a) int(a.size()) #define bg begin() #define ed end() #define in insert #define ss second #define ff first #define setp(a) cout << fixed; cout << setprecision(a); #define all(v) v.begin(), v.end() typedef long long ll; typedef long double ld; typedef pair<ll, ll> pll; typedef double db; typedef tree< long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> orset; void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; } // C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; } const ll N = 2e5 + 11; const ll inf = 1e18 + 7; ll tt = 1; ll p[404][4]; ll dp[404][404][404][4]; ll pos[404][4]; ll r, g, y; ll n; ll ans = inf; void rec(ll x, ll y, ll z, string s) { if (!(x | y | z)) { ll res = 0; // x = y = z = 0; for (int i = 1;i <= n;i++) { (s[i] == 'R' ? x : (s[i] == 'G' ? y : z))++; ll t = pos[(s[i] == 'R' ? x : (s[i] == 'G' ? y : z))][(s[i] == 'R' ? 1 : (s[i] == 'G' ? 2 : 3))]; ll h = max(0ll, x - p[t][1]) + max(0ll, y - p[t][2]) + max(0ll, z - p[t][3]); res += h; } // cout << res << sp << s << en; ans = min(ans, res); return; } if (x && s[sz(s) - 1] != 'R') rec(x - 1, y, z, s + "R"); if (y && s[sz(s) - 1] != 'G') rec(x, y - 1, z, s + "G"); if (z && s[sz(s) - 1] != 'Y') rec(x, y, z - 1, s + "Y"); } void solve() { cin >> n; string s; cin >> s; s = ' ' + s; // ll g = 0, r = 0, y = 0; for (int i = 1;i <= n;i++) { (s[i] == 'R' ? r : (s[i] == 'G' ? g : y))++; pos[(s[i] == 'R' ? r : (s[i] == 'G' ? g : y))][(s[i] == 'R' ? 1 : (s[i] == 'G' ? 2 : 3))] = i; p[i][1] = p[i - 1][1]; p[i][2] = p[i - 1][2]; p[i][3] = p[i - 1][3]; p[i][(s[i] == 'R' ? 1 : (s[i] == 'G' ? 2 : 3))]++; } rec(r, g, y, " "); cout << (ans == inf ? -1 : ans); } // 5 // RRGYY int main() { aboba // freopen("cownomics"); // precalc(); // cin >> tt; for (int i = 1;i <= tt;i++) { solve(); } }

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'void freopen(std::string)':
joi2019_ho_t3.cpp:47:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:47:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...