oj.uz

Submission #146087

# Submission time Handle Problem Language Result Execution time Memory
146087 2019-08-22T02:47:00 Z thecodingwizard Growing Vegetable is Fun 3 (JOI19_ho_t3) C++11
100 / 100
 300 ms 192576 KB 
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

#include <bits/stdc++.h>

#include <utility>

using namespace std;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; i<=(a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000LL
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define PI acos(-1.0)
// #define MOD (int)(2e+9+11)
#define MOD (int)(1e+9+7)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;

#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
#define SORT(vec) sort(all(vec))
#define RSORT(vec) sort(vec.rbegin(),vec.rend())

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

// @formatter:off
// Source: Benq (https://github.com/bqi343/USACO) [Modified]
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    template<class T> void reA(T A[], int sz);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.pA,p.pB); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
    template<class T> void reA(T A[], int sz) { F0R(i, sz) re(A[i]); }

    void setupIO(const string &PROB = "") {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        if (PROB.length() != 0) {
            ifstream infile(PROB + ".in");
            if (infile.good()) {
                freopen((PROB + ".in").c_str(), "r", stdin);
                freopen((PROB + ".out").c_str(), "w", stdout);
            }
        }
    }
}
using namespace input;

namespace output {
    template<class T1, class T2> void prD(const pair<T1,T2>& x);
    template<class T, size_t SZ> void prD(const array<T,SZ>& x);
    template<class T> void prD(const vector<T>& x);
    template<class T> void prD(const set<T>& x);
    template<class T1, class T2> void prD(const map<T1,T2>& x);

    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void prD(const T& x) { cout << x; }
    template<class Arg, class... Args> void prD(const Arg& first, const Args&... rest) {
        prD(first); prD(rest...);
    }

    template<class T1, class T2> void prD(const pair<T1,T2>& x) {
        prD("{",x.pA,", ",x.pB,"}");
    }
    template<class T> void prDContain(const T& x) {
        prD("{");
        bool fst = 1; for (const auto& a: x) prD(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        prD("}");
    }
    template<class T, size_t SZ> void prD(const array<T,SZ>& x) { prDContain(x); }
    template<class T> void prD(const vector<T>& x) { prDContain(x); }
    template<class T> void prD(const set<T>& x) { prDContain(x); }
    template<class T1, class T2> void prD(const map<T1,T2>& x) { prDContain(x); }

    void psD() { prD("\n"); }
    template<class Arg> void psD(const Arg& first) {
        prD(first); psD(); // no space at end of line
    }
    template<class Arg, class... Args> void psD(const Arg& first, const Args&... rest) {
        prD(first," "); psD(rest...); // print w/ spaces
    }


    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr(x.pA, " ", x.pB);
    }
    template<class T> void prContain(const T& x) {
        bool fst = 1; for (const auto& a: x) pr(!fst?" ":"",a), fst = 0; // const needed for vector<bool>
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}
using namespace output;
// @formatter:on

/* ============================ */

int n; string s;
vi positions[3];
int mapping[1000];
int PS[3][400];

int memo[3][401][401][401];
int dp(int prv, int r, int g, int y) {
    if (memo[prv][r][g][y] != -1) return memo[prv][r][g][y];
    if (r + g + y == n) return 0;
    int low = INF;
    int xx[3] = { r, g, y };
    F0R(i, 3) {
        if (!(r == 0 && g == 0 && y == 0) && i == prv) continue;
        if (positions[i].size() <= xx[i]) continue;
        int nextPos = positions[i][xx[i]];

        int extra = 0;
        if (r == 0 && g == 0 && y == 0) prv = (i + 1) % 3;
        if (prv != -1 && xx[prv] != positions[prv].size())
            extra += max(PS[prv][nextPos] - (xx[prv] == 0 ? 0 : PS[prv][positions[prv][xx[prv]] - 1]), 0);
        int otherColor = 0;
        while (otherColor == prv || otherColor == i) otherColor++;
        if (xx[otherColor] != positions[otherColor].size())
            extra += max(PS[otherColor][nextPos] - (xx[otherColor] == 0 ? 0 : PS[otherColor][positions[otherColor][xx[otherColor]] - 1]), 0);
        MIN(low, extra + dp(i, r + (i==0), g + (i==1), y + (i==2)));
    }
    if (r == 0 && g == 0 && y == 0) prv = 0;
    return memo[prv][r][g][y] = low;
}

int main() {
    setupIO();

    re(n, s);
    mapping['R'] = 0; mapping['G'] = 1; mapping['Y'] = 2;
    SET2D(PS, 0, 3, 400);
    F0R(i, n) {
        positions[mapping[s[i]]].pb(i);
        PS[mapping[s[i]]][i]++;
    }
    F0R(i, 3) FOR(j, 1, n) PS[i][j] += PS[i][j-1];

    SET4D(memo, -1, 3, positions[0].size() + 1, positions[1].size() + 1, positions[2].size() + 1);

    int ans = dp(0, 0, 0, 0);
    if (ans == INF) ps(-1);
    else ps(ans);

    return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int dp(int, int, int, int)':
joi2019_ho_t3.cpp:176:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (positions[i].size() <= xx[i]) continue;
             ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
joi2019_ho_t3.cpp:181:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (prv != -1 && xx[prv] != positions[prv].size())
                          ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:185:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (xx[otherColor] != positions[otherColor].size())
             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:200:31: warning: array subscript has type 'char' [-Wchar-subscripts]
         positions[mapping[s[i]]].pb(i);
                               ^
joi2019_ho_t3.cpp:201:24: warning: array subscript has type 'char' [-Wchar-subscripts]
         PS[mapping[s[i]]][i]++;
                        ^
joi2019_ho_t3.cpp:13:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define F0R(i, a) for (int i=0; i<(a); i++)
                                  ^
joi2019_ho_t3.cpp:36:62: note: in expansion of macro 'F0R'
 #define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;
                                                              ^~~
joi2019_ho_t3.cpp:205:5: note: in expansion of macro 'SET4D'
     SET4D(memo, -1, 3, positions[0].size() + 1, positions[1].size() + 1, positions[2].size() + 1);
     ^~~~~
joi2019_ho_t3.cpp:13:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define F0R(i, a) for (int i=0; i<(a); i++)
                                  ^
joi2019_ho_t3.cpp:36:75: note: in expansion of macro 'F0R'
 #define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;
                                                                           ^~~
joi2019_ho_t3.cpp:205:5: note: in expansion of macro 'SET4D'
     SET4D(memo, -1, 3, positions[0].size() + 1, positions[1].size() + 1, positions[2].size() + 1);
     ^~~~~
joi2019_ho_t3.cpp:13:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define F0R(i, a) for (int i=0; i<(a); i++)
                                  ^
joi2019_ho_t3.cpp:36:88: note: in expansion of macro 'F0R'
 #define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;
                                                                                        ^~~
joi2019_ho_t3.cpp:205:5: note: in expansion of macro 'SET4D'
     SET4D(memo, -1, 3, positions[0].size() + 1, positions[1].size() + 1, positions[2].size() + 1);
     ^~~~~
joi2019_ho_t3.cpp: In function 'void input::setupIO(const string&)':
joi2019_ho_t3.cpp:86:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".in").c_str(), "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:87:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".out").c_str(), "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 4 ms 2936 KB Output is correct
19 Correct 4 ms 2168 KB Output is correct
20 Correct 4 ms 2684 KB Output is correct
21 Correct 5 ms 2808 KB Output is correct
22 Correct 4 ms 2040 KB Output is correct
23 Correct 4 ms 2556 KB Output is correct
24 Correct 4 ms 1912 KB Output is correct
25 Correct 5 ms 4856 KB Output is correct
26 Correct 5 ms 5112 KB Output is correct
27 Correct 5 ms 3704 KB Output is correct
28 Correct 4 ms 2808 KB Output is correct
29 Correct 4 ms 2680 KB Output is correct
30 Correct 4 ms 2680 KB Output is correct
31 Correct 4 ms 2424 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 5 ms 4648 KB Output is correct
34 Correct 5 ms 4348 KB Output is correct
35 Correct 5 ms 3192 KB Output is correct
36 Correct 4 ms 2296 KB Output is correct
37 Correct 4 ms 2040 KB Output is correct
38 Correct 4 ms 2424 KB Output is correct
39 Correct 4 ms 2680 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 4 ms 2660 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 142 ms 192512 KB Output is correct
3 Correct 140 ms 191632 KB Output is correct
4 Correct 141 ms 192476 KB Output is correct
5 Correct 167 ms 192476 KB Output is correct
6 Correct 156 ms 192576 KB Output is correct
7 Correct 141 ms 191564 KB Output is correct
8 Correct 140 ms 191516 KB Output is correct
9 Correct 141 ms 190504 KB Output is correct
10 Correct 165 ms 192504 KB Output is correct
11 Correct 149 ms 192504 KB Output is correct
12 Correct 40 ms 52572 KB Output is correct
13 Correct 68 ms 91384 KB Output is correct
14 Correct 97 ms 131736 KB Output is correct
15 Correct 141 ms 192376 KB Output is correct
16 Correct 141 ms 192504 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 636 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 764 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 2 ms 632 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 4 ms 2936 KB Output is correct
19 Correct 4 ms 2168 KB Output is correct
20 Correct 4 ms 2684 KB Output is correct
21 Correct 5 ms 2808 KB Output is correct
22 Correct 4 ms 2040 KB Output is correct
23 Correct 4 ms 2556 KB Output is correct
24 Correct 4 ms 1912 KB Output is correct
25 Correct 5 ms 4856 KB Output is correct
26 Correct 5 ms 5112 KB Output is correct
27 Correct 5 ms 3704 KB Output is correct
28 Correct 4 ms 2808 KB Output is correct
29 Correct 4 ms 2680 KB Output is correct
30 Correct 4 ms 2680 KB Output is correct
31 Correct 4 ms 2424 KB Output is correct
32 Correct 4 ms 2808 KB Output is correct
33 Correct 5 ms 4648 KB Output is correct
34 Correct 5 ms 4348 KB Output is correct
35 Correct 5 ms 3192 KB Output is correct
36 Correct 4 ms 2296 KB Output is correct
37 Correct 4 ms 2040 KB Output is correct
38 Correct 4 ms 2424 KB Output is correct
39 Correct 4 ms 2680 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 4 ms 2660 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 142 ms 192512 KB Output is correct
44 Correct 140 ms 191632 KB Output is correct
45 Correct 141 ms 192476 KB Output is correct
46 Correct 167 ms 192476 KB Output is correct
47 Correct 156 ms 192576 KB Output is correct
48 Correct 141 ms 191564 KB Output is correct
49 Correct 140 ms 191516 KB Output is correct
50 Correct 141 ms 190504 KB Output is correct
51 Correct 165 ms 192504 KB Output is correct
52 Correct 149 ms 192504 KB Output is correct
53 Correct 40 ms 52572 KB Output is correct
54 Correct 68 ms 91384 KB Output is correct
55 Correct 97 ms 131736 KB Output is correct
56 Correct 141 ms 192376 KB Output is correct
57 Correct 141 ms 192504 KB Output is correct
58 Correct 269 ms 76576 KB Output is correct
59 Correct 296 ms 97032 KB Output is correct
60 Correct 296 ms 88184 KB Output is correct
61 Correct 291 ms 85404 KB Output is correct
62 Correct 141 ms 187640 KB Output is correct
63 Correct 139 ms 184976 KB Output is correct
64 Correct 153 ms 161656 KB Output is correct
65 Correct 192 ms 140604 KB Output is correct
66 Correct 288 ms 86516 KB Output is correct
67 Correct 266 ms 83064 KB Output is correct
68 Correct 287 ms 89080 KB Output is correct
69 Correct 287 ms 85756 KB Output is correct
70 Correct 300 ms 93048 KB Output is correct
71 Correct 280 ms 84600 KB Output is correct
72 Correct 43 ms 43640 KB Output is correct
73 Correct 5 ms 3064 KB Output is correct