結果
問題 | No.1650 Moving Coins |
ユーザー | snuke |
提出日時 | 2021-08-21 18:35:58 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 394 ms / 2,000 ms |
コード長 | 3,084 bytes |
コンパイル時間 | 2,535 ms |
コンパイル使用メモリ | 212,920 KB |
実行使用メモリ | 6,252 KB |
最終ジャッジ日時 | 2024-10-15 09:12:33 |
合計ジャッジ時間 | 13,719 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 248 ms
5,248 KB |
testcase_04 | AC | 188 ms
5,248 KB |
testcase_05 | AC | 229 ms
5,248 KB |
testcase_06 | AC | 260 ms
5,248 KB |
testcase_07 | AC | 257 ms
5,248 KB |
testcase_08 | AC | 318 ms
5,256 KB |
testcase_09 | AC | 323 ms
5,480 KB |
testcase_10 | AC | 328 ms
5,292 KB |
testcase_11 | AC | 330 ms
5,248 KB |
testcase_12 | AC | 308 ms
5,248 KB |
testcase_13 | AC | 308 ms
5,248 KB |
testcase_14 | AC | 330 ms
5,248 KB |
testcase_15 | AC | 286 ms
5,248 KB |
testcase_16 | AC | 335 ms
5,264 KB |
testcase_17 | AC | 332 ms
5,280 KB |
testcase_18 | AC | 355 ms
5,376 KB |
testcase_19 | AC | 379 ms
6,128 KB |
testcase_20 | AC | 394 ms
5,996 KB |
testcase_21 | AC | 383 ms
6,252 KB |
testcase_22 | AC | 392 ms
6,004 KB |
testcase_23 | AC | 387 ms
6,000 KB |
testcase_24 | AC | 259 ms
5,248 KB |
testcase_25 | AC | 257 ms
5,248 KB |
testcase_26 | AC | 124 ms
5,248 KB |
ソースコード
#include <bits/stdc++.h> #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < (t); ++i) #define dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define isin(x,l,r) ((l) <= (x) && (x) < (r)) #define pb push_back #define eb emplace_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define show(x) cerr<<#x<<" = "<<x<<endl; #define bn(x) ((1<<(x))-1) #define newline puts("") using namespace std; template<typename T> using vc = vector<T>; template<typename T> using vv = vc<vc<T>>; template<typename T> using PQ = priority_queue<T,vc<T>,greater<T> >; using ll = long long; using uint = unsigned; using ull = unsigned long long; using P = pair<int,int>; using T3 = tuple<int,int,int>; using vi = vc<int>; using vvi = vv<int>; using vl = vc<ll>; using vp = vc<P>; using vt = vc<T3>; int getInt(){int x;scanf("%d",&x);return x;} vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;} template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;} template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();} template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;} vc<string> split(const string& s,char d=' '){vc<string> r(1);for(char c:s)if(c==d)r.pb("");else r.back()+=c;return r;} string operator*(const string& s,int t){return join(vc<string>(t,s));} template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;} template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;} template<typename T>T dup(T x, T y){return (x+y-1)/y;} template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("-1"); return;} #define yn {puts("Yes");}else{puts("No");} const int MX = 200005; struct Solver { void solve() { int n; scanf("%d",&n); vi a(n), b(n); cin>>a>>b; vvi ans(2); rep(i,n) { int l = a[i], r = b[i]; int x = 0; if (l > r) swap(l,r), x = 1; rep(j,r-l) ans[x].eb(i+1); } cout<<sz(ans[0])+sz(ans[1])<<endl; reverse(rng(ans[0])); for (int p : ans[0]) cout<<p<<" R"<<endl; for (int p : ans[1]) cout<<p<<" L"<<endl; } }; int main() { int ts = 1; // scanf("%d",&ts); rrep(ti,ts) { Solver solver; solver.solve(); } return 0; }