結果
問題 | No.1906 Twinkle Town |
ユーザー | 👑 rin204 |
提出日時 | 2023-10-09 21:13:14 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 11,572 bytes |
コンパイル時間 | 3,459 ms |
コンパイル使用メモリ | 261,828 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-26 19:37:30 |
合計ジャッジ時間 | 7,419 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 37 ms
6,944 KB |
testcase_04 | AC | 28 ms
6,940 KB |
testcase_05 | AC | 38 ms
6,944 KB |
testcase_06 | AC | 27 ms
6,944 KB |
testcase_07 | AC | 37 ms
6,940 KB |
testcase_08 | AC | 28 ms
6,940 KB |
testcase_09 | AC | 37 ms
6,940 KB |
testcase_10 | AC | 27 ms
6,940 KB |
testcase_11 | AC | 37 ms
6,940 KB |
testcase_12 | AC | 27 ms
6,944 KB |
testcase_13 | AC | 37 ms
6,940 KB |
testcase_14 | AC | 28 ms
6,944 KB |
testcase_15 | AC | 38 ms
6,940 KB |
testcase_16 | AC | 27 ms
6,944 KB |
testcase_17 | AC | 36 ms
6,940 KB |
testcase_18 | AC | 26 ms
6,940 KB |
testcase_19 | AC | 37 ms
6,944 KB |
testcase_20 | AC | 27 ms
6,944 KB |
testcase_21 | AC | 45 ms
6,940 KB |
testcase_22 | AC | 31 ms
6,944 KB |
testcase_23 | AC | 45 ms
6,940 KB |
testcase_24 | AC | 31 ms
6,944 KB |
testcase_25 | AC | 44 ms
6,940 KB |
testcase_26 | AC | 32 ms
6,944 KB |
testcase_27 | AC | 45 ms
6,940 KB |
testcase_28 | AC | 30 ms
6,944 KB |
testcase_29 | AC | 52 ms
6,944 KB |
testcase_30 | AC | 42 ms
6,940 KB |
testcase_31 | AC | 51 ms
6,944 KB |
testcase_32 | AC | 43 ms
6,944 KB |
testcase_33 | AC | 51 ms
6,940 KB |
testcase_34 | AC | 42 ms
6,944 KB |
testcase_35 | AC | 50 ms
6,940 KB |
testcase_36 | AC | 42 ms
6,940 KB |
testcase_37 | AC | 52 ms
6,940 KB |
testcase_38 | AC | 43 ms
6,940 KB |
testcase_39 | AC | 54 ms
6,944 KB |
testcase_40 | AC | 54 ms
6,940 KB |
testcase_41 | AC | 53 ms
6,940 KB |
testcase_42 | AC | 53 ms
6,940 KB |
testcase_43 | AC | 54 ms
6,940 KB |
testcase_44 | AC | 53 ms
6,940 KB |
testcase_45 | AC | 24 ms
6,944 KB |
testcase_46 | AC | 32 ms
6,940 KB |
testcase_47 | AC | 26 ms
6,940 KB |
testcase_48 | AC | 32 ms
6,940 KB |
testcase_49 | AC | 37 ms
6,940 KB |
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;namespace templates {// typeusing ll = long long;using ull = unsigned long long;template <class T>using pq = priority_queue<T>;template <class T>using qp = priority_queue<T, vector<T>, greater<T>>;#define vec(T, A, ...) vector<T> A(__VA_ARGS__);#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));// for loop#define fori1(a) for (ll _ = 0; _ < (a); _++)#define fori2(i, a) for (ll i = 0; i < (a); i++)#define fori3(i, a, b) for (ll i = (a); i < (b); i++)#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))#define overload4(a, b, c, d, e, ...) e#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)// declare and input// clang-format off#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);#define VEC(T, A, n) vector<T> A(n); inp(A);#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);// clang-format on// const valueconst ll MOD1 = 1000000007;const ll MOD9 = 998244353;const double PI = acos(-1);// other macro#ifndef RIN__LOCAL#define endl "\n"#endif#define spa ' '#define len(A) ll(A.size())#define all(A) begin(A), end(A)// functionvector<char> stoc(string &S) {int n = S.size();vector<char> ret(n);for (int i = 0; i < n; i++) ret[i] = S[i];return ret;}string ctos(vector<char> &S) {int n = S.size();string ret = "";for (int i = 0; i < n; i++) ret += S[i];return ret;}template <class T>auto min(const T &a) {return *min_element(all(a));}template <class T>auto max(const T &a) {return *max_element(all(a));}template <class T, class S>auto clamp(T &a, const S &l, const S &r) {return (a > r ? r : a < l ? l : a);}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}template <class T, class S>inline bool chclamp(T &a, const S &l, const S &r) {auto b = clamp(a, l, r);return (a != b ? a = b, 1 : 0);}template <typename T>T sum(vector<T> &A) {T tot = 0;for (auto a : A) tot += a;return tot;}template <typename T>vector<T> compression(vector<T> X) {sort(all(X));X.erase(unique(all(X)), X.end());return X;}// input and outputnamespace io {// vector<T>template <typename T>istream &operator>>(istream &is, vector<T> &A) {for (auto &a : A) is >> a;return is;}template <typename T>ostream &operator<<(ostream &os, vector<T> &A) {for (size_t i = 0; i < A.size(); i++) {os << A[i];if (i != A.size() - 1) os << ' ';}return os;}// vector<vector<T>>template <typename T>istream &operator>>(istream &is, vector<vector<T>> &A) {for (auto &a : A) is >> a;return is;}template <typename T>ostream &operator<<(ostream &os, vector<vector<T>> &A) {for (size_t i = 0; i < A.size(); i++) {os << A[i];if (i != A.size() - 1) os << endl;}return os;}// pair<S, T>template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &A) {is >> A.first >> A.second;return is;}template <typename S, typename T>ostream &operator<<(ostream &os, pair<S, T> &A) {os << A.first << ' ' << A.second;return os;}// vector<pair<S, T>>template <typename S, typename T>ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {for (size_t i = 0; i < A.size(); i++) {os << A[i];if (i != A.size() - 1) os << endl;}return os;}// set<T>template <typename T>ostream &operator<<(ostream &os, set<T> &A) {for (auto itr = A.begin(); itr != A.end(); itr++) {os << *itr;if (next(itr) != A.end()) os << ' ';}return os;}// unordered_set<T>template <typename T>ostream &operator<<(ostream &os, unordered_set<T> &A) {for (auto itr = A.begin(); itr != A.end(); itr++) {os << *itr;if (next(itr) != A.end()) os << ' ';}return os;}// multiset<T>template <typename T>ostream &operator<<(ostream &os, multiset<T> &A) {for (auto itr = A.begin(); itr != A.end(); itr++) {os << *itr;if (next(itr) != A.end()) os << ' ';}return os;}// unordered_multiset<T>template <typename T>ostream &operator<<(ostream &os, unordered_multiset<T> &A) {for (auto itr = A.begin(); itr != A.end(); itr++) {os << *itr;if (next(itr) != A.end()) os << endl;}return os;}// map<S, T>template <typename S, typename T>ostream &operator<<(ostream &os, map<S, T> &A) {for (auto itr = A.begin(); itr != A.end(); itr++) {os << *itr;if (next(itr) != A.end()) os << endl;}return os;}// unordered_map<S, T>template <typename S, typename T>ostream &operator<<(ostream &os, unordered_map<S, T> &A) {for (auto itr = A.begin(); itr != A.end(); itr++) {os << *itr;if (next(itr) != A.end()) os << endl;}return os;}// tupletemplate <typename T, size_t N>struct TuplePrint {static ostream &print(ostream &os, const T &t) {TuplePrint<T, N - 1>::print(os, t);os << ' ' << get<N - 1>(t);return os;}};template <typename T>struct TuplePrint<T, 1> {static ostream &print(ostream &os, const T &t) {os << get<0>(t);return os;}};template <typename... Args>ostream &operator<<(ostream &os, const tuple<Args...> &t) {TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);return os;}// queue<T>template <typename T>ostream &operator<<(ostream &os, queue<T> &A) {auto B = A;while (!B.empty()) {os << B.front();B.pop();if (!B.empty()) os << ' ';}return os;}// deque<T>template <typename T>ostream &operator<<(ostream &os, deque<T> &A) {auto B = A;while (!B.empty()) {os << B.front();B.pop_front();if (!B.empty()) os << ' ';}return os;}// stack<T>template <typename T>ostream &operator<<(ostream &os, stack<T> &A) {auto B = A;stack<T> C;while (!B.empty()) {C.push(B.top());B.pop();}while (!C.empty()) {os << C.top();C.pop();if (!C.empty()) os << ' ';}return os;}// priority_queue<T>template <typename T>ostream &operator<<(ostream &os, priority_queue<T> &A) {auto B = A;while (!B.empty()) {os << B.top();B.pop();if (!B.empty()) os << endl;}return os;}// bitset<N>template <size_t N>ostream &operator<<(ostream &os, bitset<N> &A) {for (size_t i = 0; i < N; i++) {os << A[i];}return os;}// io functionsvoid FLUSH() {cout << flush;}void print() {cout << endl;}template <class Head, class... Tail>void print(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail)) cout << spa;print(forward<Tail>(tail)...);}template <typename T, typename S>void prisep(vector<T> &A, S sep) {int n = A.size();for (int i = 0; i < n; i++) {cout << A[i];if (i != n - 1) cout << sep;}cout << endl;}template <typename T, typename S>void priend(T A, S end) {cout << A << end;}template <typename T>void prispa(T A) {priend(A, spa);}template <typename T, typename S>bool printif(bool f, T A, S B) {if (f)print(A);elseprint(B);return f;}template <class... T>void inp(T &...a) {(cin >> ... >> a);}} // namespace iousing namespace io;// read graphvector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<int>> edges(n, vector<int>());for (int i = 0; i < m; i++) {INT(u, v);u -= indexed;v -= indexed;edges[u].push_back(v);if (!direct) edges[v].push_back(u);}return edges;}vector<vector<int>> read_tree(int n, int indexed = 1) {return read_edges(n, n - 1, false, indexed);}template <typename T = long long>vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());for (int i = 0; i < m; i++) {INT(u, v);T w;inp(w);u -= indexed;v -= indexed;edges[u].push_back({v, w});if (!direct) edges[v].push_back({u, w});}return edges;}template <typename T = long long>vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {return read_wedges<T>(n, n - 1, false, indexed);}// yes / nonamespace yesno {// yesinline bool yes(bool f = true) {cout << (f ? "yes" : "no") << endl;return f;}inline bool Yes(bool f = true) {cout << (f ? "Yes" : "No") << endl;return f;}inline bool YES(bool f = true) {cout << (f ? "YES" : "NO") << endl;return f;}// noinline bool no(bool f = true) {cout << (!f ? "yes" : "no") << endl;return f;}inline bool No(bool f = true) {cout << (!f ? "Yes" : "No") << endl;return f;}inline bool NO(bool f = true) {cout << (!f ? "YES" : "NO") << endl;return f;}// possibleinline bool possible(bool f = true) {cout << (f ? "possible" : "impossible") << endl;return f;}inline bool Possible(bool f = true) {cout << (f ? "Possible" : "Impossible") << endl;return f;}inline bool POSSIBLE(bool f = true) {cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;return f;}// impossibleinline bool impossible(bool f = true) {cout << (!f ? "possible" : "impossible") << endl;return f;}inline bool Impossible(bool f = true) {cout << (!f ? "Possible" : "Impossible") << endl;return f;}inline bool IMPOSSIBLE(bool f = true) {cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;return f;}// Alice Bobinline bool Alice(bool f = true) {cout << (f ? "Alice" : "Bob") << endl;return f;}inline bool Bob(bool f = true) {cout << (f ? "Bob" : "Alice") << endl;return f;}// Takahashi Aokiinline bool Takahashi(bool f = true) {cout << (f ? "Takahashi" : "Aoki") << endl;return f;}inline bool Aoki(bool f = true) {cout << (f ? "Aoki" : "Takahashi") << endl;return f;}} // namespace yesnousing namespace yesno;} // namespace templatesusing namespace templates;void solve() {LL(n);VEC(ll, A, n);sort(all(A));fori(i, n - 1, 0, -1) A[i] -= A[i - 1];pq<ll> q;int l = 1;ll tot = A[0];ll ans = A[0];fori((n + 1) / 2 - 1) {fori(2) {if (l < n) {tot += A[l];q.push(A[l++]);}}ans += q.top();q.pop();}if (n % 2 == 0) ans = tot + A.back() - ans;print(ans);}int main() {cin.tie(0)->sync_with_stdio(0);// cout << fixed << setprecision(12);int t;t = 1;cin >> t;while (t--) solve();return 0;}