oj.uz

Submission #595981

# Submission time Handle Problem Language Result Execution time Memory
595981 2022-07-14T08:32:25 Z 이동현(#8445) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 24920 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

const int BS = 1000;
multiset<int> num[BS];
multiset<int> que[BS];
int ask[25004][3], lst[BS];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int B = 800;
    int n, q; cin >> n >> q;
    //n = 400000, q = 25000;
    vector<int> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i];
       // a[i] = i + 1;
        num[i / B].insert(a[i]);
    }
    for(int i = 0; i < q; ++i){
        cin >> ask[i][0] >> ask[i][1] >> ask[i][2];
        lst[ask[i][0] / B] = lst[ask[i][1] / B] = i;
    }
    for(int qq = 0; qq < q; ++qq){
        int x, y, k;
        x = ask[qq][0] - 1, y = ask[qq][1] - 1, k = ask[qq][2];
       // x = 0, y = n - 1, k = q + 300;
        auto sol = [&](int x, int y, int k)->int{
            auto doque = [&](int pos)->void{
                int bp = pos / B;
                if(!(int)que[bp].size()){
                    return;
                }
                int l = bp * B, r = min(n, l + B);
                if((int)que[bp].size() == 1){
                    int val = *que[bp].begin();
                    for(int i = l; i < r; ++i) if(val < a[i]) swap(val, a[i]);
                }
                else if((int)que[bp].size() == 2){
                    int v1 = *que[bp].begin(), v2 = *(--que[bp].end());
                    for(int i = l; i < r; ++i){
                        if(v1 < a[i]) swap(v1, a[i]);
                        if(v2 < a[i]) swap(v2, a[i]);
                    }
                }
                else if((int)que[bp].size() == 3){
                    int v1 = *que[bp].begin(), v2 = *(--(--que[bp].end())), v3 = *(--que[bp].end());
                    for(int i = l; i < r; ++i){
                        if(v1 < a[i]) swap(v1, a[i]);
                        if(v2 < a[i]) swap(v2, a[i]);
                        if(v3 < a[i]) swap(v3, a[i]);
                    }
                }
                else if((int)que[bp].size() == 4){
                    int v1 = *que[bp].begin(), v2 = *(++que[bp].begin()), v3 = *(--(--que[bp].end())), v4 = *(--que[bp].end());
                    for(int i = l; i < r; ++i){
                        if(v1 < a[i]) swap(v1, a[i]);
                        if(v2 < a[i]) swap(v2, a[i]);
                        if(v3 < a[i]) swap(v3, a[i]);
                        if(v4 < a[i]) swap(v4, a[i]);
                    }
                }
                else{
                    for(int i = l; i < r; ++i){
                        que[bp].insert(a[i]);
                        a[i] = *(que[bp].begin());
                        que[bp].erase(que[bp].begin());
                    }
                }
                que[bp].clear();
            };
            int xb = x / B, yb = y / B;
            int xl = xb * B, xr = min(n, xl + B);
            int yl = yb * B, yr = min(n, yl + B);
            if(xl < x) doque(x);
            if(y + 1 < yr) doque(y);
            if(x == xl) --xb, xl -= B, xr -= B;
            if(y + 1 == yr) ++yb, yl += B, yr += B;

            if(xb < yb){
                for(int i = x; i < xr; ++i){
                    if(a[i] > k){
                        auto p = num[xb].lower_bound(a[i]);
                        num[xb].erase(p);
                        swap(a[i], k);
                        num[xb].insert(a[i]);
                    }
                }
                for(int i = xb + 1; i < yb; ++i){
                    if(lst[i] > qq) que[i].insert(k);
                    //if(k < *(--num[i].end())){
                        num[i].insert(k);
                        k = *(--num[i].end());
                        num[i].erase(--num[i].end());
                    //}
                }
                for(int i = yl; i <= y; ++i){
                    if(a[i] > k){
                        auto p = num[yb].lower_bound(a[i]);
                        num[yb].erase(p);
                        swap(a[i], k);
                        num[yb].insert(a[i]);
                    }
                }
            }
            else{
                for(int i = x; i <= y; ++i){
                    if(a[i] > k){
                        auto p = num[xb].lower_bound(a[i]);
                        num[xb].erase(p);
                        swap(a[i], k);
                        num[xb].insert(a[i]);
                    }
                }
            }
            return k;
        };
        //if(x <= y) sol(x, y, k);
        //else sol(0, y, sol(x, n - 1, k));
        if(x <= y) cout << sol(x, y, k) << '\n';
        else cout << sol(0, y, sol(x, n - 1, k)) << '\n';
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 468 KB Output is correct
2 Correct 8 ms 468 KB Output is correct
3 Correct 8 ms 556 KB Output is correct
4 Correct 8 ms 468 KB Output is correct
5 Correct 7 ms 468 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 10 ms 468 KB Output is correct
10 Correct 8 ms 468 KB Output is correct
11 Correct 60 ms 552 KB Output is correct
12 Correct 59 ms 552 KB Output is correct
13 Correct 47 ms 556 KB Output is correct
14 Correct 14 ms 468 KB Output is correct
15 Correct 15 ms 560 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5024 ms 23728 KB Output is correct
2 Correct 5354 ms 23584 KB Output is correct
3 Correct 3960 ms 23440 KB Output is correct
4 Correct 5093 ms 23564 KB Output is correct
5 Correct 4182 ms 22448 KB Output is correct
6 Correct 4452 ms 23604 KB Output is correct
7 Correct 4319 ms 23560 KB Output is correct
8 Correct 4382 ms 23816 KB Output is correct
9 Correct 3469 ms 23488 KB Output is correct
10 Correct 4148 ms 22520 KB Output is correct
11 Correct 3469 ms 23480 KB Output is correct
12 Correct 4215 ms 23644 KB Output is correct
13 Correct 5277 ms 23680 KB Output is correct
14 Correct 5452 ms 23704 KB Output is correct
15 Correct 3997 ms 22456 KB Output is correct
16 Correct 5228 ms 23836 KB Output is correct
17 Correct 4322 ms 23780 KB Output is correct
18 Correct 4500 ms 23856 KB Output is correct
19 Correct 4535 ms 23632 KB Output is correct
20 Correct 4415 ms 22588 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 468 KB Output is correct
2 Correct 8 ms 468 KB Output is correct
3 Correct 8 ms 556 KB Output is correct
4 Correct 8 ms 468 KB Output is correct
5 Correct 7 ms 468 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 10 ms 468 KB Output is correct
10 Correct 8 ms 468 KB Output is correct
11 Correct 60 ms 552 KB Output is correct
12 Correct 59 ms 552 KB Output is correct
13 Correct 47 ms 556 KB Output is correct
14 Correct 14 ms 468 KB Output is correct
15 Correct 15 ms 560 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 5024 ms 23728 KB Output is correct
24 Correct 5354 ms 23584 KB Output is correct
25 Correct 3960 ms 23440 KB Output is correct
26 Correct 5093 ms 23564 KB Output is correct
27 Correct 4182 ms 22448 KB Output is correct
28 Correct 4452 ms 23604 KB Output is correct
29 Correct 4319 ms 23560 KB Output is correct
30 Correct 4382 ms 23816 KB Output is correct
31 Correct 3469 ms 23488 KB Output is correct
32 Correct 4148 ms 22520 KB Output is correct
33 Correct 3469 ms 23480 KB Output is correct
34 Correct 4215 ms 23644 KB Output is correct
35 Correct 5277 ms 23680 KB Output is correct
36 Correct 5452 ms 23704 KB Output is correct
37 Correct 3997 ms 22456 KB Output is correct
38 Correct 5228 ms 23836 KB Output is correct
39 Correct 4322 ms 23780 KB Output is correct
40 Correct 4500 ms 23856 KB Output is correct
41 Correct 4535 ms 23632 KB Output is correct
42 Correct 4415 ms 22588 KB Output is correct
43 Correct 5306 ms 24920 KB Output is correct
44 Correct 5313 ms 24564 KB Output is correct
45 Correct 5824 ms 24272 KB Output is correct
46 Correct 5220 ms 24572 KB Output is correct
47 Correct 5080 ms 24676 KB Output is correct
48 Execution timed out 12091 ms 24632 KB Time limit exceeded
49 Halted 0 ms 0 KB -