oj.uz

답안 #545311

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
545311 2022-04-04T08:41:03 Z balbit Visiting Singapore (NOI20_visitingsingapore) C++14
100 / 100
 301 ms 836 KB 
#include <bits/stdc++.h>
#define int ll
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<ll, ll>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 5005+5;

ll V[maxn], S[maxn], T[maxn];
ll dp[2][2][maxn][2];

signed main(){
    IOS();
    int K,n,m,A,B;
    cin>>K>>n>>m>>A>>B;
//    assert(A == 0 && B == 0);

    REP1(i,K) cin>>V[i];
    REP1(i,n) cin>>S[i];
    REP1(i,m) cin>>T[i];

    REP(a,2)REP(b,maxn)REP(c,2) {
        dp[0][a][b][c] = -inf;
        if (a == 1 && c == 0) dp[0][a][b][c] = A + B * b;
    }

    dp[0][1][0][1] = 0;
    // calculate cost of not even visiting singapore
    ll re = (A + B*m);

    REP1(i,n) {
        int I = i%2;
        REP(a,2)REP(b,maxn)REP(c,2) dp[I][a][b][c] = -inf;
        dp[I][1][0][1] = 0;

        REP1(j, m) {
            if (T[j] == S[i]) {
                // take
                REP(f1, 2) REP(f2, 2)
                    MX(dp[I][1][j][1], V[S[i]] + dp[I^1][f1][j-1][f2]);
            }
            // sacrifice S
            REP(f2, 2) {
                MX(dp[I][0][j][f2], dp[I^1][1][j][f2] + A+B);
                MX(dp[I][0][j][f2], dp[I^1][0][j][f2] + 0+B);
            }

            // sacrifice T
            REP(f1, 2) {
                MX(dp[I][f1][j][0], dp[I][f1][j-1][1] + A + B);
                MX(dp[I][f1][j][0], dp[I][f1][j-1][0] + 0 + B);
            }
        }

        // extract dp[i][?][m][?]
        REP(f1,2)REP(f2,2) {
            MX(re, dp[I][f1][m][f2]);
        }
    }
    cout<<re<<endl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 16 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 8 ms 724 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 10 ms 664 KB Output is correct
10 Correct 16 ms 596 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 6 ms 664 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 9 ms 660 KB Output is correct
7 Correct 11 ms 596 KB Output is correct
8 Correct 12 ms 664 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 17 ms 596 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 656 KB Output is correct
2 Correct 26 ms 596 KB Output is correct
3 Correct 81 ms 672 KB Output is correct
4 Correct 156 ms 724 KB Output is correct
5 Correct 47 ms 596 KB Output is correct
6 Correct 70 ms 680 KB Output is correct
7 Correct 139 ms 708 KB Output is correct
8 Correct 60 ms 596 KB Output is correct
9 Correct 83 ms 700 KB Output is correct
10 Correct 188 ms 700 KB Output is correct
11 Correct 210 ms 700 KB Output is correct
12 Correct 192 ms 700 KB Output is correct
13 Correct 183 ms 700 KB Output is correct
14 Correct 291 ms 696 KB Output is correct
15 Correct 259 ms 704 KB Output is correct

Subtask #4
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 656 KB Output is correct
2 Correct 26 ms 596 KB Output is correct
3 Correct 81 ms 672 KB Output is correct
4 Correct 156 ms 724 KB Output is correct
5 Correct 47 ms 596 KB Output is correct
6 Correct 70 ms 680 KB Output is correct
7 Correct 139 ms 708 KB Output is correct
8 Correct 60 ms 596 KB Output is correct
9 Correct 83 ms 700 KB Output is correct
10 Correct 188 ms 700 KB Output is correct
11 Correct 210 ms 700 KB Output is correct
12 Correct 192 ms 700 KB Output is correct
13 Correct 183 ms 700 KB Output is correct
14 Correct 291 ms 696 KB Output is correct
15 Correct 259 ms 704 KB Output is correct
16 Correct 112 ms 716 KB Output is correct
17 Correct 140 ms 732 KB Output is correct
18 Correct 123 ms 724 KB Output is correct
19 Correct 26 ms 596 KB Output is correct
20 Correct 85 ms 596 KB Output is correct
21 Correct 13 ms 596 KB Output is correct
22 Correct 27 ms 688 KB Output is correct
23 Correct 49 ms 700 KB Output is correct
24 Correct 35 ms 700 KB Output is correct
25 Correct 185 ms 740 KB Output is correct
26 Correct 180 ms 836 KB Output is correct
27 Correct 194 ms 744 KB Output is correct
28 Correct 183 ms 724 KB Output is correct
29 Correct 267 ms 812 KB Output is correct
30 Correct 259 ms 724 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 656 KB Output is correct
2 Correct 26 ms 596 KB Output is correct
3 Correct 81 ms 672 KB Output is correct
4 Correct 156 ms 724 KB Output is correct
5 Correct 47 ms 596 KB Output is correct
6 Correct 70 ms 680 KB Output is correct
7 Correct 139 ms 708 KB Output is correct
8 Correct 60 ms 596 KB Output is correct
9 Correct 83 ms 700 KB Output is correct
10 Correct 188 ms 700 KB Output is correct
11 Correct 210 ms 700 KB Output is correct
12 Correct 192 ms 700 KB Output is correct
13 Correct 183 ms 700 KB Output is correct
14 Correct 291 ms 696 KB Output is correct
15 Correct 259 ms 704 KB Output is correct
16 Correct 170 ms 596 KB Output is correct
17 Correct 103 ms 680 KB Output is correct
18 Correct 27 ms 596 KB Output is correct
19 Correct 14 ms 668 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 7 ms 596 KB Output is correct
22 Correct 76 ms 684 KB Output is correct
23 Correct 23 ms 648 KB Output is correct
24 Correct 148 ms 696 KB Output is correct
25 Correct 181 ms 724 KB Output is correct
26 Correct 188 ms 716 KB Output is correct
27 Correct 194 ms 596 KB Output is correct
28 Correct 185 ms 724 KB Output is correct
29 Correct 278 ms 696 KB Output is correct
30 Correct 274 ms 732 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 1 ms 624 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct

Subtask #7
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 16 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 8 ms 724 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 5 ms 596 KB Output is correct
9 Correct 10 ms 664 KB Output is correct
10 Correct 16 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 6 ms 664 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 9 ms 660 KB Output is correct
17 Correct 11 ms 596 KB Output is correct
18 Correct 12 ms 664 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 17 ms 596 KB Output is correct
21 Correct 35 ms 656 KB Output is correct
22 Correct 26 ms 596 KB Output is correct
23 Correct 81 ms 672 KB Output is correct
24 Correct 156 ms 724 KB Output is correct
25 Correct 47 ms 596 KB Output is correct
26 Correct 70 ms 680 KB Output is correct
27 Correct 139 ms 708 KB Output is correct
28 Correct 60 ms 596 KB Output is correct
29 Correct 83 ms 700 KB Output is correct
30 Correct 188 ms 700 KB Output is correct
31 Correct 210 ms 700 KB Output is correct
32 Correct 192 ms 700 KB Output is correct
33 Correct 183 ms 700 KB Output is correct
34 Correct 291 ms 696 KB Output is correct
35 Correct 259 ms 704 KB Output is correct
36 Correct 112 ms 716 KB Output is correct
37 Correct 140 ms 732 KB Output is correct
38 Correct 123 ms 724 KB Output is correct
39 Correct 26 ms 596 KB Output is correct
40 Correct 85 ms 596 KB Output is correct
41 Correct 13 ms 596 KB Output is correct
42 Correct 27 ms 688 KB Output is correct
43 Correct 49 ms 700 KB Output is correct
44 Correct 35 ms 700 KB Output is correct
45 Correct 185 ms 740 KB Output is correct
46 Correct 180 ms 836 KB Output is correct
47 Correct 194 ms 744 KB Output is correct
48 Correct 183 ms 724 KB Output is correct
49 Correct 267 ms 812 KB Output is correct
50 Correct 259 ms 724 KB Output is correct
51 Correct 170 ms 596 KB Output is correct
52 Correct 103 ms 680 KB Output is correct
53 Correct 27 ms 596 KB Output is correct
54 Correct 14 ms 668 KB Output is correct
55 Correct 4 ms 596 KB Output is correct
56 Correct 7 ms 596 KB Output is correct
57 Correct 76 ms 684 KB Output is correct
58 Correct 23 ms 648 KB Output is correct
59 Correct 148 ms 696 KB Output is correct
60 Correct 181 ms 724 KB Output is correct
61 Correct 188 ms 716 KB Output is correct
62 Correct 194 ms 596 KB Output is correct
63 Correct 185 ms 724 KB Output is correct
64 Correct 278 ms 696 KB Output is correct
65 Correct 274 ms 732 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 1 ms 596 KB Output is correct
68 Correct 1 ms 596 KB Output is correct
69 Correct 1 ms 596 KB Output is correct
70 Correct 1 ms 596 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 596 KB Output is correct
73 Correct 1 ms 596 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 1 ms 596 KB Output is correct
76 Correct 2 ms 608 KB Output is correct
77 Correct 1 ms 624 KB Output is correct
78 Correct 1 ms 596 KB Output is correct
79 Correct 1 ms 596 KB Output is correct
80 Correct 1 ms 596 KB Output is correct
81 Correct 155 ms 744 KB Output is correct
82 Correct 47 ms 692 KB Output is correct
83 Correct 72 ms 596 KB Output is correct
84 Correct 41 ms 696 KB Output is correct
85 Correct 72 ms 724 KB Output is correct
86 Correct 68 ms 724 KB Output is correct
87 Correct 14 ms 596 KB Output is correct
88 Correct 13 ms 672 KB Output is correct
89 Correct 29 ms 596 KB Output is correct
90 Correct 219 ms 724 KB Output is correct
91 Correct 197 ms 736 KB Output is correct
92 Correct 182 ms 752 KB Output is correct
93 Correct 180 ms 744 KB Output is correct
94 Correct 209 ms 724 KB Output is correct
95 Correct 192 ms 724 KB Output is correct
96 Correct 195 ms 736 KB Output is correct
97 Correct 194 ms 736 KB Output is correct
98 Correct 301 ms 724 KB Output is correct
99 Correct 261 ms 724 KB Output is correct
100 Correct 285 ms 732 KB Output is correct