oj.uz

Submission #146084

# Submission time Handle Problem Language Result Execution time Memory
146084 2019-08-22T02:35:11 Z thecodingwizard Growing Vegetable is Fun 3 (JOI19_ho_t3) C++11
15 / 100
 165 ms 192624 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 == 0 && g == 0 && y == 0) prv = -1;
    if (r + g + y == n) return 0;
    int low = INF;
    int xx[3] = { r, g, y };
    F0R(i, 3) {
        if (i == prv) continue;
        if (positions[i].size() <= xx[i]) continue;
        int nextPos = positions[i][xx[i]];

        int extra = 0;
        if (prv != -1 && xx[prv] != positions[prv].size()) extra += max(PS[prv][nextPos] - 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] - 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:177: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()) extra += max(PS[prv][nextPos] - PS[prv][positions[prv][xx[prv]]] + 1, 0);
                          ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:184:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (xx[otherColor] != positions[otherColor].size()) extra += max(PS[otherColor][nextPos] - PS[otherColor][positions[otherColor][xx[otherColor]]] + 1, 0);
             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:198:31: warning: array subscript has type 'char' [-Wchar-subscripts]
         positions[mapping[s[i]]].pb(i);
                               ^
joi2019_ho_t3.cpp:199: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:203: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:203: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:203: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
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 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Incorrect 2 ms 632 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
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 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Incorrect 2 ms 632 KB Output isn't correct
8 Halted 0 ms 0 KB -

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 192476 KB Output is correct
3 Correct 141 ms 191480 KB Output is correct
4 Correct 142 ms 192504 KB Output is correct
5 Correct 141 ms 192508 KB Output is correct
6 Correct 159 ms 192528 KB Output is correct
7 Correct 165 ms 191632 KB Output is correct
8 Correct 141 ms 191628 KB Output is correct
9 Correct 140 ms 190620 KB Output is correct
10 Correct 140 ms 192476 KB Output is correct
11 Correct 151 ms 192624 KB Output is correct
12 Correct 43 ms 52472 KB Output is correct
13 Correct 68 ms 91384 KB Output is correct
14 Correct 97 ms 131672 KB Output is correct
15 Correct 141 ms 192376 KB Output is correct
16 Correct 141 ms 192376 KB Output is correct

Subtask #4
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 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 632 KB Output is correct
7 Incorrect 2 ms 632 KB Output isn't correct
8 Halted 0 ms 0 KB -