oj.uz

답안 #379090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379090 2021-03-17T09:45:48 Z ACmachine Growing Vegetable is Fun 3 (JOI19_ho_t3) C++17
100 / 100
 116 ms 165228 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }


int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
    int n;
    string s;
    cin >> n >> s;
    int red = 0;
    int green = 0;
    int yellow = 0;
    vector<int> rpos, gpos, ypos;
    vector<int> sr(n, 0), sg(n, 0), sy(n, 0);
    REP(i, n){
        REP(j, i){
            if(s[j] == 'R')
                sr[i]++;
            else if(s[j] == 'G')
                sg[i]++;
            else
                sy[i]++;
        }
    }
    REP(i, n){
        if(s[i] == 'R'){
            red++;
            rpos.pb(i);
        }
        else if(s[i] == 'G'){
            green++;
            gpos.pb(i);
        }
        else{
            yellow++;
            ypos.pb(i);
        }
    }
    const int mx = 405;
    int dp[mx][mx][mx][3];
    REP(i, red + 2) REP(j, green + 2) REP(k, yellow + 2) REP(g, 3) dp[i][j][k][g] = INF;
    dp[0][0][0][0] = dp[0][0][0][1] = dp[0][0][0][2] = 0;
    REP(i, red + 1){
        REP(j, green + 1){
            REP(k, yellow + 1){
                REP(g, 3){
                    int placed;
                    // place red
                    if(i < red && g != 0){
                        int id = rpos[i];
                        placed = max(0, sg[id] - j) + max(0, sy[id] - k);
                        dp[i + 1][j][k][0] = min(dp[i + 1][j][k][0], dp[i][j][k][g] + placed);
                    }
                    if(j < green && g != 1){
                        int id = gpos[j];
                        placed = max(0, sr[id] - i) + max(0, sy[id] - k);
                        dp[i][j + 1][k][1] = min(dp[i][j + 1][k][1], dp[i][j][k][g] + placed);
                    }
                    if(k < yellow && g != 2){
                        int id = ypos[k];
                        placed = max(0, sr[id] - i) + max(0, sg[id] - j);
                        dp[i][j][k + 1][2] = min(dp[i][j][k + 1][2], dp[i][j][k][g] + placed);
                    }
                }
            }
        }
    }
    int ans = INF;
    REP(i, 3)
        ans = min(ans, dp[red][green][yellow][i]);
    if(ans < INF)
        cout << ans << "\n";
    else
        cout << -1 << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct

Subtask #2
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2156 KB Output is correct
20 Correct 2 ms 2540 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 2 ms 1900 KB Output is correct
23 Correct 2 ms 2284 KB Output is correct
24 Correct 2 ms 1772 KB Output is correct
25 Correct 3 ms 4204 KB Output is correct
26 Correct 3 ms 4460 KB Output is correct
27 Correct 2 ms 3308 KB Output is correct
28 Correct 2 ms 2540 KB Output is correct
29 Correct 2 ms 2432 KB Output is correct
30 Correct 2 ms 2540 KB Output is correct
31 Correct 2 ms 2156 KB Output is correct
32 Correct 2 ms 2540 KB Output is correct
33 Correct 3 ms 4076 KB Output is correct
34 Correct 2 ms 3820 KB Output is correct
35 Correct 2 ms 2944 KB Output is correct
36 Correct 2 ms 2156 KB Output is correct
37 Correct 2 ms 1900 KB Output is correct
38 Correct 2 ms 2284 KB Output is correct
39 Correct 2 ms 2540 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 2 ms 2412 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 89 ms 165100 KB Output is correct
3 Correct 86 ms 164348 KB Output is correct
4 Correct 86 ms 165100 KB Output is correct
5 Correct 89 ms 165100 KB Output is correct
6 Correct 85 ms 165128 KB Output is correct
7 Correct 87 ms 164332 KB Output is correct
8 Correct 85 ms 164332 KB Output is correct
9 Correct 85 ms 163436 KB Output is correct
10 Correct 87 ms 165228 KB Output is correct
11 Correct 86 ms 165100 KB Output is correct
12 Correct 24 ms 45036 KB Output is correct
13 Correct 41 ms 78500 KB Output is correct
14 Correct 59 ms 113004 KB Output is correct
15 Correct 89 ms 165100 KB Output is correct
16 Correct 87 ms 165100 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 620 KB Output is correct
15 Correct 1 ms 620 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 2560 KB Output is correct
19 Correct 2 ms 2156 KB Output is correct
20 Correct 2 ms 2540 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 2 ms 1900 KB Output is correct
23 Correct 2 ms 2284 KB Output is correct
24 Correct 2 ms 1772 KB Output is correct
25 Correct 3 ms 4204 KB Output is correct
26 Correct 3 ms 4460 KB Output is correct
27 Correct 2 ms 3308 KB Output is correct
28 Correct 2 ms 2540 KB Output is correct
29 Correct 2 ms 2432 KB Output is correct
30 Correct 2 ms 2540 KB Output is correct
31 Correct 2 ms 2156 KB Output is correct
32 Correct 2 ms 2540 KB Output is correct
33 Correct 3 ms 4076 KB Output is correct
34 Correct 2 ms 3820 KB Output is correct
35 Correct 2 ms 2944 KB Output is correct
36 Correct 2 ms 2156 KB Output is correct
37 Correct 2 ms 1900 KB Output is correct
38 Correct 2 ms 2284 KB Output is correct
39 Correct 2 ms 2540 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 2 ms 2412 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 89 ms 165100 KB Output is correct
44 Correct 86 ms 164348 KB Output is correct
45 Correct 86 ms 165100 KB Output is correct
46 Correct 89 ms 165100 KB Output is correct
47 Correct 85 ms 165128 KB Output is correct
48 Correct 87 ms 164332 KB Output is correct
49 Correct 85 ms 164332 KB Output is correct
50 Correct 85 ms 163436 KB Output is correct
51 Correct 87 ms 165228 KB Output is correct
52 Correct 86 ms 165100 KB Output is correct
53 Correct 24 ms 45036 KB Output is correct
54 Correct 41 ms 78500 KB Output is correct
55 Correct 59 ms 113004 KB Output is correct
56 Correct 89 ms 165100 KB Output is correct
57 Correct 87 ms 165100 KB Output is correct
58 Correct 91 ms 77536 KB Output is correct
59 Correct 113 ms 98156 KB Output is correct
60 Correct 103 ms 89196 KB Output is correct
61 Correct 92 ms 86244 KB Output is correct
62 Correct 89 ms 162800 KB Output is correct
63 Correct 95 ms 162284 KB Output is correct
64 Correct 110 ms 152172 KB Output is correct
65 Correct 113 ms 140524 KB Output is correct
66 Correct 96 ms 87660 KB Output is correct
67 Correct 116 ms 84204 KB Output is correct
68 Correct 95 ms 90092 KB Output is correct
69 Correct 94 ms 86764 KB Output is correct
70 Correct 107 ms 94060 KB Output is correct
71 Correct 92 ms 85228 KB Output is correct
72 Correct 38 ms 43244 KB Output is correct
73 Correct 5 ms 3436 KB Output is correct