oj.uz

답안 #519506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
519506 2022-01-26T13:05:49 Z rrrr10000 Sushi (JOI16_sushi) C++14
100 / 100
 10850 ms 159324 KB 
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define popcnt __builtin_popcountll
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
const ll B=600;
vi sol(ll n,ll q,vi v,vector<PP> query){
    vi ans(q);
    vector<PQ(ll)> pq(n/B+1);
    vector<SPQ(ll)> spq(n/B+1);
    rep(i,n)pq[i/B].push(v[i]);
    auto eval=[&](ll i){
        while(pq[i].size())pq[i].pop();
        REP(j,i*B,min((i+1)*B,n)){
            spq[i].push(v[j]);
            v[j]=spq[i].top();spq[i].pop();
            pq[i].push(v[j]);
        }
        while(spq[i].size())spq[i].pop();
    };
    auto f=[&](ll l,ll r,ll c){
        eval(l/B);eval(r/B);
        rep(i,n/B+1){
            if(r<i*B||(i+1)*B<=l)continue;
            if(l<=i*B&&(i+1)*B-1<=r){
                spq[i].push(c);
                pq[i].push(c);
                c=pq[i].top();pq[i].pop();
            }
            else{
                REP(j,max(l,i*B),min(r+1,(i+1)*B))if(c<v[j])swap(c,v[j]);
                while(pq[i].size())pq[i].pop();
                REP(j,i*B,min((i+1)*B,n))pq[i].push(v[j]);
            }
        }
        return c;
    };
    rep(i,q){
        ll l,r,c;tie(l,r,c)=query[i];
        if(l>r){
            c=f(l,n-1,c);l=0;
        }
        ans[i]=f(l,r,c);
    }
    return ans;
}
int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    ll n,q;cin>>n>>q;
    vi v(n);vector<PP> query(q);
    rep(i,n)cin>>v[i];
    rep(i,q){
        ll a,b,c;cin>>a>>b>>c;
        query[i]={a-1,b-1,c};
    }
    vi res=sol(n,q,v,query);
    for(ll x:res)out(x);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 412 ms 520 KB Output is correct
2 Correct 414 ms 528 KB Output is correct
3 Correct 412 ms 460 KB Output is correct
4 Correct 407 ms 432 KB Output is correct
5 Correct 414 ms 508 KB Output is correct
6 Correct 419 ms 496 KB Output is correct
7 Correct 201 ms 460 KB Output is correct
8 Correct 191 ms 492 KB Output is correct
9 Correct 405 ms 576 KB Output is correct
10 Correct 405 ms 524 KB Output is correct
11 Correct 389 ms 524 KB Output is correct
12 Correct 392 ms 524 KB Output is correct
13 Correct 424 ms 580 KB Output is correct
14 Correct 509 ms 520 KB Output is correct
15 Correct 498 ms 452 KB Output is correct
16 Correct 256 ms 432 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 288 KB Output is correct
22 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5131 ms 159016 KB Output is correct
2 Correct 5222 ms 157788 KB Output is correct
3 Correct 2828 ms 155796 KB Output is correct
4 Correct 5030 ms 159248 KB Output is correct
5 Correct 4280 ms 159072 KB Output is correct
6 Correct 5439 ms 159108 KB Output is correct
7 Correct 5229 ms 159324 KB Output is correct
8 Correct 5530 ms 159184 KB Output is correct
9 Correct 2829 ms 155788 KB Output is correct
10 Correct 4897 ms 157716 KB Output is correct
11 Correct 2647 ms 155736 KB Output is correct
12 Correct 4748 ms 157816 KB Output is correct
13 Correct 5731 ms 158988 KB Output is correct
14 Correct 5458 ms 157740 KB Output is correct
15 Correct 2928 ms 155784 KB Output is correct
16 Correct 5430 ms 159228 KB Output is correct
17 Correct 4526 ms 159156 KB Output is correct
18 Correct 5519 ms 159284 KB Output is correct
19 Correct 5643 ms 159084 KB Output is correct
20 Correct 5645 ms 159032 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 412 ms 520 KB Output is correct
2 Correct 414 ms 528 KB Output is correct
3 Correct 412 ms 460 KB Output is correct
4 Correct 407 ms 432 KB Output is correct
5 Correct 414 ms 508 KB Output is correct
6 Correct 419 ms 496 KB Output is correct
7 Correct 201 ms 460 KB Output is correct
8 Correct 191 ms 492 KB Output is correct
9 Correct 405 ms 576 KB Output is correct
10 Correct 405 ms 524 KB Output is correct
11 Correct 389 ms 524 KB Output is correct
12 Correct 392 ms 524 KB Output is correct
13 Correct 424 ms 580 KB Output is correct
14 Correct 509 ms 520 KB Output is correct
15 Correct 498 ms 452 KB Output is correct
16 Correct 256 ms 432 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 288 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 5131 ms 159016 KB Output is correct
24 Correct 5222 ms 157788 KB Output is correct
25 Correct 2828 ms 155796 KB Output is correct
26 Correct 5030 ms 159248 KB Output is correct
27 Correct 4280 ms 159072 KB Output is correct
28 Correct 5439 ms 159108 KB Output is correct
29 Correct 5229 ms 159324 KB Output is correct
30 Correct 5530 ms 159184 KB Output is correct
31 Correct 2829 ms 155788 KB Output is correct
32 Correct 4897 ms 157716 KB Output is correct
33 Correct 2647 ms 155736 KB Output is correct
34 Correct 4748 ms 157816 KB Output is correct
35 Correct 5731 ms 158988 KB Output is correct
36 Correct 5458 ms 157740 KB Output is correct
37 Correct 2928 ms 155784 KB Output is correct
38 Correct 5430 ms 159228 KB Output is correct
39 Correct 4526 ms 159156 KB Output is correct
40 Correct 5519 ms 159284 KB Output is correct
41 Correct 5643 ms 159084 KB Output is correct
42 Correct 5645 ms 159032 KB Output is correct
43 Correct 8167 ms 24204 KB Output is correct
44 Correct 8173 ms 24080 KB Output is correct
45 Correct 4656 ms 20916 KB Output is correct
46 Correct 8231 ms 24288 KB Output is correct
47 Correct 8135 ms 24224 KB Output is correct
48 Correct 7933 ms 24296 KB Output is correct
49 Correct 8374 ms 24248 KB Output is correct
50 Correct 8479 ms 24348 KB Output is correct
51 Correct 8440 ms 24072 KB Output is correct
52 Correct 10802 ms 38240 KB Output is correct
53 Correct 10435 ms 36732 KB Output is correct
54 Correct 9901 ms 37064 KB Output is correct
55 Correct 10850 ms 36992 KB Output is correct
56 Correct 10725 ms 37272 KB Output is correct
57 Correct 10487 ms 36972 KB Output is correct
58 Correct 5355 ms 28512 KB Output is correct
59 Correct 5517 ms 28516 KB Output is correct
60 Correct 5526 ms 159116 KB Output is correct
61 Correct 6187 ms 159068 KB Output is correct
62 Correct 6223 ms 159184 KB Output is correct
63 Correct 6047 ms 159188 KB Output is correct
64 Correct 3423 ms 20856 KB Output is correct
65 Correct 5320 ms 92756 KB Output is correct
66 Correct 5231 ms 92968 KB Output is correct
67 Correct 8531 ms 129648 KB Output is correct
68 Correct 9398 ms 129656 KB Output is correct
69 Correct 9469 ms 129676 KB Output is correct
70 Correct 9527 ms 129680 KB Output is correct