oj.uz

Submission #563827

# Submission time Handle Problem Language Result Execution time Memory
563827 2022-05-18T07:20:54 Z maomao90 Two Dishes (JOI19_dishes) C++17
5 / 100
 549 ms 9736 KB 
// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 1000005;

int n, m;
ll a[MAXN], s[MAXN], p[MAXN];
ll b[MAXN], t[MAXN], q[MAXN];
ll ans;

int main() {
    cin >> n >> m;
    REP (i, 1, n + 1) {
        cin >> a[i] >> s[i] >> p[i];
    }
    ll sm = 0, res = 0;
    REP (i, 1, m + 1) {
        cin >> b[i] >> t[i] >> q[i];
        sm += b[i];
        res += q[i];
    }
    ans = 0;
    int j = m;
    ll gt = t[1];
    REP (i, 0, n + 1) {
        sm += a[i];
        res += p[i];
        cerr << i << ' ' << sm << ' ' << res << '\n';
        while (j > 0 && sm > gt) {
            sm -= b[j];
            res -= q[j--];
            cerr << ' ' << -(j + 1) << ' ' << sm << ' ' << res << '\n';
        }
        if (sm > gt) continue;
        mxto(ans, res);
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 9696 KB Output is correct
2 Correct 549 ms 9544 KB Output is correct
3 Correct 518 ms 9724 KB Output is correct
4 Correct 535 ms 9504 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 526 ms 9204 KB Output is correct
7 Correct 250 ms 4924 KB Output is correct
8 Correct 253 ms 4944 KB Output is correct
9 Correct 497 ms 9700 KB Output is correct
10 Correct 304 ms 9736 KB Output is correct
11 Correct 314 ms 9668 KB Output is correct

Subtask #2
0 / 3.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
0 / 7.0

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

Subtask #4
0 / 39.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 9696 KB Output is correct
2 Correct 549 ms 9544 KB Output is correct
3 Correct 518 ms 9724 KB Output is correct
4 Correct 535 ms 9504 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 526 ms 9204 KB Output is correct
7 Correct 250 ms 4924 KB Output is correct
8 Correct 253 ms 4944 KB Output is correct
9 Correct 497 ms 9700 KB Output is correct
10 Correct 304 ms 9736 KB Output is correct
11 Correct 314 ms 9668 KB Output is correct
12 Incorrect 0 ms 340 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 501 ms 9696 KB Output is correct
2 Correct 549 ms 9544 KB Output is correct
3 Correct 518 ms 9724 KB Output is correct
4 Correct 535 ms 9504 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 526 ms 9204 KB Output is correct
7 Correct 250 ms 4924 KB Output is correct
8 Correct 253 ms 4944 KB Output is correct
9 Correct 497 ms 9700 KB Output is correct
10 Correct 304 ms 9736 KB Output is correct
11 Correct 314 ms 9668 KB Output is correct
12 Incorrect 0 ms 340 KB Output isn't correct
13 Halted 0 ms 0 KB -