oj.uz

답안 #498101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498101 2021-12-24T11:45:49 Z xynex Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 76 ms 162984 KB 
/*
* Author: xynex
* Created: 24.12.2021 17:20
* Why am I so stupid? :c
* Slishkom slab
*/

#include <bits/stdc++.h>

// #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")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
    random_device rd;
    mt19937 gen(rd());
    return uniform_int_distribution<T>(l, r)(gen);
}

template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 4e2 + 1;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

void precalc() {

}

int n;
string s;
int get(char a) {
    if(a == 'R') return 0;
    if(a == 'G') return 1;
    if(a == 'Y') return 2;
}
struct ost {
    int x, y, z;
};
vt<ost > el[3];
int cnt[3];
int dp[M][M][M][3];
void solve() {
    read(n);
    read(s);
    int x = 0, y = 0, z = 0;
    for(int i = 0; i < n; ++i) {
        cnt[get(s[i])]++;
        ost cur;
        cur.x = cnt[0];
        cur.y = cnt[1];
        cur.z = cnt[2];
        el[get(s[i])].pb(cur);
    }
    x = sz(el[0]);
    y = sz(el[1]);
    z = sz(el[2]);
    for(int i = 0; i <= x; ++i) {
        for(int j = 0; j <= y; ++j) {
            for(int k = 0; k <= z; ++k) dp[i][j][k][0] = dp[i][j][k][1] = dp[i][j][k][2] = MOD;
        }
    }
   // print(x, y, z);
    dp[0][0][0][0] = 0, dp[0][0][0][1] = 0, dp[0][0][0][2] = 0;
    for(int i = 0; i <= x; ++i) {
        for(int j = 0; j <= y; ++j) {
            for(int k = 0; k <= z; ++k) {
                if(i) {
                    dp[i][j][k][0] = min(dp[i - 1][j][k][1], dp[i - 1][j][k][2]) + max(0, j - el[0][i - 1].y) + max(0, k - el[0][i - 1].z);
                }
                if(j) {
                    dp[i][j][k][1] = min(dp[i][j - 1][k][0], dp[i][j - 1][k][2]) + max(0, i - el[1][j - 1].x) + max(0, k - el[1][j - 1].z);
                }
                if(k) {
                    dp[i][j][k][2] = min(dp[i][j][k - 1][0], dp[i][j][k - 1][1]) + max(0, i - el[2][k - 1].x) + max(0, j - el[2][k - 1].y);
                }
            }
        }
    }
    int ans = MOD;
    for(int i = 0; i < 3; ++i) ans = min(ans, dp[x][y][z][i]);
    if(ans == MOD) ans = -1;
    print(ans);
}

int main() {
    //freop("");
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //read(t);
    precalc();
    for (int i = 1; i <= t; ++i) {
        //write("Case #" + to_string(i) + ": ");
        solve();
    }
    return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'void freop(std::string)':
joi2019_ho_t3.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int get(char)':
joi2019_ho_t3.cpp:99:1: warning: control reaches end of non-void function [-Wreturn-type]
   99 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 576 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 1 ms 204 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 576 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 1 ms 2380 KB Output is correct
22 Correct 2 ms 1612 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 1 ms 1612 KB Output is correct
25 Correct 4 ms 3904 KB Output is correct
26 Correct 2 ms 4044 KB Output is correct
27 Correct 2 ms 3020 KB Output is correct
28 Correct 2 ms 2240 KB Output is correct
29 Correct 2 ms 2124 KB Output is correct
30 Correct 1 ms 2252 KB Output is correct
31 Correct 2 ms 1996 KB Output is correct
32 Correct 1 ms 2380 KB Output is correct
33 Correct 2 ms 3788 KB Output is correct
34 Correct 2 ms 3532 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 1 ms 1868 KB Output is correct
37 Correct 1 ms 1612 KB Output is correct
38 Correct 1 ms 2124 KB Output is correct
39 Correct 2 ms 2252 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 2124 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 57 ms 162948 KB Output is correct
3 Correct 56 ms 162092 KB Output is correct
4 Correct 58 ms 162944 KB Output is correct
5 Correct 59 ms 162892 KB Output is correct
6 Correct 60 ms 162936 KB Output is correct
7 Correct 75 ms 162068 KB Output is correct
8 Correct 59 ms 162048 KB Output is correct
9 Correct 67 ms 161304 KB Output is correct
10 Correct 70 ms 162904 KB Output is correct
11 Correct 55 ms 162872 KB Output is correct
12 Correct 16 ms 44004 KB Output is correct
13 Correct 29 ms 77064 KB Output is correct
14 Correct 39 ms 111352 KB Output is correct
15 Correct 67 ms 162984 KB Output is correct
16 Correct 60 ms 162948 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 576 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 2252 KB Output is correct
19 Correct 1 ms 1868 KB Output is correct
20 Correct 2 ms 2252 KB Output is correct
21 Correct 1 ms 2380 KB Output is correct
22 Correct 2 ms 1612 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 1 ms 1612 KB Output is correct
25 Correct 4 ms 3904 KB Output is correct
26 Correct 2 ms 4044 KB Output is correct
27 Correct 2 ms 3020 KB Output is correct
28 Correct 2 ms 2240 KB Output is correct
29 Correct 2 ms 2124 KB Output is correct
30 Correct 1 ms 2252 KB Output is correct
31 Correct 2 ms 1996 KB Output is correct
32 Correct 1 ms 2380 KB Output is correct
33 Correct 2 ms 3788 KB Output is correct
34 Correct 2 ms 3532 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 1 ms 1868 KB Output is correct
37 Correct 1 ms 1612 KB Output is correct
38 Correct 1 ms 2124 KB Output is correct
39 Correct 2 ms 2252 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 2124 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 57 ms 162948 KB Output is correct
44 Correct 56 ms 162092 KB Output is correct
45 Correct 58 ms 162944 KB Output is correct
46 Correct 59 ms 162892 KB Output is correct
47 Correct 60 ms 162936 KB Output is correct
48 Correct 75 ms 162068 KB Output is correct
49 Correct 59 ms 162048 KB Output is correct
50 Correct 67 ms 161304 KB Output is correct
51 Correct 70 ms 162904 KB Output is correct
52 Correct 55 ms 162872 KB Output is correct
53 Correct 16 ms 44004 KB Output is correct
54 Correct 29 ms 77064 KB Output is correct
55 Correct 39 ms 111352 KB Output is correct
56 Correct 67 ms 162984 KB Output is correct
57 Correct 60 ms 162948 KB Output is correct
58 Correct 44 ms 75468 KB Output is correct
59 Correct 48 ms 95556 KB Output is correct
60 Correct 46 ms 86996 KB Output is correct
61 Correct 53 ms 84040 KB Output is correct
62 Correct 60 ms 160580 KB Output is correct
63 Correct 66 ms 160280 KB Output is correct
64 Correct 66 ms 150068 KB Output is correct
65 Correct 76 ms 138556 KB Output is correct
66 Correct 57 ms 85256 KB Output is correct
67 Correct 53 ms 82056 KB Output is correct
68 Correct 55 ms 87832 KB Output is correct
69 Correct 58 ms 84624 KB Output is correct
70 Correct 62 ms 91652 KB Output is correct
71 Correct 48 ms 83052 KB Output is correct
72 Correct 22 ms 41140 KB Output is correct
73 Correct 2 ms 2764 KB Output is correct