結果
問題 | No.1416 ショッピングモール |
ユーザー |
![]() |
提出日時 | 2021-03-05 22:50:27 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 16 ms / 1,000 ms |
コード長 | 2,891 bytes |
コンパイル時間 | 1,987 ms |
コンパイル使用メモリ | 180,684 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-07 03:50:34 |
合計ジャッジ時間 | 2,768 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;struct Edge{ll to;ll cost;};using Graph = vector<vector<Edge>>;using P = pair<ll, ll>;#define mp make_pair#define REP(i, n) for (int i = 0; i < (n); ++i)#define SORT(v) sort((v).begin(), (v).end())#define RSORT(v) sort((v).rbegin(), (v).rend())#define ALL(v) (v).begin(), v.end()ll MOD = 998244353;const ll nmax = 8;const ll INF = 1e10;const int MAX = 510000;bool graph[nmax][nmax];long long fac[MAX], finv[MAX], inv[MAX];void COMinit(){fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}ll COM(int n, int k){if (n < k)return 0;if (n < 0 || k < 0)return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));void warshall_floyd(ll n){for (size_t i = 0; i < n; i++){for (size_t j = 0; j < n; j++){for (size_t k = 0; k < n; k++){dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);}}}}ll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);}ll lcm(ll a, ll b){ll g = gcd(a, b);return a / g * b;}ll mulMod(ll a, ll b){return (((a % MOD) * (b % MOD)) % MOD);}ll powMod(ll a, ll p){if (p == 0){return 1;}else if (p % 2 == 0){ll half = powMod(a, p / 2);return mulMod(half, half);}else{return mulMod(powMod(a, p - 1), a);}}ll ceil(ll a, ll b){return (a + b - 1) / b;}bool isPrime(ll N){for (int i = 2; i * i <= N; i++){if (N % i == 0)return false;}return true;}vector<pair<long long, long long>> prime_factorize(long long n){vector<pair<long long, long long>> res;for (long long p = 2; p * p <= n; ++p){if (n % p != 0)continue;int num = 0;while (n % p == 0){++num;n /= p;}res.push_back(make_pair(p, num));}if (n != 1)res.push_back(make_pair(n, 1));return res;}ll cntbit(ll i){if (i == 0)return 0;ll ret = 0;i++;while (i != 0){i = i >> 1;ret++;}return ret - 1;}int main(){ll n;cin >> n;vector<ll> a(n);for (int i = 0; i < n; i++){cin >> a[i];}ll ans = 0;RSORT(a);for (int i = 0; i < n; i++){ll tmp = cntbit(i);// cout << tmp << endl;ans += a[i] * tmp;}cout << ans << endl;return 0;}