結果
問題 | No.1416 ショッピングモール |
ユーザー |
![]() |
提出日時 | 2021-03-29 03:46:27 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 16 ms / 1,000 ms |
コード長 | 2,200 bytes |
コンパイル時間 | 2,131 ms |
コンパイル使用メモリ | 199,988 KB |
最終ジャッジ日時 | 2025-01-20 00:27:19 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define pb push_back#define eb emplace_back#define unused [[maybe_unused]]#define tempT template<class T>#define ALL(obj) (obj).begin(), (obj).end()#define rALL(obj) (obj).rbegin(), (obj).rend()#define debug(x) cerr << #x << ": " << x << endl#define ans_exit(x) { cout << x << endl; exit(0); }#define ans_return(x) { cout << x << endl; return; }#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define r_rep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define reps(i, n, m) for (ll i = (ll)(n); i < (ll)(m); i++)#define r_reps(i, n, m) for (ll i = (ll)(m) - 1; i >= (ll)(n); i--)#define debugarr(a) {cerr << #a << ":"; \for(auto _e:a){cerr << " " <<_e;} cerr << endl;}using ll unused = long long;using ld unused = long double;using vl unused = vector<ll>;using vvl unused = vector<vl>;using vvvl unused = vector<vvl>;using lp unused = pair<ll, ll>;using lmap unused = map<int, int>;unused constexpr ll MOD = 998244353;unused constexpr ll INF = 1 << 29;unused constexpr ll LINF = 1LL << 61;unused constexpr int DX[8] = {0, 1, 0,-1, 1, 1,-1,-1};unused constexpr int DY[8] = {1, 0,-1, 0, 1,-1, 1,-1};unused inline bool bit(ll b, ll i) { return b & (1LL << i); }unused inline ll ceiv(ll a, ll b) { return (a + b - 1) / b; }unused inline ll mod(ll a, ll m = MOD) { return (a % m + m) % m; }unused inline void modadd(ll &a, ll b, ll m = MOD) { a = mod(a + b, m); }unused inline ll floordiv(ll a, ll b) { return a / b - (a < 0 && a % b); }unused inline ll ceildiv(ll a, ll b) { return floordiv(a + b - 1, b); }tempT unused inline bool in_range(T a, T x, T b) { return a <= x && x < b; }unused inline bool in_range(ll x, ll b) { return in_range(0LL, x, b); }tempT unused bool chmin(T &a, T b) { if(a > b) {a = b; return 1;} return 0; }tempT unused bool chmax(T &a, T b) { if(a < b) {a = b; return 1;} return 0; }int main() {ll n; cin >> n;vl a(n); rep(i, n) cin >> a[i];sort(rALL(a));ll ans = 0;rep(i, 29) {reps(j, (1 << i) - 1, (1 << (i + 1)) - 1) {if(j >= n) break;ans += a[j] * i;}}cout << ans << endl;}