結果
問題 | No.1906 Twinkle Town |
ユーザー |
![]() |
提出日時 | 2022-02-11 16:51:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 3,138 bytes |
コンパイル時間 | 2,758 ms |
コンパイル使用メモリ | 204,576 KB |
最終ジャッジ日時 | 2025-01-27 21:15:18 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 |
ソースコード
#include <bits/stdc++.h>using namespace std;//using namespace atcoder;struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)#define REP(i, n) FOR(i,0,n)#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)#define IREP(i, n) IFOR(i,0,n)#define Sort(v) sort(v.begin(), v.end())#define Reverse(v) reverse(v.begin(), v.end())#define all(v) v.begin(),v.end()#define SZ(v) ((int)v.size())#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))#define chmax(a, b) a = max(a, b)#define chmin(a, b) a = min(a, b)#define bit(n) (1LL<<(n))#define debug(x) cout << #x << "=" << x << endl;#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, (int)v.size()){ cout << v[i_debug] << ","; } cout << endl; }#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, (int)m.size()){ REP(j_debug, (int)m[i_debug].size()){ cout << m[i_debug][j_debug] << ",";} cout << endl;} }#define pb push_back#define fi first#define se second#define int long long#define INF 1000000000000000000template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < (int)v.size(); i++) { cout << v[i]; if(i != (int)v.size() - 1) cout << endl; }; return os; }template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }template<typename T> void Out(T x) { cout << x << endl; }template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }using vec = vector<int>;using mat = vector<vec>;using Pii = pair<int, int>;using v_bool = vector<bool>;using v_Pii = vector<Pii>;//int dx[4] = {1,0,-1,0};//int dy[4] = {0,1,0,-1};//char d[4] = {'D','R','U','L'};//const int mod = 1000000007;const int mod = 998244353;// 後攻が何個とれるかint solve_even(vec A, int N){vec a(N);a[0] = A[0];FOR(i, 1, N) a[i] = A[i] - A[i - 1];priority_queue<int> que;que.push(a[0]);int ans = 0;REP(i, N / 2){ans += que.top(); que.pop();if(i < N / 2 - 1){que.push(a[2 * i + 1]);que.push(a[2 * i + 2]);}}return ans;}int solve_odd(vec A, int N){vec a(N);a[0] = A[0];FOR(i, 1, N) a[i] = A[i] - A[i - 1];priority_queue<int> que;que.push(a[0]);int ans = 0;REP(i, N / 2 + 1){ans += que.top(); que.pop();if(i < N / 2){que.push(a[2 * i + 1]);que.push(a[2 * i + 2]);}}return ans;}signed main(){int T; cin >> T;vec ans(T);REP(q, T){int N; cin >> N;vec A(N); cin >> A;Sort(A);if(N % 2) ans[q] = solve_odd(A, N);else ans[q] = A.back() - solve_even(A, N);}cout << ans << endl;return 0;}