oj.uz

Submission #595856

# Submission time Handle Problem Language Result Execution time Memory
595856 2022-07-14T07:42:53 Z 이동현(#8445) Sushi (JOI16_sushi) C++17
5 / 100
 12000 ms 260568 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 = 1950;
    int n, q; cin >> n >> q;
    vector<int> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        num[i / B].insert(a[i]);
    }
    while(q--){
        int x, y, k; cin >> x >> y >> k; --x, --y;
        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);
                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:40:30: warning: unused variable 'yr' [-Wunused-variable]
   40 |             int yl = yb * B, yr = min(n, yl + B);
      |                              ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 468 KB Output is correct
2 Correct 11 ms 468 KB Output is correct
3 Correct 11 ms 520 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 520 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 10 ms 536 KB Output is correct
10 Correct 10 ms 468 KB Output is correct
11 Correct 100 ms 468 KB Output is correct
12 Correct 99 ms 520 KB Output is correct
13 Correct 85 ms 512 KB Output is correct
14 Correct 12 ms 468 KB Output is correct
15 Correct 14 ms 532 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 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 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7083 ms 260428 KB Output is correct
2 Correct 6898 ms 260520 KB Output is correct
3 Correct 3655 ms 260396 KB Output is correct
4 Correct 6856 ms 260496 KB Output is correct
5 Correct 9515 ms 260484 KB Output is correct
6 Correct 11303 ms 260456 KB Output is correct
7 Correct 11031 ms 260436 KB Output is correct
8 Correct 11358 ms 260540 KB Output is correct
9 Correct 3965 ms 260520 KB Output is correct
10 Correct 3616 ms 260380 KB Output is correct
11 Correct 3915 ms 260288 KB Output is correct
12 Correct 3820 ms 260456 KB Output is correct
13 Correct 7866 ms 260428 KB Output is correct
14 Correct 7965 ms 260396 KB Output is correct
15 Correct 3993 ms 260220 KB Output is correct
16 Correct 7362 ms 260568 KB Output is correct
17 Correct 9730 ms 260392 KB Output is correct
18 Execution timed out 12092 ms 260424 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 468 KB Output is correct
2 Correct 11 ms 468 KB Output is correct
3 Correct 11 ms 520 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 520 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 10 ms 536 KB Output is correct
10 Correct 10 ms 468 KB Output is correct
11 Correct 100 ms 468 KB Output is correct
12 Correct 99 ms 520 KB Output is correct
13 Correct 85 ms 512 KB Output is correct
14 Correct 12 ms 468 KB Output is correct
15 Correct 14 ms 532 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 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 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 7083 ms 260428 KB Output is correct
24 Correct 6898 ms 260520 KB Output is correct
25 Correct 3655 ms 260396 KB Output is correct
26 Correct 6856 ms 260496 KB Output is correct
27 Correct 9515 ms 260484 KB Output is correct
28 Correct 11303 ms 260456 KB Output is correct
29 Correct 11031 ms 260436 KB Output is correct
30 Correct 11358 ms 260540 KB Output is correct
31 Correct 3965 ms 260520 KB Output is correct
32 Correct 3616 ms 260380 KB Output is correct
33 Correct 3915 ms 260288 KB Output is correct
34 Correct 3820 ms 260456 KB Output is correct
35 Correct 7866 ms 260428 KB Output is correct
36 Correct 7965 ms 260396 KB Output is correct
37 Correct 3993 ms 260220 KB Output is correct
38 Correct 7362 ms 260568 KB Output is correct
39 Correct 9730 ms 260392 KB Output is correct
40 Execution timed out 12092 ms 260424 KB Time limit exceeded
41 Halted 0 ms 0 KB -