oj.uz

Submission #375839

# Submission time Handle Problem Language Result Execution time Memory
375839 2021-03-10T04:21:41 Z 2qbingxuan Two Dishes (JOI19_dishes) C++14
65 / 100
 396 ms 46676 KB 
#include <bits/stdc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\n")));
}
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local

using namespace std;
const int maxn = 200025;
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

struct Item {
    int t;
    int64_t ed;
    int val;
} v[maxn], u[maxn];
int64_t sumv[maxn], sumu[maxn];
int posv[maxn], posu[maxn];
int64_t dp[maxn], dif[maxn], lim[maxn];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> v[i].t >> v[i].ed >> v[i].val;
    for (int i = 1; i <= m; i++)
        cin >> u[i].t >> u[i].ed >> u[i].val;

    for (int i = 1; i <= n; i++)
        sumv[i] = sumv[i-1] + v[i].t;
    for (int i = 1; i <= m; i++)
        sumu[i] = sumu[i-1] + u[i].t;

    for (int i = 1; i <= n; i++)
        posv[i] = upper_bound(sumu, sumu+m+1, v[i].ed - sumv[i]) - sumu - 1;
    for (int i = 1; i <= m; i++)
        posu[i] = upper_bound(sumv, sumv+n+1, u[i].ed - sumu[i]) - sumv - 1;

    for (int j = 1; j <= m; j++) dp[j] = dp[j-1] + (posu[j] >= 0 ? u[j].val : 0);
    for (int j = 1; j <= m; j++) lim[j] = dif[j] = (posu[j] >= 0 ? u[j].val : 0);

    /*
    cerr << "posu:\t";
    cerr << 0 << ' ';
    for (int i = 1; i <= m; i++) cerr << posu[i] << ' ';
    cerr << '\n';
    cerr << "u.val:\t";
    cerr << 0 << ' ';
    for (int i = 1; i <= m; i++) cerr << u[i].val << ' ';
    cerr << '\n';
    */

    set<int> st;
    min_heap<pair<int,int>> pq;
    for (int j = 1; j <= m; j++) if (posu[j] >= 0) pq.emplace(posu[j], j);

    function<void(int,int,int64_t)> update = [&](int i, int j, int64_t val) {
        if (val == 0 || j == m+1) return;
        if (dif[j] - val <= lim[j]) {
            int64_t c = lim[j] - (dif[j] - val);
            dif[j] = lim[j];
            st.erase(j);
            auto it = st.lower_bound(j);
            if (it != st.end())
                update(i, *it, c);
        } else {
            dif[j] -= val;
        }
        // int64_t c = max<int64_t>(0, (j != 0 && i <= posu[j] ? u[j].val : 0) - dif[j]);
    };
    for (int i = 1; i <= n; i++) {
        while (!pq.empty() && i > pq.top().first) {
            int j = pq.top().second;
            pq.pop();
            lim[j] = 0;
            if (dif[j] > lim[j])
                st.insert(j);
        }

        dif[0] += v[i].val;
        update(i, posv[i]+1, v[i].val);


        /*
        for (int j = 0; j <= posv[i]; j++) dp[j] += v[i].val;
        for (int j = 1; j <= m; j++) dp[j] = max(dp[j], dp[j-1] + (i <= posu[j] ? u[j].val : 0));

        cerr << posv[i] << ';' << v[i].val << ";\t";
        for (int j = 0; j <= m; j++) cerr << (dp[j] - (j ? dp[j-1] : 0)) << ' ';
        cerr << '\n';
        */
    }
    debug(dp[m]);
    int64_t sum = 0;
    for (int i = 0; i <= m; i++) sum += dif[i];
    cout << sum << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 28856 KB Output is correct
2 Correct 241 ms 21096 KB Output is correct
3 Correct 194 ms 21352 KB Output is correct
4 Correct 240 ms 25576 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 250 ms 20584 KB Output is correct
7 Correct 96 ms 14312 KB Output is correct
8 Correct 92 ms 7404 KB Output is correct
9 Correct 199 ms 21352 KB Output is correct
10 Correct 205 ms 21480 KB Output is correct
11 Correct 159 ms 21448 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 3 ms 620 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 3 ms 620 KB Output is correct
23 Correct 3 ms 620 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 3 ms 620 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 3 ms 620 KB Output is correct
23 Correct 3 ms 620 KB Output is correct
24 Correct 169 ms 20332 KB Output is correct
25 Correct 229 ms 30820 KB Output is correct
26 Correct 177 ms 20972 KB Output is correct
27 Correct 234 ms 30840 KB Output is correct
28 Correct 218 ms 21992 KB Output is correct
29 Correct 169 ms 22120 KB Output is correct
30 Correct 350 ms 22120 KB Output is correct
31 Correct 118 ms 18696 KB Output is correct
32 Correct 89 ms 7688 KB Output is correct
33 Correct 255 ms 20880 KB Output is correct
34 Correct 326 ms 25060 KB Output is correct
35 Correct 304 ms 21608 KB Output is correct
36 Correct 301 ms 21736 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 3 ms 620 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 3 ms 620 KB Output is correct
23 Correct 3 ms 620 KB Output is correct
24 Correct 169 ms 20332 KB Output is correct
25 Correct 229 ms 30820 KB Output is correct
26 Correct 177 ms 20972 KB Output is correct
27 Correct 234 ms 30840 KB Output is correct
28 Correct 218 ms 21992 KB Output is correct
29 Correct 169 ms 22120 KB Output is correct
30 Correct 350 ms 22120 KB Output is correct
31 Correct 118 ms 18696 KB Output is correct
32 Correct 89 ms 7688 KB Output is correct
33 Correct 255 ms 20880 KB Output is correct
34 Correct 326 ms 25060 KB Output is correct
35 Correct 304 ms 21608 KB Output is correct
36 Correct 301 ms 21736 KB Output is correct
37 Correct 235 ms 21232 KB Output is correct
38 Correct 286 ms 30948 KB Output is correct
39 Correct 327 ms 46676 KB Output is correct
40 Correct 221 ms 22424 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 396 ms 22340 KB Output is correct
43 Correct 298 ms 20972 KB Output is correct
44 Correct 359 ms 24804 KB Output is correct
45 Correct 351 ms 21736 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 3 ms 620 KB Output is correct
20 Correct 3 ms 620 KB Output is correct
21 Correct 3 ms 620 KB Output is correct
22 Correct 3 ms 620 KB Output is correct
23 Correct 3 ms 620 KB Output is correct
24 Correct 169 ms 20332 KB Output is correct
25 Correct 229 ms 30820 KB Output is correct
26 Correct 177 ms 20972 KB Output is correct
27 Correct 234 ms 30840 KB Output is correct
28 Correct 218 ms 21992 KB Output is correct
29 Correct 169 ms 22120 KB Output is correct
30 Correct 350 ms 22120 KB Output is correct
31 Correct 118 ms 18696 KB Output is correct
32 Correct 89 ms 7688 KB Output is correct
33 Correct 255 ms 20880 KB Output is correct
34 Correct 326 ms 25060 KB Output is correct
35 Correct 304 ms 21608 KB Output is correct
36 Correct 301 ms 21736 KB Output is correct
37 Correct 235 ms 21232 KB Output is correct
38 Correct 286 ms 30948 KB Output is correct
39 Correct 327 ms 46676 KB Output is correct
40 Correct 221 ms 22424 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 396 ms 22340 KB Output is correct
43 Correct 298 ms 20972 KB Output is correct
44 Correct 359 ms 24804 KB Output is correct
45 Correct 351 ms 21736 KB Output is correct
46 Runtime error 100 ms 10220 KB Execution killed with signal 11
47 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 28856 KB Output is correct
2 Correct 241 ms 21096 KB Output is correct
3 Correct 194 ms 21352 KB Output is correct
4 Correct 240 ms 25576 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 250 ms 20584 KB Output is correct
7 Correct 96 ms 14312 KB Output is correct
8 Correct 92 ms 7404 KB Output is correct
9 Correct 199 ms 21352 KB Output is correct
10 Correct 205 ms 21480 KB Output is correct
11 Correct 159 ms 21448 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 620 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 3 ms 620 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 3 ms 620 KB Output is correct
33 Correct 3 ms 620 KB Output is correct
34 Correct 3 ms 620 KB Output is correct
35 Correct 169 ms 20332 KB Output is correct
36 Correct 229 ms 30820 KB Output is correct
37 Correct 177 ms 20972 KB Output is correct
38 Correct 234 ms 30840 KB Output is correct
39 Correct 218 ms 21992 KB Output is correct
40 Correct 169 ms 22120 KB Output is correct
41 Correct 350 ms 22120 KB Output is correct
42 Correct 118 ms 18696 KB Output is correct
43 Correct 89 ms 7688 KB Output is correct
44 Correct 255 ms 20880 KB Output is correct
45 Correct 326 ms 25060 KB Output is correct
46 Correct 304 ms 21608 KB Output is correct
47 Correct 301 ms 21736 KB Output is correct
48 Correct 235 ms 21232 KB Output is correct
49 Correct 286 ms 30948 KB Output is correct
50 Correct 327 ms 46676 KB Output is correct
51 Correct 221 ms 22424 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 396 ms 22340 KB Output is correct
54 Correct 298 ms 20972 KB Output is correct
55 Correct 359 ms 24804 KB Output is correct
56 Correct 351 ms 21736 KB Output is correct
57 Correct 215 ms 20548 KB Output is correct
58 Incorrect 232 ms 21464 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 28856 KB Output is correct
2 Correct 241 ms 21096 KB Output is correct
3 Correct 194 ms 21352 KB Output is correct
4 Correct 240 ms 25576 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 250 ms 20584 KB Output is correct
7 Correct 96 ms 14312 KB Output is correct
8 Correct 92 ms 7404 KB Output is correct
9 Correct 199 ms 21352 KB Output is correct
10 Correct 205 ms 21480 KB Output is correct
11 Correct 159 ms 21448 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 620 KB Output is correct
29 Correct 4 ms 748 KB Output is correct
30 Correct 3 ms 620 KB Output is correct
31 Correct 3 ms 620 KB Output is correct
32 Correct 3 ms 620 KB Output is correct
33 Correct 3 ms 620 KB Output is correct
34 Correct 3 ms 620 KB Output is correct
35 Correct 169 ms 20332 KB Output is correct
36 Correct 229 ms 30820 KB Output is correct
37 Correct 177 ms 20972 KB Output is correct
38 Correct 234 ms 30840 KB Output is correct
39 Correct 218 ms 21992 KB Output is correct
40 Correct 169 ms 22120 KB Output is correct
41 Correct 350 ms 22120 KB Output is correct
42 Correct 118 ms 18696 KB Output is correct
43 Correct 89 ms 7688 KB Output is correct
44 Correct 255 ms 20880 KB Output is correct
45 Correct 326 ms 25060 KB Output is correct
46 Correct 304 ms 21608 KB Output is correct
47 Correct 301 ms 21736 KB Output is correct
48 Correct 235 ms 21232 KB Output is correct
49 Correct 286 ms 30948 KB Output is correct
50 Correct 327 ms 46676 KB Output is correct
51 Correct 221 ms 22424 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 396 ms 22340 KB Output is correct
54 Correct 298 ms 20972 KB Output is correct
55 Correct 359 ms 24804 KB Output is correct
56 Correct 351 ms 21736 KB Output is correct
57 Runtime error 100 ms 10220 KB Execution killed with signal 11
58 Halted 0 ms 0 KB -