oj.uz

Submission #791316

# Submission time Handle Problem Language Result Execution time Memory
791316 2023-07-24T01:23:28 Z eltu0815 Fish 2 (JOI22_fish2) C++14
25 / 100
 4000 ms 4932 KB 
#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define inf (1987654321)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
int n, q;
int arr[100005], l[100005], r[100005], ord[100005], chk[100005];
ll sum[100005];
pii tmp[100005];

void update_sum() {
    for(int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + arr[i];
}

void update_sort(int idx) {
    int j = 0, k = 0;
    for(int i = 1; i <= n; ++i) if(ord[i] == idx) j = i;
    for(int i = j; i < n; ++i) ord[i] = ord[i + 1];
    for(int i = 1; i < n; ++i) if(arr[ord[i]] >= arr[idx]) k = i;
    for(int i = n; i > k + 1; --i) ord[i] = ord[i - 1];
    ord[k + 1] = idx;
}

void update_r() {
    stack<int> st;
    for(int i = 1; i <= n; ++i) r[i] = n + 1;
    for(int i = 1; i <= n; ++i) {
        while(!st.empty() && arr[st.top()] < arr[i]) {
            r[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
}

void update_l() {
    stack<int> st;
    for(int i = 1; i <= n; ++i) l[i] = 0;
    for(int i = n; i >= 1; --i) {
        while(!st.empty() && arr[st.top()] < arr[i]) {
            l[st.top()] = i;
            st.pop();
        }
        st.push(i);
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> arr[i];
    for(int i = 1; i <= n; ++i) tmp[i] = {arr[i], i};
    sort(tmp + 1, tmp + n + 1, greater<pii>());
    for(int i = 1; i <= n; ++i) ord[i] = tmp[i].second;
    update_sum(); update_l(); update_r();
    
    cin >> q;
    while(q--) {
        int t, a, b; cin >> t >> a >> b;
        if(t == 1) {
            arr[a] = b;
            update_sum(); update_l(); update_r();
            update_sort(a);
        }
        else {
            int ans = 0;
            for(int i = 1; i <= n; ++i) chk[i] = 0;
            for(int i = 1; i <= n; ++i) {
                if(ord[i] < a || ord[i] > b) continue;
                int lv = l[ord[i]] >= a ? arr[l[ord[i]]] : -1, li = max(l[ord[i]], a - 1);
                int rv = r[ord[i]] <= b ? arr[r[ord[i]]] : -1, ri = min(r[ord[i]], b + 1);
                ll sumv = sum[ri - 1] - sum[li];
                if(lv == -1 && rv == -1) chk[ord[i]] = 1;
                else if(lv != -1 && chk[li] && sumv >= lv) chk[ord[i]] = 1;
                else if(rv != -1 && chk[ri] && sumv >= rv) chk[ord[i]] = 1;
                ans += chk[ord[i]];
            }
            cout << ans << '\n';
        }
    }
    
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 2 ms 352 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 336 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 17 ms 3700 KB Output is correct
3 Correct 15 ms 3804 KB Output is correct
4 Correct 18 ms 3812 KB Output is correct
5 Correct 16 ms 3840 KB Output is correct
6 Correct 19 ms 3840 KB Output is correct
7 Correct 15 ms 3804 KB Output is correct
8 Correct 25 ms 3812 KB Output is correct
9 Correct 17 ms 3804 KB Output is correct
10 Correct 21 ms 3808 KB Output is correct
11 Correct 15 ms 3728 KB Output is correct
12 Correct 20 ms 3796 KB Output is correct
13 Correct 18 ms 3804 KB Output is correct
14 Correct 18 ms 3796 KB Output is correct
15 Correct 19 ms 3800 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 2 ms 352 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 17 ms 3700 KB Output is correct
23 Correct 15 ms 3804 KB Output is correct
24 Correct 18 ms 3812 KB Output is correct
25 Correct 16 ms 3840 KB Output is correct
26 Correct 19 ms 3840 KB Output is correct
27 Correct 15 ms 3804 KB Output is correct
28 Correct 25 ms 3812 KB Output is correct
29 Correct 17 ms 3804 KB Output is correct
30 Correct 21 ms 3808 KB Output is correct
31 Correct 15 ms 3728 KB Output is correct
32 Correct 20 ms 3796 KB Output is correct
33 Correct 18 ms 3804 KB Output is correct
34 Correct 18 ms 3796 KB Output is correct
35 Correct 19 ms 3800 KB Output is correct
36 Correct 793 ms 4432 KB Output is correct
37 Correct 621 ms 4180 KB Output is correct
38 Correct 346 ms 4300 KB Output is correct
39 Correct 1026 ms 4436 KB Output is correct
40 Correct 398 ms 4152 KB Output is correct
41 Correct 1377 ms 4808 KB Output is correct
42 Correct 1010 ms 4932 KB Output is correct
43 Correct 982 ms 4048 KB Output is correct
44 Correct 501 ms 4052 KB Output is correct
45 Correct 815 ms 4412 KB Output is correct
46 Correct 699 ms 4308 KB Output is correct
47 Correct 302 ms 4120 KB Output is correct
48 Correct 1970 ms 4096 KB Output is correct
49 Correct 529 ms 4092 KB Output is correct
50 Correct 1124 ms 4456 KB Output is correct
51 Correct 1557 ms 4464 KB Output is correct
52 Correct 1091 ms 4460 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 17 ms 3700 KB Output is correct
3 Correct 15 ms 3804 KB Output is correct
4 Correct 18 ms 3812 KB Output is correct
5 Correct 16 ms 3840 KB Output is correct
6 Correct 19 ms 3840 KB Output is correct
7 Correct 15 ms 3804 KB Output is correct
8 Correct 25 ms 3812 KB Output is correct
9 Correct 17 ms 3804 KB Output is correct
10 Correct 21 ms 3808 KB Output is correct
11 Correct 15 ms 3728 KB Output is correct
12 Correct 20 ms 3796 KB Output is correct
13 Correct 18 ms 3804 KB Output is correct
14 Correct 18 ms 3796 KB Output is correct
15 Correct 19 ms 3800 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Execution timed out 4022 ms 3964 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 17 ms 3700 KB Output is correct
3 Correct 15 ms 3804 KB Output is correct
4 Correct 18 ms 3812 KB Output is correct
5 Correct 16 ms 3840 KB Output is correct
6 Correct 19 ms 3840 KB Output is correct
7 Correct 15 ms 3804 KB Output is correct
8 Correct 25 ms 3812 KB Output is correct
9 Correct 17 ms 3804 KB Output is correct
10 Correct 21 ms 3808 KB Output is correct
11 Correct 15 ms 3728 KB Output is correct
12 Correct 20 ms 3796 KB Output is correct
13 Correct 18 ms 3804 KB Output is correct
14 Correct 18 ms 3796 KB Output is correct
15 Correct 19 ms 3800 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Execution timed out 4059 ms 4580 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 4 ms 340 KB Output is correct
16 Correct 2 ms 352 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 17 ms 3700 KB Output is correct
23 Correct 15 ms 3804 KB Output is correct
24 Correct 18 ms 3812 KB Output is correct
25 Correct 16 ms 3840 KB Output is correct
26 Correct 19 ms 3840 KB Output is correct
27 Correct 15 ms 3804 KB Output is correct
28 Correct 25 ms 3812 KB Output is correct
29 Correct 17 ms 3804 KB Output is correct
30 Correct 21 ms 3808 KB Output is correct
31 Correct 15 ms 3728 KB Output is correct
32 Correct 20 ms 3796 KB Output is correct
33 Correct 18 ms 3804 KB Output is correct
34 Correct 18 ms 3796 KB Output is correct
35 Correct 19 ms 3800 KB Output is correct
36 Correct 793 ms 4432 KB Output is correct
37 Correct 621 ms 4180 KB Output is correct
38 Correct 346 ms 4300 KB Output is correct
39 Correct 1026 ms 4436 KB Output is correct
40 Correct 398 ms 4152 KB Output is correct
41 Correct 1377 ms 4808 KB Output is correct
42 Correct 1010 ms 4932 KB Output is correct
43 Correct 982 ms 4048 KB Output is correct
44 Correct 501 ms 4052 KB Output is correct
45 Correct 815 ms 4412 KB Output is correct
46 Correct 699 ms 4308 KB Output is correct
47 Correct 302 ms 4120 KB Output is correct
48 Correct 1970 ms 4096 KB Output is correct
49 Correct 529 ms 4092 KB Output is correct
50 Correct 1124 ms 4456 KB Output is correct
51 Correct 1557 ms 4464 KB Output is correct
52 Correct 1091 ms 4460 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Execution timed out 4022 ms 3964 KB Time limit exceeded
55 Halted 0 ms 0 KB -