oj.uz

답안 #595954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595954 2022-07-14T08:20:19 Z 이동현(#8445) Sushi (JOI16_sushi) C++17
20 / 100
 9004 ms 55744 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 = 600;
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 552 KB Output is correct
2 Correct 11 ms 568 KB Output is correct
3 Correct 8 ms 468 KB Output is correct
4 Correct 14 ms 572 KB Output is correct
5 Correct 9 ms 556 KB Output is correct
6 Correct 9 ms 468 KB Output is correct
7 Correct 4 ms 556 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 14 ms 468 KB Output is correct
10 Correct 11 ms 552 KB Output is correct
11 Correct 70 ms 548 KB Output is correct
12 Correct 72 ms 552 KB Output is correct
13 Correct 63 ms 556 KB Output is correct
14 Correct 19 ms 468 KB Output is correct
15 Correct 16 ms 572 KB Output is correct
16 Correct 2 ms 540 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 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 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5935 ms 21288 KB Output is correct
2 Correct 6010 ms 21332 KB Output is correct
3 Correct 157 ms 21068 KB Output is correct
4 Correct 6519 ms 21312 KB Output is correct
5 Correct 8615 ms 21284 KB Output is correct
6 Correct 7801 ms 21288 KB Output is correct
7 Correct 7466 ms 21432 KB Output is correct
8 Correct 7556 ms 21416 KB Output is correct
9 Correct 236 ms 21096 KB Output is correct
10 Correct 6538 ms 21180 KB Output is correct
11 Correct 247 ms 21576 KB Output is correct
12 Correct 6100 ms 22368 KB Output is correct
13 Correct 6278 ms 23156 KB Output is correct
14 Correct 6999 ms 22420 KB Output is correct
15 Correct 177 ms 21748 KB Output is correct
16 Correct 6892 ms 22996 KB Output is correct
17 Correct 9004 ms 23148 KB Output is correct
18 Correct 8575 ms 23096 KB Output is correct
19 Correct 8199 ms 23212 KB Output is correct
20 Correct 7693 ms 23076 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 552 KB Output is correct
2 Correct 11 ms 568 KB Output is correct
3 Correct 8 ms 468 KB Output is correct
4 Correct 14 ms 572 KB Output is correct
5 Correct 9 ms 556 KB Output is correct
6 Correct 9 ms 468 KB Output is correct
7 Correct 4 ms 556 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 14 ms 468 KB Output is correct
10 Correct 11 ms 552 KB Output is correct
11 Correct 70 ms 548 KB Output is correct
12 Correct 72 ms 552 KB Output is correct
13 Correct 63 ms 556 KB Output is correct
14 Correct 19 ms 468 KB Output is correct
15 Correct 16 ms 572 KB Output is correct
16 Correct 2 ms 540 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 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 1 ms 340 KB Output is correct
23 Correct 5935 ms 21288 KB Output is correct
24 Correct 6010 ms 21332 KB Output is correct
25 Correct 157 ms 21068 KB Output is correct
26 Correct 6519 ms 21312 KB Output is correct
27 Correct 8615 ms 21284 KB Output is correct
28 Correct 7801 ms 21288 KB Output is correct
29 Correct 7466 ms 21432 KB Output is correct
30 Correct 7556 ms 21416 KB Output is correct
31 Correct 236 ms 21096 KB Output is correct
32 Correct 6538 ms 21180 KB Output is correct
33 Correct 247 ms 21576 KB Output is correct
34 Correct 6100 ms 22368 KB Output is correct
35 Correct 6278 ms 23156 KB Output is correct
36 Correct 6999 ms 22420 KB Output is correct
37 Correct 177 ms 21748 KB Output is correct
38 Correct 6892 ms 22996 KB Output is correct
39 Correct 9004 ms 23148 KB Output is correct
40 Correct 8575 ms 23096 KB Output is correct
41 Correct 8199 ms 23212 KB Output is correct
42 Correct 7693 ms 23076 KB Output is correct
43 Correct 4701 ms 28916 KB Output is correct
44 Correct 4808 ms 28180 KB Output is correct
45 Correct 4722 ms 27328 KB Output is correct
46 Correct 5753 ms 28284 KB Output is correct
47 Runtime error 4991 ms 55744 KB Execution killed with signal 6
48 Halted 0 ms 0 KB -