結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー もりをもりを
提出日時 2020-08-24 21:17:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 117 ms / 2,000 ms
コード長 9,263 bytes
コンパイル時間 2,408 ms
コンパイル使用メモリ 216,032 KB
実行使用メモリ 10,452 KB
最終ジャッジ日時 2024-11-06 10:42:24
合計ジャッジ時間 6,098 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
6,816 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 93 ms
9,304 KB
testcase_04 AC 113 ms
10,376 KB
testcase_05 AC 97 ms
9,280 KB
testcase_06 AC 88 ms
8,708 KB
testcase_07 AC 111 ms
10,076 KB
testcase_08 AC 4 ms
6,824 KB
testcase_09 AC 37 ms
7,424 KB
testcase_10 AC 64 ms
10,452 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 117 ms
10,452 KB
testcase_13 AC 114 ms
10,328 KB
testcase_14 AC 117 ms
10,452 KB
testcase_15 AC 2 ms
6,816 KB
testcase_16 AC 2 ms
6,816 KB
testcase_17 AC 2 ms
6,816 KB
testcase_18 AC 2 ms
6,816 KB
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 2 ms
6,816 KB
testcase_21 AC 2 ms
6,816 KB
testcase_22 AC 2 ms
6,820 KB
testcase_23 AC 8 ms
6,816 KB
testcase_24 AC 34 ms
6,820 KB
testcase_25 AC 81 ms
8,460 KB
testcase_26 AC 17 ms
6,820 KB
testcase_27 AC 44 ms
6,816 KB
testcase_28 AC 62 ms
7,552 KB
testcase_29 AC 89 ms
8,872 KB
testcase_30 AC 112 ms
9,996 KB
testcase_31 AC 24 ms
6,820 KB
testcase_32 AC 15 ms
6,816 KB
testcase_33 AC 82 ms
9,500 KB
testcase_34 AC 2 ms
6,816 KB
testcase_35 AC 2 ms
6,816 KB
testcase_36 AC 2 ms
6,820 KB
testcase_37 AC 2 ms
6,820 KB
testcase_38 AC 2 ms
6,820 KB
testcase_39 AC 3 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'

#pragma region TEMPLATE

/* TYPE */
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<vector<int>> vvi;
template <typename T, typename Cmp = less<>>
using prique = priority_queue<T, vector<T>, Cmp>;
template <typename T>
using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\n'
const int INF         = 1 << 30;
const ll INFF         = 1LL << 60;
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD         = 1e9 + 7;
const int MODD        = 998244353;
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS      = 1e-9;
const ld PI           = 3.14159265358979323846264338327950288;
const int dx[]        = { 1, 0, -1, 0, 1, -1, -1, 1, 0 };
const int dy[]        = { 0, 1, 0, -1, -1, -1, 1, 1, 0 };
/* CONTAINER */
#define PB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val) (int)(x).size() - LESS((x), (val))
#define UNIQUE(v) \
    sort(ALL(v)); \
    (v).erase(unique(ALL(v)), (v).end())
template <typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template <typename T, typename U, typename... V>
enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }
template <typename T, typename U, typename... V>
enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) {
    for (auto &e : u) fill_v<T>(e, v...);
}
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n) REPI(i, 0, n)
#define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...) _overload3(__VA_ARGS__, REPI, _REP, )(__VA_ARGS__)
#define _RREP(i, n) RREPI(i, n, 0)
#define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP, )(__VA_ARGS__)
#define EACH(e, v) for (auto &e : v)
#define PERM(v)   \
    sort(ALL(v)); \
    for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template <typename T>
void SSS(T &t) { cin >> t; }
template <typename Head, typename... Tail>
void SSS(Head &&head, Tail &&... tail) {
    cin >> head;
    SSS(tail...);
}
#define SS(T, ...) \
    T __VA_ARGS__; \
    SSS(__VA_ARGS__);
#define SV(T, v, n) \
    vector<T> v(n); \
    for (auto &i : v) cin >> i;
#define SVV(T, v, n, m)                   \
    vector<vector<T>> v(n, vector<T>(m)); \
    for (auto &r : v)                     \
        for (auto &i : r) cin >> i;
/* OUTPUT */
// Yes / No
inline int YES(bool x) {
    cout << (x ? "YES" : "NO") << endl;
    return 0;
}
inline int Yes(bool x) {
    cout << (x ? "Yes" : "No") << endl;
    return 0;
}
inline int yes(bool x) {
    cout << (x ? "yes" : "no") << endl;
    return 0;
}
inline int yES(bool x) {
    cout << (x ? "yES" : "nO") << endl;
    return 0;
}
inline int Yay(bool x) {
    cout << (x ? "Yay!" : ":(") << endl;
    return 0;
}
// PROTOTYPE DECLARATION
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &j);
template <typename... T>
ostream &operator<<(ostream &os, const tuple<T...> &t);
template <class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr>
ostream &operator<<(ostream &os, const C &c);
template <typename T>
ostream &operator<<(ostream &os, const stack<T> &j);
template <typename T>
ostream &operator<<(ostream &os, const queue<T> &j);
template <typename T, typename C, typename Cmp>
ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }
template <size_t num = 0, typename... T>
enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}
template <size_t num = 0, typename... T>
    enable_if_t < num<sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {
    os << get<num>(t);
    if (num + 1 < sizeof...(T)) os << ", ";
    PRINT_TUPLE<num + 1>(os, t);
}
template <typename... T>
ostream &operator<<(ostream &os, const tuple<T...> &t) {
    PRINT_TUPLE(os << '{', t);
    return os << '}';
}
template <class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>>
ostream &operator<<(ostream &os, const C &c) {
    os << '{';
    for (auto it = begin(c); it != end(c); it++) {
        if (begin(c) != it) os << ", ";
        os << *it;
    }
    return os << '}';
}
template <typename T>
ostream &operator<<(ostream &os, const stack<T> &j) {
    deque<T> d;
    for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());
    return os << d;
}
template <typename T>
ostream &operator<<(ostream &os, const queue<T> &j) {
    deque<T> d;
    for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front());
    return os << d;
}
template <typename T, typename C, typename Cmp>
ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) {
    deque<T> d;
    for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());
    return os << d;
}
// OUTPUT FUNCTION
template <typename T>
int PV(T &v) {
    int sz = v.size();
    for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1];
    return 0;
}
inline int print() {
    cout << endl;
    return 0;
}
template <typename Head>
int print(Head &&head) {
    cout << head;
    return print();
}
template <typename Head, typename... Tail>
int print(Head &&head, Tail &&... tail) {
    cout << head << " ";
    return print(forward<Tail>(tail)...);
}
#ifdef LOCAL
inline void dump() { cerr << endl; }
template <typename Head>
void dump(Head &&head) {
    cerr << head;
    dump();
}
template <typename Head, typename... Tail>
void dump(Head &&head, Tail &&... tail) {
    cerr << head << ", ";
    dump(forward<Tail>(tail)...);
}
#define debug(...)                                          \
    do {                                                    \
        cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \
        dump(__VA_ARGS__);                                  \
    } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
template <typename T, typename A, typename B>
inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }
template <typename A, typename B>
inline bool chmax(A &a, const B &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <typename A, typename B>
inline bool chmin(A &a, const B &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b) {
    ll r = 1;
    do {
        if (b & 1) r *= a;
        a *= a;
    } while (b >>= 1);
    return r;
}
struct abracadabra {
    abracadabra() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
        cerr << fixed << setprecision(5);
    };
} ABRACADABRA;

#pragma endregion
#pragma region datastructure binary indexed tree
/**
* @brief Binary Indexed Tree
* @docs docs/datastructure/binaryindexedtree.md
*/

template <typename T>
struct BinaryIndexedTree {
    vector<T> data;
    BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
    T sum(int k) {
        if (k < 0) return T(0);
        T ret = 0;
        for (++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }
    T sum(int l, int r) {
        assert(l <= r);
        return sum(r - 1) - sum(l - 1);
    }
    void add(int k, T x) {
        for (++k; k < data.size(); k += k & -k) data[k] += x;
    }
};
#pragma endregion

template <typename T>
long long inversion_number(vector<T> &v) {
    int sz = v.size();
    vector<T> rev, v_cp(v);
    sort(v_cp.begin(), v_cp.end());
    for (auto &e : v) rev.emplace_back(lower_bound(v_cp.begin(), v_cp.end(), e) - v_cp.begin());
    BinaryIndexedTree<T> bit(sz);
    long long ret = 0;
    for (int i = 0; i < sz; ++i) {
        ret += i - bit.sum(rev[i]);
        bit.add(rev[i], 1);
    }
    return ret;
}

signed main() {

    int N;
    cin >> N;
    vector<int> A(N), B(N), C(N);
    for (auto &e : A) cin >> e;
    for (auto &e : B) cin >> e;
    map<int, int> mp;
    for (int i = 0; i < N; ++i) mp[B[i]] = i;
    for (int i = 0; i < N; ++i) C[i] = mp[A[i]];
    cout << inversion_number(C) << endl;
}
0