結果
問題 | No.937 Ultra Sword |
ユーザー | kcvlex |
提出日時 | 2019-11-30 00:22:56 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 941 ms / 3,000 ms |
コード長 | 3,712 bytes |
コンパイル時間 | 1,785 ms |
コンパイル使用メモリ | 175,480 KB |
実行使用メモリ | 80,332 KB |
最終ジャッジ日時 | 2023-08-13 09:29:04 |
合計ジャッジ時間 | 21,828 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 13 ms
4,380 KB |
testcase_01 | AC | 15 ms
4,380 KB |
testcase_02 | AC | 13 ms
4,380 KB |
testcase_03 | AC | 13 ms
4,376 KB |
testcase_04 | AC | 13 ms
4,376 KB |
testcase_05 | AC | 532 ms
79,944 KB |
testcase_06 | AC | 754 ms
61,016 KB |
testcase_07 | AC | 839 ms
68,272 KB |
testcase_08 | AC | 361 ms
32,428 KB |
testcase_09 | AC | 268 ms
24,296 KB |
testcase_10 | AC | 941 ms
75,120 KB |
testcase_11 | AC | 146 ms
15,464 KB |
testcase_12 | AC | 765 ms
69,264 KB |
testcase_13 | AC | 738 ms
67,916 KB |
testcase_14 | AC | 842 ms
77,300 KB |
testcase_15 | AC | 660 ms
58,016 KB |
testcase_16 | AC | 21 ms
4,380 KB |
testcase_17 | AC | 66 ms
8,104 KB |
testcase_18 | AC | 736 ms
64,256 KB |
testcase_19 | AC | 427 ms
38,412 KB |
testcase_20 | AC | 328 ms
33,504 KB |
testcase_21 | AC | 663 ms
80,332 KB |
testcase_22 | AC | 13 ms
4,376 KB |
testcase_23 | AC | 15 ms
4,380 KB |
testcase_24 | AC | 554 ms
79,300 KB |
testcase_25 | AC | 629 ms
72,904 KB |
testcase_26 | AC | 579 ms
57,720 KB |
testcase_27 | AC | 522 ms
57,684 KB |
testcase_28 | AC | 694 ms
64,896 KB |
testcase_29 | AC | 27 ms
4,844 KB |
testcase_30 | AC | 461 ms
47,176 KB |
testcase_31 | AC | 732 ms
77,172 KB |
testcase_32 | AC | 385 ms
46,616 KB |
testcase_33 | AC | 692 ms
79,064 KB |
testcase_34 | AC | 123 ms
14,032 KB |
testcase_35 | AC | 54 ms
7,740 KB |
testcase_36 | AC | 615 ms
67,380 KB |
testcase_37 | AC | 58 ms
8,368 KB |
testcase_38 | AC | 485 ms
52,028 KB |
testcase_39 | AC | 34 ms
5,360 KB |
testcase_40 | AC | 555 ms
62,224 KB |
testcase_41 | AC | 202 ms
24,780 KB |
testcase_42 | AC | 403 ms
48,432 KB |
testcase_43 | AC | 421 ms
43,876 KB |
testcase_44 | AC | 140 ms
17,236 KB |
testcase_45 | AC | 258 ms
28,988 KB |
testcase_46 | AC | 295 ms
30,312 KB |
ソースコード
// #define DEBUGGING #include <bits/stdc++.h> #define endl '\n' #define ALL(V) (V).begin(), (V).end() #define ALLR(V) (V).rbegin(), (V).rend() template <typename T> using V = std::vector<T>; template <typename T> using VV = V<V<T>>; using ll = std::int64_t; using ull = std::uint64_t; using PLL = std::pair<ll, ll>; using TLL = std::tuple<ll, ll, ll>; template <typename T> const T& var_min(const T &t) { return t; } template <typename T> const T& var_max(const T &t) { return t; } template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); } template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); } namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } #define mv_rec make_v(init, tail...) template <typename T> T make_v(T init) { return init; } template <typename T, typename... Tail> auto make_v(T init, size_t s, Tail... tail) { return V<decltype(mv_rec)>(s, mv_rec); } #undef mv_rec using namespace std; #ifdef DEBUGGING #include "../../debug/debug.cpp" #else #define DEBUG(...) 0 #define DEBUG_SEPARATOR_LINE 0 #endif using BS = bitset<64>; using Matrix = V<BS>; tuple<Matrix, ll> gauss_elim(Matrix mat) { ll fcnt = 0; ll upper_row = 0; for(ll col = 0; col < 64; col++) { ll row = -1; for(ll r = upper_row; r < mat.size(); r++) { if(mat[r].test(col)) { row = r; break; } } if(row == -1) { fcnt++; continue; } swap(mat[upper_row], mat[row]); for(ll r = 0; r < mat.size(); r++) { if(r == upper_row) continue; if(!mat[r].test(col)) continue; mat[r] ^= mat[upper_row]; } upper_row++; } return make_tuple(mat, fcnt); } const ll inf = 5e15; int main() { ll N; cin >> N; V<ll> A(N); for(auto &&ele : A) cin >> ele; Matrix mat; for(ll i = 0; i < N; i++) { ll cur = A[i]; for(ll k = 0; k < 32; k++) { mat.push_back(BS(cur)); cur *= 2; } } Matrix ret; ll fcnt; tie(ret, fcnt) = gauss_elim(mat); ll rank = ret.size() - fcnt; while(rank < ret.size()) ret.pop_back(); V<ll> sum_v(1e5 + 10); ll sum = 0; for(ll e : A) { sum += e; sum_v[e]++; } ll idx[64]; fill(idx, idx + 64, inf); for(ll i = 0; i < ret.size(); i++) { for(ll j = 0; j < 64; j++) { if(!ret[i].test(j)) continue; chmin(idx[j], i); break; } } ll ans = inf; for(ll j = 1; j <= 1e5 + 10; j++) { { BS bs(j); for(ll k = 0; k < 32; k++) { if(!bs.test(k)) continue; if(idx[k] == inf) continue; bs ^= ret[idx[k]]; } if(bs.any()) continue; } ll tmp = sum; for(ll k = 1; j * k < sum_v.size(); k++) tmp -= sum_v[j * k] * (j * k - k); chmin(ans, tmp); } cout << ans << endl; return 0; }