結果
| 問題 | No.1282 Display Elements |
| ユーザー |
 Mister
|
| 提出日時 | 2020-11-19 18:40:58 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 200 ms / 2,000 ms |
| コード長 | 5,365 bytes |
| コンパイル時間 | 1,177 ms |
| コンパイル使用メモリ | 97,648 KB |
| 実行使用メモリ | 15,360 KB |
| 最終ジャッジ日時 | 2023-09-30 16:24:32 |
| 合計ジャッジ時間 | 3,363 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge15 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,380 KB |
| testcase_01 | AC | 2 ms
4,376 KB |
| testcase_02 | AC | 2 ms
4,376 KB |
| testcase_03 | AC | 1 ms
4,384 KB |
| testcase_04 | AC | 1 ms
4,380 KB |
| testcase_05 | AC | 1 ms
4,380 KB |
| testcase_06 | AC | 2 ms
4,376 KB |
| testcase_07 | AC | 2 ms
4,380 KB |
| testcase_08 | AC | 1 ms
4,384 KB |
| testcase_09 | AC | 2 ms
4,380 KB |
| testcase_10 | AC | 2 ms
4,376 KB |
| testcase_11 | AC | 2 ms
4,380 KB |
| testcase_12 | AC | 2 ms
4,380 KB |
| testcase_13 | AC | 2 ms
4,376 KB |
| testcase_14 | AC | 2 ms
4,376 KB |
| testcase_15 | AC | 178 ms
14,616 KB |
| testcase_16 | AC | 58 ms
7,524 KB |
| testcase_17 | AC | 141 ms
12,500 KB |
| testcase_18 | AC | 80 ms
8,972 KB |
| testcase_19 | AC | 32 ms
4,580 KB |
| testcase_20 | AC | 31 ms
4,700 KB |
| testcase_21 | AC | 200 ms
15,360 KB |
| testcase_22 | AC | 49 ms
4,640 KB |
| testcase_23 | AC | 197 ms
15,348 KB |
ソースコード
#line 2 "/Users/tiramister/CompetitiveProgramming/Cpp/CppLibrary/Tools/compress.hpp"
#include <algorithm>
#include <vector>
#include <map>
template <class T>
std::map<T, int> compress(std::vector<T>& v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(), v.end()), v.end());
std::map<T, int> rev;
for (int i = 0; i < (int)v.size(); ++i) rev[v[i]] = i;
return rev;
}
#line 2 "combined.cpp"
#include <cassert>
#line 5 "combined.cpp"
#line 8 "combined.cpp"
#include <numeric>
#include <type_traits>
namespace atcoder {
namespace internal {
#ifndef _MSC_VER
template <class T>
using is_signed_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value ||
std::is_same<T, __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int128 =
typename std::conditional<std::is_same<T, __uint128_t>::value ||
std::is_same<T, unsigned __int128>::value,
std::true_type,
std::false_type>::type;
template <class T>
using make_unsigned_int128 =
typename std::conditional<std::is_same<T, __int128_t>::value,
__uint128_t,
unsigned __int128>;
template <class T>
using is_integral = typename std::conditional<std::is_integral<T>::value ||
is_signed_int128<T>::value ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
std::is_signed<T>::value) ||
is_signed_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<(is_integral<T>::value &&
std::is_unsigned<T>::value) ||
is_unsigned_int128<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<
is_signed_int128<T>::value,
make_unsigned_int128<T>,
typename std::conditional<std::is_signed<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type>::type;
#else
template <class T> using is_integral = typename std::is_integral<T>;
template <class T>
using is_signed_int =
typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using is_unsigned_int =
typename std::conditional<is_integral<T>::value &&
std::is_unsigned<T>::value,
std::true_type,
std::false_type>::type;
template <class T>
using to_unsigned = typename std::conditional<is_signed_int<T>::value,
std::make_unsigned<T>,
std::common_type<T>>::type;
#endif
template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
} // namespace internal
} // namespace atcoder
namespace atcoder {
template <class T> struct fenwick_tree {
using U = internal::to_unsigned_t<T>;
public:
fenwick_tree() : _n(0) {}
fenwick_tree(int n) : _n(n), data(n) {}
void add(int p, T x) {
assert(0 <= p && p < _n);
p++;
while (p <= _n) {
data[p - 1] += U(x);
p += p & -p;
}
}
T sum(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
return sum(r) - sum(l);
}
private:
int _n;
std::vector<U> data;
U sum(int r) {
U s = 0;
while (r > 0) {
s += data[r - 1];
r -= r & -r;
}
return s;
}
};
} // namespace atcoder
#include <iostream>
#line 146 "combined.cpp"
using lint = long long;
void solve() {
int n;
std::cin >> n;
std::vector<int> xs(n), ys(n);
for (auto& x : xs) std::cin >> x;
for (auto& y : ys) std::cin >> y;
auto zs = xs;
std::copy(ys.begin(), ys.end(), std::back_inserter(zs));
auto zrev = compress(zs);
for (auto& x : xs) x = zrev[x];
for (auto& y : ys) y = zrev[y];
int m = zs.size();
std::sort(xs.begin(), xs.end());
lint ans = 0;
atcoder::fenwick_tree<lint> bit(m);
for (int i = 0; i < n; ++i) {
bit.add(ys[i], 1);
ans += bit.sum(0, xs[i]);
}
std::cout << ans << "\n";
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
solve();
return 0;
}