oj.uz

답안 #595933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595933 2022-07-14T08:11:30 Z 이동현(#8445) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 23420 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 = 1000;
    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 468 KB Output is correct
2 Correct 11 ms 548 KB Output is correct
3 Correct 9 ms 468 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 552 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 8 ms 528 KB Output is correct
11 Correct 98 ms 548 KB Output is correct
12 Correct 105 ms 548 KB Output is correct
13 Correct 83 ms 548 KB Output is correct
14 Correct 13 ms 556 KB Output is correct
15 Correct 16 ms 556 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 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 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 4686 ms 21316 KB Output is correct
2 Correct 5034 ms 21344 KB Output is correct
3 Correct 164 ms 20988 KB Output is correct
4 Correct 4318 ms 21224 KB Output is correct
5 Correct 10330 ms 21196 KB Output is correct
6 Correct 8985 ms 21192 KB Output is correct
7 Correct 10647 ms 21256 KB Output is correct
8 Correct 9189 ms 21244 KB Output is correct
9 Correct 140 ms 21068 KB Output is correct
10 Correct 6481 ms 21208 KB Output is correct
11 Correct 153 ms 21068 KB Output is correct
12 Correct 6663 ms 21180 KB Output is correct
13 Correct 4354 ms 21308 KB Output is correct
14 Correct 4936 ms 21248 KB Output is correct
15 Correct 154 ms 21040 KB Output is correct
16 Correct 4680 ms 21284 KB Output is correct
17 Correct 10179 ms 21300 KB Output is correct
18 Correct 8231 ms 21200 KB Output is correct
19 Correct 8430 ms 21284 KB Output is correct
20 Correct 8722 ms 21196 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 468 KB Output is correct
2 Correct 11 ms 548 KB Output is correct
3 Correct 9 ms 468 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 552 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 11 ms 468 KB Output is correct
10 Correct 8 ms 528 KB Output is correct
11 Correct 98 ms 548 KB Output is correct
12 Correct 105 ms 548 KB Output is correct
13 Correct 83 ms 548 KB Output is correct
14 Correct 13 ms 556 KB Output is correct
15 Correct 16 ms 556 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 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 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 4686 ms 21316 KB Output is correct
24 Correct 5034 ms 21344 KB Output is correct
25 Correct 164 ms 20988 KB Output is correct
26 Correct 4318 ms 21224 KB Output is correct
27 Correct 10330 ms 21196 KB Output is correct
28 Correct 8985 ms 21192 KB Output is correct
29 Correct 10647 ms 21256 KB Output is correct
30 Correct 9189 ms 21244 KB Output is correct
31 Correct 140 ms 21068 KB Output is correct
32 Correct 6481 ms 21208 KB Output is correct
33 Correct 153 ms 21068 KB Output is correct
34 Correct 6663 ms 21180 KB Output is correct
35 Correct 4354 ms 21308 KB Output is correct
36 Correct 4936 ms 21248 KB Output is correct
37 Correct 154 ms 21040 KB Output is correct
38 Correct 4680 ms 21284 KB Output is correct
39 Correct 10179 ms 21300 KB Output is correct
40 Correct 8231 ms 21200 KB Output is correct
41 Correct 8430 ms 21284 KB Output is correct
42 Correct 8722 ms 21196 KB Output is correct
43 Correct 4070 ms 23400 KB Output is correct
44 Correct 4002 ms 23412 KB Output is correct
45 Correct 4179 ms 23188 KB Output is correct
46 Correct 3851 ms 23396 KB Output is correct
47 Correct 3965 ms 23420 KB Output is correct
48 Execution timed out 12092 ms 23396 KB Time limit exceeded
49 Halted 0 ms 0 KB -