oj.uz

Submission #578379

# Submission time Handle Problem Language Result Execution time Memory
578379 2022-06-16T13:30:00 Z Johann Two Dishes (JOI19_dishes) C++14
0 / 100
 158 ms 23308 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int,int>
#define tiii tuple<int,int,int>
#define vi vector<int>
#define vpii vector<pii>
#define vtiii vector<tiii>
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()

const int MAXN = 1e6 + 7;
ll N,M;
ll A[MAXN],B[MAXN],S[MAXN],T[MAXN],P[MAXN],Q[MAXN];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> M;
    for (int i = 0; i < N; ++i) cin >> A[i] >> S[i] >> P[i];
    for (int i = 0; i < M; ++i) cin >> B[i] >> T[i] >> Q[i];

    ll sum = 0;
    ll ans = 0;
    ll points = 0;
    int a = 0, b = 0;
    while (a < N && sum <= S[a]) {
        sum += A[a];
        points += P[a];
        ++a;
    }
    ans = points;
    while (b < M) {
        if (sum + B[b] <= T[b]) {
            sum += B[b];
            points += Q[b];
            ++b;
            ans = max(ans, points);
        } else {
            if (a > 0) {
                --a;
                sum -= A[a];
                points -= P[a];
            } else {
                break;
            }
        }
    }
    cout << ans << "\n";
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 23244 KB Output is correct
2 Correct 146 ms 23308 KB Output is correct
3 Correct 147 ms 23132 KB Output is correct
4 Correct 158 ms 23284 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 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 Incorrect 1 ms 340 KB Output isn't correct
3 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 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 23244 KB Output is correct
2 Correct 146 ms 23308 KB Output is correct
3 Correct 147 ms 23132 KB Output is correct
4 Correct 158 ms 23284 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 23244 KB Output is correct
2 Correct 146 ms 23308 KB Output is correct
3 Correct 147 ms 23132 KB Output is correct
4 Correct 158 ms 23284 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -