oj.uz

Submission #804684

# Submission time Handle Problem Language Result Execution time Memory
804684 2023-08-03T10:52:04 Z TheSahib Food Court (JOI21_foodcourt) C++14
100 / 100
 838 ms 81288 KB 
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>

using namespace std;

const int oo = 1e9 + 9;
const pair<ll, ll> dummy = {1e18, 0};
const int MAX = 3e5 + 5;

ll n, m, q;


struct BIT{
    ll T[MAX + 1];
    void update(int pos, int val){
        while(pos < MAX){
            T[pos] += val;
            pos += pos & -pos;
        }
    }
    ll ask(int l, int r){
        if(l != 1) return ask(1, r) - ask(1, l - 1);
        ll ans = 0;
        while(r > 0){
            ans += T[r];
            r -= r & -r;
        }
        return ans;
    }
};

pair<ll, ll> tree[MAX * 5];
ll lazy[MAX * 5];

BIT b1, b2;


void build(int node, int l, int r){
    if(l == r){
        tree[node] = {0, l};
        return;
    }
    int mid = (l + r) / 2;
    build(node * 2, l, mid);
    build(node * 2 + 1, mid + 1, r);
    tree[node] = min(tree[node * 2], tree[node * 2 + 1]);
}

void relax(int node, int l, int r){
    if(!lazy[node]) return;
    tree[node].first += lazy[node];
    if(l != r){
        lazy[node * 2] += lazy[node];
        lazy[node * 2 + 1] += lazy[node];
    }
    lazy[node] = 0;
}

void update(int node, int l, int r, int ql, int qr, int val){
    relax(node, l, r);
    if(ql > r || qr < l) return;
    if(ql <= l && r <= qr){
        lazy[node] += val;
        relax(node, l, r);
        return;
    }
    int mid = (l + r) / 2;
    update(node * 2, l, mid, ql, qr, val);
    update(node * 2 + 1, mid + 1, r, ql, qr, val);
    tree[node] = min(tree[node * 2], tree[node * 2 + 1]);
}

pair<ll, ll> ask(int node, int l, int r, int ql, int qr){
    if(ql > r || qr < l) return dummy;
    relax(node, l, r);
    if(ql <= l && r <= qr){
        return tree[node];
    }
    int mid = (l + r) / 2;
    return min(ask(node * 2, l, mid, ql, qr), ask(node * 2 + 1, mid + 1, r, ql, qr));
}

vector<array<ll, 4>> events[MAX][2];
vector<array<ll, 2>> quer[MAX];

int main()
{
    build(1, 0, MAX);
    cin >> n >> m >> q;
    for (int i = 1; i <= q; i++)
    {
        int t; scanf("%d", &t);
        if(t == 1){
            int l, r, k; ll c; scanf("%d%d%lld%d", &l, &r, &c, &k);
            events[l][0].push_back({t, i, c, k});
            events[r + 1][1].push_back({t, i, c, k});
        }
        else if(t == 2){
            int l, r, k; scanf("%d%d%d", &l, &r, &k);
            events[l][0].push_back({t, i, 0, k});
            events[r + 1][1].push_back({t, i, 0, k});
        }
        else{
            ll a, b; scanf("%lld%lld", &a, &b);
            quer[a].push_back({i, b});
        }
    }
    vector<ll> ans(q + 1, -1);
    set<pair<int, ll>> st;
    for (int i = 1; i <= n; i++)
    {
        for(auto& e:events[i][0]){
            int idx = e[1], k = e[3]; ll c = e[2];
            if(e[0] == 1){
                update(1, 0, MAX, idx, MAX, k);
                b1.update(idx, k);
                st.insert({idx, c});
            }
            else{
                update(1, 0, MAX, idx, MAX, -k);
                b2.update(idx, k);
            }
        }
        for(auto& e:events[i][1]){
            int idx = e[1], k = e[3]; ll c = e[2];
            if(e[0] == 1){
                update(1, 0, MAX, idx, MAX, -k);
                b1.update(idx, -k);
                st.erase({idx, c});
            }
            else{
                update(1, 0, MAX, idx, MAX, k);
                b2.update(idx, -k);
            }
        }

        for(auto& e:quer[i]){
            int idx = e[0];
            ll b = e[1];
            auto mn = ask(1, 0, MAX, 0, idx);
            mn.second += 1;
            if(mn.second > idx){
                ans[idx] = 0;
                continue;
            }

            ll d = b2.ask(mn.second, idx);
            ll a = -1;
            int l = mn.second, r = idx - 1;
            while(l <= r){
                int mid = (l + r) / 2;
                if(b1.ask(mn.second, mid) - d < b){
                    l = mid + 1;
                }
                else{
                    r = mid - 1;
                    a = mid;
                }
            }
            if(a == -1){
                ans[idx] = 0;
                continue;
            }
            ans[idx] = st.lower_bound({a, 0})->second;
        }
    }
    for (int i = 0; i <= q; i++)
    {
        if(ans[i] < 0) continue;
        cout << ans[i] << '\n';
    }
}

Compilation message

foodcourt.cpp: In function 'int main()':
foodcourt.cpp:94:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         int t; scanf("%d", &t);
      |                ~~~~~^~~~~~~~~~
foodcourt.cpp:96:37: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |             int l, r, k; ll c; scanf("%d%d%lld%d", &l, &r, &c, &k);
      |                                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:101:31: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |             int l, r, k; scanf("%d%d%d", &l, &r, &k);
      |                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:106:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |             ll a, b; scanf("%lld%lld", &a, &b);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 38212 KB Output is correct
2 Correct 19 ms 38264 KB Output is correct
3 Correct 20 ms 38148 KB Output is correct
4 Correct 21 ms 38220 KB Output is correct
5 Correct 20 ms 38240 KB Output is correct
6 Correct 20 ms 38228 KB Output is correct
7 Correct 20 ms 38260 KB Output is correct
8 Correct 20 ms 38252 KB Output is correct
9 Correct 21 ms 38264 KB Output is correct
10 Correct 20 ms 38228 KB Output is correct
11 Correct 20 ms 38216 KB Output is correct
12 Correct 28 ms 38248 KB Output is correct
13 Correct 23 ms 38164 KB Output is correct
14 Correct 21 ms 38264 KB Output is correct
15 Correct 23 ms 38228 KB Output is correct
16 Correct 20 ms 38228 KB Output is correct
17 Correct 21 ms 38136 KB Output is correct
18 Correct 21 ms 38312 KB Output is correct
19 Correct 21 ms 38220 KB Output is correct
20 Correct 21 ms 38212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 38212 KB Output is correct
2 Correct 19 ms 38264 KB Output is correct
3 Correct 20 ms 38148 KB Output is correct
4 Correct 21 ms 38220 KB Output is correct
5 Correct 20 ms 38240 KB Output is correct
6 Correct 20 ms 38228 KB Output is correct
7 Correct 20 ms 38260 KB Output is correct
8 Correct 20 ms 38252 KB Output is correct
9 Correct 21 ms 38264 KB Output is correct
10 Correct 20 ms 38228 KB Output is correct
11 Correct 20 ms 38216 KB Output is correct
12 Correct 28 ms 38248 KB Output is correct
13 Correct 23 ms 38164 KB Output is correct
14 Correct 21 ms 38264 KB Output is correct
15 Correct 23 ms 38228 KB Output is correct
16 Correct 20 ms 38228 KB Output is correct
17 Correct 21 ms 38136 KB Output is correct
18 Correct 21 ms 38312 KB Output is correct
19 Correct 21 ms 38220 KB Output is correct
20 Correct 21 ms 38212 KB Output is correct
21 Correct 21 ms 38260 KB Output is correct
22 Correct 21 ms 38204 KB Output is correct
23 Correct 23 ms 38260 KB Output is correct
24 Correct 23 ms 38332 KB Output is correct
25 Correct 23 ms 38264 KB Output is correct
26 Correct 24 ms 38268 KB Output is correct
27 Correct 22 ms 38268 KB Output is correct
28 Correct 27 ms 38312 KB Output is correct
29 Correct 23 ms 38284 KB Output is correct
30 Correct 25 ms 38324 KB Output is correct
31 Correct 22 ms 38280 KB Output is correct
32 Correct 24 ms 38252 KB Output is correct
33 Correct 22 ms 38304 KB Output is correct
34 Correct 22 ms 38220 KB Output is correct
35 Correct 25 ms 38264 KB Output is correct
36 Correct 24 ms 38280 KB Output is correct
37 Correct 22 ms 38128 KB Output is correct
38 Correct 25 ms 38228 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 46888 KB Output is correct
2 Correct 113 ms 47272 KB Output is correct
3 Correct 141 ms 46888 KB Output is correct
4 Correct 120 ms 46832 KB Output is correct
5 Correct 146 ms 47196 KB Output is correct
6 Correct 103 ms 47244 KB Output is correct
7 Correct 69 ms 45864 KB Output is correct
8 Correct 60 ms 46232 KB Output is correct
9 Correct 101 ms 46924 KB Output is correct
10 Correct 103 ms 47208 KB Output is correct
11 Correct 102 ms 47180 KB Output is correct
12 Correct 109 ms 47260 KB Output is correct
13 Correct 93 ms 45936 KB Output is correct
14 Correct 101 ms 46796 KB Output is correct
15 Correct 117 ms 47508 KB Output is correct
16 Correct 109 ms 47652 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 73160 KB Output is correct
2 Correct 408 ms 65996 KB Output is correct
3 Correct 598 ms 76348 KB Output is correct
4 Correct 402 ms 68684 KB Output is correct
5 Correct 486 ms 69360 KB Output is correct
6 Correct 621 ms 80560 KB Output is correct
7 Correct 218 ms 71936 KB Output is correct
8 Correct 248 ms 72608 KB Output is correct
9 Correct 607 ms 76744 KB Output is correct
10 Correct 610 ms 76768 KB Output is correct
11 Correct 547 ms 77092 KB Output is correct
12 Correct 568 ms 79144 KB Output is correct
13 Correct 581 ms 77424 KB Output is correct
14 Correct 593 ms 79072 KB Output is correct
15 Correct 635 ms 79012 KB Output is correct
16 Correct 621 ms 78992 KB Output is correct
17 Correct 635 ms 78944 KB Output is correct
18 Correct 616 ms 78032 KB Output is correct
19 Correct 584 ms 79072 KB Output is correct
20 Correct 655 ms 78360 KB Output is correct
21 Correct 665 ms 79056 KB Output is correct
22 Correct 707 ms 79028 KB Output is correct
23 Correct 593 ms 78988 KB Output is correct
24 Correct 630 ms 78936 KB Output is correct
25 Correct 523 ms 79404 KB Output is correct
26 Correct 633 ms 80304 KB Output is correct
27 Correct 489 ms 77040 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 38212 KB Output is correct
2 Correct 19 ms 38264 KB Output is correct
3 Correct 20 ms 38148 KB Output is correct
4 Correct 21 ms 38220 KB Output is correct
5 Correct 20 ms 38240 KB Output is correct
6 Correct 20 ms 38228 KB Output is correct
7 Correct 20 ms 38260 KB Output is correct
8 Correct 20 ms 38252 KB Output is correct
9 Correct 21 ms 38264 KB Output is correct
10 Correct 20 ms 38228 KB Output is correct
11 Correct 20 ms 38216 KB Output is correct
12 Correct 28 ms 38248 KB Output is correct
13 Correct 23 ms 38164 KB Output is correct
14 Correct 21 ms 38264 KB Output is correct
15 Correct 23 ms 38228 KB Output is correct
16 Correct 20 ms 38228 KB Output is correct
17 Correct 21 ms 38136 KB Output is correct
18 Correct 21 ms 38312 KB Output is correct
19 Correct 21 ms 38220 KB Output is correct
20 Correct 21 ms 38212 KB Output is correct
21 Correct 113 ms 46888 KB Output is correct
22 Correct 113 ms 47272 KB Output is correct
23 Correct 141 ms 46888 KB Output is correct
24 Correct 120 ms 46832 KB Output is correct
25 Correct 146 ms 47196 KB Output is correct
26 Correct 103 ms 47244 KB Output is correct
27 Correct 69 ms 45864 KB Output is correct
28 Correct 60 ms 46232 KB Output is correct
29 Correct 101 ms 46924 KB Output is correct
30 Correct 103 ms 47208 KB Output is correct
31 Correct 102 ms 47180 KB Output is correct
32 Correct 109 ms 47260 KB Output is correct
33 Correct 93 ms 45936 KB Output is correct
34 Correct 101 ms 46796 KB Output is correct
35 Correct 117 ms 47508 KB Output is correct
36 Correct 109 ms 47652 KB Output is correct
37 Correct 122 ms 46472 KB Output is correct
38 Correct 125 ms 46420 KB Output is correct
39 Correct 52 ms 45228 KB Output is correct
40 Correct 66 ms 46152 KB Output is correct
41 Correct 185 ms 47604 KB Output is correct
42 Correct 123 ms 48160 KB Output is correct
43 Correct 145 ms 48068 KB Output is correct
44 Correct 165 ms 47892 KB Output is correct
45 Correct 180 ms 48128 KB Output is correct
46 Correct 137 ms 48116 KB Output is correct
47 Correct 77 ms 46940 KB Output is correct
48 Correct 150 ms 48396 KB Output is correct
49 Correct 99 ms 45164 KB Output is correct
50 Correct 160 ms 46688 KB Output is correct
51 Correct 159 ms 48180 KB Output is correct
52 Correct 161 ms 48176 KB Output is correct
53 Correct 101 ms 45492 KB Output is correct
54 Correct 162 ms 47616 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 46296 KB Output is correct
2 Correct 153 ms 47172 KB Output is correct
3 Correct 145 ms 47316 KB Output is correct
4 Correct 125 ms 44764 KB Output is correct
5 Correct 101 ms 46372 KB Output is correct
6 Correct 126 ms 47688 KB Output is correct
7 Correct 68 ms 45812 KB Output is correct
8 Correct 87 ms 45256 KB Output is correct
9 Correct 112 ms 47444 KB Output is correct
10 Correct 114 ms 45212 KB Output is correct
11 Correct 125 ms 48144 KB Output is correct
12 Correct 171 ms 48168 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 38212 KB Output is correct
2 Correct 19 ms 38264 KB Output is correct
3 Correct 20 ms 38148 KB Output is correct
4 Correct 21 ms 38220 KB Output is correct
5 Correct 20 ms 38240 KB Output is correct
6 Correct 20 ms 38228 KB Output is correct
7 Correct 20 ms 38260 KB Output is correct
8 Correct 20 ms 38252 KB Output is correct
9 Correct 21 ms 38264 KB Output is correct
10 Correct 20 ms 38228 KB Output is correct
11 Correct 20 ms 38216 KB Output is correct
12 Correct 28 ms 38248 KB Output is correct
13 Correct 23 ms 38164 KB Output is correct
14 Correct 21 ms 38264 KB Output is correct
15 Correct 23 ms 38228 KB Output is correct
16 Correct 20 ms 38228 KB Output is correct
17 Correct 21 ms 38136 KB Output is correct
18 Correct 21 ms 38312 KB Output is correct
19 Correct 21 ms 38220 KB Output is correct
20 Correct 21 ms 38212 KB Output is correct
21 Correct 21 ms 38260 KB Output is correct
22 Correct 21 ms 38204 KB Output is correct
23 Correct 23 ms 38260 KB Output is correct
24 Correct 23 ms 38332 KB Output is correct
25 Correct 23 ms 38264 KB Output is correct
26 Correct 24 ms 38268 KB Output is correct
27 Correct 22 ms 38268 KB Output is correct
28 Correct 27 ms 38312 KB Output is correct
29 Correct 23 ms 38284 KB Output is correct
30 Correct 25 ms 38324 KB Output is correct
31 Correct 22 ms 38280 KB Output is correct
32 Correct 24 ms 38252 KB Output is correct
33 Correct 22 ms 38304 KB Output is correct
34 Correct 22 ms 38220 KB Output is correct
35 Correct 25 ms 38264 KB Output is correct
36 Correct 24 ms 38280 KB Output is correct
37 Correct 22 ms 38128 KB Output is correct
38 Correct 25 ms 38228 KB Output is correct
39 Correct 113 ms 46888 KB Output is correct
40 Correct 113 ms 47272 KB Output is correct
41 Correct 141 ms 46888 KB Output is correct
42 Correct 120 ms 46832 KB Output is correct
43 Correct 146 ms 47196 KB Output is correct
44 Correct 103 ms 47244 KB Output is correct
45 Correct 69 ms 45864 KB Output is correct
46 Correct 60 ms 46232 KB Output is correct
47 Correct 101 ms 46924 KB Output is correct
48 Correct 103 ms 47208 KB Output is correct
49 Correct 102 ms 47180 KB Output is correct
50 Correct 109 ms 47260 KB Output is correct
51 Correct 93 ms 45936 KB Output is correct
52 Correct 101 ms 46796 KB Output is correct
53 Correct 117 ms 47508 KB Output is correct
54 Correct 109 ms 47652 KB Output is correct
55 Correct 122 ms 46472 KB Output is correct
56 Correct 125 ms 46420 KB Output is correct
57 Correct 52 ms 45228 KB Output is correct
58 Correct 66 ms 46152 KB Output is correct
59 Correct 185 ms 47604 KB Output is correct
60 Correct 123 ms 48160 KB Output is correct
61 Correct 145 ms 48068 KB Output is correct
62 Correct 165 ms 47892 KB Output is correct
63 Correct 180 ms 48128 KB Output is correct
64 Correct 137 ms 48116 KB Output is correct
65 Correct 77 ms 46940 KB Output is correct
66 Correct 150 ms 48396 KB Output is correct
67 Correct 99 ms 45164 KB Output is correct
68 Correct 160 ms 46688 KB Output is correct
69 Correct 159 ms 48180 KB Output is correct
70 Correct 161 ms 48176 KB Output is correct
71 Correct 101 ms 45492 KB Output is correct
72 Correct 162 ms 47616 KB Output is correct
73 Correct 119 ms 46296 KB Output is correct
74 Correct 153 ms 47172 KB Output is correct
75 Correct 145 ms 47316 KB Output is correct
76 Correct 125 ms 44764 KB Output is correct
77 Correct 101 ms 46372 KB Output is correct
78 Correct 126 ms 47688 KB Output is correct
79 Correct 68 ms 45812 KB Output is correct
80 Correct 87 ms 45256 KB Output is correct
81 Correct 112 ms 47444 KB Output is correct
82 Correct 114 ms 45212 KB Output is correct
83 Correct 125 ms 48144 KB Output is correct
84 Correct 171 ms 48168 KB Output is correct
85 Correct 152 ms 47100 KB Output is correct
86 Correct 148 ms 47996 KB Output is correct
87 Correct 120 ms 47664 KB Output is correct
88 Correct 126 ms 49156 KB Output is correct
89 Correct 81 ms 44824 KB Output is correct
90 Correct 131 ms 48656 KB Output is correct
91 Correct 101 ms 46800 KB Output is correct
92 Correct 123 ms 46320 KB Output is correct
93 Correct 171 ms 48652 KB Output is correct
94 Correct 134 ms 48404 KB Output is correct
95 Correct 148 ms 48484 KB Output is correct
96 Correct 136 ms 48712 KB Output is correct
97 Correct 146 ms 48640 KB Output is correct
98 Correct 126 ms 47104 KB Output is correct
99 Correct 87 ms 47412 KB Output is correct
100 Correct 117 ms 46740 KB Output is correct
101 Correct 143 ms 48920 KB Output is correct
102 Correct 139 ms 48256 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 38212 KB Output is correct
2 Correct 19 ms 38264 KB Output is correct
3 Correct 20 ms 38148 KB Output is correct
4 Correct 21 ms 38220 KB Output is correct
5 Correct 20 ms 38240 KB Output is correct
6 Correct 20 ms 38228 KB Output is correct
7 Correct 20 ms 38260 KB Output is correct
8 Correct 20 ms 38252 KB Output is correct
9 Correct 21 ms 38264 KB Output is correct
10 Correct 20 ms 38228 KB Output is correct
11 Correct 20 ms 38216 KB Output is correct
12 Correct 28 ms 38248 KB Output is correct
13 Correct 23 ms 38164 KB Output is correct
14 Correct 21 ms 38264 KB Output is correct
15 Correct 23 ms 38228 KB Output is correct
16 Correct 20 ms 38228 KB Output is correct
17 Correct 21 ms 38136 KB Output is correct
18 Correct 21 ms 38312 KB Output is correct
19 Correct 21 ms 38220 KB Output is correct
20 Correct 21 ms 38212 KB Output is correct
21 Correct 21 ms 38260 KB Output is correct
22 Correct 21 ms 38204 KB Output is correct
23 Correct 23 ms 38260 KB Output is correct
24 Correct 23 ms 38332 KB Output is correct
25 Correct 23 ms 38264 KB Output is correct
26 Correct 24 ms 38268 KB Output is correct
27 Correct 22 ms 38268 KB Output is correct
28 Correct 27 ms 38312 KB Output is correct
29 Correct 23 ms 38284 KB Output is correct
30 Correct 25 ms 38324 KB Output is correct
31 Correct 22 ms 38280 KB Output is correct
32 Correct 24 ms 38252 KB Output is correct
33 Correct 22 ms 38304 KB Output is correct
34 Correct 22 ms 38220 KB Output is correct
35 Correct 25 ms 38264 KB Output is correct
36 Correct 24 ms 38280 KB Output is correct
37 Correct 22 ms 38128 KB Output is correct
38 Correct 25 ms 38228 KB Output is correct
39 Correct 113 ms 46888 KB Output is correct
40 Correct 113 ms 47272 KB Output is correct
41 Correct 141 ms 46888 KB Output is correct
42 Correct 120 ms 46832 KB Output is correct
43 Correct 146 ms 47196 KB Output is correct
44 Correct 103 ms 47244 KB Output is correct
45 Correct 69 ms 45864 KB Output is correct
46 Correct 60 ms 46232 KB Output is correct
47 Correct 101 ms 46924 KB Output is correct
48 Correct 103 ms 47208 KB Output is correct
49 Correct 102 ms 47180 KB Output is correct
50 Correct 109 ms 47260 KB Output is correct
51 Correct 93 ms 45936 KB Output is correct
52 Correct 101 ms 46796 KB Output is correct
53 Correct 117 ms 47508 KB Output is correct
54 Correct 109 ms 47652 KB Output is correct
55 Correct 538 ms 73160 KB Output is correct
56 Correct 408 ms 65996 KB Output is correct
57 Correct 598 ms 76348 KB Output is correct
58 Correct 402 ms 68684 KB Output is correct
59 Correct 486 ms 69360 KB Output is correct
60 Correct 621 ms 80560 KB Output is correct
61 Correct 218 ms 71936 KB Output is correct
62 Correct 248 ms 72608 KB Output is correct
63 Correct 607 ms 76744 KB Output is correct
64 Correct 610 ms 76768 KB Output is correct
65 Correct 547 ms 77092 KB Output is correct
66 Correct 568 ms 79144 KB Output is correct
67 Correct 581 ms 77424 KB Output is correct
68 Correct 593 ms 79072 KB Output is correct
69 Correct 635 ms 79012 KB Output is correct
70 Correct 621 ms 78992 KB Output is correct
71 Correct 635 ms 78944 KB Output is correct
72 Correct 616 ms 78032 KB Output is correct
73 Correct 584 ms 79072 KB Output is correct
74 Correct 655 ms 78360 KB Output is correct
75 Correct 665 ms 79056 KB Output is correct
76 Correct 707 ms 79028 KB Output is correct
77 Correct 593 ms 78988 KB Output is correct
78 Correct 630 ms 78936 KB Output is correct
79 Correct 523 ms 79404 KB Output is correct
80 Correct 633 ms 80304 KB Output is correct
81 Correct 489 ms 77040 KB Output is correct
82 Correct 122 ms 46472 KB Output is correct
83 Correct 125 ms 46420 KB Output is correct
84 Correct 52 ms 45228 KB Output is correct
85 Correct 66 ms 46152 KB Output is correct
86 Correct 185 ms 47604 KB Output is correct
87 Correct 123 ms 48160 KB Output is correct
88 Correct 145 ms 48068 KB Output is correct
89 Correct 165 ms 47892 KB Output is correct
90 Correct 180 ms 48128 KB Output is correct
91 Correct 137 ms 48116 KB Output is correct
92 Correct 77 ms 46940 KB Output is correct
93 Correct 150 ms 48396 KB Output is correct
94 Correct 99 ms 45164 KB Output is correct
95 Correct 160 ms 46688 KB Output is correct
96 Correct 159 ms 48180 KB Output is correct
97 Correct 161 ms 48176 KB Output is correct
98 Correct 101 ms 45492 KB Output is correct
99 Correct 162 ms 47616 KB Output is correct
100 Correct 119 ms 46296 KB Output is correct
101 Correct 153 ms 47172 KB Output is correct
102 Correct 145 ms 47316 KB Output is correct
103 Correct 125 ms 44764 KB Output is correct
104 Correct 101 ms 46372 KB Output is correct
105 Correct 126 ms 47688 KB Output is correct
106 Correct 68 ms 45812 KB Output is correct
107 Correct 87 ms 45256 KB Output is correct
108 Correct 112 ms 47444 KB Output is correct
109 Correct 114 ms 45212 KB Output is correct
110 Correct 125 ms 48144 KB Output is correct
111 Correct 171 ms 48168 KB Output is correct
112 Correct 152 ms 47100 KB Output is correct
113 Correct 148 ms 47996 KB Output is correct
114 Correct 120 ms 47664 KB Output is correct
115 Correct 126 ms 49156 KB Output is correct
116 Correct 81 ms 44824 KB Output is correct
117 Correct 131 ms 48656 KB Output is correct
118 Correct 101 ms 46800 KB Output is correct
119 Correct 123 ms 46320 KB Output is correct
120 Correct 171 ms 48652 KB Output is correct
121 Correct 134 ms 48404 KB Output is correct
122 Correct 148 ms 48484 KB Output is correct
123 Correct 136 ms 48712 KB Output is correct
124 Correct 146 ms 48640 KB Output is correct
125 Correct 126 ms 47104 KB Output is correct
126 Correct 87 ms 47412 KB Output is correct
127 Correct 117 ms 46740 KB Output is correct
128 Correct 143 ms 48920 KB Output is correct
129 Correct 139 ms 48256 KB Output is correct
130 Correct 727 ms 76980 KB Output is correct
131 Correct 546 ms 66268 KB Output is correct
132 Correct 618 ms 76844 KB Output is correct
133 Correct 545 ms 79356 KB Output is correct
134 Correct 617 ms 74788 KB Output is correct
135 Correct 838 ms 81288 KB Output is correct
136 Correct 754 ms 77716 KB Output is correct
137 Correct 620 ms 77668 KB Output is correct
138 Correct 673 ms 77804 KB Output is correct
139 Correct 660 ms 79740 KB Output is correct
140 Correct 608 ms 78356 KB Output is correct
141 Correct 655 ms 79692 KB Output is correct
142 Correct 659 ms 79660 KB Output is correct
143 Correct 604 ms 79552 KB Output is correct
144 Correct 722 ms 78744 KB Output is correct
145 Correct 639 ms 79676 KB Output is correct
146 Correct 701 ms 79200 KB Output is correct
147 Correct 607 ms 79612 KB Output is correct
148 Correct 603 ms 79644 KB Output is correct
149 Correct 635 ms 79648 KB Output is correct
150 Correct 360 ms 74776 KB Output is correct
151 Correct 625 ms 80848 KB Output is correct
152 Correct 536 ms 80932 KB Output is correct
153 Correct 443 ms 77856 KB Output is correct