oj.uz

Submission #250728

# Submission time Handle Problem Language Result Execution time Memory
250728 2020-07-18T23:18:03 Z WhaleVomit Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 774776 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
 
#define MOO(i, a, b) for(int i=a; i<b; i++)
#define M00(i, a) for(int i=0; i<a; i++)
#define MOOd(i,a,b) for(int i = (b)-1; i >= a; i--)
#define M00d(i,a) for(int i = (a)-1; i>=0; i--)
 
#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << '\n', 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << "\n";
#define _ << " _ " <<
 
template<class T> bool ckmin(T& a, const T& b) {return b < a ? a = b, 1 : 0;}
template<class T> bool ckmax(T& a, const T& b) {return a < b ? a = b, 1 : 0;}
 
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef pair<ld,ld> pd;
typedef complex<ld> cd;
 
const int MAX_N = 404;
int n;
int arr[MAX_N];
int pref[MAX_N][3];
vi idxOf[3];
int dp[MAX_N][3][MAX_N][MAX_N];
 
int getOf(int idx, pair<pi,int> fucked) {
    if(idx == 0) return fucked.f.f;
    if(idx == 1) return fucked.f.s;
    return fucked.s;
}
 
int getcost(int c, pair<pi,int> cnt) { // cost to get the next c
    if(getOf(c, cnt) >= sz(idxOf[c])) return 1e8; // impossible
    int idx = idxOf[c][getOf(c, cnt)];
    int res = idx;
    M00(k, 3) res -= min(getOf(k, cnt), pref[idx][k]);
    return res;
}
 
int getdp(int idx, int c, pair<pi,int> cnt) {
    if(dp[idx][c][cnt.f.f][cnt.f.s] != -1) return dp[idx][c][cnt.f.f][cnt.f.s];
    int cost = getcost(c, cnt);
    if(cost == 1e8) {
        dp[idx][c][cnt.f.f][cnt.f.s] = 1e8;
        return dp[idx][c][cnt.f.f][cnt.f.s]; 
    }
    if(idx == n-1) {
        dp[idx][c][cnt.f.f][cnt.f.s] = cost;
        return dp[idx][c][cnt.f.f][cnt.f.s];
    }
    pair<pi,int> cnt2 = cnt;
    if(c == 0) {
        cnt2.f.f++;
    } else if(c == 1) {
        cnt2.f.s++;
    } else {
        cnt2.s++;
    }
    int res = 1e8;
    M00(c2, 3) if(c2 != c) {
        ckmin(res, cost + getdp(idx+1, c2, cnt2));
    }
    dp[idx][c][cnt.f.f][cnt.f.s] = res;
    return dp[idx][c][cnt.f.f][cnt.f.s];
}
 
int main() { FAST
    //M00(a, MAX_N) M00(b, 3) M00(c, MAX_N) M00(d, MAX_N-c) dp[a][b][c][d] = -1;
    memset(dp, -1, sizeof(dp[0][0][0][0])*MAX_N*3*MAX_N*MAX_N);
    string s;
    cin >> n >> s;
    M00(i, n) {
        if(s[i] == 'R') arr[i] = 0;
        else if(s[i] == 'Y') arr[i] = 1;
        else arr[i] = 2;
    }
    M00(c, 3) {
        pref[0][c] = (arr[0] == c);
        MOO(i, 1, n) pref[i][c] = pref[i-1][c] + (arr[i] == c);
    }
    M00(i, n) idxOf[arr[i]].pb(i);
    int res = 1e8;
    M00(i, 3) ckmin(res, getdp(0, i, mp(mp(0,0),0)));
    if(res == 1e8) {
        finish(-1);
    }
    finish(res);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 774668 KB Output is correct
2 Correct 386 ms 774632 KB Output is correct
3 Correct 380 ms 774604 KB Output is correct
4 Correct 375 ms 774520 KB Output is correct
5 Correct 397 ms 774648 KB Output is correct
6 Correct 374 ms 774520 KB Output is correct
7 Correct 374 ms 774520 KB Output is correct
8 Correct 373 ms 774520 KB Output is correct
9 Correct 375 ms 774648 KB Output is correct
10 Correct 386 ms 774648 KB Output is correct
11 Correct 374 ms 774648 KB Output is correct
12 Correct 401 ms 774648 KB Output is correct
13 Correct 386 ms 774648 KB Output is correct
14 Correct 382 ms 774572 KB Output is correct
15 Correct 396 ms 774648 KB Output is correct
16 Correct 376 ms 774720 KB Output is correct
17 Correct 377 ms 774556 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 774668 KB Output is correct
2 Correct 386 ms 774632 KB Output is correct
3 Correct 380 ms 774604 KB Output is correct
4 Correct 375 ms 774520 KB Output is correct
5 Correct 397 ms 774648 KB Output is correct
6 Correct 374 ms 774520 KB Output is correct
7 Correct 374 ms 774520 KB Output is correct
8 Correct 373 ms 774520 KB Output is correct
9 Correct 375 ms 774648 KB Output is correct
10 Correct 386 ms 774648 KB Output is correct
11 Correct 374 ms 774648 KB Output is correct
12 Correct 401 ms 774648 KB Output is correct
13 Correct 386 ms 774648 KB Output is correct
14 Correct 382 ms 774572 KB Output is correct
15 Correct 396 ms 774648 KB Output is correct
16 Correct 376 ms 774720 KB Output is correct
17 Correct 377 ms 774556 KB Output is correct
18 Correct 386 ms 774520 KB Output is correct
19 Correct 379 ms 774648 KB Output is correct
20 Correct 391 ms 774596 KB Output is correct
21 Correct 384 ms 774648 KB Output is correct
22 Correct 425 ms 774648 KB Output is correct
23 Correct 378 ms 774520 KB Output is correct
24 Correct 386 ms 774676 KB Output is correct
25 Correct 369 ms 774520 KB Output is correct
26 Correct 372 ms 774520 KB Output is correct
27 Correct 372 ms 774520 KB Output is correct
28 Correct 394 ms 774520 KB Output is correct
29 Correct 377 ms 774520 KB Output is correct
30 Correct 389 ms 774648 KB Output is correct
31 Correct 375 ms 774520 KB Output is correct
32 Correct 373 ms 774648 KB Output is correct
33 Correct 377 ms 774520 KB Output is correct
34 Correct 376 ms 774776 KB Output is correct
35 Correct 369 ms 774520 KB Output is correct
36 Correct 399 ms 774648 KB Output is correct
37 Correct 385 ms 774520 KB Output is correct
38 Correct 410 ms 774648 KB Output is correct
39 Correct 371 ms 774524 KB Output is correct
40 Correct 393 ms 774552 KB Output is correct
41 Correct 380 ms 774520 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 373 ms 774648 KB Output is correct
2 Correct 372 ms 774648 KB Output is correct
3 Correct 411 ms 774676 KB Output is correct
4 Correct 384 ms 774648 KB Output is correct
5 Correct 376 ms 774648 KB Output is correct
6 Correct 374 ms 774648 KB Output is correct
7 Correct 374 ms 774776 KB Output is correct
8 Correct 376 ms 774648 KB Output is correct
9 Correct 409 ms 774648 KB Output is correct
10 Correct 375 ms 774648 KB Output is correct
11 Correct 376 ms 774700 KB Output is correct
12 Correct 375 ms 774648 KB Output is correct
13 Correct 373 ms 774696 KB Output is correct
14 Correct 381 ms 774604 KB Output is correct
15 Correct 396 ms 774648 KB Output is correct
16 Correct 380 ms 774648 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 774668 KB Output is correct
2 Correct 386 ms 774632 KB Output is correct
3 Correct 380 ms 774604 KB Output is correct
4 Correct 375 ms 774520 KB Output is correct
5 Correct 397 ms 774648 KB Output is correct
6 Correct 374 ms 774520 KB Output is correct
7 Correct 374 ms 774520 KB Output is correct
8 Correct 373 ms 774520 KB Output is correct
9 Correct 375 ms 774648 KB Output is correct
10 Correct 386 ms 774648 KB Output is correct
11 Correct 374 ms 774648 KB Output is correct
12 Correct 401 ms 774648 KB Output is correct
13 Correct 386 ms 774648 KB Output is correct
14 Correct 382 ms 774572 KB Output is correct
15 Correct 396 ms 774648 KB Output is correct
16 Correct 376 ms 774720 KB Output is correct
17 Correct 377 ms 774556 KB Output is correct
18 Correct 386 ms 774520 KB Output is correct
19 Correct 379 ms 774648 KB Output is correct
20 Correct 391 ms 774596 KB Output is correct
21 Correct 384 ms 774648 KB Output is correct
22 Correct 425 ms 774648 KB Output is correct
23 Correct 378 ms 774520 KB Output is correct
24 Correct 386 ms 774676 KB Output is correct
25 Correct 369 ms 774520 KB Output is correct
26 Correct 372 ms 774520 KB Output is correct
27 Correct 372 ms 774520 KB Output is correct
28 Correct 394 ms 774520 KB Output is correct
29 Correct 377 ms 774520 KB Output is correct
30 Correct 389 ms 774648 KB Output is correct
31 Correct 375 ms 774520 KB Output is correct
32 Correct 373 ms 774648 KB Output is correct
33 Correct 377 ms 774520 KB Output is correct
34 Correct 376 ms 774776 KB Output is correct
35 Correct 369 ms 774520 KB Output is correct
36 Correct 399 ms 774648 KB Output is correct
37 Correct 385 ms 774520 KB Output is correct
38 Correct 410 ms 774648 KB Output is correct
39 Correct 371 ms 774524 KB Output is correct
40 Correct 393 ms 774552 KB Output is correct
41 Correct 380 ms 774520 KB Output is correct
42 Correct 373 ms 774648 KB Output is correct
43 Correct 372 ms 774648 KB Output is correct
44 Correct 411 ms 774676 KB Output is correct
45 Correct 384 ms 774648 KB Output is correct
46 Correct 376 ms 774648 KB Output is correct
47 Correct 374 ms 774648 KB Output is correct
48 Correct 374 ms 774776 KB Output is correct
49 Correct 376 ms 774648 KB Output is correct
50 Correct 409 ms 774648 KB Output is correct
51 Correct 375 ms 774648 KB Output is correct
52 Correct 376 ms 774700 KB Output is correct
53 Correct 375 ms 774648 KB Output is correct
54 Correct 373 ms 774696 KB Output is correct
55 Correct 381 ms 774604 KB Output is correct
56 Correct 396 ms 774648 KB Output is correct
57 Correct 380 ms 774648 KB Output is correct
58 Execution timed out 788 ms 774756 KB Time limit exceeded
59 Halted 0 ms 0 KB -