#809781 (C++17) No.2107 Entangled LIS

提出ソース
結果

問題	No.2107 Entangled LIS
ユーザー	👑 tute7627
提出日時	2022-10-21 23:55:47
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	46 ms / 2,000 ms
コード長	9,663 bytes
コンパイル時間	2,392 ms
コンパイル使用メモリ	209,328 KB
実行使用メモリ	12,112 KB
最終ジャッジ日時	2023-09-14 00:02:20
合計ジャッジ時間	4,321 ms
ジャッジサーバーID （参考情報）	judge11 / judge14
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	30 ms 4,376 KB
testcase_02	AC	35 ms 4,376 KB
testcase_03	AC	19 ms 4,376 KB
testcase_04	AC	22 ms 4,380 KB
testcase_05	AC	31 ms 4,376 KB
testcase_06	AC	36 ms 5,676 KB
testcase_07	AC	38 ms 8,180 KB
testcase_08	AC	46 ms 12,112 KB
testcase_09	AC	45 ms 11,720 KB
testcase_10	AC	27 ms 7,848 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
  return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
  vector<T>inv(ord.size());
  for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
  return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge():id(-1){};
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
  Graph<T>ret(g.size());
  for(int i=0;i<g.size();i++){
    for(auto e:g[i]){
      int to = e.to;
      e.to = i;
      ret[to].push_back(e);
    }
  }
  return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v;
    T w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll t;cin>>t;
  while(t--){
    ll n,a,b;cin>>n>>a>>b;
    string s;cin>>s;
    vector<ll>v(n);
    rep(i,0,n){
        if(s[i]=='a')v[i]=0;
        else v[i]=1;
    }
    bool rev=false;
    if(a<b){
        rev=true;
        swap(a,b);
        rep(i,0,n)v[i]^=1;        
    }
    vector<ll>x(n),y(n);
    if(a==b){
        rep(i,0,n){
            x[i]=2*i+1+!v[i];
            y[i]=2*i+1+v[i];
        }
        //debug(x);
        //debug(y);
        reverse(x.begin(),x.begin()+n-a+1);
        reverse(y.begin(),y.begin()+n-a+1);
    }
    else if(b==1){
        vector<ll>l(n+1),r(n+1);
        rep(i,0,n)l[i+1]=l[i]+v[i];
        rrep(i,0,n)r[i]=r[i+1]+!v[i];
        ll mx=0,idx=-1;
        rep(i,0,n+1){
            if(chmax(mx,l[i]+r[i]))idx=i;
        }
        ll rval=r[idx];
        if(mx<a){
            x.clear();
        }
        else{
            ll l=1,r=2*n;
            rep(i,0,n)if(v[i]==0)x[i]=r--;
            rrep(i,0,n)if(v[i]==1)x[i]=l++;
            rep(i,0,n)y[i]=r--;
            vector<ll>vl,vr;
            rrep(i,0,idx){
                if(v[i]==1&&a>(rval>0)){
                    vl.push_back(i);
                    a--;
                }
            }
            rep(i,idx,n){
                if(v[i]==0&&a>0){
                    vr.push_back(i);
                    a--;
                }
            }
            //cout<<idx spa rval spa a<<endl;
            //debug(vl);
            //debug(vr);
            reverse(ALL(vl));
            rep(i,0,vl.size())if(vl[i]<vl[vl.size()-i-1]){
                swap(x[vl[i]],x[vl[vl.size()-i-1]]);
            }
            rep(i,0,vr.size())if(vr[i]<vr[vr.size()-i-1]){
                swap(x[vr[i]],x[vr[vr.size()-i-1]]);
            }
        }
    }
    else{
        ll m=n;
        while(b>2){
            m--;
            x[m]=2*m+1+!v[m];
            y[m]=2*m+1+v[m];
            a--;
            b--;
        }
        ll inc=0;
        rep(i,0,m){
            if(v[i]==inc)inc++;
        }
        if(inc<=1){
            m--;
            x[m]=2*m+1+!v[m];
            y[m]=2*m+1+v[m];
            a--;
            b--;
        }
        ll l=1,r=2*m;
        rep(i,0,m)if(v[i]==1)y[i]=r--;
        rrep(i,0,m)if(v[i]==0)y[i]=l++;
        //debug(y);
        rep(i,0,m){
            x[i]=l++;
        }
        reverse(x.begin(),x.begin()+m-a+1);
    }
    if(!x.empty()){
        rep(i,0,n)if(v[i]^(x[i]<y[i]))swap(x[i],y[i]);
        cout<<"Yes"<<endl;
        if(rev)swap(x,y);
        debug(x);
        debug(y);
    }
    else{
        cout<<"No"<<endl;
    }
  }
  return 0;
}
yukicoder

結果

テストケース

ソースコード
