結果
| 問題 | No.1405 ジグザグロボット |
| ユーザー |
 hotman78
|
| 提出日時 | 2021-04-05 21:26:53 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 185 ms / 3,153 ms |
| コード長 | 15,873 bytes |
| コンパイル時間 | 19,057 ms |
| コンパイル使用メモリ | 320,328 KB |
| 最終ジャッジ日時 | 2025-01-20 12:02:11 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 35 |
ソースコード
#line 2 "cpplib/util/template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("avx2")#include<bits/stdc++.h>using namespace std;struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;typedef long long lint;#define INF (1LL<<60)#define IINF (1<<30)#define EPS (1e-10)#define endl ('\n')typedef vector<lint> vec;typedef vector<vector<lint>> mat;typedef vector<vector<vector<lint>>> mat3;typedef vector<string> svec;typedef vector<vector<string>> smat;template<typename T>using V=vector<T>;template<typename T>using VV=V<V<T>>;template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}template<typename T>inline void output2(T t){for(auto i:t)output(i);}template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}#define loop(n) for(long long _=0;_<(long long)(n);++_)#define _overload4(_1,_2,_3,_4,name,...) name#define __rep(i,a) repi(i,0,a,1)#define _rep(i,a,b) repi(i,a,b,1)#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)#define _overload3_rev(_1,_2,_3,name,...) name#define _rep_rev(i,a) repi_rev(i,0,a)#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)// #define rep(i,...) for(auto i:range(__VA_ARGS__))// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)// #define irep(i) for(lint i=0;;++i)// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}#define all(n) begin(n),end(n)template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}const vector<lint> dx={1,0,-1,0,1,1,-1,-1};const vector<lint> dy={0,1,0,-1,1,-1,1,-1};#define SUM(v) accumulate(all(v),0LL)template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else returnvector(arg,make_vector<T>(x,args...));}#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))#define bit(n,a) ((n>>a)&1)vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}using graph=vector<vector<int>>;template<typename T>using graph_w=vector<vector<pair<int,T>>>;template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}#line 3 "cpplib/alga/maybe.hpp"/*** @brief Maybe* @see https://ja.wikipedia.org/wiki/%E3%83%A2%E3%83%8A%E3%83%89_(%E3%83%97%E3%83%AD%E3%82%B0%E3%83%A9%E3%83%9F%E3%83%B3%E3%82%B0)#Maybe%E3%83%A2%E3%83%8A%E3%83%89*/template<typename T>struct maybe{bool _is_none;T val;maybe():_is_none(true){}maybe(T val):_is_none(false),val(val){}T unwrap()const{assert(!_is_none);return val;}T unwrap_or(T e)const{return _is_none?e:val;}bool is_none()const{return _is_none;}bool is_some()const{return !_is_none;}};template<typename T,typename F>auto expand(F op){return [&op](const maybe<T>& s,const maybe<T>& t){if(s.is_none())return t;if(t.is_none())return s;return maybe<T>(op(s.unwrap(),t.unwrap()));};}#line 4 "cpplib/segment_tree/segment_tree.hpp"/*** @brief セグメント木* @see https://en.wikipedia.org/wiki/Segment_tree*/template<typename T,typename F>class segment_tree{maybe<T>* node;F op;int n=1;public:segment_tree(){}segment_tree(int sz,F op=F()):op(op){while(n<=sz)n<<=1;node=new maybe<T>[n*2];for(int i=0;i<n*2;i++)node[i]=maybe<T>();}segment_tree(const std::vector<T>&v,F op=F()):op(op){auto f=expand<T,F>(op);const int sz=v.size();while(n<=sz)n<<=1;node=new maybe<T>[n*2]();for(int i=0;i<sz;i++)node[i+n]=maybe<T>(v[i]);for(int i=n-1;i>=1;i--)node[i]=f(node[i*2],node[i*2+1]);}maybe<T> get(int l,int r){auto f=expand<T,F>(op);l+=n;r+=n;maybe<T> s,t;while(l<r){if(l&1)s=f(s,node[l++]);if(r&1)t=f(node[--r],t);l>>=1;r>>=1;}return f(s,t);}void apply(int t,T _val){auto f=expand<T,F>(op);t+=n;maybe<T> val=maybe<T>(_val);while(t){node[t]=f(node[t],val);t=t>>1;}}void apply_left(int t,T _val){auto f=expand<T,F>(op);t+=n;maybe<T> val=maybe<T>(_val);while(t){node[t]=f(val,node[t]);t=t>>1;}}void change(int t,T val){auto f=expand<T,F>(op);t+=n;node[t]=maybe<T>(val);while(t>1){t=t>>1;node[t]=f(node[t*2],node[t*2+1]);}}};#line 3 "cpplib/math/binary_search.hpp"/*** @brief 二分探索*/template<typename F,typename T=long long>T bs(T mn,T mx,F func){mn--;mx++;while(mx-mn>1){T mid=(mn+mx)/2;if(!func(mid))mx=mid;else mn=mid;}return mn;}#line 1 "cpplib/DP/monotone_minima.hpp"//monotoneな二変数関数に対して各行の最小値を求めるtemplate<typename T,typename F>std::vector<int> monotone_minima(int h,int w,T inf,F f){std::vector<int>ret(h);auto g=[&](auto g,int a,int b,int c,int d,T inf,auto f)->void{int e=(a+b)/2,idx=0;T mn=inf;for(int i=c;i<d;++i){if(mn>f(e,i))mn=f(e,i),idx=i;}ret[e]=idx;if(b>a+1){g(g,a,e,c,idx+1,inf,f);g(g,e,b,idx,d,inf,f);}};g(g,0,h,0,w,inf,f);return ret;}#line 5 "code.cpp"int main(){lint n,x,y;cin>>n>>x>>y;string s;cin>>s;vector<tuple<lint,lint,lint,lint,lint>>v;lint p=0,q=0,cnt=0,cnt_mx=0;vec edge;vector<lint>spos;vector<pair<lint,lint>> vv;if(count(all(s),'S')<y){cout<<-1<<endl;return 0;}rep(i,n){if(s[i]=='S'){spos.push_back(i);edge.push_back(cnt);vv.push_back(make_pair(p,q));cnt++;cnt_mx++;p=q=0;}if(s[i]=='R'){q++;chmin(p,q);}if(s[i]=='L'){q--;chmin(p,q);}}edge.push_back(cnt);vv.push_back(make_pair(p,q));cnt++;cnt_mx++;auto get=[&](pair<lint,lint>x){return x.second-x.first;};auto merge=[&](pair<lint,lint>s,pair<lint,lint>t){return make_pair(min(s.first,s.second+t.first),s.second+t.second);};// auto dp=make_vector<lint>(-INF,cnt+1,y+2);// auto pre=make_vector<lint>(-1,cnt+1,y+2);// dp[0][0]=0;// rep(k,y+1)rep(i,cnt){// auto now=make_pair(0LL,0LL);// rep(j,i,cnt){// now=merge(now,vv[j]);// if(chmax(dp[j+1][k+1],dp[i][k]+(now.second-now.first))){// pre[j+1][k+1]=i;// }// }// }segment_tree<pair<lint,lint>,decltype(merge)>seg(vv,merge);// rep(_,1000){// vec v={rand()%cnt,rand()%cnt,rand()%cnt,rand()%cnt};// sort(all(v));// if(v[0]==v[1]||v[1]==v[2]||v[2]==v[3])continue;// auto p=get(seg.get(v[0],v[3]).unwrap())+get(seg.get(v[1],v[2]).unwrap());// auto q=get(seg.get(v[0],v[2]).unwrap())+get(seg.get(v[1],v[3]).unwrap());// assert(p-q<=0);// }lint pena=bs(-n,n,[&](lint x){vector<lint>dp(cnt+1,-INF);vector<lint>d(cnt+1,-INF);dp[0]=0;d[0]=0;auto dfs=[&](auto dfs,lint l,lint r)->void{if(r-l==1)return;lint m=(l+r)/2;dfs(dfs,l,m);auto res=monotone_minima(r-m,m-l,INF,[&](lint p,lint q){return -dp[q+l]-get(seg.get(q+l,p+m).unwrap());});rep(i,r-m){if(chmax(dp[i+m],dp[res[i]+l]+get(seg.get(res[i]+l,i+m).unwrap())-x)){d[i+m]=d[res[i]+l]+1;}}dfs(dfs,m,r);};dfs(dfs,0,cnt+1);return d[cnt]>y+1;})+1;vector<lint>a,b;{vector<lint>dp(cnt+1,-INF);vector<lint>d(cnt+1,-INF);vector<lint>from(cnt+1,-1);dp[0]=0;d[0]=0;auto dfs=[&](auto dfs,lint l,lint r)->void{if(r-l==1)return;lint m=(l+r)/2;dfs(dfs,l,m);auto res=monotone_minima(r-m,m-l,make_pair(INF,INF),[&](lint p,lint q)->pair<lint,lint>{return make_pair(-dp[q+l]-get(seg.get(q+l,p+m).unwrap()),d[q+l]);});rep(i,r-m){if(make_pair(dp[i+m],-d[i+m])<make_pair(dp[res[i]+l]+get(seg.get(res[i]+l,i+m).unwrap())-pena,-d[res[i]+l]-1)){dp[i+m]=dp[res[i]+l]+get(seg.get(res[i]+l,i+m).unwrap())-pena;d[i+m]=d[res[i]+l]+1;from[i+m]=res[i]+l;}}dfs(dfs,m,r);};dfs(dfs,0,cnt+1);lint now=cnt;while(now!=-1){a.push_back(now);now=from[now];}reverse(all(a));}{vector<lint>dp(cnt+1,-INF);vector<lint>d(cnt+1,-INF);vector<lint>from(cnt+1,-1);dp[0]=0;d[0]=0;auto dfs=[&](auto dfs,lint l,lint r)->void{if(r-l==1)return;lint m=(l+r)/2;dfs(dfs,l,m);auto res=monotone_minima(r-m,m-l,make_pair(INF,INF),[&](lint p,lint q)->pair<lint,lint>{return make_pair(-dp[q+l]-get(seg.get(q+l,p+m).unwrap()),d[q+l]);});rep(i,r-m){if(make_pair(dp[i+m],-d[i+m])<make_pair(dp[res[i]+l]+get(seg.get(res[i]+l,i+m).unwrap())-pena,-d[res[i]+l]+1)){dp[i+m]=dp[res[i]+l]+get(seg.get(res[i]+l,i+m).unwrap())-pena;d[i+m]=d[res[i]+l]-1;from[i+m]=res[i]+l;}}dfs(dfs,m,r);};dfs(dfs,0,cnt+1);lint now=cnt;while(now!=-1){b.push_back(now);now=from[now];}reverse(all(b));}vec c,d;lint ai=0,bi=0;while(ai<(int)a.size()||bi<(int)b.size()){if((int)a.size()-ai+(int)c.size()==y+2||(int)b.size()-bi+(int)d.size()==y+2){if(ai<(int)a.size())c.push_back(a[ai++]);if(bi<(int)b.size())d.push_back(b[bi++]);}else if(ai<(int)a.size()&&bi+1<(int)b.size()&&a[ai]==b[bi+1]){c.push_back(a[ai++]);d.push_back(b[bi++]);d.push_back(b[bi++]);c.swap(d);}else if(ai<(int)a.size()&&bi+1<(int)b.size()&&a[ai]>b[bi+1]){d.push_back(b[bi++]);c.swap(d);}else{if(ai<(int)a.size())c.push_back(a[ai++]);if(bi<(int)b.size())d.push_back(b[bi++]);}}vec vvv(y+1),ll(y+1),rr(y+1);{if((int)c.size()!=y+2){c.swap(d);}rep(i,c.size()-1){vvv[i]=get(seg.get(c[i],c[i+1]).unwrap());ll[i]=c[i];rr[i]=c[i+1];}}// {// lint now=cnt;// for(lint i=y+1;i>=1;--i){// auto tmp=make_pair(0LL,0LL);// for(int j=pre[now][i];j<now;++j){// tmp=merge(tmp,vv[j]);// }// vvv.push_back(tmp.second-tmp.first);// ll.push_back(pre[now][i]);// rr.push_back(now);// now=pre[now][i];// }// }// reverse(all(vvv));// reverse(all(ll));// reverse(all(rr));// while(cnt>y+1){// auto [cost,l,r,p,q]=que.top();// que.pop();// if(edge[l]!=r||edge[r]!=l){// continue;// }// if(edge[p]!=q||edge[q]!=p){// continue;// }// cnt--;// if(r+1==p){// edge[l]=q;// edge[q]=l;// if(l!=r)edge[r]=-1;// if(p!=q)edge[p]=-1;// vv[l]=vv[q]=merge(vv[l],vv[q]);// if(l!=r)vv[r]=make_pair(-1,-1);// if(p!=q)vv[p]=make_pair(-1,-1);// if(l!=0){// que.emplace(get(merge(vv[l],vv[l-1]))-get(vv[l])-get(vv[l-1]),l,q,edge[l-1],l-1);// }// if(q!=cnt_mx-1){// que.emplace(get(merge(vv[q],vv[q+1]))-get(vv[q])-get(vv[q+1]),l,q,q+1,edge[q+1]);// }// }else{// edge[r]=p;// edge[p]=r;// if(l!=r)edge[l]=-1;// if(p!=q)edge[q]=-1;// vv[r]=vv[p]=merge(vv[r],vv[p]);// if(l!=r)vv[l]=make_pair(-1,-1);// if(p!=q)vv[q]=make_pair(-1,-1);// if(p!=0){// que.emplace(get(merge(vv[p],vv[p-1]))-get(vv[p])-get(vv[p-1]),p,r,edge[p-1],p-1);// }// if(r!=cnt_mx-1){// que.emplace(get(merge(vv[r],vv[r+1]))-get(vv[r])-get(vv[r+1]),p,r,r+1,edge[r+1]);// }// }// }vector<pair<lint,lint>> ans;ans.emplace_back(-1,0);lint nx=0;for(int ny=0;ny<=y;++ny){lint px=nx;if(nx==x){ans.emplace_back(x-1,ny);ans.emplace_back(x+1,ny);}else if(nx+vvv[ny]>x){lint p=0,q=0,r=0;rep(i,ll[ny],rr[ny]){if(s[i]=='R'){q++;chmax(r,q);if(chmin(p,q)){r=0;}}if(s[i]=='L'){q--;chmax(r,q);if(chmin(p,q)){r=0;}}}nx=x;rep(i,px-1,nx){ans.emplace_back(i,ny+1);}rep(i,0,ny+1)ans.emplace_back(x+r-q+1,i);rep(i,x+1,x+r-q+1)ans.emplace_back(i,ny+1);}else{nx+=vvv[ny];rep(i,px-1,nx){ans.emplace_back(i,ny+1);}}}rep(i,n)ans.emplace_back(i,y+1);if(x!=nx){cout<<-1<<endl;return 0;}cout<<ans.size()<<endl;for(auto [s,t]:ans){cout<<s<<" "<<t<<endl;}// vector<string> ma(n+2,string(n+1,'.'));// for(auto [nx,ny]:ans){// ma[ny][nx+1]='#';// }// rep(i,n+2){// cout<<ma[i]<<endl;// }}