結果
問題 | No.1919 Many Monster Battles |
ユーザー |
|
提出日時 | 2022-04-29 23:29:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 400 ms / 2,000 ms |
コード長 | 7,850 bytes |
コンパイル時間 | 2,432 ms |
コンパイル使用メモリ | 215,700 KB |
最終ジャッジ日時 | 2025-01-29 00:15:19 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < n; i++)#define rep2(i, x, n) for (int i = x; i <= n; i++)#define rep3(i, x, n) for (int i = x; i >= n; i--)#define each(e, v) for (auto &e : v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;const int inf = (1 << 30) - 1;const ll INF = (1LL << 60) - 1;const int MOD = 1000000007;// const int MOD = 998244353;template <int mod>struct Mod_Int {int x;Mod_Int() : x(0) {}Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}static int get_mod() { return mod; }Mod_Int &operator+=(const Mod_Int &p) {if ((x += p.x) >= mod) x -= mod;return *this;}Mod_Int &operator-=(const Mod_Int &p) {if ((x += mod - p.x) >= mod) x -= mod;return *this;}Mod_Int &operator*=(const Mod_Int &p) {x = (int)(1LL * x * p.x % mod);return *this;}Mod_Int &operator/=(const Mod_Int &p) {*this *= p.inverse();return *this;}Mod_Int &operator++() { return *this += Mod_Int(1); }Mod_Int operator++(int) {Mod_Int tmp = *this;++*this;return tmp;}Mod_Int &operator--() { return *this -= Mod_Int(1); }Mod_Int operator--(int) {Mod_Int tmp = *this;--*this;return tmp;}Mod_Int operator-() const { return Mod_Int(-x); }Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; }Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; }Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; }Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; }bool operator==(const Mod_Int &p) const { return x == p.x; }bool operator!=(const Mod_Int &p) const { return x != p.x; }Mod_Int inverse() const {assert(*this != Mod_Int(0));return pow(mod - 2);}Mod_Int pow(long long k) const {Mod_Int now = *this, ret = 1;for (; k > 0; k >>= 1, now *= now) {if (k & 1) ret *= now;}return ret;}friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; }friend istream &operator>>(istream &is, Mod_Int &p) {long long a;is >> a;p = Mod_Int<mod>(a);return is;}};using mint = Mod_Int<MOD>;template <typename T>struct Binary_Indexed_Tree {vector<T> bit;const int n;Binary_Indexed_Tree(const vector<T> &v) : n((int)v.size()) {bit.resize(n + 1);copy(begin(v), end(v), begin(bit) + 1);for (int a = 2; a <= n; a <<= 1) {for (int b = a; b <= n; b += a) bit[b] += bit[b - a / 2];}}Binary_Indexed_Tree(int n, const T &x) : n(n) {bit.resize(n + 1);vector<T> v(n, x);copy(begin(v), end(v), begin(bit) + 1);for (int a = 2; a <= n; a <<= 1) {for (int b = a; b <= n; b += a) bit[b] += bit[b - a / 2];}}void add(int i, const T &x) {for (i++; i <= n; i += (i & -i)) bit[i] += x;}void change(int i, const T &x) { add(i, x - query(i, i + 1)); }T sum(int i) const {T ret = 0;for (; i > 0; i -= (i & -i)) ret += bit[i];return ret;}T query(int l, int r) const { return sum(r) - sum(l); }T operator[](int i) const { return query(i, i + 1); }int lower_bound(T x) const {int ret = 0;for (int k = 31 - __builtin_clz(n); k >= 0; k--) {if (ret + (1 << k) <= n && bit[ret + (1 << k)] < x) x -= bit[ret += (1 << k)];}return ret;}int upper_bound(T x) const {int ret = 0;for (int k = 31 - __builtin_clz(n); k >= 0; k--) {if (ret + (1 << k) <= n && bit[ret + (1 << k)] <= x) x -= bit[ret += (1 << k)];}return ret;}};int main() {int N;cin >> N;vector<ll> a(N), b(N);rep(i, N) cin >> a[i];rep(i, N) cin >> b[i];vector<ll> x(N), y(N);rep(i, N) x[i] = a[i] + b[i], y[i] = b[i] - a[i];auto ys = y;rearrange(ys);int K = sz(ys);Binary_Indexed_Tree<mint> l1(K, 0), l2(K, 0), r1(K, 0), r2(K, 0);Binary_Indexed_Tree<mint> cl1(K, 0), cl2(K, 0), cr1(K, 0), cr2(K, 0);rep(i, N) {int t = lb(ys, y[i]);r1.add(t, a[i]), cr1.add(t, 1);r2.add(t, b[i]), cr2.add(t, 1);}mint ans1 = 0, ans2 = 0;auto v = id_sort(x);int pl = 0, pr = 0;rep(i, N) {int e = v[i];while (pr < N && x[v[pr]] == x[e]) {int u = v[pr];int t = lb(ys, y[u]);r1.add(t, -a[u]), cr1.add(t, -1);r2.add(t, -b[u]), cr2.add(t, -1);pr++;}while (pl < N && x[v[pl]] < x[e]) {int u = v[pl];int t = lb(ys, y[u]);l1.add(t, a[u]), cl1.add(t, 1);l2.add(t, b[u]), cl2.add(t, 1);pl++;}int t = lb(ys, y[e]);{ans1 += r1.query(0, t);ans1 -= cr1.query(0, t) * a[e];}{ans2 += r2.query(t + 1, K);ans2 -= cr2.query(t + 1, K) * b[e];}{ans1 -= l1.query(t + 1, K);ans1 += cl1.query(t + 1, K) * a[e];}{ans2 -= l2.query(0, t);ans2 += cl2.query(0, t) * b[e];}}cout << ans1 << ' ' << ans2 << '\n';}