oj.uz

Submission #797200

# Submission time Handle Problem Language Result Execution time Memory
797200 2023-07-29T07:55:09 Z eltu0815 Fish 2 (JOI22_fish2) C++14
48 / 100
 4000 ms 25104 KB 
#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define inf (1000000001)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
int n, q;
int arr[100005];
 
struct SEG1 {
    ll seg[400005];
    void update(int str, int ed, int idx, ll val, int node) {
        if(str == ed) {
            seg[node] = val;
            return;
        }
        int mid = str + ed >> 1;
        if(idx <= mid) update(str, mid, idx, val, node << 1);
        else update(mid + 1, ed, idx, val, node << 1 | 1);
        seg[node] = seg[node << 1] + seg[node << 1 | 1];
    }
    ll query(int str, int ed, int left, int right, int node) {
        if(str > right || ed < left) return 0;
        if(left <= str && ed <= right) return seg[node];
        int mid = str + ed >> 1;
        return query(str, mid, left, right, node << 1) + query(mid + 1, ed, left, right, node << 1 | 1);
    }
} seg1;
 
struct SEG2 {
    int seg[400005];
    void update(int str, int ed, int idx, int val, int node) {
        if(str == ed) {
            seg[node] = val;
            return;
        }
        int mid = str + ed >> 1;
        if(idx <= mid) update(str, mid, idx, val, node << 1);
        else update(mid + 1, ed, idx, val, node << 1 | 1);
        seg[node] = max(seg[node << 1], seg[node << 1 | 1]);
    }
    int get_mx(int str, int ed, int left, int right, int val, int node) {
        if(str > right || ed < left) return -1;
        if(seg[node] <= val) return -1;
        if(str == ed) return str;
        int mid = str + ed >> 1;
        int tmp = get_mx(mid + 1, ed, left, right, val, node << 1 | 1);
        if(tmp != -1) return tmp;
        return get_mx(str, mid, left, right, val, node << 1);
    }
    int get_mn(int str, int ed, int left, int right, ll val, int node) {
        if(str > right || ed < left) return -1;
        if(seg[node] <= val) return -1;
        if(str == ed) return str;
        int mid = str + ed >> 1;
        int tmp = get_mn(str, mid, left, right, val, node << 1);
        if(tmp != -1) return tmp;
        return get_mn(mid + 1, ed, left, right, val, node << 1 | 1);
    }
} seg2;
 
struct SEG3 {
    struct Node{
        int mn, cnt;
        Node() { mn = inf, cnt = 0; }
    };
    Node seg[400005];
    int lazy[400005];
    Node Merge(Node l, Node r) {
        Node ret; ret.cnt = 0;
        ret.mn = min(l.mn, r.mn);
        if(l.mn == ret.mn) ret.cnt += l.cnt;
        if(r.mn == ret.mn) ret.cnt += r.cnt;
        return ret;
    }
    void init(int str, int ed, int node) {
        lazy[node] = 0;
        if(str == ed) {
            seg[node].mn = 0, seg[node].cnt = 1;
            return;
        }
        int mid = str + ed >> 1;
        init(str, mid, node << 1);
        init(mid + 1, ed, node << 1 | 1);
        seg[node] = Merge(seg[node << 1], seg[node << 1 | 1]);
    }
    void lazyProp(int str, int ed, int node) {
        if(lazy[node]) {
            seg[node].mn += lazy[node];
            if(str != ed) {
                lazy[node << 1] += lazy[node];
                lazy[node << 1 | 1] += lazy[node];
            }
            lazy[node] = 0;
        }
    }
    void update(int str, int ed, int left, int right, int val, int node) {
        lazyProp(str, ed, node);
        if(str > right || ed < left) return;
        if(left <= str && ed <= right) {
            lazy[node] += val;
            lazyProp(str, ed, node);
            return;
        }
        int mid = str + ed >> 1;
        update(str, mid, left, right, val, node << 1);
        update(mid + 1, ed, left, right, val, node << 1 | 1);
        seg[node] = Merge(seg[node << 1], seg[node << 1 | 1]);
    }
    Node query(int str, int ed, int left, int right, int node) {
        lazyProp(str, ed, node);
        if(str > right || ed < left) return Node();
        if(left <= str && ed <= right) return seg[node];
        int mid = str + ed >> 1;
        return Merge(query(str, mid, left, right, node << 1), query(mid + 1, ed, left, right, node << 1 | 1));
    }
} seg3;
 
set<pii> s;
struct SEG4 {
    vector<pii> seg[400005];
    void update(int str, int ed, int l, int r, int node) {
        int mid = str + ed >> 1;
        if(str == ed || (l <= mid && r > mid)) {
            seg[node].push_back({l, r});
            seg3.update(1, n, l, r, 1, 1);
            return;
        }
        if(r <= mid) update(str, mid, l, r, node << 1);
        else update(mid + 1, ed, l, r, node << 1 | 1);
    }
    
    void erasex(int str, int ed, int x, int node) {
        while(!seg[node].empty() && seg[node].back().first <= x && x <= seg[node].back().second) {
            seg3.update(1, n, seg[node].back().first, seg[node].back().second, -1, 1);
            s.erase({seg[node].back().first, seg[node].back().second});
            seg[node].pop_back();
        }
        if(str == ed) return;
        int mid = str + ed >> 1;
        if(x <= mid) erasex(str, mid, x, node << 1);
        else erasex(mid + 1, ed, x, node << 1 | 1);
    }
} seg4;
 
void update(int i) {
    vector<pll> left, right;
    int j = i, sum = arr[j];
    while(j > 1) {
        j = seg2.get_mx(1, n, 1, j - 1, sum, 1);
        if(j == -1) break;
        left.push_back({j, seg1.query(1, n, 1, j, 1)});
        sum += arr[j];
    }
    left.push_back({0, 0});
    
    j = i, sum = arr[j];
    while(j < n) {
        j = seg2.get_mn(1, n, j + 1, n, sum, 1);
        if(j == -1) break;
        right.push_back({j, seg1.query(1, n, 1, j - 1, 1)});
        sum += arr[j];
    }
    right.push_back({n + 1, seg1.query(1, n, 1, n, 1)});
    
    vector<pii> range;
    for(auto l : left) for(auto r : right) {
        if(l.first == 0 && r.first == n + 1) continue;
        if(r.second - l.second < min(arr[r.first], arr[l.first])) {
            range.push_back({l.first + 1, r.first - 1});
        }
    }
    
    sort(range.begin(), range.end(), [&](auto a, auto b) {
            if(a.second - a.first != b.second - b.first) return a.second - a.first < b.second - b.first;
            return a.first < b.first;
        });
    
    for(auto [l, r] : range) {
        if(s.find({l, r}) == s.end()) {
            seg4.update(1, n, l, r, 1);
            s.insert({l, r});
        }
    }
}
 
int compL(int i, int lim) {
    vector<int> right;
    int j = i, sum = arr[j];
    while(j < n) {
        j = seg2.get_mn(1, n, j + 1, n, sum, 1);
        if(j == -1) break;
        right.push_back(j);
        sum += arr[j];
    }
    int mx = i;
    for(auto r : right) {
        if(r <= lim && seg1.query(1, n, i, r - 1, 1) < arr[r]) mx = max(mx, r);
    }
    return mx;
}
 
int compR(int i, int lim) {
    vector<int> left;
    int j = i, sum = arr[j];
    while(j > 1) {
        j = seg2.get_mx(1, n, 1, j - 1, sum, 1);
        if(j == -1) break;
        left.push_back(j);
        sum += arr[j];
    }
    int mn = i;
    for(auto l : left) {
        if(l >= lim && seg1.query(1, n, l + 1, i, 1) < arr[l]) mn = min(mn, l);
    }
    return mn;
}
 
void update_query(int a, int b) {
    arr[a] = b;
    seg1.update(1, n, a, b, 1);
    seg2.update(1, n, a, b, 1);
    
    seg4.erasex(1, n, a, 1);
    update(a);
    
    if(a > 1) seg4.erasex(1, n, a - 1, 1);
    if(a > 1) update(a - 1);
    
    if(a < n) seg4.erasex(1, n, a + 1, 1);
    if(a < n) update(a + 1);
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n;
    seg3.init(1, n, 1); arr[0] = arr[n + 1] = inf;
    for(int i = 1; i <= n; ++i) {
        cin >> arr[i];
        update_query(i, arr[i]);
    }
    
    cin >> q;
    while(q--) {
        int t, a, b; cin >> t >> a >> b;
        if(t == 1) update_query(a, b);
        else {
            int l = a, r = b;
            a = compL(a, r); b = compR(b, l);
            cout << seg3.query(1, n, a, b, 1).cnt << '\n';
        }
    }
    return 0;
}

Compilation message

fish2.cpp: In member function 'void SEG1::update(int, int, int, ll, int)':
fish2.cpp:22:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'll SEG1::query(int, int, int, int, int)':
fish2.cpp:30:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'void SEG2::update(int, int, int, int, int)':
fish2.cpp:42:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'int SEG2::get_mx(int, int, int, int, int, int)':
fish2.cpp:51:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'int SEG2::get_mn(int, int, int, int, ll, int)':
fish2.cpp:60:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   60 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'void SEG3::init(int, int, int)':
fish2.cpp:87:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   87 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'void SEG3::update(int, int, int, int, int, int)':
fish2.cpp:110:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  110 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'SEG3::Node SEG3::query(int, int, int, int, int)':
fish2.cpp:119:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  119 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'void SEG4::update(int, int, int, int, int)':
fish2.cpp:128:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  128 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In member function 'void SEG4::erasex(int, int, int, int)':
fish2.cpp:145:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  145 |         int mid = str + ed >> 1;
      |                   ~~~~^~~~
fish2.cpp: In function 'void update(int)':
fish2.cpp:184:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  184 |     for(auto [l, r] : range) {
      |              ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 6 ms 12756 KB Output is correct
4 Correct 6 ms 12756 KB Output is correct
5 Correct 15 ms 12884 KB Output is correct
6 Correct 10 ms 12884 KB Output is correct
7 Correct 13 ms 12908 KB Output is correct
8 Correct 13 ms 12884 KB Output is correct
9 Correct 10 ms 12888 KB Output is correct
10 Correct 9 ms 12884 KB Output is correct
11 Correct 10 ms 12884 KB Output is correct
12 Correct 12 ms 12884 KB Output is correct
13 Correct 10 ms 12916 KB Output is correct
14 Correct 13 ms 12884 KB Output is correct
15 Correct 15 ms 12888 KB Output is correct
16 Correct 14 ms 12908 KB Output is correct
17 Correct 10 ms 12884 KB Output is correct
18 Correct 9 ms 12900 KB Output is correct
19 Correct 9 ms 12920 KB Output is correct
20 Correct 8 ms 12884 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12756 KB Output is correct
2 Correct 476 ms 22468 KB Output is correct
3 Correct 973 ms 22268 KB Output is correct
4 Correct 470 ms 22500 KB Output is correct
5 Correct 985 ms 22204 KB Output is correct
6 Correct 368 ms 20704 KB Output is correct
7 Correct 1045 ms 19256 KB Output is correct
8 Correct 367 ms 20788 KB Output is correct
9 Correct 1195 ms 19248 KB Output is correct
10 Correct 1906 ms 19712 KB Output is correct
11 Correct 2227 ms 19748 KB Output is correct
12 Correct 632 ms 20296 KB Output is correct
13 Correct 591 ms 20372 KB Output is correct
14 Correct 496 ms 22588 KB Output is correct
15 Correct 512 ms 22288 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 6 ms 12756 KB Output is correct
4 Correct 6 ms 12756 KB Output is correct
5 Correct 15 ms 12884 KB Output is correct
6 Correct 10 ms 12884 KB Output is correct
7 Correct 13 ms 12908 KB Output is correct
8 Correct 13 ms 12884 KB Output is correct
9 Correct 10 ms 12888 KB Output is correct
10 Correct 9 ms 12884 KB Output is correct
11 Correct 10 ms 12884 KB Output is correct
12 Correct 12 ms 12884 KB Output is correct
13 Correct 10 ms 12916 KB Output is correct
14 Correct 13 ms 12884 KB Output is correct
15 Correct 15 ms 12888 KB Output is correct
16 Correct 14 ms 12908 KB Output is correct
17 Correct 10 ms 12884 KB Output is correct
18 Correct 9 ms 12900 KB Output is correct
19 Correct 9 ms 12920 KB Output is correct
20 Correct 8 ms 12884 KB Output is correct
21 Correct 8 ms 12756 KB Output is correct
22 Correct 476 ms 22468 KB Output is correct
23 Correct 973 ms 22268 KB Output is correct
24 Correct 470 ms 22500 KB Output is correct
25 Correct 985 ms 22204 KB Output is correct
26 Correct 368 ms 20704 KB Output is correct
27 Correct 1045 ms 19256 KB Output is correct
28 Correct 367 ms 20788 KB Output is correct
29 Correct 1195 ms 19248 KB Output is correct
30 Correct 1906 ms 19712 KB Output is correct
31 Correct 2227 ms 19748 KB Output is correct
32 Correct 632 ms 20296 KB Output is correct
33 Correct 591 ms 20372 KB Output is correct
34 Correct 496 ms 22588 KB Output is correct
35 Correct 512 ms 22288 KB Output is correct
36 Correct 456 ms 23176 KB Output is correct
37 Correct 958 ms 22480 KB Output is correct
38 Correct 922 ms 21736 KB Output is correct
39 Correct 506 ms 23188 KB Output is correct
40 Correct 920 ms 21740 KB Output is correct
41 Correct 371 ms 20672 KB Output is correct
42 Correct 357 ms 20716 KB Output is correct
43 Correct 1027 ms 19332 KB Output is correct
44 Correct 969 ms 19380 KB Output is correct
45 Correct 1999 ms 20260 KB Output is correct
46 Correct 1927 ms 19828 KB Output is correct
47 Correct 2191 ms 18672 KB Output is correct
48 Correct 611 ms 20428 KB Output is correct
49 Correct 560 ms 20456 KB Output is correct
50 Correct 502 ms 22564 KB Output is correct
51 Correct 584 ms 22316 KB Output is correct
52 Correct 503 ms 22592 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12756 KB Output is correct
2 Correct 476 ms 22468 KB Output is correct
3 Correct 973 ms 22268 KB Output is correct
4 Correct 470 ms 22500 KB Output is correct
5 Correct 985 ms 22204 KB Output is correct
6 Correct 368 ms 20704 KB Output is correct
7 Correct 1045 ms 19256 KB Output is correct
8 Correct 367 ms 20788 KB Output is correct
9 Correct 1195 ms 19248 KB Output is correct
10 Correct 1906 ms 19712 KB Output is correct
11 Correct 2227 ms 19748 KB Output is correct
12 Correct 632 ms 20296 KB Output is correct
13 Correct 591 ms 20372 KB Output is correct
14 Correct 496 ms 22588 KB Output is correct
15 Correct 512 ms 22288 KB Output is correct
16 Correct 6 ms 12756 KB Output is correct
17 Correct 1361 ms 22604 KB Output is correct
18 Correct 816 ms 23556 KB Output is correct
19 Correct 1368 ms 22856 KB Output is correct
20 Correct 1394 ms 22796 KB Output is correct
21 Correct 1378 ms 22668 KB Output is correct
22 Correct 797 ms 23664 KB Output is correct
23 Correct 1335 ms 22432 KB Output is correct
24 Correct 1472 ms 23080 KB Output is correct
25 Correct 1388 ms 22956 KB Output is correct
26 Correct 1475 ms 23040 KB Output is correct
27 Correct 496 ms 21280 KB Output is correct
28 Correct 506 ms 21304 KB Output is correct
29 Correct 506 ms 21356 KB Output is correct
30 Correct 1675 ms 19532 KB Output is correct
31 Correct 1563 ms 19516 KB Output is correct
32 Correct 2882 ms 20448 KB Output is correct
33 Correct 2174 ms 20188 KB Output is correct
34 Correct 2850 ms 19704 KB Output is correct
35 Correct 2584 ms 19184 KB Output is correct
36 Correct 2433 ms 20420 KB Output is correct
37 Correct 762 ms 20556 KB Output is correct
38 Correct 745 ms 20556 KB Output is correct
39 Correct 695 ms 23132 KB Output is correct
40 Correct 704 ms 22940 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12756 KB Output is correct
2 Correct 476 ms 22468 KB Output is correct
3 Correct 973 ms 22268 KB Output is correct
4 Correct 470 ms 22500 KB Output is correct
5 Correct 985 ms 22204 KB Output is correct
6 Correct 368 ms 20704 KB Output is correct
7 Correct 1045 ms 19256 KB Output is correct
8 Correct 367 ms 20788 KB Output is correct
9 Correct 1195 ms 19248 KB Output is correct
10 Correct 1906 ms 19712 KB Output is correct
11 Correct 2227 ms 19748 KB Output is correct
12 Correct 632 ms 20296 KB Output is correct
13 Correct 591 ms 20372 KB Output is correct
14 Correct 496 ms 22588 KB Output is correct
15 Correct 512 ms 22288 KB Output is correct
16 Correct 6 ms 12756 KB Output is correct
17 Correct 2743 ms 22660 KB Output is correct
18 Correct 1840 ms 25104 KB Output is correct
19 Correct 2504 ms 22528 KB Output is correct
20 Correct 1645 ms 24920 KB Output is correct
21 Correct 2628 ms 22692 KB Output is correct
22 Correct 1847 ms 24868 KB Output is correct
23 Correct 2871 ms 22532 KB Output is correct
24 Correct 1791 ms 24856 KB Output is correct
25 Correct 2586 ms 22464 KB Output is correct
26 Correct 713 ms 21764 KB Output is correct
27 Correct 884 ms 21980 KB Output is correct
28 Correct 1684 ms 23160 KB Output is correct
29 Correct 847 ms 21804 KB Output is correct
30 Correct 907 ms 21908 KB Output is correct
31 Correct 2661 ms 23344 KB Output is correct
32 Execution timed out 4033 ms 23880 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12756 KB Output is correct
2 Correct 6 ms 12756 KB Output is correct
3 Correct 6 ms 12756 KB Output is correct
4 Correct 6 ms 12756 KB Output is correct
5 Correct 15 ms 12884 KB Output is correct
6 Correct 10 ms 12884 KB Output is correct
7 Correct 13 ms 12908 KB Output is correct
8 Correct 13 ms 12884 KB Output is correct
9 Correct 10 ms 12888 KB Output is correct
10 Correct 9 ms 12884 KB Output is correct
11 Correct 10 ms 12884 KB Output is correct
12 Correct 12 ms 12884 KB Output is correct
13 Correct 10 ms 12916 KB Output is correct
14 Correct 13 ms 12884 KB Output is correct
15 Correct 15 ms 12888 KB Output is correct
16 Correct 14 ms 12908 KB Output is correct
17 Correct 10 ms 12884 KB Output is correct
18 Correct 9 ms 12900 KB Output is correct
19 Correct 9 ms 12920 KB Output is correct
20 Correct 8 ms 12884 KB Output is correct
21 Correct 8 ms 12756 KB Output is correct
22 Correct 476 ms 22468 KB Output is correct
23 Correct 973 ms 22268 KB Output is correct
24 Correct 470 ms 22500 KB Output is correct
25 Correct 985 ms 22204 KB Output is correct
26 Correct 368 ms 20704 KB Output is correct
27 Correct 1045 ms 19256 KB Output is correct
28 Correct 367 ms 20788 KB Output is correct
29 Correct 1195 ms 19248 KB Output is correct
30 Correct 1906 ms 19712 KB Output is correct
31 Correct 2227 ms 19748 KB Output is correct
32 Correct 632 ms 20296 KB Output is correct
33 Correct 591 ms 20372 KB Output is correct
34 Correct 496 ms 22588 KB Output is correct
35 Correct 512 ms 22288 KB Output is correct
36 Correct 456 ms 23176 KB Output is correct
37 Correct 958 ms 22480 KB Output is correct
38 Correct 922 ms 21736 KB Output is correct
39 Correct 506 ms 23188 KB Output is correct
40 Correct 920 ms 21740 KB Output is correct
41 Correct 371 ms 20672 KB Output is correct
42 Correct 357 ms 20716 KB Output is correct
43 Correct 1027 ms 19332 KB Output is correct
44 Correct 969 ms 19380 KB Output is correct
45 Correct 1999 ms 20260 KB Output is correct
46 Correct 1927 ms 19828 KB Output is correct
47 Correct 2191 ms 18672 KB Output is correct
48 Correct 611 ms 20428 KB Output is correct
49 Correct 560 ms 20456 KB Output is correct
50 Correct 502 ms 22564 KB Output is correct
51 Correct 584 ms 22316 KB Output is correct
52 Correct 503 ms 22592 KB Output is correct
53 Correct 6 ms 12756 KB Output is correct
54 Correct 1361 ms 22604 KB Output is correct
55 Correct 816 ms 23556 KB Output is correct
56 Correct 1368 ms 22856 KB Output is correct
57 Correct 1394 ms 22796 KB Output is correct
58 Correct 1378 ms 22668 KB Output is correct
59 Correct 797 ms 23664 KB Output is correct
60 Correct 1335 ms 22432 KB Output is correct
61 Correct 1472 ms 23080 KB Output is correct
62 Correct 1388 ms 22956 KB Output is correct
63 Correct 1475 ms 23040 KB Output is correct
64 Correct 496 ms 21280 KB Output is correct
65 Correct 506 ms 21304 KB Output is correct
66 Correct 506 ms 21356 KB Output is correct
67 Correct 1675 ms 19532 KB Output is correct
68 Correct 1563 ms 19516 KB Output is correct
69 Correct 2882 ms 20448 KB Output is correct
70 Correct 2174 ms 20188 KB Output is correct
71 Correct 2850 ms 19704 KB Output is correct
72 Correct 2584 ms 19184 KB Output is correct
73 Correct 2433 ms 20420 KB Output is correct
74 Correct 762 ms 20556 KB Output is correct
75 Correct 745 ms 20556 KB Output is correct
76 Correct 695 ms 23132 KB Output is correct
77 Correct 704 ms 22940 KB Output is correct
78 Correct 6 ms 12756 KB Output is correct
79 Correct 2743 ms 22660 KB Output is correct
80 Correct 1840 ms 25104 KB Output is correct
81 Correct 2504 ms 22528 KB Output is correct
82 Correct 1645 ms 24920 KB Output is correct
83 Correct 2628 ms 22692 KB Output is correct
84 Correct 1847 ms 24868 KB Output is correct
85 Correct 2871 ms 22532 KB Output is correct
86 Correct 1791 ms 24856 KB Output is correct
87 Correct 2586 ms 22464 KB Output is correct
88 Correct 713 ms 21764 KB Output is correct
89 Correct 884 ms 21980 KB Output is correct
90 Correct 1684 ms 23160 KB Output is correct
91 Correct 847 ms 21804 KB Output is correct
92 Correct 907 ms 21908 KB Output is correct
93 Correct 2661 ms 23344 KB Output is correct
94 Execution timed out 4033 ms 23880 KB Time limit exceeded
95 Halted 0 ms 0 KB -