oj.uz

Submission #644930

# Submission time Handle Problem Language Result Execution time Memory
644930 2022-09-25T14:43:13 Z ghostwriter Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
100 / 100
 61 ms 3924 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int oo = 1e9 + 5;
#define getid(x) (x == 'R'? 0 : x == 'G'? 1 : 2)
const int N = 405;
int n, pos[3][N], c[3], d[N][N][3], d1[N][N][3], d2[N][3][N];
char s[N];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n;
    FOR(i, 1, n) {
    	cin >> s[i];
    	++c[getid(s[i])];
    	pos[getid(s[i])][c[getid(s[i])]] = i;
    }
    FOR(i, 1, n)
    FOR(j, 0, 2) {
    	if (j == getid(s[i])) continue;
	    FOR(z, 1, c[j]) d2[i][j][z] = d2[i][j][z - 1] + (pos[j][z] > i? 1 : 0);
	}
    FSN(i, c[0] + 1) {
	    FSN(j, c[1] + 1)
	    FSN(z, c[2] + 1)
	    FSN(x, 3) {
	    	int &rs = d[j][z][x];
	    	rs = oo;
	    	if (i == c[0] && j == c[1] && z == c[2]) {
	    		rs = 0;
	    		continue;
	    	}
	    	if (x != 0 && i < c[0]) rs = min(rs, d1[j][z][0] + d2[pos[0][i + 1]][1][j] + d2[pos[0][i + 1]][2][z]);
	    	if (x != 1 && j < c[1]) rs = min(rs, d[j + 1][z][1] + d2[pos[1][j + 1]][0][i] + d2[pos[1][j + 1]][2][z]);
	    	if (x != 2 && z < c[2]) rs = min(rs, d[j][z + 1][2] + d2[pos[2][z + 1]][0][i] + d2[pos[2][z + 1]][1][j]);
	    }
	    FSN(j, c[1] + 1)
	    FSN(z, c[2] + 1)
	    FSN(x, 3)
	    	d1[j][z][x] = d[j][z][x];
	}
	int rs = min({d[0][0][0], d[0][0][1], d[0][0][2]}); 
	cout << (rs < oo? rs : -1);
    return 0;
}
/*
5
RRGYY
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
joi2019_ho_t3.cpp:59:5: note: in expansion of macro 'FOR'
   59 |     FOR(i, 1, n) {
      |     ^~~
joi2019_ho_t3.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
joi2019_ho_t3.cpp:64:5: note: in expansion of macro 'FOR'
   64 |     FOR(i, 1, n)
      |     ^~~
joi2019_ho_t3.cpp:30:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
joi2019_ho_t3.cpp:65:5: note: in expansion of macro 'FOR'
   65 |     FOR(j, 0, 2) {
      |     ^~~
joi2019_ho_t3.cpp:30:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
joi2019_ho_t3.cpp:67:6: note: in expansion of macro 'FOR'
   67 |      FOR(z, 1, c[j]) d2[i][j][z] = d2[i][j][z - 1] + (pos[j][z] > i? 1 : 0);
      |      ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:69:5: note: in expansion of macro 'FSN'
   69 |     FSN(i, c[0] + 1) {
      |     ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:70:6: note: in expansion of macro 'FSN'
   70 |      FSN(j, c[1] + 1)
      |      ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:71:6: note: in expansion of macro 'FSN'
   71 |      FSN(z, c[2] + 1)
      |      ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:72:6: note: in expansion of macro 'FSN'
   72 |      FSN(x, 3) {
      |      ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:83:6: note: in expansion of macro 'FSN'
   83 |      FSN(j, c[1] + 1)
      |      ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:84:6: note: in expansion of macro 'FSN'
   84 |      FSN(z, c[2] + 1)
      |      ^~~
joi2019_ho_t3.cpp:33:28: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   33 | #define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
      |                            ^
joi2019_ho_t3.cpp:85:6: note: in expansion of macro 'FSN'
   85 |      FSN(x, 3)
      |      ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 712 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 712 KB Output is correct
24 Correct 1 ms 844 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 844 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 1 ms 852 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 1 ms 980 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct
3 Correct 3 ms 3788 KB Output is correct
4 Correct 3 ms 3660 KB Output is correct
5 Correct 3 ms 3668 KB Output is correct
6 Correct 3 ms 3668 KB Output is correct
7 Correct 3 ms 3664 KB Output is correct
8 Correct 3 ms 3668 KB Output is correct
9 Correct 5 ms 3668 KB Output is correct
10 Correct 3 ms 3660 KB Output is correct
11 Correct 3 ms 3668 KB Output is correct
12 Correct 1 ms 1996 KB Output is correct
13 Correct 2 ms 2516 KB Output is correct
14 Correct 2 ms 3028 KB Output is correct
15 Correct 3 ms 3668 KB Output is correct
16 Correct 3 ms 3656 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 712 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 712 KB Output is correct
24 Correct 1 ms 844 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 1 ms 844 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 724 KB Output is correct
30 Correct 1 ms 724 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 724 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 1 ms 852 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 1 ms 852 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 1 ms 980 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 3 ms 3796 KB Output is correct
44 Correct 3 ms 3788 KB Output is correct
45 Correct 3 ms 3660 KB Output is correct
46 Correct 3 ms 3668 KB Output is correct
47 Correct 3 ms 3668 KB Output is correct
48 Correct 3 ms 3664 KB Output is correct
49 Correct 3 ms 3668 KB Output is correct
50 Correct 5 ms 3668 KB Output is correct
51 Correct 3 ms 3660 KB Output is correct
52 Correct 3 ms 3668 KB Output is correct
53 Correct 1 ms 1996 KB Output is correct
54 Correct 2 ms 2516 KB Output is correct
55 Correct 2 ms 3028 KB Output is correct
56 Correct 3 ms 3668 KB Output is correct
57 Correct 3 ms 3656 KB Output is correct
58 Correct 55 ms 3412 KB Output is correct
59 Correct 61 ms 3540 KB Output is correct
60 Correct 47 ms 3412 KB Output is correct
61 Correct 51 ms 3448 KB Output is correct
62 Correct 5 ms 3668 KB Output is correct
63 Correct 11 ms 3796 KB Output is correct
64 Correct 23 ms 3832 KB Output is correct
65 Correct 39 ms 3924 KB Output is correct
66 Correct 43 ms 3460 KB Output is correct
67 Correct 49 ms 3668 KB Output is correct
68 Correct 47 ms 3412 KB Output is correct
69 Correct 47 ms 3412 KB Output is correct
70 Correct 58 ms 3540 KB Output is correct
71 Correct 50 ms 3300 KB Output is correct
72 Correct 13 ms 2476 KB Output is correct
73 Correct 7 ms 3156 KB Output is correct