oj.uz

Submission #692468

# Submission time Handle Problem Language Result Execution time Memory
692468 2023-02-01T13:28:31 Z saayan007 Visiting Singapore (NOI20_visitingsingapore) C++17
16 / 100
 221 ms 196080 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"

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

    ll k, n, m, a, b;
    cin >> k >> n >> m >> a >> 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, 1, n) {
        fur(j, 1, m) {
            dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
            if(s[i] == t[j]) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + v[s[i]]);
            }
        }
    }

    cout << dp[n][m] << nl;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 7 ms 6868 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 9 ms 8068 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19244 KB Output is correct
2 Correct 8 ms 7892 KB Output is correct
3 Correct 57 ms 64468 KB Output is correct
4 Correct 141 ms 156364 KB Output is correct
5 Correct 45 ms 45652 KB Output is correct
6 Correct 59 ms 66620 KB Output is correct
7 Correct 113 ms 124480 KB Output is correct
8 Correct 37 ms 40660 KB Output is correct
9 Correct 75 ms 79776 KB Output is correct
10 Correct 182 ms 195328 KB Output is correct
11 Correct 170 ms 194860 KB Output is correct
12 Correct 174 ms 196080 KB Output is correct
13 Correct 178 ms 195772 KB Output is correct
14 Correct 221 ms 195400 KB Output is correct
15 Correct 202 ms 195352 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19244 KB Output is correct
2 Correct 8 ms 7892 KB Output is correct
3 Correct 57 ms 64468 KB Output is correct
4 Correct 141 ms 156364 KB Output is correct
5 Correct 45 ms 45652 KB Output is correct
6 Correct 59 ms 66620 KB Output is correct
7 Correct 113 ms 124480 KB Output is correct
8 Correct 37 ms 40660 KB Output is correct
9 Correct 75 ms 79776 KB Output is correct
10 Correct 182 ms 195328 KB Output is correct
11 Correct 170 ms 194860 KB Output is correct
12 Correct 174 ms 196080 KB Output is correct
13 Correct 178 ms 195772 KB Output is correct
14 Correct 221 ms 195400 KB Output is correct
15 Correct 202 ms 195352 KB Output is correct
16 Incorrect 90 ms 101960 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19244 KB Output is correct
2 Correct 8 ms 7892 KB Output is correct
3 Correct 57 ms 64468 KB Output is correct
4 Correct 141 ms 156364 KB Output is correct
5 Correct 45 ms 45652 KB Output is correct
6 Correct 59 ms 66620 KB Output is correct
7 Correct 113 ms 124480 KB Output is correct
8 Correct 37 ms 40660 KB Output is correct
9 Correct 75 ms 79776 KB Output is correct
10 Correct 182 ms 195328 KB Output is correct
11 Correct 170 ms 194860 KB Output is correct
12 Correct 174 ms 196080 KB Output is correct
13 Correct 178 ms 195772 KB Output is correct
14 Correct 221 ms 195400 KB Output is correct
15 Correct 202 ms 195352 KB Output is correct
16 Incorrect 151 ms 162808 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 7 ms 6868 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 4 ms 3924 KB Output is correct
10 Correct 9 ms 8068 KB Output is correct
11 Incorrect 0 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -