結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー Shuz*Shuz*
提出日時 2020-07-17 21:35:20
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 77 ms / 2,000 ms
コード長 6,368 bytes
コンパイル時間 1,896 ms
コンパイル使用メモリ 173,996 KB
実行使用メモリ 7,936 KB
最終ジャッジ日時 2024-11-29 22:09:45
合計ジャッジ時間 4,178 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 66 ms
7,168 KB
testcase_04 AC 75 ms
7,680 KB
testcase_05 AC 65 ms
7,168 KB
testcase_06 AC 60 ms
6,784 KB
testcase_07 AC 74 ms
7,680 KB
testcase_08 AC 5 ms
5,248 KB
testcase_09 AC 36 ms
5,760 KB
testcase_10 AC 63 ms
7,808 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 76 ms
7,808 KB
testcase_13 AC 77 ms
7,808 KB
testcase_14 AC 76 ms
7,936 KB
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 2 ms
5,248 KB
testcase_17 AC 2 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 2 ms
5,248 KB
testcase_20 AC 2 ms
5,248 KB
testcase_21 AC 2 ms
5,248 KB
testcase_22 AC 2 ms
5,248 KB
testcase_23 AC 7 ms
5,248 KB
testcase_24 AC 28 ms
5,248 KB
testcase_25 AC 57 ms
6,528 KB
testcase_26 AC 15 ms
5,248 KB
testcase_27 AC 34 ms
5,248 KB
testcase_28 AC 45 ms
6,016 KB
testcase_29 AC 62 ms
6,912 KB
testcase_30 AC 73 ms
7,552 KB
testcase_31 AC 19 ms
5,248 KB
testcase_32 AC 13 ms
5,248 KB
testcase_33 AC 54 ms
7,168 KB
testcase_34 AC 2 ms
5,248 KB
testcase_35 AC 2 ms
5,248 KB
testcase_36 AC 2 ms
5,248 KB
testcase_37 AC 2 ms
5,248 KB
testcase_38 AC 2 ms
5,248 KB
testcase_39 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(_i, h) {                                                           \
            rep(_j, w) {                                                       \
                if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2)       \
                    cerr << '-';                                               \
                if (abs(a[_i][_j]) >= INF / 2)                                 \
                    cerr << "∞" << sp;                                         \
                else                                                           \
                    cerr << a[_i][_j] << sp;                                   \
            }                                                                  \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(_i, n) {                                                           \
            if (_i) cerr << sp;                                                \
            if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) cerr << '-';      \
            if (abs(a[_i]) >= INF / 2)                                         \
                cerr << "∞" << sp;                                             \
            else                                                               \
                cerr << a[_i];                                                 \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

vector<ll> rev(vector<ll> a) {
    vector<ll> b(len(a));
    rep(i, len(a)) b[a[i]] = i;
    return b;
}
vector<ll> mul(vector<ll> a, vector<ll> b) {
    vector<ll> c(len(a));
    rep(i, len(a)) c[i] = b[a[i]];
    return c;
}

ll res = 0;
void merge(vector<ll>::iterator left, vector<ll>::iterator mid,
           vector<ll>::iterator right) {
    vector<ll>::iterator iter = left, i1 = left, i2 = mid;
    vector<ll> v;
    while (i1 != mid && i2 != right) {
        if (*i1 < *i2) {
            v.push_back(*i1), i1++;
        } else {
            v.push_back(*i2), i2++;
            res += mid - i1;
        }
    }
    while (i1 != mid) v.push_back(*i1), i1++;
    while (i2 != right) v.push_back(*i2), i2++;
    while (iter != right) {
        *iter = v[iter - left];
        iter++;
    }
}

void mergesort(vector<ll>::iterator left, vector<ll>::iterator right) {
    if (right - left <= 1) return;
    vector<ll>::iterator mid = left + (right - left) / 2;
    mergesort(left, mid);
    mergesort(mid, right);
    merge(left, mid, right);
}

signed main() {
    ll N;
    cin >> N;
    vector<ll> A(N), B(N);
    rep(i, N) cin >> A[i], A[i]--;
    rep(i, N) cin >> B[i], B[i]--;
    auto v = mul(B, rev(A));
    mergesort(all(v));
    cout << res << rt;
}
0