結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー kuhaku
提出日時 2020-08-10 11:55:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 473 ms / 2,000 ms
コード長 3,213 bytes
コンパイル時間 2,183 ms
コンパイル使用メモリ 195,832 KB
最終ジャッジ日時 2025-01-12 19:36:29
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for(ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for(ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
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>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
void co(void){cout << '\n';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); co();}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); co();}
void ce(void){cerr << '\n';}
template <typename T>
void ce(const T n){cerr << n << '\n';}
template <typename T>
void cesp(const T n){cerr << n << ' ';}
template <typename T>
void ce(initializer_list<T> v){for(T i : v) cesp(i); ce();}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr ll MOD = 1e9+7;
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const double PI = acos(-1);
template <typename T>
struct BIT{
ll N;
Vec1<T> data;
BIT(ll n){
init(n);
}
void init(ll n){
N = 1;
while(N < n) N <<= 1;
data.assign(N, 0);
}
void build(Vec1<T> v){
init(N);
rep(i, v.size()){
add(i, v[i]);
}
}
void add(ll k, T x){
k++;
while(k <= N){
data[k] += x;
k += k & -k;
}
}
// [0, k)
T sum(ll k){
T res = 0;
while(k){
res += data[k];
k -= k & -k;
}
return res;
}
// [a, b)
T sum(ll a, ll b){return sum(b) - sum(a);}
T at(ll k){return sum(k) - sum(k - 1);}
T lower_bound(T k){
ll l = 0, r = N;
while(r - l > 1){
ll m = (l + r) / 2;
if(sum(m) >= k) r = m;
else l = m;
}
return r;
}
};
int main(void){
ll n;
cin >> n;
Vec a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
--a[i];
}
rep(i, n) {
--b[i];
}
Vec p(n);
rep(i, n) p[b[i]] = i;
ll ans = 0;
BIT<ll> bit(n);
rep(i, n) bit.add(i, 1);
rep(i, n) {
ans += bit.sum(p[a[i]]);
bit.add(p[a[i]], -1);
ce(ans);
}
co(ans);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0