oj.uz

Submission #963893

# Submission time Handle Problem Language Result Execution time Memory
963893 2024-04-16T02:02:48 Z Tuanlinh123 Two Dishes (JOI19_dishes) C++17
10 / 100
 30 ms 31836 KB 
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
#define sz(a) ((ll)(a).size())
using namespace std;

const ll maxn=2005, inf=1e18;
ll a[maxn], s[maxn], p[maxn], b[maxn], t[maxn], q[maxn];
ll dp[maxn][maxn];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, m; cin >> n >> m;
    if (n>2000) exit(0);
    for (ll i=1; i<=n; i++) cin >> a[i] >> s[i] >> p[i], a[i]+=a[i-1];
    for (ll i=1; i<=m; i++) cin >> b[i] >> t[i] >> q[i], b[i]+=b[i-1];
    for (ll i=0; i<=n; i++)
        for (ll j=0; j<=m; j++)
            dp[i][j]=-inf;
    for (ll i=0; i<=n; i++) for (ll j=0; j<=m; j++)
    {
        if (i==0 && j==0) dp[i][j]=0;
        if (i) dp[i][j]=max(dp[i][j], dp[i-1][j]+(a[i]+b[j]<=s[i]?p[i]:0));
        if (j) dp[i][j]=max(dp[i][j], dp[i][j-1]+(a[i]+b[j]<=t[j]?q[j]:0));
    }
    cout << dp[n][m];
}

Subtask #1
0 / 5.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 460 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 460 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 30 ms 31836 KB Output is correct
18 Correct 23 ms 31832 KB Output is correct
19 Correct 25 ms 31836 KB Output is correct
20 Correct 24 ms 31836 KB Output is correct
21 Correct 24 ms 30692 KB Output is correct
22 Correct 24 ms 31836 KB Output is correct
23 Correct 25 ms 31836 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 460 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 30 ms 31836 KB Output is correct
18 Correct 23 ms 31832 KB Output is correct
19 Correct 25 ms 31836 KB Output is correct
20 Correct 24 ms 31836 KB Output is correct
21 Correct 24 ms 30692 KB Output is correct
22 Correct 24 ms 31836 KB Output is correct
23 Correct 25 ms 31836 KB Output is correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 460 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 30 ms 31836 KB Output is correct
18 Correct 23 ms 31832 KB Output is correct
19 Correct 25 ms 31836 KB Output is correct
20 Correct 24 ms 31836 KB Output is correct
21 Correct 24 ms 30692 KB Output is correct
22 Correct 24 ms 31836 KB Output is correct
23 Correct 25 ms 31836 KB Output is correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 460 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 30 ms 31836 KB Output is correct
18 Correct 23 ms 31832 KB Output is correct
19 Correct 25 ms 31836 KB Output is correct
20 Correct 24 ms 31836 KB Output is correct
21 Correct 24 ms 30692 KB Output is correct
22 Correct 24 ms 31836 KB Output is correct
23 Correct 25 ms 31836 KB Output is correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

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

Subtask #8
0 / 9.0

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