oj.uz

답안 #889203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889203 2023-12-19T07:36:19 Z CDuong Visiting Singapore (NOI20_visitingsingapore) C++17
29 / 100
 835 ms 21332 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][2], nxt[5005][1005], lst[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;
    }

    auto get_new_day = [&]() -> void {
        ForE(i, 0, m) For(cont, 0, 2) For(gotA, 0, 2) {
            dp[1][i][cont][gotA] = INT_MIN;
        }
        dp[1][0][1][1] = 0;
    };

    int res = INT_MIN;
    auto getmax = [&]() -> void {
        ForE(i, 0, m) For(cont, 0, 2) For(gotA, 0, 2) if (dp[0][i][cont][gotA] != INT_MIN) {
            chkmax(res, dp[0][i][cont][gotA] + cal(m - i));
        }
    };

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

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

    // 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 4696 KB Output is correct
2 Correct 28 ms 7000 KB Output is correct
3 Correct 2 ms 4696 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 4560 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 15 ms 6748 KB Output is correct
10 Correct 29 ms 6812 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 8 ms 6748 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 4 ms 4696 KB Output is correct
6 Correct 15 ms 6744 KB Output is correct
7 Correct 15 ms 6748 KB Output is correct
8 Correct 20 ms 6608 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 33 ms 6996 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 6748 KB Output is correct
2 Correct 19 ms 4700 KB Output is correct
3 Correct 232 ms 12976 KB Output is correct
4 Correct 601 ms 21208 KB Output is correct
5 Correct 165 ms 19136 KB Output is correct
6 Correct 272 ms 17100 KB Output is correct
7 Correct 452 ms 16984 KB Output is correct
8 Correct 106 ms 8796 KB Output is correct
9 Correct 288 ms 17088 KB Output is correct
10 Correct 771 ms 21332 KB Output is correct
11 Correct 835 ms 21216 KB Output is correct
12 Correct 814 ms 21212 KB Output is correct
13 Correct 204 ms 21084 KB Output is correct
14 Correct 730 ms 21196 KB Output is correct
15 Correct 720 ms 21196 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 6748 KB Output is correct
2 Correct 19 ms 4700 KB Output is correct
3 Correct 232 ms 12976 KB Output is correct
4 Correct 601 ms 21208 KB Output is correct
5 Correct 165 ms 19136 KB Output is correct
6 Correct 272 ms 17100 KB Output is correct
7 Correct 452 ms 16984 KB Output is correct
8 Correct 106 ms 8796 KB Output is correct
9 Correct 288 ms 17088 KB Output is correct
10 Correct 771 ms 21332 KB Output is correct
11 Correct 835 ms 21216 KB Output is correct
12 Correct 814 ms 21212 KB Output is correct
13 Correct 204 ms 21084 KB Output is correct
14 Correct 730 ms 21196 KB Output is correct
15 Correct 720 ms 21196 KB Output is correct
16 Correct 401 ms 16984 KB Output is correct
17 Correct 475 ms 17100 KB Output is correct
18 Correct 415 ms 15040 KB Output is correct
19 Correct 61 ms 12892 KB Output is correct
20 Correct 284 ms 12980 KB Output is correct
21 Correct 12 ms 4764 KB Output is correct
22 Correct 65 ms 17080 KB Output is correct
23 Correct 182 ms 17080 KB Output is correct
24 Correct 39 ms 6748 KB Output is correct
25 Correct 781 ms 21216 KB Output is correct
26 Correct 786 ms 21216 KB Output is correct
27 Correct 772 ms 21228 KB Output is correct
28 Correct 202 ms 21080 KB Output is correct
29 Correct 682 ms 21328 KB Output is correct
30 Correct 697 ms 21196 KB Output is correct

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 6748 KB Output is correct
2 Correct 19 ms 4700 KB Output is correct
3 Correct 232 ms 12976 KB Output is correct
4 Correct 601 ms 21208 KB Output is correct
5 Correct 165 ms 19136 KB Output is correct
6 Correct 272 ms 17100 KB Output is correct
7 Correct 452 ms 16984 KB Output is correct
8 Correct 106 ms 8796 KB Output is correct
9 Correct 288 ms 17088 KB Output is correct
10 Correct 771 ms 21332 KB Output is correct
11 Correct 835 ms 21216 KB Output is correct
12 Correct 814 ms 21212 KB Output is correct
13 Correct 204 ms 21084 KB Output is correct
14 Correct 730 ms 21196 KB Output is correct
15 Correct 720 ms 21196 KB Output is correct
16 Correct 618 ms 21200 KB Output is correct
17 Correct 249 ms 12984 KB Output is correct
18 Correct 71 ms 12892 KB Output is correct
19 Incorrect 14 ms 6748 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4700 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 4696 KB Output is correct
2 Correct 28 ms 7000 KB Output is correct
3 Correct 2 ms 4696 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 4560 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 15 ms 6748 KB Output is correct
10 Correct 29 ms 6812 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 8 ms 6748 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 4 ms 4696 KB Output is correct
16 Correct 15 ms 6744 KB Output is correct
17 Correct 15 ms 6748 KB Output is correct
18 Correct 20 ms 6608 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 33 ms 6996 KB Output is correct
21 Correct 53 ms 6748 KB Output is correct
22 Correct 19 ms 4700 KB Output is correct
23 Correct 232 ms 12976 KB Output is correct
24 Correct 601 ms 21208 KB Output is correct
25 Correct 165 ms 19136 KB Output is correct
26 Correct 272 ms 17100 KB Output is correct
27 Correct 452 ms 16984 KB Output is correct
28 Correct 106 ms 8796 KB Output is correct
29 Correct 288 ms 17088 KB Output is correct
30 Correct 771 ms 21332 KB Output is correct
31 Correct 835 ms 21216 KB Output is correct
32 Correct 814 ms 21212 KB Output is correct
33 Correct 204 ms 21084 KB Output is correct
34 Correct 730 ms 21196 KB Output is correct
35 Correct 720 ms 21196 KB Output is correct
36 Correct 401 ms 16984 KB Output is correct
37 Correct 475 ms 17100 KB Output is correct
38 Correct 415 ms 15040 KB Output is correct
39 Correct 61 ms 12892 KB Output is correct
40 Correct 284 ms 12980 KB Output is correct
41 Correct 12 ms 4764 KB Output is correct
42 Correct 65 ms 17080 KB Output is correct
43 Correct 182 ms 17080 KB Output is correct
44 Correct 39 ms 6748 KB Output is correct
45 Correct 781 ms 21216 KB Output is correct
46 Correct 786 ms 21216 KB Output is correct
47 Correct 772 ms 21228 KB Output is correct
48 Correct 202 ms 21080 KB Output is correct
49 Correct 682 ms 21328 KB Output is correct
50 Correct 697 ms 21196 KB Output is correct
51 Correct 618 ms 21200 KB Output is correct
52 Correct 249 ms 12984 KB Output is correct
53 Correct 71 ms 12892 KB Output is correct
54 Incorrect 14 ms 6748 KB Output isn't correct
55 Halted 0 ms 0 KB -