oj.uz

답안 #888962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888962 2023-12-18T13:21:46 Z vjudge1 Visiting Singapore (NOI20_visitingsingapore) C++17
29 / 100
 218 ms 216148 KB 
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

#define For(i, a, b) for(int i = (a); i < (b); ++i)
#define ForE(i, a, b) for(int i = (a); i <= (b); ++i)

int K, n, m, A, B;
int hpn[1005], events[5005], mission[5005];
int dp[5005][5005][2], nxt[5005][1005];

int cal(int val) {
    if (val == 0) return 0;
    return A + val * B;
}

void chkmax(int &val, int nval) {
    val = (val < nval ? nval : val);
}

void solve() {
    cin >> K >> n >> m >> A >> B;
    for (int i = 1; i <= K; ++i) cin >> hpn[i];
    for (int i = 1; i <= n; ++i) cin >> events[i];
    for (int i = 1; i <= m; ++i) cin >> mission[i];

    memset(nxt[m + 1], -1, sizeof nxt[0]);
    for (int i = m; i >= 1; --i) {
        for (int j = 1; j <= K; ++j) nxt[i][j] = nxt[i + 1][j];
        nxt[i][mission[i]] = i;
    }

    ForE(day, 0, n) ForE(i, 0, m) For(cont, 0, 2) {
        dp[day][i][cont] = INT_MIN;
    }
    ForE(day, 0, n) dp[day][0][1] = 0;

    For(day, 0, n) For(i, 0, m) For(cont, 0, 2) if (dp[day][i][cont] != INT_MIN) {
        int val = dp[day][i][cont];
        if (nxt[i + 1][events[day + 1]] != -1) {
            int ni = nxt[i + 1][events[day + 1]];
            chkmax(dp[day + 1][ni][1], val + hpn[events[day + 1]] + cal(ni - i - 1));
        }
        chkmax(dp[day + 1][i][0], val + (cont ? A + B : B));
    }

    int res = INT_MIN;
    ForE(day, 0, n) ForE(i, 0, m) For(cont, 0, 2) if (dp[day][i][cont] != INT_MIN) {
        chkmax(res, dp[day][i][cont] + cal(m - i));
    }
    cout << res << endl;
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 11 ms 43612 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 4 ms 37468 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 6 ms 35420 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 3 ms 23132 KB Output is correct
9 Correct 7 ms 37588 KB Output is correct
10 Correct 11 ms 45660 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 3 ms 19032 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 10844 KB Output is correct
6 Correct 7 ms 31324 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 9 ms 39644 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 11 ms 45660 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 111452 KB Output is correct
2 Correct 16 ms 103260 KB Output is correct
3 Correct 73 ms 162732 KB Output is correct
4 Correct 176 ms 197652 KB Output is correct
5 Correct 49 ms 76376 KB Output is correct
6 Correct 68 ms 111452 KB Output is correct
7 Correct 125 ms 201748 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 102 ms 131928 KB Output is correct
10 Correct 184 ms 215888 KB Output is correct
11 Correct 196 ms 215888 KB Output is correct
12 Correct 218 ms 216124 KB Output is correct
13 Correct 117 ms 215888 KB Output is correct
14 Correct 177 ms 216120 KB Output is correct
15 Correct 174 ms 215888 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 111452 KB Output is correct
2 Correct 16 ms 103260 KB Output is correct
3 Correct 73 ms 162732 KB Output is correct
4 Correct 176 ms 197652 KB Output is correct
5 Correct 49 ms 76376 KB Output is correct
6 Correct 68 ms 111452 KB Output is correct
7 Correct 125 ms 201748 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 102 ms 131928 KB Output is correct
10 Correct 184 ms 215888 KB Output is correct
11 Correct 196 ms 215888 KB Output is correct
12 Correct 218 ms 216124 KB Output is correct
13 Correct 117 ms 215888 KB Output is correct
14 Correct 177 ms 216120 KB Output is correct
15 Correct 174 ms 215888 KB Output is correct
16 Correct 132 ms 170968 KB Output is correct
17 Correct 129 ms 205648 KB Output is correct
18 Correct 114 ms 207900 KB Output is correct
19 Correct 30 ms 57948 KB Output is correct
20 Correct 89 ms 158544 KB Output is correct
21 Correct 10 ms 55900 KB Output is correct
22 Correct 37 ms 53852 KB Output is correct
23 Correct 61 ms 90716 KB Output is correct
24 Correct 27 ms 117624 KB Output is correct
25 Correct 205 ms 216044 KB Output is correct
26 Correct 206 ms 216112 KB Output is correct
27 Correct 197 ms 216120 KB Output is correct
28 Correct 141 ms 216120 KB Output is correct
29 Correct 182 ms 216148 KB Output is correct
30 Correct 171 ms 216124 KB Output is correct

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 111452 KB Output is correct
2 Correct 16 ms 103260 KB Output is correct
3 Correct 73 ms 162732 KB Output is correct
4 Correct 176 ms 197652 KB Output is correct
5 Correct 49 ms 76376 KB Output is correct
6 Correct 68 ms 111452 KB Output is correct
7 Correct 125 ms 201748 KB Output is correct
8 Correct 49 ms 146260 KB Output is correct
9 Correct 102 ms 131928 KB Output is correct
10 Correct 184 ms 215888 KB Output is correct
11 Correct 196 ms 215888 KB Output is correct
12 Correct 218 ms 216124 KB Output is correct
13 Correct 117 ms 215888 KB Output is correct
14 Correct 177 ms 216120 KB Output is correct
15 Correct 174 ms 215888 KB Output is correct
16 Incorrect 162 ms 212012 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 11 ms 43612 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 4 ms 37468 KB Output is correct
5 Correct 2 ms 16732 KB Output is correct
6 Correct 6 ms 35420 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 3 ms 23132 KB Output is correct
9 Correct 7 ms 37588 KB Output is correct
10 Correct 11 ms 45660 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 3 ms 19032 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 2 ms 10844 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 5 ms 27228 KB Output is correct
18 Correct 9 ms 39644 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 11 ms 45660 KB Output is correct
21 Correct 28 ms 111452 KB Output is correct
22 Correct 16 ms 103260 KB Output is correct
23 Correct 73 ms 162732 KB Output is correct
24 Correct 176 ms 197652 KB Output is correct
25 Correct 49 ms 76376 KB Output is correct
26 Correct 68 ms 111452 KB Output is correct
27 Correct 125 ms 201748 KB Output is correct
28 Correct 49 ms 146260 KB Output is correct
29 Correct 102 ms 131928 KB Output is correct
30 Correct 184 ms 215888 KB Output is correct
31 Correct 196 ms 215888 KB Output is correct
32 Correct 218 ms 216124 KB Output is correct
33 Correct 117 ms 215888 KB Output is correct
34 Correct 177 ms 216120 KB Output is correct
35 Correct 174 ms 215888 KB Output is correct
36 Correct 132 ms 170968 KB Output is correct
37 Correct 129 ms 205648 KB Output is correct
38 Correct 114 ms 207900 KB Output is correct
39 Correct 30 ms 57948 KB Output is correct
40 Correct 89 ms 158544 KB Output is correct
41 Correct 10 ms 55900 KB Output is correct
42 Correct 37 ms 53852 KB Output is correct
43 Correct 61 ms 90716 KB Output is correct
44 Correct 27 ms 117624 KB Output is correct
45 Correct 205 ms 216044 KB Output is correct
46 Correct 206 ms 216112 KB Output is correct
47 Correct 197 ms 216120 KB Output is correct
48 Correct 141 ms 216120 KB Output is correct
49 Correct 182 ms 216148 KB Output is correct
50 Correct 171 ms 216124 KB Output is correct
51 Incorrect 162 ms 212012 KB Output isn't correct
52 Halted 0 ms 0 KB -