結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー ningenMe
提出日時 2020-07-17 22:38:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 87 ms / 2,000 ms
コード長 5,213 bytes
コンパイル時間 2,579 ms
コンパイル使用メモリ 205,596 KB
最終ジャッジ日時 2025-01-11 23:07:18
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x
    .second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj
    .begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr !
    = obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "")
    << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj
    .end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
/*
* @title BinaryIndexedTree
*/
template<class Operator> class BinaryIndexedTree {
using TypeNode = typename Operator::TypeNode;
size_t depth;
size_t length;
size_t num;
vector<TypeNode> node;
public:
BinaryIndexedTree(const size_t num) : num(num) {
for (depth = 1,length = 1; length < num; depth++,length *= 2);
node.resize(length+1, Operator::unit_node);
}
//[idx,idx+1) update
void update(size_t idx, TypeNode var) {
assert(0 <= idx && idx < length);
for (++idx; idx <= length; idx += idx & -idx) node[idx] = Operator::func_node(node[idx],var);
}
//[0,idx) get
TypeNode get(size_t idx) {
TypeNode ret = Operator::unit_node;
for (idx = min(length,idx); idx > 0; idx -= idx & -idx) ret = Operator::func_node(ret,node[idx]);
return ret;
}
//return [0,length]
int binary_search(TypeNode var) {
if(!Operator::func_check(node.back(),var)) return num;
TypeNode ret = Operator::unit_node;
size_t off = 0;
for(size_t idx = length; idx; idx >>= 1){
if(off + idx <= length && !Operator::func_check(Operator::func_node(ret,node[off+idx]),var)) {
off += idx;
ret = Operator::func_node(ret,node[off]);
}
}
return min(off,num);
}
void print() {
cout << "{ " << get(1);
for(int i = 1; i < length; ++i) cout << ", " << get(i+1);
cout << " }" << endl;
}
};
template<class T> struct NodePrefixSumPointAdd {
using TypeNode = T;
inline static constexpr TypeNode unit_node = 0;
inline static constexpr TypeNode func_node(TypeNode l,TypeNode r){return l+r;}
// Binary Search for first index where func_check is true
inline static constexpr bool func_check(TypeNode nodeVal,TypeNode val){return val <= nodeVal;}
};
template<class TypeNode> struct nodeUpdatePrefixGCD {
TypeNode unit_node = 0;
TypeNode func_node(TypeNode l,TypeNode r){return ((r == 0) ? l : func_node(r, l % r));}
// Binary Search for first index at where func_check is true
bool func_check(TypeNode nodeVal,TypeNode var){return var == nodeVal;}
};
//verify https://atcoder.jp/contests/chokudai_S001/tasks/chokudai_S001_j
//verify https://atcoder.jp/contests/abc130/tasks/abc130_d
int main() {
int N; cin >> N;
vector<int> a(N),b(N),c(N+1);
for(int i = 0; i < N; ++i) {
cin >> a[i];
c[a[i]]=i;
}
for(int i = 0; i < N; ++i) {
cin >> b[i];
b[i]=c[b[i]];
}
BinaryIndexedTree<NodePrefixSumPointAdd<ll>> bit(N);
vector<pair<int,int>> ord(N);
for(int i = 0; i < N; ++i) {
ord[i] = {b[i],i};
}
sort(ALL(ord));
ll ans = 0;
for(int i = 0; i < N; ++i) {
ans += bit.get(N)-bit.get(ord[i].second);
bit.update(ord[i].second,1);
}
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0