oj.uz

Submission #435806

# Submission time Handle Problem Language Result Execution time Memory
435806 2021-06-23T18:15:27 Z 2qbingxuan Two Dishes (JOI19_dishes) C++17
100 / 100
 2769 ms 317432 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 = 1000025;
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;
    /*
    // int T = time(0); debug(T);
    int T = 1624472002;
    srand(T);
    // srand(2300);
    for (int i = 1; i <= n; i++)
        v[i].t = rand() % 10000, v[i].ed = rand() % (10000 * i), v[i].val = rand() % 101 - 50;
    for (int i = 1; i <= m; i++)
        u[i].t = rand() % 10000, u[i].ed = rand() % (10000 * i), u[i].val = rand() % 101 - 50;
    */
 
    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);
    // for (int j = 1; j <= m; j++) debug(j, posu[j], u[j].val);
 
    function<void(int,int,int64_t)> update = [&](int i, int j, int64_t val) {
        if (j == m+1) return;
        dif[j] -= val;
        // debug(i, j, val);
        if (dif[j] <= lim[j]) {
            int64_t c = lim[j] - dif[j];
            dif[j] = lim[j];
            st.erase(j);
            auto it = st.lower_bound(j);
            if (it != st.end() && c)
                update(i, *it, c);
        } else {
            st.insert(j);
        }
        // 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++) {
        vector<int> tmp;
        while (!pq.empty() && i > pq.top().first) {
            int j = -pq.top().second;
            pq.pop();
            lim[j] = 0;
            if (dif[j] > lim[j]) {
                // debug(j, "ins");
                st.insert(j);
            } else {
                tmp.push_back(j);
            }
        }
        if (posv[i] >= 0)
            dif[0] += v[i].val, update(i, posv[i]+1, v[i].val);
        for (int j: tmp)
            update(i, j, 0);
 
        /*
        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));
            // for (int j = 0; j <= m; j++) cerr << (dp[j] - (j ? dp[j-1] : 0)) << ' ';
            // cerr << '\n';
        }
 
        cerr << posv[i] << ';' << v[i].val << ";\n";
        for (int j = 0; j <= m; j++) cerr << (dp[j] - (j ? dp[j-1] : 0)) << ' ';
        cerr << '\n';
        for (int j = 0; j <= m; j++) cerr << dif[j] << ' ';
        cerr << '\n';
        for (int j = 0; j <= m; j++) cerr << lim[j] << ' ';
        cerr << '\n';
        for (int j = 0; j <= m; j++)
            cerr << (i<=posu[j]?u[j].val:0)<<' ';
        cerr<<'\n';
        for (int j = 0; j <= m; j++) assert (dif[j] == dp[j] - (j ? dp[j-1] : 0));
        */
    }
    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 316 ms 28820 KB Output is correct
2 Correct 266 ms 21148 KB Output is correct
3 Correct 219 ms 21276 KB Output is correct
4 Correct 284 ms 25512 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 333 ms 20496 KB Output is correct
7 Correct 120 ms 14276 KB Output is correct
8 Correct 99 ms 7364 KB Output is correct
9 Correct 243 ms 21228 KB Output is correct
10 Correct 235 ms 21348 KB Output is correct
11 Correct 157 ms 21332 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 189 ms 20264 KB Output is correct
25 Correct 309 ms 30112 KB Output is correct
26 Correct 227 ms 20280 KB Output is correct
27 Correct 266 ms 30104 KB Output is correct
28 Correct 246 ms 21252 KB Output is correct
29 Correct 208 ms 21324 KB Output is correct
30 Correct 385 ms 21312 KB Output is correct
31 Correct 128 ms 18296 KB Output is correct
32 Correct 96 ms 7304 KB Output is correct
33 Correct 309 ms 20160 KB Output is correct
34 Correct 381 ms 24180 KB Output is correct
35 Correct 336 ms 21312 KB Output is correct
36 Correct 378 ms 21264 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 189 ms 20264 KB Output is correct
25 Correct 309 ms 30112 KB Output is correct
26 Correct 227 ms 20280 KB Output is correct
27 Correct 266 ms 30104 KB Output is correct
28 Correct 246 ms 21252 KB Output is correct
29 Correct 208 ms 21324 KB Output is correct
30 Correct 385 ms 21312 KB Output is correct
31 Correct 128 ms 18296 KB Output is correct
32 Correct 96 ms 7304 KB Output is correct
33 Correct 309 ms 20160 KB Output is correct
34 Correct 381 ms 24180 KB Output is correct
35 Correct 336 ms 21312 KB Output is correct
36 Correct 378 ms 21264 KB Output is correct
37 Correct 222 ms 20348 KB Output is correct
38 Correct 318 ms 30020 KB Output is correct
39 Correct 356 ms 51936 KB Output is correct
40 Correct 229 ms 21264 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 460 ms 21304 KB Output is correct
43 Correct 318 ms 20100 KB Output is correct
44 Correct 424 ms 23896 KB Output is correct
45 Correct 399 ms 21320 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 4 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 189 ms 20264 KB Output is correct
25 Correct 309 ms 30112 KB Output is correct
26 Correct 227 ms 20280 KB Output is correct
27 Correct 266 ms 30104 KB Output is correct
28 Correct 246 ms 21252 KB Output is correct
29 Correct 208 ms 21324 KB Output is correct
30 Correct 385 ms 21312 KB Output is correct
31 Correct 128 ms 18296 KB Output is correct
32 Correct 96 ms 7304 KB Output is correct
33 Correct 309 ms 20160 KB Output is correct
34 Correct 381 ms 24180 KB Output is correct
35 Correct 336 ms 21312 KB Output is correct
36 Correct 378 ms 21264 KB Output is correct
37 Correct 222 ms 20348 KB Output is correct
38 Correct 318 ms 30020 KB Output is correct
39 Correct 356 ms 51936 KB Output is correct
40 Correct 229 ms 21264 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 460 ms 21304 KB Output is correct
43 Correct 318 ms 20100 KB Output is correct
44 Correct 424 ms 23896 KB Output is correct
45 Correct 399 ms 21320 KB Output is correct
46 Correct 1206 ms 98424 KB Output is correct
47 Correct 1602 ms 148984 KB Output is correct
48 Correct 2008 ms 258312 KB Output is correct
49 Correct 1290 ms 102580 KB Output is correct
50 Correct 2769 ms 102580 KB Output is correct
51 Correct 1773 ms 96172 KB Output is correct
52 Correct 2500 ms 113944 KB Output is correct
53 Correct 2630 ms 102472 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 28820 KB Output is correct
2 Correct 266 ms 21148 KB Output is correct
3 Correct 219 ms 21276 KB Output is correct
4 Correct 284 ms 25512 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 333 ms 20496 KB Output is correct
7 Correct 120 ms 14276 KB Output is correct
8 Correct 99 ms 7364 KB Output is correct
9 Correct 243 ms 21228 KB Output is correct
10 Correct 235 ms 21348 KB Output is correct
11 Correct 157 ms 21332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 4 ms 588 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 189 ms 20264 KB Output is correct
36 Correct 309 ms 30112 KB Output is correct
37 Correct 227 ms 20280 KB Output is correct
38 Correct 266 ms 30104 KB Output is correct
39 Correct 246 ms 21252 KB Output is correct
40 Correct 208 ms 21324 KB Output is correct
41 Correct 385 ms 21312 KB Output is correct
42 Correct 128 ms 18296 KB Output is correct
43 Correct 96 ms 7304 KB Output is correct
44 Correct 309 ms 20160 KB Output is correct
45 Correct 381 ms 24180 KB Output is correct
46 Correct 336 ms 21312 KB Output is correct
47 Correct 378 ms 21264 KB Output is correct
48 Correct 222 ms 20348 KB Output is correct
49 Correct 318 ms 30020 KB Output is correct
50 Correct 356 ms 51936 KB Output is correct
51 Correct 229 ms 21264 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 460 ms 21304 KB Output is correct
54 Correct 318 ms 20100 KB Output is correct
55 Correct 424 ms 23896 KB Output is correct
56 Correct 399 ms 21320 KB Output is correct
57 Correct 290 ms 29224 KB Output is correct
58 Correct 241 ms 21344 KB Output is correct
59 Correct 235 ms 21320 KB Output is correct
60 Correct 399 ms 63932 KB Output is correct
61 Correct 312 ms 31968 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 427 ms 35164 KB Output is correct
64 Correct 314 ms 33220 KB Output is correct
65 Correct 383 ms 34884 KB Output is correct
66 Correct 365 ms 28784 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 28820 KB Output is correct
2 Correct 266 ms 21148 KB Output is correct
3 Correct 219 ms 21276 KB Output is correct
4 Correct 284 ms 25512 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 333 ms 20496 KB Output is correct
7 Correct 120 ms 14276 KB Output is correct
8 Correct 99 ms 7364 KB Output is correct
9 Correct 243 ms 21228 KB Output is correct
10 Correct 235 ms 21348 KB Output is correct
11 Correct 157 ms 21332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 4 ms 588 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 4 ms 460 KB Output is correct
32 Correct 4 ms 588 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 189 ms 20264 KB Output is correct
36 Correct 309 ms 30112 KB Output is correct
37 Correct 227 ms 20280 KB Output is correct
38 Correct 266 ms 30104 KB Output is correct
39 Correct 246 ms 21252 KB Output is correct
40 Correct 208 ms 21324 KB Output is correct
41 Correct 385 ms 21312 KB Output is correct
42 Correct 128 ms 18296 KB Output is correct
43 Correct 96 ms 7304 KB Output is correct
44 Correct 309 ms 20160 KB Output is correct
45 Correct 381 ms 24180 KB Output is correct
46 Correct 336 ms 21312 KB Output is correct
47 Correct 378 ms 21264 KB Output is correct
48 Correct 222 ms 20348 KB Output is correct
49 Correct 318 ms 30020 KB Output is correct
50 Correct 356 ms 51936 KB Output is correct
51 Correct 229 ms 21264 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 460 ms 21304 KB Output is correct
54 Correct 318 ms 20100 KB Output is correct
55 Correct 424 ms 23896 KB Output is correct
56 Correct 399 ms 21320 KB Output is correct
57 Correct 1206 ms 98424 KB Output is correct
58 Correct 1602 ms 148984 KB Output is correct
59 Correct 2008 ms 258312 KB Output is correct
60 Correct 1290 ms 102580 KB Output is correct
61 Correct 2769 ms 102580 KB Output is correct
62 Correct 1773 ms 96172 KB Output is correct
63 Correct 2500 ms 113944 KB Output is correct
64 Correct 2630 ms 102472 KB Output is correct
65 Correct 290 ms 29224 KB Output is correct
66 Correct 241 ms 21344 KB Output is correct
67 Correct 235 ms 21320 KB Output is correct
68 Correct 399 ms 63932 KB Output is correct
69 Correct 312 ms 31968 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 427 ms 35164 KB Output is correct
72 Correct 314 ms 33220 KB Output is correct
73 Correct 383 ms 34884 KB Output is correct
74 Correct 365 ms 28784 KB Output is correct
75 Correct 1443 ms 216980 KB Output is correct
76 Correct 1268 ms 174300 KB Output is correct
77 Correct 1186 ms 161432 KB Output is correct
78 Correct 1988 ms 317432 KB Output is correct
79 Correct 2747 ms 173128 KB Output is correct
80 Correct 1783 ms 162264 KB Output is correct
81 Correct 2234 ms 170516 KB Output is correct
82 Correct 2355 ms 140976 KB Output is correct
83 Correct 2514 ms 161444 KB Output is correct