oj.uz

답안 #785853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785853 2023-07-17T16:25:41 Z bachhoangxuan Sushi (JOI16_sushi) C++17
100 / 100
 3605 ms 79708 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
//#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
//const int inf=1e18;
const int mod=1e9+7;
const int maxn=400005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
/*
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
*/
const int base=101;
int n,q,a[maxn];
struct block{
    priority_queue<int> pq;
    vector<int> add;
    int lt,rt;
    void build(){
        if(add.empty()) return;
        priority_queue<int,vector<int>,greater<int>> qq;
        for(int x:add) qq.push(x);
        for(int i=lt;i<=rt;i++){
            int x=qq.top();
            if(x<a[i]) qq.pop(),qq.push(a[i]),a[i]=x;
        }
        add.clear();
    }
    int update(int l,int r,int p){
        if(r<lt || rt<l) return p;
        if(l<=lt && rt<=r){
            int Max=pq.top();
            if(p<Max) pq.pop(),pq.push(p),add.push_back(p);
            return max(Max,p);
        }
        else{
            build();
            while(!pq.empty()) pq.pop();
            for(int i=max(lt,l);i<=min(rt,r);i++) if(p<a[i]) swap(a[i],p);
            for(int i=lt;i<=rt;i++) pq.push(a[i]);
            return p;
        }
    }
}ss[maxs];

void solve(){
    cin >> n >> q;
    for(int i=0;i<=(n-1)/bl;i++) ss[i].lt=i*bl,ss[i].rt=min(n,(i+1)*bl)-1;
    for(int i=0;i<n;i++) cin >> a[i],ss[i/bl].pq.push(a[i]);
    while(q--){
        int s,t,p;cin >> s >> t >> p;s--;t--;
        if(s<=t){
            for(int i=0;i<=(n-1)/bl;i++) p=ss[i].update(s,t,p);
        }
        else{
            for(int i=0;i<=(n-1)/bl;i++) p=ss[i].update(s,n-1,p);
            for(int i=0;i<=(n-1)/bl;i++) p=ss[i].update(0,t,p);
        }
        cout << p << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 340 KB Output is correct
2 Correct 138 ms 448 KB Output is correct
3 Correct 139 ms 452 KB Output is correct
4 Correct 138 ms 448 KB Output is correct
5 Correct 139 ms 420 KB Output is correct
6 Correct 141 ms 416 KB Output is correct
7 Correct 39 ms 340 KB Output is correct
8 Correct 39 ms 340 KB Output is correct
9 Correct 139 ms 448 KB Output is correct
10 Correct 140 ms 440 KB Output is correct
11 Correct 141 ms 460 KB Output is correct
12 Correct 143 ms 440 KB Output is correct
13 Correct 148 ms 452 KB Output is correct
14 Correct 144 ms 448 KB Output is correct
15 Correct 147 ms 460 KB Output is correct
16 Correct 81 ms 448 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 372 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 372 KB Output is correct
22 Correct 0 ms 368 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 947 ms 75992 KB Output is correct
2 Correct 921 ms 76364 KB Output is correct
3 Correct 83 ms 4596 KB Output is correct
4 Correct 950 ms 76472 KB Output is correct
5 Correct 611 ms 75788 KB Output is correct
6 Correct 931 ms 75844 KB Output is correct
7 Correct 918 ms 75988 KB Output is correct
8 Correct 902 ms 75892 KB Output is correct
9 Correct 93 ms 4720 KB Output is correct
10 Correct 602 ms 71556 KB Output is correct
11 Correct 84 ms 4660 KB Output is correct
12 Correct 594 ms 72564 KB Output is correct
13 Correct 954 ms 76340 KB Output is correct
14 Correct 1006 ms 75812 KB Output is correct
15 Correct 91 ms 4552 KB Output is correct
16 Correct 939 ms 76296 KB Output is correct
17 Correct 600 ms 75744 KB Output is correct
18 Correct 883 ms 75844 KB Output is correct
19 Correct 921 ms 75832 KB Output is correct
20 Correct 901 ms 75820 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 340 KB Output is correct
2 Correct 138 ms 448 KB Output is correct
3 Correct 139 ms 452 KB Output is correct
4 Correct 138 ms 448 KB Output is correct
5 Correct 139 ms 420 KB Output is correct
6 Correct 141 ms 416 KB Output is correct
7 Correct 39 ms 340 KB Output is correct
8 Correct 39 ms 340 KB Output is correct
9 Correct 139 ms 448 KB Output is correct
10 Correct 140 ms 440 KB Output is correct
11 Correct 141 ms 460 KB Output is correct
12 Correct 143 ms 440 KB Output is correct
13 Correct 148 ms 452 KB Output is correct
14 Correct 144 ms 448 KB Output is correct
15 Correct 147 ms 460 KB Output is correct
16 Correct 81 ms 448 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 372 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 372 KB Output is correct
22 Correct 0 ms 368 KB Output is correct
23 Correct 947 ms 75992 KB Output is correct
24 Correct 921 ms 76364 KB Output is correct
25 Correct 83 ms 4596 KB Output is correct
26 Correct 950 ms 76472 KB Output is correct
27 Correct 611 ms 75788 KB Output is correct
28 Correct 931 ms 75844 KB Output is correct
29 Correct 918 ms 75988 KB Output is correct
30 Correct 902 ms 75892 KB Output is correct
31 Correct 93 ms 4720 KB Output is correct
32 Correct 602 ms 71556 KB Output is correct
33 Correct 84 ms 4660 KB Output is correct
34 Correct 594 ms 72564 KB Output is correct
35 Correct 954 ms 76340 KB Output is correct
36 Correct 1006 ms 75812 KB Output is correct
37 Correct 91 ms 4552 KB Output is correct
38 Correct 939 ms 76296 KB Output is correct
39 Correct 600 ms 75744 KB Output is correct
40 Correct 883 ms 75844 KB Output is correct
41 Correct 921 ms 75832 KB Output is correct
42 Correct 901 ms 75820 KB Output is correct
43 Correct 2266 ms 9548 KB Output is correct
44 Correct 2288 ms 9704 KB Output is correct
45 Correct 1043 ms 5724 KB Output is correct
46 Correct 2275 ms 9624 KB Output is correct
47 Correct 2332 ms 9704 KB Output is correct
48 Correct 3372 ms 11240 KB Output is correct
49 Correct 3605 ms 11248 KB Output is correct
50 Correct 3601 ms 11312 KB Output is correct
51 Correct 3597 ms 11224 KB Output is correct
52 Correct 2287 ms 10548 KB Output is correct
53 Correct 2250 ms 10324 KB Output is correct
54 Correct 3185 ms 13616 KB Output is correct
55 Correct 3395 ms 13836 KB Output is correct
56 Correct 3399 ms 13768 KB Output is correct
57 Correct 3427 ms 13752 KB Output is correct
58 Correct 2231 ms 14216 KB Output is correct
59 Correct 2261 ms 14188 KB Output is correct
60 Correct 1735 ms 79708 KB Output is correct
61 Correct 2272 ms 79656 KB Output is correct
62 Correct 2241 ms 79668 KB Output is correct
63 Correct 2220 ms 79704 KB Output is correct
64 Correct 643 ms 5584 KB Output is correct
65 Correct 1428 ms 42052 KB Output is correct
66 Correct 1423 ms 42612 KB Output is correct
67 Correct 1815 ms 47916 KB Output is correct
68 Correct 2359 ms 47840 KB Output is correct
69 Correct 2371 ms 47784 KB Output is correct
70 Correct 2318 ms 47844 KB Output is correct