結果

問題 No.1906 Twinkle Town
ユーザー snukesnuke
提出日時 2022-04-15 22:25:15
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 113 ms / 2,000 ms
コード長 3,143 bytes
コンパイル時間 2,287 ms
コンパイル使用メモリ 207,192 KB
実行使用メモリ 6,228 KB
最終ジャッジ日時 2023-08-26 08:13:21
合計ジャッジ時間 8,415 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 109 ms
4,376 KB
testcase_04 AC 73 ms
4,380 KB
testcase_05 AC 110 ms
4,376 KB
testcase_06 AC 72 ms
4,380 KB
testcase_07 AC 113 ms
4,380 KB
testcase_08 AC 73 ms
4,376 KB
testcase_09 AC 109 ms
4,380 KB
testcase_10 AC 71 ms
4,380 KB
testcase_11 AC 111 ms
4,380 KB
testcase_12 AC 73 ms
4,376 KB
testcase_13 AC 110 ms
4,376 KB
testcase_14 AC 68 ms
4,376 KB
testcase_15 AC 111 ms
4,376 KB
testcase_16 AC 73 ms
4,380 KB
testcase_17 AC 107 ms
4,380 KB
testcase_18 AC 75 ms
4,380 KB
testcase_19 AC 112 ms
4,376 KB
testcase_20 AC 73 ms
4,376 KB
testcase_21 AC 91 ms
4,376 KB
testcase_22 AC 54 ms
4,376 KB
testcase_23 AC 90 ms
4,376 KB
testcase_24 AC 52 ms
4,376 KB
testcase_25 AC 90 ms
4,376 KB
testcase_26 AC 52 ms
4,380 KB
testcase_27 AC 91 ms
4,376 KB
testcase_28 AC 54 ms
4,376 KB
testcase_29 AC 96 ms
4,504 KB
testcase_30 AC 72 ms
4,976 KB
testcase_31 AC 98 ms
4,804 KB
testcase_32 AC 75 ms
4,504 KB
testcase_33 AC 96 ms
4,996 KB
testcase_34 AC 71 ms
5,352 KB
testcase_35 AC 92 ms
4,848 KB
testcase_36 AC 70 ms
4,868 KB
testcase_37 AC 93 ms
5,248 KB
testcase_38 AC 69 ms
4,544 KB
testcase_39 AC 94 ms
6,172 KB
testcase_40 AC 96 ms
5,292 KB
testcase_41 AC 97 ms
6,228 KB
testcase_42 AC 99 ms
5,412 KB
testcase_43 AC 98 ms
6,192 KB
testcase_44 AC 94 ms
5,412 KB
testcase_45 AC 61 ms
4,376 KB
testcase_46 AC 90 ms
4,376 KB
testcase_47 AC 54 ms
4,380 KB
testcase_48 AC 54 ms
4,380 KB
testcase_49 AC 61 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>;
int getInt(){int x;scanf("%d",&x);return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return;}
#define yes { puts("Yes"); return;}
#define no { puts("No"); return;}
#define ret(x) { cout<<(x)<<endl; return;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

struct Solver {
  ll f(vi a) {
    int n = sz(a);
    if (n%2 == 0) {
      ll res = suma(a);
      a.pob();
      res -= f(a);
      return res;
    }
    ll res = a[0];
    priority_queue<int> q;
    for (int i = 1; i < n; i += 2) {
      q.push(a[i]);
      q.push(a[i+1]);
      res += q.top(); q.pop();
    }
    return res;
  }
  void solve() {
    int n;
    scanf("%d",&n);
    vi a(n);
    cin>>a;
    sort(rng(a));
    drep(i,n-1) a[i+1] -= a[i];
    cout<<f(a)<<endl;
  }
};

int main() {
  int ts = 1;
  scanf("%d",&ts);
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}
0