結果
問題 | No.1913 Periodic Comparison |
ユーザー | tokusakurai |
提出日時 | 2022-04-07 19:41:21 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 336 ms / 2,000 ms |
コード長 | 4,486 bytes |
コンパイル時間 | 2,178 ms |
コンパイル使用メモリ | 210,432 KB |
実行使用メモリ | 50,744 KB |
最終ジャッジ日時 | 2023-08-18 18:34:42 |
合計ジャッジ時間 | 17,529 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 22 ms
38,204 KB |
testcase_01 | AC | 19 ms
38,092 KB |
testcase_02 | AC | 23 ms
38,208 KB |
testcase_03 | AC | 24 ms
38,204 KB |
testcase_04 | AC | 25 ms
38,204 KB |
testcase_05 | AC | 24 ms
38,212 KB |
testcase_06 | AC | 24 ms
38,144 KB |
testcase_07 | AC | 24 ms
38,176 KB |
testcase_08 | AC | 92 ms
39,260 KB |
testcase_09 | AC | 240 ms
47,976 KB |
testcase_10 | AC | 86 ms
38,872 KB |
testcase_11 | AC | 238 ms
48,092 KB |
testcase_12 | AC | 63 ms
48,144 KB |
testcase_13 | AC | 75 ms
39,088 KB |
testcase_14 | AC | 198 ms
48,116 KB |
testcase_15 | AC | 236 ms
48,076 KB |
testcase_16 | AC | 217 ms
48,124 KB |
testcase_17 | AC | 89 ms
39,348 KB |
testcase_18 | AC | 78 ms
38,964 KB |
testcase_19 | AC | 232 ms
48,156 KB |
testcase_20 | AC | 113 ms
48,144 KB |
testcase_21 | AC | 246 ms
48,168 KB |
testcase_22 | AC | 82 ms
38,824 KB |
testcase_23 | AC | 52 ms
38,684 KB |
testcase_24 | AC | 235 ms
48,128 KB |
testcase_25 | AC | 63 ms
48,032 KB |
testcase_26 | AC | 198 ms
48,112 KB |
testcase_27 | AC | 80 ms
38,940 KB |
testcase_28 | AC | 86 ms
38,936 KB |
testcase_29 | AC | 248 ms
48,520 KB |
testcase_30 | AC | 223 ms
48,080 KB |
testcase_31 | AC | 49 ms
38,744 KB |
testcase_32 | AC | 62 ms
38,736 KB |
testcase_33 | AC | 75 ms
38,888 KB |
testcase_34 | AC | 237 ms
48,188 KB |
testcase_35 | AC | 249 ms
48,124 KB |
testcase_36 | AC | 63 ms
47,904 KB |
testcase_37 | AC | 239 ms
48,080 KB |
testcase_38 | AC | 19 ms
38,204 KB |
testcase_39 | AC | 20 ms
38,200 KB |
testcase_40 | AC | 336 ms
49,584 KB |
testcase_41 | AC | 142 ms
47,596 KB |
testcase_42 | AC | 169 ms
50,744 KB |
ソースコード
#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; int main() { int N; cin >> N; int MAX = 1000000; vector<ll> X(N), Y(N); rep(i, N) cin >> X[i]; rep(i, N) cin >> Y[i]; vector<ll> v(N); rep(i, N) v[i] = i + 1; vector<priority_queue<pli>> que(MAX + 1); vector<int> id(MAX + 1, -1); rep(i, N) { if (id[Y[i]] != -1) { cout << "-1\n"; return 0; } id[Y[i]] = i; que[X[i]].emplace(Y[i], i); } vector<ll> ans(N, -1); int ptr = MAX; rep3(t, N, 1) { ll ma = -INF; int p = -1; for (int i = 0; i * t <= MAX; i++) { while (!empty(que[i])) { int j = que[i].top().second; if (ans[j] != -1 || X[j] != i) { que[i].pop(); continue; } ll tmp = Y[j] - X[j] * t; if (chmax(ma, tmp)) p = j; break; } } // cout << p << ' ' << ma << '\n'; if (ma < 0) { cout << "-1\n"; return 0; } if (t == 1 && ma > 0) { cout << "-1\n"; return 0; } rep3(i, ptr, ma + 1) { if (id[i] == -1) continue; int e = id[i]; if (ans[e] != -1) continue; if (Y[e] > ma) { ll d = (Y[e] - ma + t - 1) / t; Y[e] -= t * d; X[e] -= d; if (X[e] < 0 || Y[e] < 0 || id[Y[e]] != -1) { cout << "-1\n"; return 0; } id[Y[e]] = e; que[X[e]].emplace(Y[e], e); } id[i] = -1; } // print(X), print(Y); ans[p] = ma; ptr = ma; } print(ans); }