oj.uz

Submission #708721

# Submission time Handle Problem Language Result Execution time Memory
708721 2023-03-12T08:42:37 Z PixelCat Two Dishes (JOI19_dishes) C++14
10 / 100
 32 ms 32048 KB 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

// const int MAXN = 1000010;
const int MAXN = 2010;

int a1[MAXN];
int s1[MAXN];
int p1[MAXN];
int pr1[MAXN];
int t1[MAXN];

int a2[MAXN];
int s2[MAXN];
int p2[MAXN];
int pr2[MAXN];
int t2[MAXN];

int su[MAXN][MAXN];
int dp[MAXN][MAXN];

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // NYA =^-w-^=
    int n, m; cin >> n >> m;
    assert(n <= MAXN);
    For(i, 1, n) {
        cin >> a1[i] >> s1[i] >> p1[i];
        pr1[i] = pr1[i - 1] + a1[i];
    }
    For(i, 1, m) {
        cin >> a2[i] >> s2[i] >> p2[i];
        pr2[i] = pr2[i - 1] + a2[i];
    }
    For(i, 1, n) {
        auto it = upper_bound(pr2, pr2 + m + 1, s1[i] - pr1[i]);
        t1[i] = it - pr2 - 1;
        // cout << i << " " << t1[i] << "\n";
        dp[i][0] = dp[i - 1][0] + (t1[i] >= 0);
    }
    For(i, 1, m) {
        auto it = upper_bound(pr1, pr1 + n + 1, s2[i] - pr2[i]);
        t2[i] = it - pr1 - 1;
        // cout << i << " " << t2[i] << "\n";
        dp[0][i] = dp[0][i - 1] + (t2[i] >= 0);
        // For(j, 0, t2[i]) {
        //     su[j][i]++;
        // }
    }
    For(i, 1, n) For(j, 1, m) {
        dp[i][j] = max(dp[i - 1][j] + (j <= t1[i]), dp[i][j - 1] + (i <= t2[j]));
    }
    cout << dp[n][m] << "\n";
    // For(i, 0, n) For(j, 1, m) su[i][j] += su[i][j - 1];
    // int ans = 0;
    // For(i, 1, n) if(t1[i] >= 0) {
    //     int add = 0;
    //     dp[i] = su[0][t1[i]];
    //     Forr(i2, i - 1, 1) {
    //         if(t1[i2] > t1[i]) add++;
    //         else {
    //             dp[i] = max(dp[i], dp[i - 1] + su[i2][t1[i]] - su[i2][t1[i2]] + add);
    //         }
    //     }
    //     ans = max(ans, dp[i] + su[i][m] - su[i][t1[i]]);
    // }
    // cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 28 ms 32000 KB Output is correct
18 Correct 29 ms 31960 KB Output is correct
19 Correct 30 ms 32048 KB Output is correct
20 Correct 28 ms 32032 KB Output is correct
21 Correct 27 ms 30764 KB Output is correct
22 Correct 32 ms 31896 KB Output is correct
23 Correct 32 ms 31880 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 28 ms 32000 KB Output is correct
18 Correct 29 ms 31960 KB Output is correct
19 Correct 30 ms 32048 KB Output is correct
20 Correct 28 ms 32032 KB Output is correct
21 Correct 27 ms 30764 KB Output is correct
22 Correct 32 ms 31896 KB Output is correct
23 Correct 32 ms 31880 KB Output is correct
24 Runtime error 2 ms 468 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 28 ms 32000 KB Output is correct
18 Correct 29 ms 31960 KB Output is correct
19 Correct 30 ms 32048 KB Output is correct
20 Correct 28 ms 32032 KB Output is correct
21 Correct 27 ms 30764 KB Output is correct
22 Correct 32 ms 31896 KB Output is correct
23 Correct 32 ms 31880 KB Output is correct
24 Runtime error 2 ms 468 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 28 ms 32000 KB Output is correct
18 Correct 29 ms 31960 KB Output is correct
19 Correct 30 ms 32048 KB Output is correct
20 Correct 28 ms 32032 KB Output is correct
21 Correct 27 ms 30764 KB Output is correct
22 Correct 32 ms 31896 KB Output is correct
23 Correct 32 ms 31880 KB Output is correct
24 Runtime error 2 ms 468 KB Execution killed with signal 6
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -