結果
問題 | No.1650 Moving Coins |
ユーザー | hotman78 |
提出日時 | 2021-08-20 21:56:11 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 90 ms / 2,000 ms |
コード長 | 9,726 bytes |
コンパイル時間 | 3,453 ms |
コンパイル使用メモリ | 232,524 KB |
実行使用メモリ | 45,108 KB |
最終ジャッジ日時 | 2024-04-27 03:57:00 |
合計ジャッジ時間 | 8,468 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
10,936 KB |
testcase_01 | AC | 5 ms
10,940 KB |
testcase_02 | AC | 5 ms
11,132 KB |
testcase_03 | AC | 30 ms
17,088 KB |
testcase_04 | AC | 23 ms
15,424 KB |
testcase_05 | AC | 28 ms
16,708 KB |
testcase_06 | AC | 30 ms
15,428 KB |
testcase_07 | AC | 30 ms
16,188 KB |
testcase_08 | AC | 53 ms
18,492 KB |
testcase_09 | AC | 52 ms
18,508 KB |
testcase_10 | AC | 53 ms
18,176 KB |
testcase_11 | AC | 54 ms
17,336 KB |
testcase_12 | AC | 44 ms
16,996 KB |
testcase_13 | AC | 45 ms
17,280 KB |
testcase_14 | AC | 51 ms
17,112 KB |
testcase_15 | AC | 41 ms
17,068 KB |
testcase_16 | AC | 56 ms
18,352 KB |
testcase_17 | AC | 57 ms
17,632 KB |
testcase_18 | AC | 61 ms
18,152 KB |
testcase_19 | AC | 90 ms
45,108 KB |
testcase_20 | AC | 70 ms
19,452 KB |
testcase_21 | AC | 80 ms
33,364 KB |
testcase_22 | AC | 70 ms
18,680 KB |
testcase_23 | AC | 70 ms
19,956 KB |
testcase_24 | AC | 30 ms
15,804 KB |
testcase_25 | AC | 29 ms
16,064 KB |
testcase_26 | AC | 43 ms
14,192 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) #if __cplusplus>=201703L 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...));} #endif #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;} #if __cplusplus>=201703L constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;} #endif template<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;} template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;} template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;} template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;} #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024)); #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_); #line 5 "cpplib/math/mod_int.hpp" /** * @brief ModInt */ template<int MOD> struct mod_int { using mint=mod_int<MOD>; using u64 = std::uint_fast64_t; u64 a; constexpr mod_int(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){} constexpr u64 &value()noexcept{return a;} constexpr const u64 &value() const noexcept {return a;} constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;} constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;} constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;} constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;} constexpr mint &operator+=(const mint rhs) noexcept { a += rhs.a; if (a >= get_mod())a -= get_mod(); return *this; } constexpr mint &operator-=(const mint rhs) noexcept { if (a<rhs.a)a += get_mod(); a -= rhs.a; return *this; } constexpr mint &operator*=(const mint rhs) noexcept { a = a * rhs.a % get_mod(); return *this; } constexpr mint operator++(int) noexcept { a += 1; if (a >= get_mod())a -= get_mod(); return *this; } constexpr mint operator--(int) noexcept { if (a<1)a += get_mod(); a -= 1; return *this; } constexpr mint &operator/=(mint rhs) noexcept { u64 exp=get_mod()-2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } constexpr bool operator==(mint x) const{ return a==x.a; } constexpr bool operator!=(mint x) const{ return a!=x.a; } constexpr bool operator<(mint x) const{ return a<x.a; } constexpr bool operator>(mint x) const{ return a>x.a; } constexpr bool operator<=(mint x) const{ return a<=x.a; } constexpr bool operator>=(mint x) const{ return a>=x.a; } constexpr static int root(){ mint root = 2; while(root.pow((get_mod()-1)>>1).a==1)root++; return root.a; } constexpr mint pow(long long n)const{ long long x=a; mint ret = 1; while(n>0) { if(n&1)(ret*=x); (x*=x)%=get_mod(); n>>=1; } return ret; } constexpr mint inv(){ return pow(get_mod()-2); } static std::vector<mint> fac; static std::vector<mint> ifac; static bool init; constexpr static int mx=10000001; void build()const{ init=0; fac.resize(mx); ifac.resize(mx); fac[0]=1,ifac[0]=1; for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i; ifac[mx-1]=fac[mx-1].inv(); for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1); } mint comb(long long b){ if(init)build(); if(a<0||b<0)return 0; if(a==0&&b==0)return 1; if((long long)a<b)return 0; return fac[a]*ifac[a-b]*ifac[b]; } mint fact()const{ if(init)build(); return fac[a]; } mint fact_inv()const{ if(init)build(); return ifac[a]; } friend std::ostream& operator<<(std::ostream& lhs, const mint& rhs) noexcept { lhs << rhs.a; return lhs; } friend std::istream& operator>>(std::istream& lhs,mint& rhs) noexcept { lhs >> rhs.a; return lhs; } constexpr static bool is_static=true; constexpr static u64 get_mod(){ return MOD; } }; template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::fac; template<int MOD>std::vector<mod_int<MOD>> mod_int<MOD>::ifac; template<int MOD>bool mod_int<MOD>::init=1; #line 3 "cpplib/math/mod_int1000000007.hpp" using mint=mod_int<1'000'000'007>; constexpr int MOD=1'000'000'007; /** * @brief ModInt(1'000'000'007) */ #line 3 "main.cpp" int main(){ lint n; cin>>n; vec a(n),b(n); rep(i,n)cin>>a[i]; rep(i,n)cin>>b[i]; vec v(1010101,-1); rep(i,n){ v[a[i]]=i; } vector<pair<lint,char>>ans; rep(i,n){ auto dfs=[&](auto dfs,lint idx)->void{ if(idx<b[v[idx]]){ if(v[idx+1]!=-1){ dfs(dfs,idx+1); } ans.emplace_back(v[idx]+1,'R'); a[v[idx]]=idx+1; v[idx+1]=v[idx]; v[idx]=-1; dfs(dfs,idx+1); }else if(b[v[idx]]<idx){ if(v[idx-1]!=-1){ dfs(dfs,idx-1); } ans.emplace_back(v[idx]+1,'L'); a[v[idx]]=idx-1; v[idx-1]=v[idx]; v[idx]=-1; dfs(dfs,idx-1); } }; dfs(dfs,a[i]); } cout<<ans.size()<<endl; for(auto [s,t]:ans){ cout<<s<<" "<<t<<endl; } }