結果
問題 | No.1650 Moving Coins |
ユーザー | leaf_1415 |
提出日時 | 2021-08-20 21:44:54 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 317 ms / 2,000 ms |
コード長 | 6,951 bytes |
コンパイル時間 | 1,146 ms |
コンパイル使用メモリ | 105,060 KB |
実行使用メモリ | 22,896 KB |
最終ジャッジ日時 | 2024-10-14 03:05:20 |
合計ジャッジ時間 | 11,317 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 264 ms
7,404 KB |
testcase_04 | AC | 198 ms
7,352 KB |
testcase_05 | AC | 247 ms
7,408 KB |
testcase_06 | AC | 276 ms
7,408 KB |
testcase_07 | AC | 264 ms
7,280 KB |
testcase_08 | AC | 281 ms
8,984 KB |
testcase_09 | AC | 289 ms
8,992 KB |
testcase_10 | AC | 288 ms
9,004 KB |
testcase_11 | AC | 302 ms
9,024 KB |
testcase_12 | AC | 275 ms
8,368 KB |
testcase_13 | AC | 283 ms
8,272 KB |
testcase_14 | AC | 283 ms
8,796 KB |
testcase_15 | AC | 273 ms
8,156 KB |
testcase_16 | AC | 295 ms
9,308 KB |
testcase_17 | AC | 268 ms
9,336 KB |
testcase_18 | AC | 306 ms
9,748 KB |
testcase_19 | AC | 311 ms
22,896 KB |
testcase_20 | AC | 294 ms
10,396 KB |
testcase_21 | AC | 309 ms
16,640 KB |
testcase_22 | AC | 317 ms
10,396 KB |
testcase_23 | AC | 316 ms
10,528 KB |
testcase_24 | AC | 264 ms
7,404 KB |
testcase_25 | AC | 273 ms
7,276 KB |
testcase_26 | AC | 40 ms
6,528 KB |
ソースコード
#include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <ctime> #include <cstdlib> #include <cassert> #include <vector> #include <list> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <string> #include <algorithm> #include <utility> #include <complex> #include <unordered_set> #include <unordered_map> #define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++) #define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--) #define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define sz(x) ((ll)(x).size()) #define ceil(x, y) (((x)+(y)-1) / (y)) #define all(x) (x).begin(),(x).end() #define outl(...) dump_func(__VA_ARGS__) #define outf(x) cout << fixed << setprecision(16) << (x) << endl #define inf 1e18 const double PI = 3.1415926535897932384626433; using namespace std; typedef long long llint; typedef long long ll; typedef pair<ll, ll> P; struct edge{ ll to, cost; edge(){} edge(ll a, ll b){ to = a, cost = b;} }; const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; const ll mod = 1000000007; //const ll mod = 998244353; struct mint{ ll x = 0; mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;} mint(const mint &ope) {x = ope.x;} mint operator-(){return mint(-x);} mint operator+(const mint &ope){return mint(x) += ope;} mint operator-(const mint &ope){return mint(x) -= ope;} mint operator*(const mint &ope){return mint(x) *= ope;} mint operator/(const mint &ope){return mint(x) /= ope;} mint& operator+=(const mint &ope){ x += ope.x; if(x >= mod) x -= mod; return *this; } mint& operator-=(const mint &ope){ x += mod - ope.x; if(x >= mod) x -= mod; return *this; } mint& operator*=(const mint &ope){ x *= ope.x, x %= mod; return *this; } mint& operator/=(const mint &ope){ ll n = mod-2; mint mul = ope; while(n){ if(n & 1) *this *= mul; mul *= mul; n >>= 1; } return *this; } mint inverse(){return mint(1) / *this;} bool operator ==(const mint &ope){return x == ope.x;} bool operator !=(const mint &ope){return x != ope.x;} bool operator <(const mint &ope){return x < ope.x;} }; mint modpow(mint a, ll n){ if(n == 0) return mint(1); if(n % 2) return a * modpow(a, n-1); else return modpow(a*a, n/2); } istream& operator >>(istream &is, mint &ope){ ll t; is >> t, ope.x = t; return is; } ostream& operator <<(ostream &os, mint &ope){return os << ope.x;} ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;} vector<mint> fact, fact_inv; void make_fact(int n){ fact.resize(n+1), fact_inv.resize(n+1); fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i); fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1); } mint comb(ll n, ll k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];} mint perm(ll n, ll k){ return comb(n, k) * fact[k]; } vector<int> prime, pvec; void make_prime(int n){ prime.resize(n+1); rep(i, 2, n){ if(prime[i]) continue; for(int j = i; j <= n; j+=i) prime[j] = i; } rep(i, 2, n) if(prime[i] == i) pvec.push_back(i); } bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} void mark(){ cout << "*" << endl; } void yes(){ cout << "YES" << endl; } void no(){ cout << "NO" << endl; } ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;} ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);} ll lcm(ll a, ll b){return a/gcd(a, b)*b;} ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;} ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;} string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;} ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;} template<typename T> void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());} template<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){ s.first += t.first, s.second += t.second; return s; } template<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){ s.first -= t.first, s.second -= t.second; return s; } template<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second); } template<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second); } template<typename T> ostream& operator << (ostream& os, vector<T>& vec) { for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os; } template<typename T> ostream& operator << (ostream& os, deque<T>& deq) { for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " "); return os; } template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) { for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) { os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ","; itr--; } return os; } template<typename T> ostream& operator << (ostream& os, set<T>& set_var) { for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--; } return os; } template<typename T> ostream& operator << (ostream& os, multiset<T>& set_var) { for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--; } return os; } template<typename T> void outa(T a[], ll s, ll t){for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}cout << endl;} void dump_func(){cout << endl;} template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...); } ll n; ll a[200005], b[200005]; vector<P> ans; void move(ll id, ll d) { if(a[id+d] == a[id]+d) move(id+d, d); a[id] += d; ans.push_back(P(id, d)); } int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; rep(i, 1, n) cin >> a[i]; rep(i, 1, n) cin >> b[i]; rep(i, 1, n){ while(a[i] < b[i]) move(i, 1); while(a[i] > b[i]) move(i, -1); } outl(sz(ans)); for(auto p : ans){ cout << p.first << " "; if(p.second == -1) cout << "L" << endl; else cout << "R" << endl; } return 0; }