oj.uz

Submission #679537

# Submission time Handle Problem Language Result Execution time Memory
679537 2023-01-08T13:02:03 Z keta_tsimakuridze Two Dishes (JOI19_dishes) C++14
100 / 100
 8328 ms 282712 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18; // !
int lazy[4 * N][2], a[N][2], c[N][2], s[N][2], n[2];
vector<pii> x[N];
int t[4 * N];
int merge(int x, int y) {
    return max(x, y);
}
void push(int u, int l, int r) {
    if(lazy[u][0] != -inf) {
        t[u] = lazy[u][0];
        if(l < r) {
            lazy[2 * u][1] = lazy[2 * u + 1][1] = 0;
            lazy[2 * u][0] = lazy[2 * u + 1][0] = lazy[u][0];
        }
        lazy[u][0] = -inf;
    }
    if(lazy[u][1] != 0) {
        t[u] += lazy[u][1];
        if(l < r) {
            lazy[2 * u][1] += lazy[u][1];
            lazy[2 * u + 1][1] += lazy[u][1];
        }
        lazy[u][1] = 0;
    }
}
void upd(int u, int st, int en, int l, int r, int x, int T) {
    push(u, l, r);
    if(l > en || r < st) return;
    if(st <= l && r <= en) {
        lazy[u][T] = x;
        push(u, l, r);
        return;
    }
    int mid = (l + r) / 2;
    upd(2 * u, st, en, l, mid, x, T); upd(2 * u + 1, st, en, mid + 1, r, x, T);
    t[u] = merge(t[2 * u], t[2 * u + 1]);
}
int get(int u, int st, int en, int l, int r) {
    push(u, l, r);
    if(l > en || r < st) return -inf;
    if(st <= l && r <= en) return t[u];
    int mid = (l + r) / 2;

    int x = merge(get(2 * u, st, en, l, mid), get(2 * u + 1, st, en, mid + 1, r));
    t[u] = merge(t[2 * u], t[2 * u + 1]);
    return x;
}
int GET(int u, int L, int l, int r, int x) {
    if(l == r) {
        if(t[u] < x) return l + 1;
        return l;
    }
    int mid = (l + r) /2;
    push(2 * u, l, mid);
    push(2 * u + 1, mid + 1, r);
    if(l >= L) {

        if(t[2 * u] < x) return GET(2 * u + 1, L, mid + 1, r, x);
        return GET(2 * u,  L, l, mid, x);
    }
    if(mid < L) return GET(2 * u + 1, L, mid + 1, r, x);
    int id = GET(2 * u, L, l, mid, x);
    if(id == mid + 1) return GET(2 * u + 1, L, mid + 1, r, x);
    else return id;
}
main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int  m;
    cin >> n[0] >> n[1];
    for(int t = 0; t < 2; t++) {
        for(int i = 1; i <= n[t]; i++) {
            cin >> a[i][t] >> s[i][t] >> c[i][t];
            a[i][t] += a[i - 1][t];
        }
    }
    int ans = 0;
    for(int t = 0; t < 2; t++) {
        int R = n[t^1];
        for(int i = 1; i <= n[t]; i++) {

            int l = 0, r = n[t^1], R = -1;

            while(l <= r) {
                int mid = (l + r) / 2;
                if(a[i][t] + a[mid][t^1] <= s[i][t]) R = mid, l = mid + 1;
                else r = mid - 1;
            }
            if(!t) {
                // R tu aris i - s win mashin ver vigebt
                ++R;
                ans += c[i][t];
                if(R == n[1] + 1) continue;
                x[i].push_back({R, -c[i][t]});
                continue;
            }
            ++R;
            if(R == n[0] + 1) {
                ans += c[i][t];
                continue;
            }
            // R tu aris i - s shemdeg mashin vigebt
            // i tu aris R - is win mashin vigebt

            x[R].push_back({i, c[i][t]});
        }
    }
/*
    vector<int> dp(n[1] + 1);
    for(int i = 1; i <= n[0]; i++) {
        for(int j = 1; j <= n[1]; j++) dp[j] = max(dp[j], dp[j - 1]);
        sort(x[i].begin(), x[i].end());

        for(int k = 0; k < x[i].size(); k++) {
            for(int j = x[i][k].f; j <= n[1]; j++) dp[j] += x[i][k].s;
        }
    }
    int mn = -inf;
    for(int i = 0; i <= n[1]; i++) mn = max(mn, dp[i]);
    cout << ans + mn << "\n";
    return 0; */
//    build(1, 0, n[1]);
    for(int i = 1; i <= n[0]; i++) {
        x[i].push_back({0, 0});
        x[i].push_back({n[1] + 1, 0});
        sort(x[i].begin(), x[i].end());
        int c = 0, mx = -inf;
        vector<int> v;
        for(int j = 0; j + 1 < x[i].size(); j++) {
            c += x[i][j].s;
            if(x[i][j + 1].f != x[i][j].f) {
                upd(1, x[i][j].f, -1 + x[i][j + 1].f, 0, n[1], c, 1);
                int mx = get(1, 0, x[i][j].f - 1, 0, n[1]);
                int id = min(-1 + x[i][j + 1].f, GET(1, x[i][j].f, 0, n[1], mx) - 1);
//                cout << mx << " __ " << id << endl;
                upd(1, x[i][j].f, id, 0, n[1], mx, 0);
            }
        }
    }
    cout << t[1] + ans;

 }
 /*
 4 3
2 1 1
3 8 1
2 13 1
1 13 1
3 6 1
2 11 1
2 15 1
-1000000000000000000__-1
-1000000000000000000__-1
-1__0
0__3
-1000000000000000000__-1
0__1
1__3
-1000000000000000000__-1
1__3
6

 */

Compilation message

dishes.cpp:72:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   72 | main(){
      | ^~~~
dishes.cpp: In function 'int main()':
dishes.cpp:84:13: warning: unused variable 'R' [-Wunused-variable]
   84 |         int R = n[t^1];
      |             ^
dishes.cpp:134:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |         for(int j = 0; j + 1 < x[i].size(); j++) {
      |                        ~~~~~~^~~~~~~~~~~~~
dishes.cpp:132:20: warning: unused variable 'mx' [-Wunused-variable]
  132 |         int c = 0, mx = -inf;
      |                    ^~
dishes.cpp:74:10: warning: unused variable 'm' [-Wunused-variable]
   74 |     int  m;
      |          ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 64212 KB Output is correct
2 Correct 645 ms 62208 KB Output is correct
3 Correct 207 ms 42712 KB Output is correct
4 Correct 465 ms 57704 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 692 ms 58916 KB Output is correct
7 Correct 83 ms 33872 KB Output is correct
8 Correct 109 ms 42536 KB Output is correct
9 Correct 248 ms 42624 KB Output is correct
10 Correct 452 ms 61232 KB Output is correct
11 Correct 157 ms 42684 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23824 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23724 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23824 KB Output is correct
11 Correct 13 ms 23836 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23728 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23824 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23724 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23824 KB Output is correct
11 Correct 13 ms 23836 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23728 KB Output is correct
17 Correct 16 ms 24152 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 22 ms 24220 KB Output is correct
20 Correct 21 ms 24240 KB Output is correct
21 Correct 19 ms 24176 KB Output is correct
22 Correct 23 ms 24148 KB Output is correct
23 Correct 23 ms 24268 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23824 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23724 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23824 KB Output is correct
11 Correct 13 ms 23836 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23728 KB Output is correct
17 Correct 16 ms 24152 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 22 ms 24220 KB Output is correct
20 Correct 21 ms 24240 KB Output is correct
21 Correct 19 ms 24176 KB Output is correct
22 Correct 23 ms 24148 KB Output is correct
23 Correct 23 ms 24268 KB Output is correct
24 Correct 803 ms 50904 KB Output is correct
25 Correct 410 ms 61124 KB Output is correct
26 Correct 590 ms 62828 KB Output is correct
27 Correct 449 ms 61220 KB Output is correct
28 Correct 439 ms 58948 KB Output is correct
29 Correct 179 ms 42700 KB Output is correct
30 Correct 1062 ms 65888 KB Output is correct
31 Correct 168 ms 47176 KB Output is correct
32 Correct 119 ms 45676 KB Output is correct
33 Correct 652 ms 64424 KB Output is correct
34 Correct 827 ms 63676 KB Output is correct
35 Correct 1031 ms 65996 KB Output is correct
36 Correct 997 ms 65752 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23824 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23724 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23824 KB Output is correct
11 Correct 13 ms 23836 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23728 KB Output is correct
17 Correct 16 ms 24152 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 22 ms 24220 KB Output is correct
20 Correct 21 ms 24240 KB Output is correct
21 Correct 19 ms 24176 KB Output is correct
22 Correct 23 ms 24148 KB Output is correct
23 Correct 23 ms 24268 KB Output is correct
24 Correct 803 ms 50904 KB Output is correct
25 Correct 410 ms 61124 KB Output is correct
26 Correct 590 ms 62828 KB Output is correct
27 Correct 449 ms 61220 KB Output is correct
28 Correct 439 ms 58948 KB Output is correct
29 Correct 179 ms 42700 KB Output is correct
30 Correct 1062 ms 65888 KB Output is correct
31 Correct 168 ms 47176 KB Output is correct
32 Correct 119 ms 45676 KB Output is correct
33 Correct 652 ms 64424 KB Output is correct
34 Correct 827 ms 63676 KB Output is correct
35 Correct 1031 ms 65996 KB Output is correct
36 Correct 997 ms 65752 KB Output is correct
37 Correct 652 ms 62732 KB Output is correct
38 Correct 565 ms 61204 KB Output is correct
39 Correct 505 ms 61140 KB Output is correct
40 Correct 691 ms 61196 KB Output is correct
41 Correct 13 ms 23764 KB Output is correct
42 Correct 1199 ms 65828 KB Output is correct
43 Correct 752 ms 64400 KB Output is correct
44 Correct 941 ms 63624 KB Output is correct
45 Correct 1158 ms 65888 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 12 ms 23716 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 13 ms 23824 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 14 ms 23724 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23764 KB Output is correct
10 Correct 13 ms 23824 KB Output is correct
11 Correct 13 ms 23836 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23832 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 12 ms 23728 KB Output is correct
17 Correct 16 ms 24152 KB Output is correct
18 Correct 14 ms 24148 KB Output is correct
19 Correct 22 ms 24220 KB Output is correct
20 Correct 21 ms 24240 KB Output is correct
21 Correct 19 ms 24176 KB Output is correct
22 Correct 23 ms 24148 KB Output is correct
23 Correct 23 ms 24268 KB Output is correct
24 Correct 803 ms 50904 KB Output is correct
25 Correct 410 ms 61124 KB Output is correct
26 Correct 590 ms 62828 KB Output is correct
27 Correct 449 ms 61220 KB Output is correct
28 Correct 439 ms 58948 KB Output is correct
29 Correct 179 ms 42700 KB Output is correct
30 Correct 1062 ms 65888 KB Output is correct
31 Correct 168 ms 47176 KB Output is correct
32 Correct 119 ms 45676 KB Output is correct
33 Correct 652 ms 64424 KB Output is correct
34 Correct 827 ms 63676 KB Output is correct
35 Correct 1031 ms 65996 KB Output is correct
36 Correct 997 ms 65752 KB Output is correct
37 Correct 652 ms 62732 KB Output is correct
38 Correct 565 ms 61204 KB Output is correct
39 Correct 505 ms 61140 KB Output is correct
40 Correct 691 ms 61196 KB Output is correct
41 Correct 13 ms 23764 KB Output is correct
42 Correct 1199 ms 65828 KB Output is correct
43 Correct 752 ms 64400 KB Output is correct
44 Correct 941 ms 63624 KB Output is correct
45 Correct 1158 ms 65888 KB Output is correct
46 Correct 3642 ms 206112 KB Output is correct
47 Correct 2485 ms 268344 KB Output is correct
48 Correct 2366 ms 254140 KB Output is correct
49 Correct 3800 ms 252384 KB Output is correct
50 Correct 8328 ms 282668 KB Output is correct
51 Correct 4531 ms 272756 KB Output is correct
52 Correct 5155 ms 268712 KB Output is correct
53 Correct 7237 ms 256484 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 64212 KB Output is correct
2 Correct 645 ms 62208 KB Output is correct
3 Correct 207 ms 42712 KB Output is correct
4 Correct 465 ms 57704 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 692 ms 58916 KB Output is correct
7 Correct 83 ms 33872 KB Output is correct
8 Correct 109 ms 42536 KB Output is correct
9 Correct 248 ms 42624 KB Output is correct
10 Correct 452 ms 61232 KB Output is correct
11 Correct 157 ms 42684 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 12 ms 23716 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 13 ms 23824 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 14 ms 23724 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23824 KB Output is correct
22 Correct 13 ms 23836 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 13 ms 23832 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 12 ms 23728 KB Output is correct
28 Correct 16 ms 24152 KB Output is correct
29 Correct 14 ms 24148 KB Output is correct
30 Correct 22 ms 24220 KB Output is correct
31 Correct 21 ms 24240 KB Output is correct
32 Correct 19 ms 24176 KB Output is correct
33 Correct 23 ms 24148 KB Output is correct
34 Correct 23 ms 24268 KB Output is correct
35 Correct 803 ms 50904 KB Output is correct
36 Correct 410 ms 61124 KB Output is correct
37 Correct 590 ms 62828 KB Output is correct
38 Correct 449 ms 61220 KB Output is correct
39 Correct 439 ms 58948 KB Output is correct
40 Correct 179 ms 42700 KB Output is correct
41 Correct 1062 ms 65888 KB Output is correct
42 Correct 168 ms 47176 KB Output is correct
43 Correct 119 ms 45676 KB Output is correct
44 Correct 652 ms 64424 KB Output is correct
45 Correct 827 ms 63676 KB Output is correct
46 Correct 1031 ms 65996 KB Output is correct
47 Correct 997 ms 65752 KB Output is correct
48 Correct 652 ms 62732 KB Output is correct
49 Correct 565 ms 61204 KB Output is correct
50 Correct 505 ms 61140 KB Output is correct
51 Correct 691 ms 61196 KB Output is correct
52 Correct 13 ms 23764 KB Output is correct
53 Correct 1199 ms 65828 KB Output is correct
54 Correct 752 ms 64400 KB Output is correct
55 Correct 941 ms 63624 KB Output is correct
56 Correct 1158 ms 65888 KB Output is correct
57 Correct 475 ms 62708 KB Output is correct
58 Correct 639 ms 61256 KB Output is correct
59 Correct 690 ms 61340 KB Output is correct
60 Correct 465 ms 61192 KB Output is correct
61 Correct 930 ms 65996 KB Output is correct
62 Correct 13 ms 23764 KB Output is correct
63 Correct 1153 ms 65852 KB Output is correct
64 Correct 724 ms 64700 KB Output is correct
65 Correct 867 ms 63092 KB Output is correct
66 Correct 1062 ms 65844 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 537 ms 64212 KB Output is correct
2 Correct 645 ms 62208 KB Output is correct
3 Correct 207 ms 42712 KB Output is correct
4 Correct 465 ms 57704 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 692 ms 58916 KB Output is correct
7 Correct 83 ms 33872 KB Output is correct
8 Correct 109 ms 42536 KB Output is correct
9 Correct 248 ms 42624 KB Output is correct
10 Correct 452 ms 61232 KB Output is correct
11 Correct 157 ms 42684 KB Output is correct
12 Correct 13 ms 23764 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 12 ms 23716 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 13 ms 23824 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 14 ms 23724 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 13 ms 23764 KB Output is correct
21 Correct 13 ms 23824 KB Output is correct
22 Correct 13 ms 23836 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 13 ms 23832 KB Output is correct
26 Correct 12 ms 23764 KB Output is correct
27 Correct 12 ms 23728 KB Output is correct
28 Correct 16 ms 24152 KB Output is correct
29 Correct 14 ms 24148 KB Output is correct
30 Correct 22 ms 24220 KB Output is correct
31 Correct 21 ms 24240 KB Output is correct
32 Correct 19 ms 24176 KB Output is correct
33 Correct 23 ms 24148 KB Output is correct
34 Correct 23 ms 24268 KB Output is correct
35 Correct 803 ms 50904 KB Output is correct
36 Correct 410 ms 61124 KB Output is correct
37 Correct 590 ms 62828 KB Output is correct
38 Correct 449 ms 61220 KB Output is correct
39 Correct 439 ms 58948 KB Output is correct
40 Correct 179 ms 42700 KB Output is correct
41 Correct 1062 ms 65888 KB Output is correct
42 Correct 168 ms 47176 KB Output is correct
43 Correct 119 ms 45676 KB Output is correct
44 Correct 652 ms 64424 KB Output is correct
45 Correct 827 ms 63676 KB Output is correct
46 Correct 1031 ms 65996 KB Output is correct
47 Correct 997 ms 65752 KB Output is correct
48 Correct 652 ms 62732 KB Output is correct
49 Correct 565 ms 61204 KB Output is correct
50 Correct 505 ms 61140 KB Output is correct
51 Correct 691 ms 61196 KB Output is correct
52 Correct 13 ms 23764 KB Output is correct
53 Correct 1199 ms 65828 KB Output is correct
54 Correct 752 ms 64400 KB Output is correct
55 Correct 941 ms 63624 KB Output is correct
56 Correct 1158 ms 65888 KB Output is correct
57 Correct 3642 ms 206112 KB Output is correct
58 Correct 2485 ms 268344 KB Output is correct
59 Correct 2366 ms 254140 KB Output is correct
60 Correct 3800 ms 252384 KB Output is correct
61 Correct 8328 ms 282668 KB Output is correct
62 Correct 4531 ms 272756 KB Output is correct
63 Correct 5155 ms 268712 KB Output is correct
64 Correct 7237 ms 256484 KB Output is correct
65 Correct 475 ms 62708 KB Output is correct
66 Correct 639 ms 61256 KB Output is correct
67 Correct 690 ms 61340 KB Output is correct
68 Correct 465 ms 61192 KB Output is correct
69 Correct 930 ms 65996 KB Output is correct
70 Correct 13 ms 23764 KB Output is correct
71 Correct 1153 ms 65852 KB Output is correct
72 Correct 724 ms 64700 KB Output is correct
73 Correct 867 ms 63092 KB Output is correct
74 Correct 1062 ms 65844 KB Output is correct
75 Correct 2474 ms 271680 KB Output is correct
76 Correct 3665 ms 263528 KB Output is correct
77 Correct 3908 ms 252032 KB Output is correct
78 Correct 2428 ms 252176 KB Output is correct
79 Correct 7800 ms 282712 KB Output is correct
80 Correct 4405 ms 275996 KB Output is correct
81 Correct 5271 ms 263448 KB Output is correct
82 Correct 7402 ms 256480 KB Output is correct
83 Correct 7137 ms 273304 KB Output is correct