oj.uz

답안 #692903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
692903 2023-02-02T07:07:06 Z saayan007 Visiting Singapore (NOI20_visitingsingapore) C++17
16 / 100
 178 ms 195840 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

#define fur(i, a, b) for(ll i = a; i <= (ll) b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll) b; --i)
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define nl "\n"

const ll inf = 1e15L;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll k, n, m, a, b;
    cin >> k >> n >> m >> a >> b;
    a = -a;
    b = -b;

    ll v[k + 1], s[n + 1], t[m + 1];

    fur(i, 1, k) {
        cin >> v[i];
    }
    fur(i, 1, n) {
        cin >> s[i];
    }
    fur(i, 1, m) {
        cin >> t[i];
    }

    ll dp[n + 1][m + 1];
    fur(i, 0, n)
        fur(j, 0, m)
            dp[i][j] = 0;

    dp[0][0] = 0;
    fur(i, 1, n) {
        fur(j, 1, m) {
            if(s[i] == t[j]) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + v[t[j]]);
            }
            dp[i][j] = max({dp[i][j], dp[i - 1][j], dp[i][j - 1]});
        }
    }
    cout << dp[n][m] << nl;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 6 ms 6868 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 2 ms 2116 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 828 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 8 ms 8176 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19156 KB Output is correct
2 Correct 8 ms 7884 KB Output is correct
3 Correct 58 ms 64556 KB Output is correct
4 Correct 154 ms 156364 KB Output is correct
5 Correct 42 ms 45652 KB Output is correct
6 Correct 59 ms 66600 KB Output is correct
7 Correct 112 ms 124468 KB Output is correct
8 Correct 38 ms 40660 KB Output is correct
9 Correct 73 ms 79744 KB Output is correct
10 Correct 175 ms 195320 KB Output is correct
11 Correct 173 ms 194768 KB Output is correct
12 Correct 178 ms 195840 KB Output is correct
13 Correct 174 ms 195788 KB Output is correct
14 Correct 172 ms 195424 KB Output is correct
15 Correct 177 ms 195268 KB Output is correct

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19156 KB Output is correct
2 Correct 8 ms 7884 KB Output is correct
3 Correct 58 ms 64556 KB Output is correct
4 Correct 154 ms 156364 KB Output is correct
5 Correct 42 ms 45652 KB Output is correct
6 Correct 59 ms 66600 KB Output is correct
7 Correct 112 ms 124468 KB Output is correct
8 Correct 38 ms 40660 KB Output is correct
9 Correct 73 ms 79744 KB Output is correct
10 Correct 175 ms 195320 KB Output is correct
11 Correct 173 ms 194768 KB Output is correct
12 Correct 178 ms 195840 KB Output is correct
13 Correct 174 ms 195788 KB Output is correct
14 Correct 172 ms 195424 KB Output is correct
15 Correct 177 ms 195268 KB Output is correct
16 Incorrect 93 ms 101992 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 19156 KB Output is correct
2 Correct 8 ms 7884 KB Output is correct
3 Correct 58 ms 64556 KB Output is correct
4 Correct 154 ms 156364 KB Output is correct
5 Correct 42 ms 45652 KB Output is correct
6 Correct 59 ms 66600 KB Output is correct
7 Correct 112 ms 124468 KB Output is correct
8 Correct 38 ms 40660 KB Output is correct
9 Correct 73 ms 79744 KB Output is correct
10 Correct 175 ms 195320 KB Output is correct
11 Correct 173 ms 194768 KB Output is correct
12 Correct 178 ms 195840 KB Output is correct
13 Correct 174 ms 195788 KB Output is correct
14 Correct 172 ms 195424 KB Output is correct
15 Correct 177 ms 195268 KB Output is correct
16 Incorrect 154 ms 162920 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 6 ms 6868 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 2 ms 2116 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 828 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 8 ms 8176 KB Output is correct
11 Incorrect 1 ms 316 KB Output isn't correct
12 Halted 0 ms 0 KB -