結果
問題 | No.1650 Moving Coins |
ユーザー | stoq |
提出日時 | 2021-08-20 22:01:02 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 5,296 bytes |
コンパイル時間 | 4,573 ms |
コンパイル使用メモリ | 277,584 KB |
実行使用メモリ | 18,376 KB |
最終ジャッジ日時 | 2024-10-14 03:39:43 |
合計ジャッジ時間 | 9,674 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 15 ms
9,088 KB |
testcase_01 | AC | 15 ms
9,088 KB |
testcase_02 | AC | 15 ms
9,088 KB |
testcase_03 | AC | 38 ms
11,344 KB |
testcase_04 | AC | 34 ms
11,340 KB |
testcase_05 | AC | 37 ms
11,344 KB |
testcase_06 | AC | 38 ms
11,348 KB |
testcase_07 | AC | 40 ms
11,348 KB |
testcase_08 | AC | 60 ms
12,936 KB |
testcase_09 | AC | 57 ms
12,696 KB |
testcase_10 | AC | 60 ms
13,000 KB |
testcase_11 | AC | 63 ms
12,972 KB |
testcase_12 | AC | 52 ms
12,168 KB |
testcase_13 | AC | 52 ms
12,328 KB |
testcase_14 | AC | 58 ms
12,704 KB |
testcase_15 | AC | 49 ms
12,032 KB |
testcase_16 | AC | 67 ms
13,308 KB |
testcase_17 | AC | 66 ms
13,536 KB |
testcase_18 | AC | 69 ms
13,552 KB |
testcase_19 | AC | 79 ms
13,896 KB |
testcase_20 | AC | 79 ms
14,024 KB |
testcase_21 | AC | 81 ms
13,824 KB |
testcase_22 | AC | 85 ms
18,372 KB |
testcase_23 | AC | 85 ms
18,376 KB |
testcase_24 | AC | 39 ms
11,216 KB |
testcase_25 | AC | 39 ms
11,468 KB |
testcase_26 | AC | 55 ms
12,032 KB |
ソースコード
#define MOD_TYPE 1 #pragma region Macros #include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; #if 0 #include <boost/multiprecision/cpp_dec_float.hpp> #include <boost/multiprecision/cpp_int.hpp> using Int = boost::multiprecision::cpp_int; using lld = boost::multiprecision::cpp_dec_float_100; #endif #if 1 #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif using ll = long long int; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; using pld = pair<ld, ld>; template <typename Q_type> using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>; #if MOD_TYPE == 1 constexpr ll MOD = ll(1e9 + 7); #else #if MOD_TYPE == 2 constexpr ll MOD = 998244353; #else constexpr ll MOD = 1000003; #endif #endif using mint = static_modint<MOD>; constexpr int INF = (int)1e9 + 10; constexpr ll LINF = (ll)4e18; constexpr double PI = acos(-1.0); constexpr double EPS = 1e-11; constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0}; constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0}; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define REPI(i, m, n) for (int i = m; i < (int)(n); ++i) #define repi(i, n) REPI(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << "\n" #define possible(n) cout << ((n) ? "possible" : "impossible") << "\n" #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n" #define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n" #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << "\n"; #define UNIQUE(v) v.erase(unique(all(v)), v.end()) struct io_init { io_init() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); }; } io_init; template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } inline ll CEIL(ll a, ll b) { return (a + b - 1) / b; } template <typename A, size_t N, typename T> inline void Fill(A (&array)[N], const T &val) { fill((T *)array, (T *)(array + N), val); } template <typename T> vector<T> compress(vector<T> &v) { vector<T> val = v; sort(all(val)), val.erase(unique(all(val)), val.end()); for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin(); return val; } template <typename T, typename U> constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept { is >> p.first >> p.second; return is; } template <typename T, typename U> constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept { os << p.first << " " << p.second; return os; } ostream &operator<<(ostream &os, mint m) { os << m.val(); return os; } random_device seed_gen; mt19937_64 engine(seed_gen()); struct BiCoef { vector<mint> fact_, inv_, finv_; BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) { fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1); for (int i = 2; i < n; i++) { fact_[i] = fact_[i - 1] * i; inv_[i] = -inv_[MOD % i] * (MOD / i); finv_[i] = finv_[i - 1] * inv_[i]; } } mint C(ll n, ll k) const noexcept { if (n < k || n < 0 || k < 0) return 0; return fact_[n] * finv_[k] * finv_[n - k]; } mint P(ll n, ll k) const noexcept { return C(n, k) * fact_[k]; } mint H(ll n, ll k) const noexcept { return C(n + k - 1, k); } mint Ch1(ll n, ll k) const noexcept { if (n < 0 || k < 0) return 0; mint res = 0; for (int i = 0; i < n; i++) res += C(n, i) * mint(n - i).pow(k) * (i & 1 ? -1 : 1); return res; } mint fact(ll n) const noexcept { if (n < 0) return 0; return fact_[n]; } mint inv(ll n) const noexcept { if (n < 0) return 0; return inv_[n]; } mint finv(ll n) const noexcept { if (n < 0) return 0; return finv_[n]; } }; BiCoef bc(500010); #pragma endregion //ランレングス圧縮 template <typename T> vector<pair<T, ll>> RLE(const vector<T> &v) { vector<pair<T, ll>> res; T before; rep(i, v.size()) { if (i == 0 || v[i] != before) { before = v[i]; res.push_back(MP(v[i], 0LL)); } res.rbegin()->second++; } return res; } void solve() { int n; cin >> n; vector<int> a(n), b(n); rep(i, n) cin >> a[i]; rep(i, n) cin >> b[i]; int m = 0; rep(i, n) m += abs(a[i] - b[i]); cout << m << "\n"; vector<int> d(n); rep(i, n) d[i] = b[i] - a[i]; vector<char> s; rep(i, n) { if (d[i] > 0) s.push_back('+'); else if (d[i] < 0) s.push_back('-'); else s.push_back('0'); } auto p = RLE(s); int l = 0; vector<pair<int, char>> ans; for (auto [c, len] : p) { int r = l + len - 1; if (c == '+') { for (int i = r; i >= l; i--) { rep(j, d[i]) ans.push_back({i + 1, 'R'}); } } else if (c == '-') { for (int i = l; i <= r; i++) { rep(j, -d[i]) ans.push_back({i + 1, 'L'}); } } l += len; } for (auto [k, c] : ans) cout << k << " " << c << "\n"; } int main() { solve(); }