結果
問題 | No.2248 max(C)-min(C) |
ユーザー | au7777 |
提出日時 | 2023-04-11 17:21:32 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 362 ms / 3,000 ms |
コード長 | 3,367 bytes |
コンパイル時間 | 4,642 ms |
コンパイル使用メモリ | 240,072 KB |
実行使用メモリ | 19,732 KB |
最終ジャッジ日時 | 2024-04-16 14:45:14 |
合計ジャッジ時間 | 15,299 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 3 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 3 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 4 ms
5,376 KB |
testcase_09 | AC | 4 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 4 ms
5,376 KB |
testcase_12 | AC | 5 ms
5,376 KB |
testcase_13 | AC | 4 ms
5,376 KB |
testcase_14 | AC | 4 ms
5,376 KB |
testcase_15 | AC | 4 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 4 ms
5,376 KB |
testcase_18 | AC | 167 ms
13,212 KB |
testcase_19 | AC | 24 ms
5,508 KB |
testcase_20 | AC | 196 ms
19,604 KB |
testcase_21 | AC | 185 ms
19,528 KB |
testcase_22 | AC | 129 ms
12,020 KB |
testcase_23 | AC | 82 ms
8,260 KB |
testcase_24 | AC | 35 ms
5,848 KB |
testcase_25 | AC | 181 ms
19,236 KB |
testcase_26 | AC | 153 ms
12,696 KB |
testcase_27 | AC | 177 ms
19,200 KB |
testcase_28 | AC | 19 ms
5,376 KB |
testcase_29 | AC | 160 ms
12,836 KB |
testcase_30 | AC | 67 ms
7,932 KB |
testcase_31 | AC | 195 ms
19,732 KB |
testcase_32 | AC | 38 ms
5,692 KB |
testcase_33 | AC | 61 ms
7,820 KB |
testcase_34 | AC | 195 ms
19,604 KB |
testcase_35 | AC | 197 ms
19,728 KB |
testcase_36 | AC | 196 ms
19,604 KB |
testcase_37 | AC | 103 ms
11,836 KB |
testcase_38 | AC | 264 ms
19,600 KB |
testcase_39 | AC | 263 ms
19,604 KB |
testcase_40 | AC | 265 ms
19,732 KB |
testcase_41 | AC | 219 ms
12,888 KB |
testcase_42 | AC | 265 ms
19,604 KB |
testcase_43 | AC | 228 ms
19,272 KB |
testcase_44 | AC | 261 ms
19,604 KB |
testcase_45 | AC | 199 ms
12,832 KB |
testcase_46 | AC | 97 ms
8,200 KB |
testcase_47 | AC | 264 ms
19,596 KB |
testcase_48 | AC | 239 ms
19,596 KB |
testcase_49 | AC | 350 ms
19,728 KB |
testcase_50 | AC | 356 ms
19,676 KB |
testcase_51 | AC | 348 ms
19,604 KB |
testcase_52 | AC | 362 ms
19,604 KB |
testcase_53 | AC | 49 ms
5,592 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> typedef long long int ll; using namespace std; typedef pair<ll, ll> P; using namespace atcoder; template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>; #define USE998244353 #ifdef USE998244353 const ll MOD = 998244353; using mint = modint998244353; #else const ll MOD = 1000000007; using mint = modint1000000007; #endif const int MAX = 2000005; long long fac[MAX], finv[MAX], inv[MAX]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } long long COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } ll gcd(ll x, ll y) { if (y == 0) return x; else if (y > x) { return gcd (y, x); } else return gcd(x % y, y); } ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } ll my_sqrt(ll x) { // ll m = 0; ll M = 3000000001; while (M - m > 1) { ll now = (M + m) / 2; if (now * now <= x) { m = now; } else { M = now; } } return m; } ll keta(ll num, ll arity) { ll ret = 0; while (num) { num /= arity; ret++; } return ret; } ll ceil(ll n, ll m) { // n > 0, m > 0 ll ret = n / m; if (n % m) ret++; return ret; } ll pow_ll(ll x, ll n) { if (n == 0) return 1; if (n % 2) { return pow_ll(x, n - 1) * x; } else { ll tmp = pow_ll(x, n / 2); return tmp * tmp; } } vector<ll> compress(vector<ll>& v) { // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] vector<ll> u = v; sort(u.begin(), u.end()); u.erase(unique(u.begin(),u.end()),u.end()); map<ll, ll> mp; for (int i = 0; i < u.size(); i++) { mp[u[i]] = i; } for (int i = 0; i < v.size(); i++) { v[i] = mp[v[i]]; } return v; } int main() { int n; cin >> n; vector<int> a(n); vector<int> b(n); for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> b[i]; int s[n]; int m[n]; int l[n]; for (int i = 0; i < n; i++) { if (a[i] < b[i]) { s[i] = a[i]; m[i] = (a[i] + b[i]) / 2; l[i] = b[i]; } else { s[i] = b[i]; m[i] = (a[i] + b[i]) / 2; l[i] = a[i]; } } min_priority_queue<tuple<int, int, int>> que; // num, state, idx int maxC = 0; for (int i = 0; i < n; i++) { maxC = max(s[i], maxC); que.push({s[i], 0, i}); que.push({m[i], 1, i}); que.push({l[i], 2, i}); } int ans = 1000000000; while (que.size()) { auto p = que.top(); que.pop(); int minC = get<0>(p); int state = get<1>(p); int idx = get<2>(p); ans = min(ans, maxC - minC); if (state == 2) break; if (state == 0) { que.push({m[idx], 1, idx}); maxC = max(maxC, m[idx]); } if (state == 1) { que.push({l[idx], 2, idx}); maxC = max(maxC, l[idx]); } } cout << ans << endl; return 0; }