oj.uz

Submission #435734

# Submission time Handle Problem Language Result Execution time Memory
435734 2021-06-23T16:07:59 Z 2qbingxuan Two Dishes (JOI19_dishes) C++17
74 / 100
 2875 ms 314528 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;
 
    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 (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() && c != 0)
                update(i, *it, c);
        } else {
            dif[j] -= val;
          	if (dif[j] > lim[j])
              	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])
                st.insert(j);
          	tmp.push_back(j);
        }
 
        dif[0] += v[i].val;
        update(i, posv[i]+1, v[i].val);
      	for (int x: tmp) update(i, x, 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));
 
        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';
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:85:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   85 |             if (dif[j] > lim[j])
      |             ^~
dishes.cpp:87:12: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   87 |            tmp.push_back(j);
      |            ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 42376 KB Output is correct
2 Correct 348 ms 34868 KB Output is correct
3 Correct 280 ms 34684 KB Output is correct
4 Correct 336 ms 39316 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 273 ms 33872 KB Output is correct
7 Correct 135 ms 21084 KB Output is correct
8 Correct 110 ms 14408 KB Output is correct
9 Correct 224 ms 35648 KB Output is correct
10 Correct 261 ms 28792 KB Output is correct
11 Correct 162 ms 29100 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 320 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 1 ms 324 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 316 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

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 320 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 1 ms 324 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 316 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 3 ms 588 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 5 ms 588 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 4 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 320 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 1 ms 324 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 316 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 3 ms 588 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 5 ms 588 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 4 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 198 ms 30800 KB Output is correct
25 Correct 293 ms 41464 KB Output is correct
26 Correct 195 ms 30916 KB Output is correct
27 Correct 341 ms 40728 KB Output is correct
28 Correct 329 ms 32160 KB Output is correct
29 Correct 217 ms 32592 KB Output is correct
30 Correct 421 ms 32056 KB Output is correct
31 Correct 168 ms 23992 KB Output is correct
32 Correct 91 ms 12552 KB Output is correct
33 Correct 407 ms 30584 KB Output is correct
34 Correct 406 ms 34684 KB Output is correct
35 Correct 338 ms 25536 KB Output is correct
36 Correct 365 ms 25584 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 320 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 1 ms 324 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 316 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 3 ms 588 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 5 ms 588 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 4 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 198 ms 30800 KB Output is correct
25 Correct 293 ms 41464 KB Output is correct
26 Correct 195 ms 30916 KB Output is correct
27 Correct 341 ms 40728 KB Output is correct
28 Correct 329 ms 32160 KB Output is correct
29 Correct 217 ms 32592 KB Output is correct
30 Correct 421 ms 32056 KB Output is correct
31 Correct 168 ms 23992 KB Output is correct
32 Correct 91 ms 12552 KB Output is correct
33 Correct 407 ms 30584 KB Output is correct
34 Correct 406 ms 34684 KB Output is correct
35 Correct 338 ms 25536 KB Output is correct
36 Correct 365 ms 25584 KB Output is correct
37 Correct 228 ms 33892 KB Output is correct
38 Correct 417 ms 43704 KB Output is correct
39 Correct 409 ms 62972 KB Output is correct
40 Correct 297 ms 32352 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 485 ms 35072 KB Output is correct
43 Correct 336 ms 33500 KB Output is correct
44 Correct 440 ms 37560 KB Output is correct
45 Correct 406 ms 28792 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 320 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 1 ms 324 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 316 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 3 ms 588 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 5 ms 588 KB Output is correct
21 Correct 3 ms 716 KB Output is correct
22 Correct 4 ms 588 KB Output is correct
23 Correct 3 ms 588 KB Output is correct
24 Correct 198 ms 30800 KB Output is correct
25 Correct 293 ms 41464 KB Output is correct
26 Correct 195 ms 30916 KB Output is correct
27 Correct 341 ms 40728 KB Output is correct
28 Correct 329 ms 32160 KB Output is correct
29 Correct 217 ms 32592 KB Output is correct
30 Correct 421 ms 32056 KB Output is correct
31 Correct 168 ms 23992 KB Output is correct
32 Correct 91 ms 12552 KB Output is correct
33 Correct 407 ms 30584 KB Output is correct
34 Correct 406 ms 34684 KB Output is correct
35 Correct 338 ms 25536 KB Output is correct
36 Correct 365 ms 25584 KB Output is correct
37 Correct 228 ms 33892 KB Output is correct
38 Correct 417 ms 43704 KB Output is correct
39 Correct 409 ms 62972 KB Output is correct
40 Correct 297 ms 32352 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 485 ms 35072 KB Output is correct
43 Correct 336 ms 33500 KB Output is correct
44 Correct 440 ms 37560 KB Output is correct
45 Correct 406 ms 28792 KB Output is correct
46 Correct 1229 ms 168388 KB Output is correct
47 Correct 2012 ms 218896 KB Output is correct
48 Correct 2253 ms 314528 KB Output is correct
49 Correct 1278 ms 158900 KB Output is correct
50 Correct 2875 ms 172544 KB Output is correct
51 Correct 2106 ms 163212 KB Output is correct
52 Correct 2719 ms 180108 KB Output is correct
53 Correct 2598 ms 141372 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 42376 KB Output is correct
2 Correct 348 ms 34868 KB Output is correct
3 Correct 280 ms 34684 KB Output is correct
4 Correct 336 ms 39316 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 273 ms 33872 KB Output is correct
7 Correct 135 ms 21084 KB Output is correct
8 Correct 110 ms 14408 KB Output is correct
9 Correct 224 ms 35648 KB Output is correct
10 Correct 261 ms 28792 KB Output is correct
11 Correct 162 ms 29100 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 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 1 ms 324 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 3 ms 588 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Correct 5 ms 588 KB Output is correct
32 Correct 3 ms 716 KB Output is correct
33 Correct 4 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 198 ms 30800 KB Output is correct
36 Correct 293 ms 41464 KB Output is correct
37 Correct 195 ms 30916 KB Output is correct
38 Correct 341 ms 40728 KB Output is correct
39 Correct 329 ms 32160 KB Output is correct
40 Correct 217 ms 32592 KB Output is correct
41 Correct 421 ms 32056 KB Output is correct
42 Correct 168 ms 23992 KB Output is correct
43 Correct 91 ms 12552 KB Output is correct
44 Correct 407 ms 30584 KB Output is correct
45 Correct 406 ms 34684 KB Output is correct
46 Correct 338 ms 25536 KB Output is correct
47 Correct 365 ms 25584 KB Output is correct
48 Correct 228 ms 33892 KB Output is correct
49 Correct 417 ms 43704 KB Output is correct
50 Correct 409 ms 62972 KB Output is correct
51 Correct 297 ms 32352 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 485 ms 35072 KB Output is correct
54 Correct 336 ms 33500 KB Output is correct
55 Correct 440 ms 37560 KB Output is correct
56 Correct 406 ms 28792 KB Output is correct
57 Correct 283 ms 43532 KB Output is correct
58 Incorrect 254 ms 35512 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 323 ms 42376 KB Output is correct
2 Correct 348 ms 34868 KB Output is correct
3 Correct 280 ms 34684 KB Output is correct
4 Correct 336 ms 39316 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Correct 273 ms 33872 KB Output is correct
7 Correct 135 ms 21084 KB Output is correct
8 Correct 110 ms 14408 KB Output is correct
9 Correct 224 ms 35648 KB Output is correct
10 Correct 261 ms 28792 KB Output is correct
11 Correct 162 ms 29100 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 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 1 ms 324 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 3 ms 588 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 4 ms 588 KB Output is correct
31 Correct 5 ms 588 KB Output is correct
32 Correct 3 ms 716 KB Output is correct
33 Correct 4 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 198 ms 30800 KB Output is correct
36 Correct 293 ms 41464 KB Output is correct
37 Correct 195 ms 30916 KB Output is correct
38 Correct 341 ms 40728 KB Output is correct
39 Correct 329 ms 32160 KB Output is correct
40 Correct 217 ms 32592 KB Output is correct
41 Correct 421 ms 32056 KB Output is correct
42 Correct 168 ms 23992 KB Output is correct
43 Correct 91 ms 12552 KB Output is correct
44 Correct 407 ms 30584 KB Output is correct
45 Correct 406 ms 34684 KB Output is correct
46 Correct 338 ms 25536 KB Output is correct
47 Correct 365 ms 25584 KB Output is correct
48 Correct 228 ms 33892 KB Output is correct
49 Correct 417 ms 43704 KB Output is correct
50 Correct 409 ms 62972 KB Output is correct
51 Correct 297 ms 32352 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 485 ms 35072 KB Output is correct
54 Correct 336 ms 33500 KB Output is correct
55 Correct 440 ms 37560 KB Output is correct
56 Correct 406 ms 28792 KB Output is correct
57 Correct 1229 ms 168388 KB Output is correct
58 Correct 2012 ms 218896 KB Output is correct
59 Correct 2253 ms 314528 KB Output is correct
60 Correct 1278 ms 158900 KB Output is correct
61 Correct 2875 ms 172544 KB Output is correct
62 Correct 2106 ms 163212 KB Output is correct
63 Correct 2719 ms 180108 KB Output is correct
64 Correct 2598 ms 141372 KB Output is correct
65 Correct 283 ms 43532 KB Output is correct
66 Incorrect 254 ms 35512 KB Output isn't correct
67 Halted 0 ms 0 KB -