結果
問題 | No.1650 Moving Coins |
ユーザー | Focus_Sash |
提出日時 | 2021-08-20 23:39:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,913 bytes |
コンパイル時間 | 4,520 ms |
コンパイル使用メモリ | 270,192 KB |
実行使用メモリ | 18,852 KB |
最終ジャッジ日時 | 2024-10-14 07:43:35 |
合計ジャッジ時間 | 10,466 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 6 ms
11,008 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | RE | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | RE | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 61 ms
17,448 KB |
ソースコード
#include "bits/stdc++.h" #include <atcoder/all> using namespace std; using namespace atcoder; using ll = long long; using vl = vector<long long>; using pl = pair<long long, long long>; using PQ = priority_queue<long long>; using PQR = priority_queue<long long, vector<long long>, greater<>>; struct edge {long long to;long long cost;edge(long long t,long long c):to(t),cost(c){}}; using Graph = vector<vector<long long>>; using WGraph = vector<vector<edge>>; constexpr int dx[8]{1,0,-1,0,1,1,-1,-1}; constexpr int dy[8]{0,1,0,-1,1,-1,1,-1}; #define rep(i, n) for(long long (i) = 0; (i) < (n); (i)++) #define all(v) (v).begin(), (v).end() #define pb emplace_back #define V vector #define uniquify(vec) sort(all(vec)); (vec).erase(std::unique((vec).begin(), (vec).end()), (vec).end()) constexpr long long MOD1 = 1e9 + 7; constexpr long long MOD9 = 998244353; constexpr long long INF = MOD1*MOD1+1; constexpr long long LL_MAX = std::numeric_limits<long long>::max(); long long safe_mod(long long n, long long m){if(n >= 0) {return n % m;} else return (n%m + m)%m;} long long div_ceil(long long a, long long b){return (a + b - 1) / b;} long long DIG(long long x, long long d){ll ret=0;while(x){x/=d;ret++;}return ret;} long long pw(long long x,long long n) {ll ret=1;while(n>0){if(n&1){ret=ret*x;}if(n>>=1){x=x*x;}}return ret;} template<typename T> T SUM(const vector<T> &v){T ret{};return(accumulate(all(v), ret));} template<typename T> T pwmod(T x, long long n, long long m) {T ret=1;while(n>0){if(n&1)ret=ret*x%m;x=x*x%m;n>>=1;}return ret%m;} template<typename T> void rsort(vector<T> &v) {sort(all(v), greater<T>());} template<typename T> bool chmax(T &a,const T& b) {if(a<b){a=b;return true;}return false;} template<typename T> bool chmin(T &a,const T& b) {if(a>b){a=b;return true;}return false;} template<typename T> void fin(const T &a) {cout << a << '\n';exit(0);} template<typename T, typename S> pair<T, S> mp(const T &a, const S &b){return make_pair(a, b);} template<typename T> void unique(vector<T> &a){sort(all(a)); a.erase(std::unique(a.begin(), a.end()), a.end());} template<typename T> vector<int> compress(vector<T> &a){ int n = a.size(); vector<int> ret(n); vector<T> temp = a; unique(a); for(int i = 0; i < n; i++) ret[i] = lower_bound(a.begin(), a.end(), temp[i]) - a.begin(); return ret; } std::ostream &operator<<(std::ostream& os, const modint1000000007 &m){ os << m.val(); return os; } std::ostream &operator<<(std::ostream& os, const modint998244353 &m){ os << m.val(); return os; } template<typename T, typename S> std::ostream &operator<<(std::ostream& os, const pair<T, S> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template <typename T> std::ostream &operator<<(std::ostream& os, const vector<T> &v){ int n = v.size(); os << "["; for(int i = 0; i < n; i++){ if(i == n - 1) os << v[i]; else os << v[i] << ", "; } os << "]"; return os; } template <typename T, typename S> std::ostream &operator<<(std::ostream& os, const map<T, S> &mp){ for(auto iter = mp.begin(); iter != mp.end(); iter++){ os << "(" << iter->first << ", " << iter->second << ")" << " "; } return os; } template <typename T> std::ostream &operator<<(std::ostream& os, const set<T> &s){ os << "{"; for(auto c : s) os << c << " "; os << "}"; return os; } #define LOCAL #ifdef LOCAL #define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl #else #define dump(x) true #endif //using mint = modint1000000007; //using mint = modint998244353; void solve(){ ll n; cin >> n; vl a(n), b(n); rep(i,n){ cin >> a[i]; --a[i]; } rep(i,n){ cin >> b[i]; --b[i]; } fenwick_tree<ll> bit(1000000); rep(i, n){ bit.add(a[i], 1); } vl list; rep(i, n){ if(a[i] == b[i]){ list.pb(i); } else if(a[i] > b[i]){ if(bit.sum(b[i], a[i]) == 0){ list.pb(i); } } else { if(bit.sum(a[i], b[i]) == 0){ list.pb(i); } } } ll m = 0; vl al(n, 0); V<pair<char, ll>> ord; for(ll i : list){ m += abs(a[i] - b[i]); al[i] = 1; bit.add(a[i], -1); bit.add(b[i], 1); if(a[i] > b[i]){ ord.push_back({'L', abs(a[i] - b[i])}); if(i < n - 1 && !al[i+1]){ list.pb(i+1); } } else if(b[i] > a[i] && !al[i-1]){ ord.push_back({'R', abs(a[i] - b[i])}); if(i > 0){ list.pb(i-1); } } } cout << m << '\n'; for(auto [c, x] : ord){ cout << c << ' ' << x << '\n'; } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << std::fixed << std::setprecision(15); solve(); return 0; }