結果
| 問題 | No.1405 ジグザグロボット |
| ユーザー |
 hotman78
|
| 提出日時 | 2021-04-05 02:05:05 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,679 bytes |
| コンパイル時間 | 4,219 ms |
| コンパイル使用メモリ | 249,004 KB |
| 実行使用メモリ | 4,500 KB |
| 最終ジャッジ日時 | 2023-08-28 13:29:44 |
| 合計ジャッジ時間 | 11,767 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 2 ms
4,376 KB |
| testcase_03 | AC | 1 ms
4,380 KB |
| testcase_04 | AC | 2 ms
4,380 KB |
| testcase_05 | AC | 2 ms
4,376 KB |
| testcase_06 | AC | 2 ms
4,376 KB |
| testcase_07 | WA | - |
| testcase_08 | AC | 2 ms
4,376 KB |
| testcase_09 | WA | - |
| testcase_10 | AC | 2 ms
4,376 KB |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | AC | 2 ms
4,376 KB |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | AC | 2 ms
4,376 KB |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | AC | 2 ms
4,376 KB |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | AC | 3 ms
4,376 KB |
| testcase_32 | AC | 2 ms
4,376 KB |
| testcase_33 | AC | 2 ms
4,376 KB |
| testcase_34 | AC | 2 ms
4,376 KB |
| testcase_35 | AC | 3 ms
4,376 KB |
| testcase_36 | AC | 2 ms
4,380 KB |
| testcase_37 | AC | 2 ms
4,380 KB |
ソースコード
#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 return vector(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 2 "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;
priority_queue<tuple<lint,lint,lint,lint,lint>,vector<tuple<lint,lint,lint,lint,lint>>,greater<tuple<lint,lint,lint,lint,lint>>>que;
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);
};
rep(i,cnt-1){
que.emplace(get(merge(vv[i],vv[i+1]))-get(vv[i])-get(vv[i+1]),i,i,i+1,i+1);
}
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,ny=-1,now=0;
while(now<cnt_mx){
lint px=nx;
if(nx==x){
ny++;
ans.emplace_back(x-1,ny);
ans.emplace_back(x+1,ny);
}else if(nx+vv[now].second-vv[now].first>x){
lint p=0,q=0,r=0;
rep(i,spos[now],now+1==cnt_mx?n:spos[now+1]){
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;
ny++;
rep(i,px-1,nx){
ans.emplace_back(i,ny+1);
}
rep(i,0,ny)ans.emplace_back(x+r-q+1,i);
}else{
nx+=vv[now].second-vv[now].first;
ny++;
rep(i,px-1,nx){
ans.emplace_back(i,ny+1);
}
}
now=edge[now]+1;
}
rep(i,n)ans.emplace_back(i,y+1);
if(x!=nx||y!=ny){
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;
// }
}