結果

問題 No.1888 Odd Insertion
ユーザー 👑 potato167
提出日時 2022-03-25 22:56:29
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 5,280 bytes
コンパイル時間 2,153 ms
コンパイル使用メモリ 213,224 KB
最終ジャッジ日時 2025-01-28 12:28:23
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
namespace po167{
template <class T,T (*op)(T,T),T(*e)()>
struct segment_tree{
    int _n,size;
    std::vector<T> seg;
    int ceil_pow2(int a){
        int b=1;
        while(a>b){
            b<<=1;
        }
        return b;
    }
    void update(int k){seg[k]=op(seg[k*2],seg[k*2+1]);};
    segment_tree(int n) :_n(n){
        size=ceil_pow2(n);
        seg=std::vector<T>(size*2,e());
    }
    segment_tree(std::vector<T> &p) :_n((int) p.size()){
        size=ceil_pow2(_n);
        seg=std::vector<T>(size*2,e());
        for(int i=0;i<_n;i++) seg[i+size]=p[i];
        for(int i=size-1;i>0;i--) update(i);
    }
    void set(int ind,T val){
        assert(0<=ind&&ind<_n);
        ind+=size;
        seg[ind]=val;
        while(ind!=1){
            ind>>=1;
            update(ind);
        }
    }
    void addl(int ind,T val){
        set(ind,op(get(ind),val));
    }
    void addr(int ind,T val){
        set(ind,op(val,get(ind)));
    }
    T get(int ind){
        assert(0<=ind&&ind<_n);
        return seg[ind+size];
    }
    T query(int l,int r){
        assert(0<=l&&l<=r&&r<=_n);
        T l_val=e();
        T r_val=e();
        l+=size,r+=size;
        while(l<r){
            if(l&1) l_val=op(l_val,seg[l]),l+=1;
            if(r&1) r-=1,r_val=op(seg[r],r_val);
            r>>=1;
            l>>=1;
        }
        return op(l_val,r_val);
    }
    template <bool (*f)(T)> int max_right(int l) {
        return max_right(l, [](T x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0<=l&&l<=_n);
        assert(f(e()));
        if(f(query(l,_n))) return _n;
        T val=e();
        l+=size;
        while(true){
            while(l%2==0) l>>=1;
            if(!f(op(val,seg[l]))){
                while(l<size){
                    l*=2;
                    if(f(op(val,seg[l]))){
                        val=op(val,seg[l]);
                        l++;
                    }
                }
                return l-size;
            }
            val=op(val,seg[l]);
            l++;
        }
    }
    template <bool (*f)(T)> int min_left(int r) {
        return min_left(r, [](T x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        T sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(seg[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(seg[r], sm))) {
                        sm = op(seg[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(seg[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
};
}
using po167::segment_tree;
using F= int;
F op_sum(F a,F b){return a+b;}
F op_min(F a,F b){return min(a,b);}
F e(){return 0;}
F e_min(){return INF;}
int target;
bool f(F x){
    return (x%target==0);
}
void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,t) solve();
}
void solve(){
    int N;
    cin>>N;
    vector<int> p(N),rev(1+N);
    rep(i,N) cin>>p[i],p[i]--,rev[p[i]]=i;
    vector<int> B(N+1);
    segment_tree<F,op_sum,e> seg(N);
    rep(i,N){
        B[i]=(1+seg.query(0,rev[i]))%2;
        seg.set(rev[i],1);
        //cout<<i<<" "<<B[i]<<endl;
    }
    segment_tree<F,op_min,e_min> odd(N),even(N);
    rep(i,N){
        if(B[i]) odd.set(rev[i],i);
        else even.set(rev[i],i);
    }
    vector<queue<pair<int,int>>> q(2);//from,to
    vector<int> front(N+1,-1);
    int SUM=0;
    rep(i,N+1){
        //cout<<i<<endl;
        if(B[i]){
            //SUM^=1;
            odd.set(rev[i],e_min());
        }else if(i!=N) even.set(rev[i],e_min());
        //cout<<i<<endl;
        rep(j,2){
            //cout<<i<<" "<<j<<" "<<q[j].size()<<endl;
            while(!q[j].empty()&&q[j].front().second<i){
                q[j].pop();
            }
        }
        //cout<<i<<endl;
        if(i!=0&&q[SUM].empty()){
            SUM^=B[i];
            continue;
        }
        if(i!=0) front[i]=q[SUM].front().first;
        SUM^=B[i];
        int X=min(even.query(0,rev[i]),odd.query(rev[i],N));
        //cout<<i<<" "<<X<<"\n";
        q[SUM^B[i]^1].push({i,X});
    }
    if(front[N]==-1){
        yneos(0);
        return;
    }
    vector<int> order(N);
    rep(i,N) order[i]=i;
    int ind=N;
    while(front[ind]!=-1){
        for(int j=front[ind];j<ind-1;j++){
            swap(order[j],order[j+1]);
        }
        ind=front[ind];
        /*cout<<"#"<<ind<<" ";
        vec_out(order);*/
    }
    //cout<<"\n";
    rep(i,N) seg.set(i,0);
    //rep(i,N+1) cout<<i<<" "<<front[i]<<"\n";
    yneos(1);
    rep(i,N){
        cout<<order[i]+1<<" ";
        cout<<seg.query(0,rev[order[i]])+1<<"\n";
        seg.set(rev[order[i]],1);
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0