oj.uz

Submission #123536

# Submission time Handle Problem Language Result Execution time Memory
123536 2019-07-01T14:35:56 Z duality Growing Vegetable is Fun 3 (JOI19_ho_t3) C++11
100 / 100
 87 ms 29432 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

char S[400];
vi c[3];
int num[3][401][400];
int dp[2500000][3];
int main() {
    int i;
    int N;
    scanf("%d",&N);
    for (i = 0; i < N; i++) {
        scanf(" %c",&S[i]);
        if (S[i] == 'R') c[0].pb(i);
        else if (S[i] == 'G') c[1].pb(i);
        else c[2].pb(i);
    }

    int j,k;
    int x = c[0].size()+1,y = c[1].size()+1,z = c[2].size()+1;
    for (i = 0; i < 3; i++) {
        for (j = 0; j < c[i].size(); j++) {
            for (k = 0; k < N; k++) num[i][j+1][k] = num[i][j][k];
            for (k = 0; k <= c[i][j]; k++) num[i][j+1][k]++;
        }
    }
    for (i = 1; i < x*y*z; i++) {
        int p = i % x,q = (i/x) % y,r = i/(x*y);
        for (j = 0; j < 3; j++) dp[i][j] = 1e9;
        if (p > 0) dp[i][0] = min(dp[i][0],min(dp[i-1][1],dp[i-1][2])+num[1][q][c[0][p-1]]+num[2][r][c[0][p-1]]);
        if (q > 0) dp[i][1] = min(dp[i][1],min(dp[i-x][0],dp[i-x][2])+num[0][p][c[1][q-1]]+num[2][r][c[1][q-1]]);
        if (r > 0) dp[i][2] = min(dp[i][2],min(dp[i-x*y][0],dp[i-x*y][1])+num[0][p][c[2][r-1]]+num[1][q][c[2][r-1]]);
    }
    i--;
    int ans = min(min(dp[i][0],dp[i][1]),dp[i][2]);
    printf("%d\n",(ans < 1e8) ? ans:-1);

    return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:76:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < c[i].size(); j++) {
                     ~~^~~~~~~~~~~~~
joi2019_ho_t3.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
joi2019_ho_t3.cpp:67:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf(" %c",&S[i]);
         ~~~~~^~~~~~~~~~~~~

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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 504 KB Output is correct
36 Correct 2 ms 504 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 2 ms 504 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 4 ms 1400 KB Output is correct
3 Correct 4 ms 1400 KB Output is correct
4 Correct 4 ms 1400 KB Output is correct
5 Correct 4 ms 1400 KB Output is correct
6 Correct 4 ms 1400 KB Output is correct
7 Correct 4 ms 1400 KB Output is correct
8 Correct 4 ms 1400 KB Output is correct
9 Correct 4 ms 1400 KB Output is correct
10 Correct 4 ms 1528 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 1016 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 4 ms 1528 KB Output is correct
16 Correct 4 ms 1528 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 2 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 504 KB Output is correct
36 Correct 2 ms 504 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 2 ms 504 KB Output is correct
41 Correct 2 ms 504 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 4 ms 1400 KB Output is correct
44 Correct 4 ms 1400 KB Output is correct
45 Correct 4 ms 1400 KB Output is correct
46 Correct 4 ms 1400 KB Output is correct
47 Correct 4 ms 1400 KB Output is correct
48 Correct 4 ms 1400 KB Output is correct
49 Correct 4 ms 1400 KB Output is correct
50 Correct 4 ms 1400 KB Output is correct
51 Correct 4 ms 1528 KB Output is correct
52 Correct 4 ms 1528 KB Output is correct
53 Correct 3 ms 760 KB Output is correct
54 Correct 3 ms 1016 KB Output is correct
55 Correct 3 ms 1144 KB Output is correct
56 Correct 4 ms 1528 KB Output is correct
57 Correct 4 ms 1528 KB Output is correct
58 Correct 81 ms 29048 KB Output is correct
59 Correct 81 ms 29132 KB Output is correct
60 Correct 80 ms 28832 KB Output is correct
61 Correct 82 ms 29188 KB Output is correct
62 Correct 9 ms 3320 KB Output is correct
63 Correct 14 ms 5112 KB Output is correct
64 Correct 41 ms 14968 KB Output is correct
65 Correct 59 ms 21036 KB Output is correct
66 Correct 79 ms 28792 KB Output is correct
67 Correct 81 ms 28752 KB Output is correct
68 Correct 87 ms 29176 KB Output is correct
69 Correct 81 ms 29432 KB Output is correct
70 Correct 82 ms 29432 KB Output is correct
71 Correct 80 ms 28692 KB Output is correct
72 Correct 24 ms 8184 KB Output is correct
73 Correct 8 ms 2808 KB Output is correct