結果
問題 | No.1282 Display Elements |
ユーザー | snrnsidy |
提出日時 | 2021-12-03 04:36:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 4,876 bytes |
コンパイル時間 | 1,858 ms |
コンパイル使用メモリ | 208,836 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-05 08:09:58 |
合計ジャッジ時間 | 4,083 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 51 ms
5,376 KB |
testcase_16 | AC | 20 ms
5,376 KB |
testcase_17 | AC | 42 ms
5,376 KB |
testcase_18 | AC | 26 ms
5,376 KB |
testcase_19 | AC | 28 ms
5,376 KB |
testcase_20 | AC | 26 ms
5,376 KB |
testcase_21 | AC | 55 ms
5,376 KB |
testcase_22 | AC | 36 ms
5,376 KB |
testcase_23 | AC | 55 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; 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 { // Reference: https://en.wikipedia.org/wiki/Fenwick_tree template <class T> struct fenwick_tree { using U = internal::to_unsigned_t<T>; public: fenwick_tree() : _n(0) {} explicit 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 using namespace atcoder; vector <int> idx; int getidx(int x){ return lower_bound(idx.begin(), idx.end(), x) - idx.begin(); } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int n,t; vector <int> a,b; cin >> n; for(int i=0;i<n;i++) { cin >> t; a.push_back(t); } for(int i=0;i<n;i++) { cin >> t; b.push_back(t); } sort(a.begin(),a.end()); idx = b; sort(idx.begin(),idx.end()); idx.erase(unique(idx.begin(), idx.end()), idx.end()); int m = idx.size(); fenwick_tree<int> fw(m+1); long long int res = 0; for(int i=0;i<n;i++) { int IDX = getidx(b[i]); fw.add(IDX,1); IDX = getidx(a[i]); res += fw.sum(0,IDX); } cout << res << '\n'; return 0; }