oj.uz

Submission #294885

# Submission time Handle Problem Language Result Execution time Memory
294885 2020-09-09T10:18:44 Z crossing0ver Visiting Singapore (NOI20_visitingsingapore) C++17
35 / 100
 327 ms 196088 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
int k,n,m,a,b,hap[5005],s[5005],t[5005];
int dp[5005][5005][2];
main() {
    cin >> k >> n >> m >> a >> b;
    for (int i = 1; i <= k; i++)
        cin >> hap[i];
    for (int i = 1; i <= n; i++)
        cin >> s[i];
    for (int i = 1; i <= m; i++)
        cin >> t[i];
    int ans = a + b*m;
    const int inf = -1e6;
  //
  for (int j = 1; j <= m ;j ++)
    dp[0][j][1] = inf,dp[0][j][0] = a + b*j;
   // for (int i = 1; i <= n; i++)
    //    for (int j = 1; j <= m; j++)
     //       dp[i][j][0] = dp[i][j][1] = inf;
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) {
      //     dp[i][j]_ taken j-th one
            // 0 _ last not used
            // 1 _ last used
           // dp[i][j][0] = a + j*b;
           dp[i][j][0] = a + j*b + b+a;
            if (j!=1)
            dp[i][j][0] = max(dp[i][j][0],dp[i][j-1][1]  +  a + b);
    //        if (i>1)
    //    dp[i][j][0] = max(dp[i][j][0],dp[i-1][j][0]+b);
       // else
       // dp[i][j][0] = max(dp[i][j][0],dp[i-1][j][0]+b);
        if (j != 1)
        dp[i][j][0] = max(dp[i][j][0],dp[i][j-1][0]+b);

        dp[i][j][0] = max(dp[i][j][0],dp[i-1][j][1] + a + b + b + a);
        dp[i][j][0] = max(dp[i][j][0], dp[i-1][j][0] + a + b);
        ans = max(ans,dp[i][j][0] + b*(m-j));
        if (s[i] != t[j])
            dp[i][j][1] = inf;
        else {
            int adit = hap[ t[j] ];
                dp[i][j][1] = (j > 1? a : 0) + (j-1)*b + adit;
            dp[i][j][1] = max(dp[i][j][1],adit + dp[i-1][j-1][1]);
            //dp[i][j][1] = max(dp[i][j][1],adit + dp[i-1][j-1][1]);
            dp[i][j][1] = max(dp[i][j][1],adit + dp[i-1][j-1][0] );
            ans = max(ans,dp[i][j][1] + (m-j)*b + (j != m ? a : 0));
        }
    }
  //  cout << dp[5][1][1];exit(0);
    cout << ans;



    /*
    if (m <= n) {
    ans = max(ans, hap[1]*m);
    }else {
        ans = max(ans,hap[1]*n + (m-n)*B + A);
    }
    cout << ans;*/



}

Compilation message

VisitingSingapore.cpp:7:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    7 | main() {
      |      ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 14 ms 10752 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 2 ms 3968 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 9 ms 7168 KB Output is correct
10 Correct 17 ms 12160 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 5 ms 3328 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 2 ms 1536 KB Output is correct
6 Correct 8 ms 6528 KB Output is correct
7 Correct 8 ms 6144 KB Output is correct
8 Correct 11 ms 9088 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 16 ms 12160 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 29944 KB Output is correct
2 Correct 17 ms 18176 KB Output is correct
3 Correct 101 ms 79864 KB Output is correct
4 Correct 231 ms 174272 KB Output is correct
5 Correct 65 ms 51448 KB Output is correct
6 Correct 97 ms 76280 KB Output is correct
7 Correct 195 ms 143480 KB Output is correct
8 Correct 69 ms 54904 KB Output is correct
9 Correct 125 ms 91384 KB Output is correct
10 Correct 258 ms 196088 KB Output is correct
11 Correct 278 ms 195632 KB Output is correct
12 Correct 260 ms 196088 KB Output is correct
13 Correct 257 ms 196088 KB Output is correct
14 Correct 327 ms 196088 KB Output is correct
15 Correct 317 ms 196088 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 29944 KB Output is correct
2 Correct 17 ms 18176 KB Output is correct
3 Correct 101 ms 79864 KB Output is correct
4 Correct 231 ms 174272 KB Output is correct
5 Correct 65 ms 51448 KB Output is correct
6 Correct 97 ms 76280 KB Output is correct
7 Correct 195 ms 143480 KB Output is correct
8 Correct 69 ms 54904 KB Output is correct
9 Correct 125 ms 91384 KB Output is correct
10 Correct 258 ms 196088 KB Output is correct
11 Correct 278 ms 195632 KB Output is correct
12 Correct 260 ms 196088 KB Output is correct
13 Correct 257 ms 196088 KB Output is correct
14 Correct 327 ms 196088 KB Output is correct
15 Correct 317 ms 196088 KB Output is correct
16 Correct 144 ms 117740 KB Output is correct
17 Correct 174 ms 142456 KB Output is correct
18 Correct 162 ms 129284 KB Output is correct
19 Correct 38 ms 27000 KB Output is correct
20 Incorrect 111 ms 92920 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 29944 KB Output is correct
2 Correct 17 ms 18176 KB Output is correct
3 Correct 101 ms 79864 KB Output is correct
4 Correct 231 ms 174272 KB Output is correct
5 Correct 65 ms 51448 KB Output is correct
6 Correct 97 ms 76280 KB Output is correct
7 Correct 195 ms 143480 KB Output is correct
8 Correct 69 ms 54904 KB Output is correct
9 Correct 125 ms 91384 KB Output is correct
10 Correct 258 ms 196088 KB Output is correct
11 Correct 278 ms 195632 KB Output is correct
12 Correct 260 ms 196088 KB Output is correct
13 Correct 257 ms 196088 KB Output is correct
14 Correct 327 ms 196088 KB Output is correct
15 Correct 317 ms 196088 KB Output is correct
16 Incorrect 223 ms 182424 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 640 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 768 KB Output is correct
11 Correct 1 ms 768 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 756 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 14 ms 10752 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 2 ms 3968 KB Output is correct
5 Correct 1 ms 1792 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 9 ms 7168 KB Output is correct
10 Correct 17 ms 12160 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 5 ms 3328 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 2 ms 1536 KB Output is correct
16 Correct 8 ms 6528 KB Output is correct
17 Correct 8 ms 6144 KB Output is correct
18 Correct 11 ms 9088 KB Output is correct
19 Correct 2 ms 1792 KB Output is correct
20 Correct 16 ms 12160 KB Output is correct
21 Correct 31 ms 29944 KB Output is correct
22 Correct 17 ms 18176 KB Output is correct
23 Correct 101 ms 79864 KB Output is correct
24 Correct 231 ms 174272 KB Output is correct
25 Correct 65 ms 51448 KB Output is correct
26 Correct 97 ms 76280 KB Output is correct
27 Correct 195 ms 143480 KB Output is correct
28 Correct 69 ms 54904 KB Output is correct
29 Correct 125 ms 91384 KB Output is correct
30 Correct 258 ms 196088 KB Output is correct
31 Correct 278 ms 195632 KB Output is correct
32 Correct 260 ms 196088 KB Output is correct
33 Correct 257 ms 196088 KB Output is correct
34 Correct 327 ms 196088 KB Output is correct
35 Correct 317 ms 196088 KB Output is correct
36 Correct 144 ms 117740 KB Output is correct
37 Correct 174 ms 142456 KB Output is correct
38 Correct 162 ms 129284 KB Output is correct
39 Correct 38 ms 27000 KB Output is correct
40 Incorrect 111 ms 92920 KB Output isn't correct
41 Halted 0 ms 0 KB -