結果
問題 | No.2114 01 Matching |
ユーザー | tokusakurai |
提出日時 | 2022-10-29 10:03:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 440 ms / 5,000 ms |
コード長 | 5,581 bytes |
コンパイル時間 | 3,021 ms |
コンパイル使用メモリ | 222,052 KB |
実行使用メモリ | 50,104 KB |
最終ジャッジ日時 | 2023-08-16 02:51:14 |
合計ジャッジ時間 | 16,755 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 163 ms
15,956 KB |
testcase_03 | AC | 61 ms
13,032 KB |
testcase_04 | AC | 90 ms
16,936 KB |
testcase_05 | AC | 70 ms
8,156 KB |
testcase_06 | AC | 134 ms
14,632 KB |
testcase_07 | AC | 70 ms
10,108 KB |
testcase_08 | AC | 237 ms
15,500 KB |
testcase_09 | AC | 173 ms
9,036 KB |
testcase_10 | AC | 148 ms
13,676 KB |
testcase_11 | AC | 420 ms
50,088 KB |
testcase_12 | AC | 422 ms
49,992 KB |
testcase_13 | AC | 217 ms
18,700 KB |
testcase_14 | AC | 180 ms
23,020 KB |
testcase_15 | AC | 181 ms
22,752 KB |
testcase_16 | AC | 244 ms
22,856 KB |
testcase_17 | AC | 127 ms
15,100 KB |
testcase_18 | AC | 141 ms
12,844 KB |
testcase_19 | AC | 198 ms
18,752 KB |
testcase_20 | AC | 431 ms
50,104 KB |
testcase_21 | AC | 235 ms
20,084 KB |
testcase_22 | AC | 125 ms
8,300 KB |
testcase_23 | AC | 189 ms
17,256 KB |
testcase_24 | AC | 55 ms
5,548 KB |
testcase_25 | AC | 62 ms
8,356 KB |
testcase_26 | AC | 440 ms
49,980 KB |
testcase_27 | AC | 433 ms
49,996 KB |
testcase_28 | AC | 201 ms
28,940 KB |
testcase_29 | AC | 436 ms
49,928 KB |
testcase_30 | AC | 70 ms
10,800 KB |
testcase_31 | AC | 440 ms
50,020 KB |
testcase_32 | AC | 232 ms
11,740 KB |
testcase_33 | AC | 148 ms
16,328 KB |
testcase_34 | AC | 69 ms
10,160 KB |
testcase_35 | AC | 140 ms
21,996 KB |
testcase_36 | AC | 439 ms
50,028 KB |
testcase_37 | AC | 183 ms
10,768 KB |
testcase_38 | AC | 72 ms
10,204 KB |
testcase_39 | AC | 108 ms
6,992 KB |
testcase_40 | AC | 137 ms
21,840 KB |
testcase_41 | AC | 221 ms
10,620 KB |
testcase_42 | AC | 182 ms
12,408 KB |
testcase_43 | AC | 121 ms
14,624 KB |
testcase_44 | AC | 269 ms
22,132 KB |
testcase_45 | AC | 199 ms
49,732 KB |
testcase_46 | AC | 73 ms
5,860 KB |
testcase_47 | AC | 431 ms
49,796 KB |
testcase_48 | AC | 427 ms
49,988 KB |
testcase_49 | AC | 207 ms
17,856 KB |
testcase_50 | AC | 82 ms
6,104 KB |
testcase_51 | AC | 67 ms
10,284 KB |
testcase_52 | AC | 175 ms
23,228 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #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> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; 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 <typename Operator_Monoid> struct Dual_Segment_Tree { using H = function<Operator_Monoid(Operator_Monoid, Operator_Monoid)>; int n, height; vector<Operator_Monoid> lazy; const H h; const Operator_Monoid e2; Dual_Segment_Tree(int m, const H &h, const Operator_Monoid &e2) : h(h), e2(e2) { n = 1, height = 0; while (n < m) n <<= 1, height++; lazy.assign(2 * n, e2); } inline void eval(int i) { if (i < n && lazy[i] != e2) { lazy[2 * i] = h(lazy[2 * i], lazy[i]); lazy[2 * i + 1] = h(lazy[2 * i + 1], lazy[i]); lazy[i] = e2; } } inline void thrust(int i) { for (int j = height; j > 0; j--) eval(i >> j); } void apply(int l, int r, const Operator_Monoid &x) { l = max(l, 0), r = min(r, n); if (l >= r) return; l += n, r += n; thrust(l), thrust(r - 1); while (l < r) { if (l & 1) lazy[l] = h(lazy[l], x), l++; if (r & 1) r--, lazy[r] = h(lazy[r], x); l >>= 1, r >>= 1; } } Operator_Monoid get(int i) { thrust(i + n); return lazy[i + n]; } Operator_Monoid operator[](int i) { return get(i); } }; ll solve(vector<ll> a, vector<ll> b) { if (sz(a) > sz(b)) swap(a, b); int n = sz(a), m = sz(b); vector<pii> c; rep(i, n) c.eb(a[i], 0); rep(i, m) c.eb(b[i], 1); sort(all(c)); auto g = [](ll x, ll y) { return x + y; }; Dual_Segment_Tree<ll> seg(m + 1, g, 0); vector<ll> v(m + 1, INF); v[0] = 0; int s = 0; rep(i, n + m) { auto [w, col] = c[i]; if (col == 0) { seg.apply(0, s, w); seg.apply(s, m + 1, -w); s--; } else { ll tmp = (s >= 0 ? seg[s] + v[s] : 0); seg.apply(0, s + 1, -w); seg.apply(s + 1, m + 1, w); if (s >= 0) { ll now = seg[s + 1] + v[s + 1]; if (tmp < now) seg.apply(s + 1, s + 2, tmp - now); } s++; } } return seg[s] + v[s]; } int main() { int N, M, K; cin >> N >> M >> K; vector<ll> B(N), R(M); rep(i, N) cin >> B[i]; rep(i, M) cin >> R[i]; if (N > M) { swap(B, R); swap(N, M); } map<int, vector<ll>> mp1, mp2; rep(i, N) mp1[B[i] % K].eb(B[i] / K); rep(i, M) mp2[R[i] % K].eb(R[i] / K); ll ans = 0; each(e, mp1) { auto v = mp2[e.first]; if (sz(e.second) > sz(v)) { cout << "-1\n"; return 0; } ans += solve(e.second, v); } cout << ans << '\n'; }