oj.uz

Submission #693286

# Submission time Handle Problem Language Result Execution time Memory
693286 2023-02-02T15:26:01 Z AJR07 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
60 / 100
 91 ms 131052 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define DBGRUN(stmt) stmt
#define DBG1(x) cout << #x << ": " << (x) << endl
#define DBG2(x, y) cout << #x << ": " << (x) << ", " << #y << ": " << (y) << endl
#define DBG3(x, y, z) cout << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << endl
#define DBG4(w, x, y, z) cout << #w << ": " << (w) << ", " << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << endl
#define DBG_ARR(a, e) cout << #a << ": "; for (int i = 0; i < e; i++) cout << a[i] << ' '; cout << endl
#define DBG_ARR2D(a, s1, e1, s2, e2) cout << #a << ": " << endl; for (int i = s1; i < e1; i++) { for (int j = s2; j < e2; j++) cout << a[i][j] << ' '; cout << '\n'; }cout << endl
#define DBG_VEC(v) cout << #v << ": "; for (auto i : v) cout << i << ' '; cout << endl
#define DBG_HERE cout << "reached line: " << __LINE__ << endl
#else
#define DBGRUN(stmt)
#define DBG1(x)
#define DBG2(x, y)
#define DBG3(x, y, z)
#define DBG4(w, x, y, z)
#define DBG_ARR(a, e)
#define DBG_ARR2D(a, s1, e1, s2, e2)
#define DBG_VEC(v)
#define DBG_HERE
#endif
#define int long long
#define f first
#define s second
#define pii pair<int, int>
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a)) 
#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a))
#define FORR(a, b, c) for (int(a) = (b); (a) >= (c); --(a))
#define ALLV(v) v.begin(), v.end() 
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v)) 
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz)) 
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
template <typename A, typename B> ostream& operator<<(ostream& out, const pair<A, B>& a) { out << "(" << a.first << ", " << a.second << ")"; return out; }
template<typename ...Ts, size_t ...Is> ostream& println_tuple_impl(ostream& os, tuple<Ts...> tuple, index_sequence<Is...>) { static_assert(sizeof...(Is) == sizeof...(Ts), "Indices must have same number of elements as tuple types!"); static_assert(sizeof...(Ts) > 0, "Cannot insert empty tuple into stream."); auto last = sizeof...(Ts) - 1; os << "("; return ((os << get<Is>(tuple) << (Is != last ? ", " : ")\n")), ...); }
template<typename ...Ts> ostream& operator<<(ostream& os, const tuple<Ts...>& tuple) { return println_tuple_impl(os, tuple, index_sequence_for<Ts...>{}); }

int N, R, G, Y;
int memo[140][140][140][3];
vector<int> rPos, gPos, yPos;
string S, A;

inline int dp(int RR, int GG, int YY, int lastUsed) {
    if (lastUsed != -1 && memo[RR][GG][YY][lastUsed] != -1)
        return memo[RR][GG][YY][lastUsed];
    if (RR == R && GG == G && YY == Y) return 0;
    int res = 1e18;
    // int idx = RR + GG + YY;

    if (RR < R && lastUsed != 0) {
        int nearestR = rPos[RR], ad = 0;
        ad += max(GG - (upper_bound(gPos.begin(), gPos.end(), nearestR) - gPos.begin()), 0ll);
        ad += max(YY - (upper_bound(yPos.begin(), yPos.end(), nearestR) - yPos.begin()), 0ll);
        int newRes = dp(RR + 1, GG, YY, 0) + ad;
        // DBG2(idx, lastUsed);
        // DBG3(ad, max(nearestR - idx, 0ll), newRes);
        res = min(res, newRes);
    }

    if (GG < G && lastUsed != 1) {
        int nearestG = gPos[GG], ad = 0;
        ad += max(RR - (upper_bound(rPos.begin(), rPos.end(), nearestG) - rPos.begin()), 0ll);
        ad += max(YY - (upper_bound(yPos.begin(), yPos.end(), nearestG) - yPos.begin()), 0ll);
        int newRes = dp(RR, GG + 1, YY, 1) + ad;
        res = min(res, newRes);
    }

    if (YY < Y && lastUsed != 2) {
        int nearestY = yPos[YY], ad = 0;
        ad += max(RR - (upper_bound(rPos.begin(), rPos.end(), nearestY) - rPos.begin()), 0ll);
        ad += max(GG - (upper_bound(gPos.begin(), gPos.end(), nearestY) - gPos.begin()), 0ll);
        int newRes = dp(RR, GG, YY + 1, 2) + ad;
        // DBG2(idx, lastUsed);
        // DBG3(ad, max(nearestY - idx, 0ll), newRes);
        res = min(res, newRes);
    }

    if (lastUsed != -1) memo[RR][GG][YY][lastUsed] = res;
    return res;
}

void dp2(int RR, int GG, int YY, int lastUsed) {
    if (RR == R && GG == G && YY == Y) return;
    int res = 1e18;
    char c;
    tuple<int, int, int, int> t = { -1, -1, -1, -1 };

    if (RR < R && lastUsed != 0) {
        if (memo[RR + 1][GG][YY][0] < res) {
            res = memo[RR + 1][GG][YY][0];
            t = { RR + 1, GG, YY, 0 };
            c = 'R';
        }
    }

    if (GG < G && lastUsed != 1) {
        if (memo[RR][GG + 1][YY][1] < res) {
            res = memo[RR][GG + 1][YY][1];
            t = { RR, GG + 1, YY, 1 };
            c = 'G';
        }
    }

    if (YY < Y && lastUsed != 2) {
        if (memo[RR][GG][YY + 1][2] < res) {
            res = memo[RR][GG][YY + 1][2];
            t = { RR, GG, YY + 1, 2 };
            c = 'Y';
        }
    }
    A += c;

    int a, b, cc, d;
    tie(a, b, cc, d) = t;
    DBG2(a + b + cc, res);
    dp2(a, b, cc, d);
}

int32_t main() {
    memset(memo, -1, sizeof memo);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> N >> S;
    FOR(i, 0, N) {
        if (S[i] == 'R') {
            R++;
            rPos.push_back(i);
        }
        if (S[i] == 'G') {
            G++;
            gPos.push_back(i);
        }
        if (S[i] == 'Y') {
            Y++;
            yPos.push_back(i);
        }
    }
    int res = dp(0, 0, 0, -1);
    if (res >= 1e18) cout << -1;
    else {
        cout << res;
        // DBGRUN(dp2(0, 0, 0, -1));
        // DBG1(A);
    }
}

Compilation message

joi2019_ho_t3.cpp: In function 'int32_t main()':
joi2019_ho_t3.cpp:28:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   28 | #define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
      |                              ^
joi2019_ho_t3.cpp:128:5: note: in expansion of macro 'FOR'
  128 |     FOR(i, 0, N) {
      |     ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 64700 KB Output is correct
2 Correct 26 ms 64724 KB Output is correct
3 Correct 31 ms 64664 KB Output is correct
4 Correct 34 ms 64716 KB Output is correct
5 Correct 27 ms 64648 KB Output is correct
6 Correct 25 ms 64756 KB Output is correct
7 Correct 33 ms 64696 KB Output is correct
8 Correct 26 ms 64720 KB Output is correct
9 Correct 35 ms 64668 KB Output is correct
10 Correct 35 ms 64668 KB Output is correct
11 Correct 25 ms 64656 KB Output is correct
12 Correct 26 ms 64656 KB Output is correct
13 Correct 29 ms 64740 KB Output is correct
14 Correct 40 ms 64724 KB Output is correct
15 Correct 39 ms 64696 KB Output is correct
16 Correct 32 ms 64764 KB Output is correct
17 Correct 30 ms 64720 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 64700 KB Output is correct
2 Correct 26 ms 64724 KB Output is correct
3 Correct 31 ms 64664 KB Output is correct
4 Correct 34 ms 64716 KB Output is correct
5 Correct 27 ms 64648 KB Output is correct
6 Correct 25 ms 64756 KB Output is correct
7 Correct 33 ms 64696 KB Output is correct
8 Correct 26 ms 64720 KB Output is correct
9 Correct 35 ms 64668 KB Output is correct
10 Correct 35 ms 64668 KB Output is correct
11 Correct 25 ms 64656 KB Output is correct
12 Correct 26 ms 64656 KB Output is correct
13 Correct 29 ms 64740 KB Output is correct
14 Correct 40 ms 64724 KB Output is correct
15 Correct 39 ms 64696 KB Output is correct
16 Correct 32 ms 64764 KB Output is correct
17 Correct 30 ms 64720 KB Output is correct
18 Correct 39 ms 64720 KB Output is correct
19 Correct 33 ms 64664 KB Output is correct
20 Correct 41 ms 64760 KB Output is correct
21 Correct 37 ms 64736 KB Output is correct
22 Correct 32 ms 64632 KB Output is correct
23 Correct 41 ms 64716 KB Output is correct
24 Correct 38 ms 64656 KB Output is correct
25 Correct 30 ms 64656 KB Output is correct
26 Correct 33 ms 64712 KB Output is correct
27 Correct 30 ms 64684 KB Output is correct
28 Correct 32 ms 64660 KB Output is correct
29 Correct 29 ms 64728 KB Output is correct
30 Correct 37 ms 64724 KB Output is correct
31 Correct 29 ms 64724 KB Output is correct
32 Correct 29 ms 64672 KB Output is correct
33 Correct 28 ms 64716 KB Output is correct
34 Correct 32 ms 64744 KB Output is correct
35 Correct 37 ms 64740 KB Output is correct
36 Correct 34 ms 64740 KB Output is correct
37 Correct 33 ms 64744 KB Output is correct
38 Correct 29 ms 64656 KB Output is correct
39 Correct 34 ms 64720 KB Output is correct
40 Correct 36 ms 64788 KB Output is correct
41 Correct 34 ms 64740 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 64628 KB Output is correct
2 Runtime error 91 ms 131052 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 64700 KB Output is correct
2 Correct 26 ms 64724 KB Output is correct
3 Correct 31 ms 64664 KB Output is correct
4 Correct 34 ms 64716 KB Output is correct
5 Correct 27 ms 64648 KB Output is correct
6 Correct 25 ms 64756 KB Output is correct
7 Correct 33 ms 64696 KB Output is correct
8 Correct 26 ms 64720 KB Output is correct
9 Correct 35 ms 64668 KB Output is correct
10 Correct 35 ms 64668 KB Output is correct
11 Correct 25 ms 64656 KB Output is correct
12 Correct 26 ms 64656 KB Output is correct
13 Correct 29 ms 64740 KB Output is correct
14 Correct 40 ms 64724 KB Output is correct
15 Correct 39 ms 64696 KB Output is correct
16 Correct 32 ms 64764 KB Output is correct
17 Correct 30 ms 64720 KB Output is correct
18 Correct 39 ms 64720 KB Output is correct
19 Correct 33 ms 64664 KB Output is correct
20 Correct 41 ms 64760 KB Output is correct
21 Correct 37 ms 64736 KB Output is correct
22 Correct 32 ms 64632 KB Output is correct
23 Correct 41 ms 64716 KB Output is correct
24 Correct 38 ms 64656 KB Output is correct
25 Correct 30 ms 64656 KB Output is correct
26 Correct 33 ms 64712 KB Output is correct
27 Correct 30 ms 64684 KB Output is correct
28 Correct 32 ms 64660 KB Output is correct
29 Correct 29 ms 64728 KB Output is correct
30 Correct 37 ms 64724 KB Output is correct
31 Correct 29 ms 64724 KB Output is correct
32 Correct 29 ms 64672 KB Output is correct
33 Correct 28 ms 64716 KB Output is correct
34 Correct 32 ms 64744 KB Output is correct
35 Correct 37 ms 64740 KB Output is correct
36 Correct 34 ms 64740 KB Output is correct
37 Correct 33 ms 64744 KB Output is correct
38 Correct 29 ms 64656 KB Output is correct
39 Correct 34 ms 64720 KB Output is correct
40 Correct 36 ms 64788 KB Output is correct
41 Correct 34 ms 64740 KB Output is correct
42 Correct 28 ms 64628 KB Output is correct
43 Runtime error 91 ms 131052 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -