oj.uz

Submission #595942

# Submission time Handle Problem Language Result Execution time Memory
595942 2022-07-14T08:16:37 Z 이동현(#8445) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 25648 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 = 700;
    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;
        if(ask[i][0] > ask[i][1]) lst[0] = lst[(n - 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();
            };
            doque(x), doque(y);
            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(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;
}

Compilation message

sushi.cpp: In lambda function:
sushi.cpp:80:30: warning: unused variable 'yr' [-Wunused-variable]
   80 |             int yl = yb * B, yr = min(n, yl + B);
      |                              ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 468 KB Output is correct
2 Correct 8 ms 468 KB Output is correct
3 Correct 9 ms 572 KB Output is correct
4 Correct 10 ms 468 KB Output is correct
5 Correct 8 ms 468 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 4 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 9 ms 468 KB Output is correct
11 Correct 84 ms 528 KB Output is correct
12 Correct 81 ms 540 KB Output is correct
13 Correct 58 ms 536 KB Output is correct
14 Correct 13 ms 468 KB Output is correct
15 Correct 14 ms 564 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 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 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 5251 ms 21316 KB Output is correct
2 Correct 5184 ms 21224 KB Output is correct
3 Correct 145 ms 21020 KB Output is correct
4 Correct 5256 ms 21264 KB Output is correct
5 Correct 7347 ms 21316 KB Output is correct
6 Correct 7181 ms 21268 KB Output is correct
7 Correct 7295 ms 21332 KB Output is correct
8 Correct 7165 ms 21288 KB Output is correct
9 Correct 187 ms 21212 KB Output is correct
10 Correct 5657 ms 21224 KB Output is correct
11 Correct 228 ms 21096 KB Output is correct
12 Correct 6044 ms 21192 KB Output is correct
13 Correct 5691 ms 21224 KB Output is correct
14 Correct 6235 ms 21236 KB Output is correct
15 Correct 209 ms 21104 KB Output is correct
16 Correct 6065 ms 21224 KB Output is correct
17 Correct 8591 ms 21312 KB Output is correct
18 Correct 7291 ms 21224 KB Output is correct
19 Correct 6953 ms 21284 KB Output is correct
20 Correct 7429 ms 21212 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 468 KB Output is correct
2 Correct 8 ms 468 KB Output is correct
3 Correct 9 ms 572 KB Output is correct
4 Correct 10 ms 468 KB Output is correct
5 Correct 8 ms 468 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 4 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 9 ms 468 KB Output is correct
11 Correct 84 ms 528 KB Output is correct
12 Correct 81 ms 540 KB Output is correct
13 Correct 58 ms 536 KB Output is correct
14 Correct 13 ms 468 KB Output is correct
15 Correct 14 ms 564 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 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 5251 ms 21316 KB Output is correct
24 Correct 5184 ms 21224 KB Output is correct
25 Correct 145 ms 21020 KB Output is correct
26 Correct 5256 ms 21264 KB Output is correct
27 Correct 7347 ms 21316 KB Output is correct
28 Correct 7181 ms 21268 KB Output is correct
29 Correct 7295 ms 21332 KB Output is correct
30 Correct 7165 ms 21288 KB Output is correct
31 Correct 187 ms 21212 KB Output is correct
32 Correct 5657 ms 21224 KB Output is correct
33 Correct 228 ms 21096 KB Output is correct
34 Correct 6044 ms 21192 KB Output is correct
35 Correct 5691 ms 21224 KB Output is correct
36 Correct 6235 ms 21236 KB Output is correct
37 Correct 209 ms 21104 KB Output is correct
38 Correct 6065 ms 21224 KB Output is correct
39 Correct 8591 ms 21312 KB Output is correct
40 Correct 7291 ms 21224 KB Output is correct
41 Correct 6953 ms 21284 KB Output is correct
42 Correct 7429 ms 21212 KB Output is correct
43 Correct 4575 ms 25576 KB Output is correct
44 Correct 4544 ms 25492 KB Output is correct
45 Correct 4705 ms 25348 KB Output is correct
46 Correct 4692 ms 25496 KB Output is correct
47 Correct 4431 ms 25520 KB Output is correct
48 Correct 11399 ms 25596 KB Output is correct
49 Correct 11897 ms 25512 KB Output is correct
50 Execution timed out 12099 ms 25648 KB Time limit exceeded
51 Halted 0 ms 0 KB -