結果
問題 | No.2918 Divide Applicants Fairly |
ユーザー | 👑 binap |
提出日時 | 2024-10-01 14:25:35 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,458 bytes |
コンパイル時間 | 4,421 ms |
コンパイル使用メモリ | 271,520 KB |
実行使用メモリ | 126,592 KB |
最終ジャッジ日時 | 2024-10-07 11:33:29 |
合計ジャッジ時間 | 8,558 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 9 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 393 ms
61,056 KB |
testcase_12 | AC | 5 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 5 ms
5,248 KB |
testcase_18 | AC | 398 ms
60,032 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 242 ms
44,800 KB |
testcase_21 | AC | 5 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 9 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 834 ms
126,592 KB |
testcase_26 | AC | 2 ms
5,248 KB |
testcase_27 | AC | 113 ms
22,784 KB |
testcase_28 | AC | 2 ms
5,248 KB |
testcase_29 | AC | 2 ms
5,248 KB |
testcase_30 | AC | 2 ms
5,248 KB |
testcase_31 | AC | 2 ms
5,248 KB |
testcase_32 | AC | 2 ms
5,248 KB |
testcase_33 | AC | 2 ms
5,248 KB |
testcase_34 | AC | 1 ms
5,248 KB |
testcase_35 | AC | 2 ms
5,248 KB |
testcase_36 | AC | 77 ms
17,536 KB |
testcase_37 | AC | 23 ms
8,320 KB |
testcase_38 | AC | 11 ms
5,760 KB |
testcase_39 | AC | 2 ms
5,248 KB |
testcase_40 | AC | 2 ms
5,248 KB |
testcase_41 | AC | 2 ms
5,248 KB |
testcase_42 | AC | 2 ms
5,248 KB |
testcase_43 | AC | 2 ms
5,248 KB |
testcase_44 | AC | 2 ms
5,248 KB |
testcase_45 | AC | 2 ms
5,248 KB |
testcase_46 | AC | 2 ms
5,248 KB |
testcase_47 | AC | 1 ms
5,248 KB |
testcase_48 | AC | 8 ms
5,248 KB |
testcase_49 | WA | - |
testcase_50 | AC | 2 ms
5,248 KB |
testcase_51 | AC | 5 ms
5,248 KB |
testcase_52 | AC | 36 ms
9,856 KB |
testcase_53 | AC | 6 ms
5,248 KB |
testcase_54 | AC | 6 ms
5,248 KB |
testcase_55 | AC | 17 ms
7,296 KB |
testcase_56 | WA | - |
testcase_57 | AC | 108 ms
22,016 KB |
testcase_58 | WA | - |
testcase_59 | AC | 18 ms
7,552 KB |
testcase_60 | AC | 3 ms
5,248 KB |
testcase_61 | AC | 11 ms
5,888 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;} template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} const int INF = 1001001001; const int K = 20; int main(){ int n; cin >> n; if(n >= 26){ cout << "0\n"; return 0; } vector<int> a(n); cin >> a; vector<int> perm(n); rep(i, n) perm[i] = i; int n1 = n / 2; int n2 = n - n1; vector<int> perm1(n1); rep(i, n1) perm1[i] = i; vector<int> perm2(n2); rep(i, n2) perm2[i] = n1 + i; auto split = [&](int n, vector<int> perm){ vector<set<int>> res(2 * K + 1); rep(i, n){ vector<set<int>> res_old(2 * K + 1); swap(res, res_old); for(int j = 1; j < 2 * K; j++){ for(int sum : res_old[j]){ res[j - 1].insert(sum - a[perm[i]]); res[j].insert(sum); res[j + 1].insert(sum + a[perm[i]]); } } { res[K - 1].insert(-a[perm[i]]); res[K + 1].insert(+a[perm[i]]); } } return res; }; vector<set<int>> set1 = split(n1, perm1); vector<set<int>> set2 = split(n2, perm2); int ans = INF; for(int i = 0; i <= n1; i++){ for(int sum1 : set1[K + i]){ auto it = set2[K + i].lower_bound(sum1); if(it != set2[K + i].end()){ chmin(ans, *it - sum1); } if(it != set2[K + i].begin()){ chmin(ans, sum1 - *prev(it)); } } } cout << ans << "\n"; return 0; }