oj.uz

Submission #595892

# Submission time Handle Problem Language Result Execution time Memory
595892 2022-07-14T07:55:27 Z 이동현(#8445) Sushi (JOI16_sushi) C++17
5 / 100
 12000 ms 259680 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];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int B = 1960;
    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]);
    }
    while(q--){
        int x, y, k; cin >> x >> y >> k; --x, --y;
       // 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{
                    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){
                    que[i].insert(k);
                    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:49:30: warning: unused variable 'yr' [-Wunused-variable]
   49 |             int yl = yb * B, yr = min(n, yl + B);
      |                              ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 512 KB Output is correct
2 Correct 9 ms 468 KB Output is correct
3 Correct 11 ms 556 KB Output is correct
4 Correct 10 ms 508 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 9 ms 568 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 540 KB Output is correct
9 Correct 10 ms 596 KB Output is correct
10 Correct 8 ms 556 KB Output is correct
11 Correct 111 ms 568 KB Output is correct
12 Correct 102 ms 560 KB Output is correct
13 Correct 78 ms 576 KB Output is correct
14 Correct 13 ms 596 KB Output is correct
15 Correct 16 ms 468 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 412 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 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
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6647 ms 259588 KB Output is correct
2 Correct 6804 ms 259680 KB Output is correct
3 Correct 3879 ms 259276 KB Output is correct
4 Correct 6912 ms 259576 KB Output is correct
5 Correct 8720 ms 259328 KB Output is correct
6 Execution timed out 12074 ms 250812 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 512 KB Output is correct
2 Correct 9 ms 468 KB Output is correct
3 Correct 11 ms 556 KB Output is correct
4 Correct 10 ms 508 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 9 ms 568 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 3 ms 540 KB Output is correct
9 Correct 10 ms 596 KB Output is correct
10 Correct 8 ms 556 KB Output is correct
11 Correct 111 ms 568 KB Output is correct
12 Correct 102 ms 560 KB Output is correct
13 Correct 78 ms 576 KB Output is correct
14 Correct 13 ms 596 KB Output is correct
15 Correct 16 ms 468 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 1 ms 412 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 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 6647 ms 259588 KB Output is correct
24 Correct 6804 ms 259680 KB Output is correct
25 Correct 3879 ms 259276 KB Output is correct
26 Correct 6912 ms 259576 KB Output is correct
27 Correct 8720 ms 259328 KB Output is correct
28 Execution timed out 12074 ms 250812 KB Time limit exceeded
29 Halted 0 ms 0 KB -