結果
問題 | No.1508 Avoid being hit |
ユーザー |
![]() |
提出日時 | 2021-05-14 23:47:52 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 101 ms / 3,000 ms |
コード長 | 6,823 bytes |
コンパイル時間 | 2,972 ms |
コンパイル使用メモリ | 205,672 KB |
実行使用メモリ | 14,336 KB |
最終ジャッジ日時 | 2024-11-15 01:05:13 |
合計ジャッジ時間 | 7,877 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:214:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 214 | auto [a,b]=jama[t]; | ^ main.cpp:217:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 217 | for(auto [A,B]:g[t]){ | ^ main.cpp:240:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 240 | for(auto [x,y]:g[i+1]){ | ^
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>// #include<ext/pb_ds/assoc_container.hpp>// #include<ext/pb_ds/tree_policy.hpp>// #include<ext/pb_ds/tag_and_trait.hpp>// using namespace __gnu_pbds;// #include<boost/multiprecision/cpp_int.hpp>// namespace multiprecisioninteger = boost::multiprecision;// using cint=multiprecisioninteger::cpp_int;using namespace std;using ll=long long;using datas=pair<ll,ll>;using ddatas=pair<long double,long double>;using tdata=pair<ll,datas>;using vec=vector<ll>;using mat=vector<vec>;using pvec=vector<datas>;using pmat=vector<pvec>;// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;#define For(i,a,b) for(i=a;i<(ll)b;++i)#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)#define rep(i,N) For(i,0,N)#define rep1(i,N) For(i,1,N)#define brep(i,N) bFor(i,N,0)#define brep1(i,N) bFor(i,N,1)#define all(v) (v).begin(),(v).end()#define allr(v) (v).rbegin(),(v).rend()#define vsort(v) sort(all(v))#define vrsort(v) sort(allr(v))#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())#define endl "\n"#define popcount __builtin_popcountll#define eb emplace_back#define print(x) cout<<x<<endl#define printyes print("Yes")#define printno print("No")#define printYES print("YES")#define printNO print("NO")#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)// constexpr ll mod=1000000007;constexpr ll mod=998244353;constexpr ll inf=1LL<<60;constexpr long double eps=1e-9;const long double PI=acosl(-1);template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}template<class T> ostream& operator<<(ostream& os,const vector<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const set<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}#ifdef DEBUGvoid debugg(){cout<<endl;}template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)#else#define debug(...) (void(0))#endifinline void startupcpp(void) noexcept{cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}// Merge:0->interval set,1->point settemplate<typename T,int Merge=1>struct rangeset:set<pair<T,T>>{private:using P=pair<T,T>;using seitr=_Rb_tree_const_iterator<P>;const T TINF=numeric_limits<T>::max()/2;public:// There are all [L,R] (not [L,R) )rangeset(){this->emplace(-TINF,-TINF);this->emplace(TINF,TINF);}// [L,R] covered?bool covered(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));return R<=itr->second;}bool covered(T x){return covered(x,x);}// what is covered [L,R] (not cover->return [-TINF,-TINF])P covered_by(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));if(R<=itr->second)return *itr;else return *(this->begin());}P covered_by(T x){return covered_by(x,x);}//insert [L,R] and merge, return (how many add point or interval)pair<seitr,T> insert(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));if(R<=itr->second)return pair<seitr,T>(itr,0);T deletecnt(0);if(itr->second<L-Merge){++itr;}else{L=itr->first;deletecnt=itr->second-itr->first+Merge;itr=this->erase(itr);}while(itr->second<=R){deletecnt+=itr->second-itr->first+Merge;itr=this->erase(itr);}if(itr->first<=R+Merge){R=itr->second;deletecnt+=itr->second-itr->first+Merge;itr=this->erase(itr);}itr=this->emplace_hint(itr,L,R);return pair<seitr,T>(itr,R-L+Merge-deletecnt);}pair<seitr,T> insert(T x){// assert(Merge==1);return insert(x,x);}//delete intersect [L,R], return (how many erase point or interval)T remove(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));if(R<=itr->second){if(itr->first<=L-Merge)this->emplace_hint(itr,itr->first,L-Merge);if(itr->second>=R+Merge)this->emplace_hint(next(itr),R+Merge,itr->second);this->erase(itr);return R-L+Merge;}T deletecnt(0);if(itr->second<=L-Merge){++itr;}else{deletecnt=itr->second-L+Merge;if(itr->first<=L-Merge)this->emplace_hint(itr,itr->first,L-Merge);itr=this->erase(itr);}while(itr->second<=R){deletecnt+=itr->second-itr->first+Merge;itr=this->erase(itr);}if(itr->first<R+Merge){deletecnt+=R-itr->first+Merge;if(R+Merge<=itr->second)this->emplace_hint(next(itr),R+Merge,itr->second);this->erase(itr);}return deletecnt;}T remove(T x){// assert(Merge==1);return remove(x,x);}T mex(T x){// assert(Merge==1);seitr itr(--this->lower_bound(P(x+1,x)));if(x<=itr->second)return itr->second+1;else return x;}vector<pair<T,T>> allpair(){seitr itr(++this->begin());vector<pair<T,T>> res;res.reserve(this->size()-1);while(itr!=this->end())res.emplace_back(*itr++);res.pop_back();return res;}};ll N,Q;int main(){ll i;cin>>N>>Q;pvec jama(Q);rep(i,Q)cin>>jama[i].first;rep(i,Q)cin>>jama[i].second;ll t;rangeset<ll> se;se.insert(0,N-1);pmat g(Q+1);rep(t,Q){auto [a,b]=jama[t];g[t]=se.allpair();debug(g[t]);for(auto [A,B]:g[t]){if(A)se.insert(A-1);if(B<N-1)se.insert(B+1);}--a;--b;if(a>b)swap(a,b);se.remove(a);se.remove(b);if(se.size()==2){printNO;return 0;}}printYES;g[t]=se.allpair();debug(g);vec ans(Q+1);reverse(all(g));debug(g);ans[0]=g[0][0].first+1;rep(i,Q){for(auto d:{-1,0,1}){auto now=ans[i]+d-1;for(auto [x,y]:g[i+1]){if(x<=now&&now<=y){ans[i+1]=now+1;break;}}}assert(ans[i+1]);}brep(i,Q+1)print(ans[i]);}