結果
問題 | No.1416 ショッピングモール |
ユーザー |
![]() |
提出日時 | 2021-03-05 22:03:07 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 9 ms / 1,000 ms |
コード長 | 4,873 bytes |
コンパイル時間 | 3,160 ms |
コンパイル使用メモリ | 212,736 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-04-16 09:31:47 |
合計ジャッジ時間 | 3,246 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 3 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 3 ms
5,376 KB |
testcase_16 | AC | 3 ms
5,376 KB |
testcase_17 | AC | 3 ms
5,376 KB |
testcase_18 | AC | 3 ms
5,376 KB |
testcase_19 | AC | 4 ms
5,376 KB |
testcase_20 | AC | 3 ms
5,376 KB |
testcase_21 | AC | 8 ms
5,376 KB |
testcase_22 | AC | 9 ms
5,376 KB |
testcase_23 | AC | 8 ms
5,376 KB |
ソースコード
/////////////////////////////////////////////////////////////////////////////// #include <bits/stdc++.h> #include <unistd.h> #include <time.h> #include <sys/time.h> using namespace std; /////////////////////////////////////////////////////////////////////////////// #define DEBUG 0 #define pb push_back #define V vector #define S static #define rep(i,n) for(ll i=0LL; i<n; ++i) #define srep(i,s,n) for(ll i=s; i<n; ++i) #define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() #define CIN(x) do { \ assert(!cin.eof()); \ cin >> x; \ assert(!cin.fail()); \ } while(0); #if DEBUG #define debug_print(...) _debug_print(__VA_ARGS__) #define debug_printf(...) printf(__VA_ARGS__) #define debug_print_time _debug_print_time #else // DEBUG #define debug_print(...) #define debug_printf(...) #define debug_print_time #endif // DEBUG typedef long long ll; typedef unsigned long long ull; typedef __int128_t ll128; typedef tuple<ll, ll> t2; typedef tuple<ll, ll, ll> t3; typedef tuple<ll, ll, ll, ll> t4; typedef tuple<ll, ll, ll, ll, ll> t5; template <typename T> using priority_queue_incr = priority_queue<T, V<T>, greater<T> >; /////////////////////////////////////////////////////////////////////////////// template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) { if (m.find(k) == m.end()) m[k] = 0; m[k]++; } void llin(ll &a) { CIN(a); } void llinl1(V<ll> &v, ll count) { for (ll i = 0LL; i < count; ++i) { ll a; CIN(a); v.push_back(a); } } void llinl2(V<t2> &v, ll count) { for (ll i = 0LL; i < count; ++i) { ll a, b; CIN(a >> b); v.push_back(t2(a, b)); } } void llinl3(V<t3> &v, ll count) { for (ll i = 0LL; i < count; ++i) { ll a, b, c; CIN(a >> b >> c); v.push_back(t3(a, b, c)); } } void llinl4(V<t4> &v, ll count) { for (ll i = 0LL; i < count; ++i) { ll a, b, c, d; CIN(a >> b >> c >> d); v.push_back(t4(a, b, c, d)); } } void llina(V<ll> &v, ll count) { llinl1(v, count); } template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); } template <typename T> void sort_reverse(V<T> &v) { sort(v.begin(), v.end(), greater<T>()); } t2 _ext_gcd(ll a, ll b, ll g) { if (!b) return t2(1, 0); ll q = a / b; ll r = a % b; t2 sol = _ext_gcd(b, r, g); ll sx = get<0>(sol); ll sy = get<1>(sol); ll x = sy; ll y = sx - q * sy; return t2(x, y); } t2 ext_gcd(ll a, ll b) { return _ext_gcd(a, b, gcd(a, b)); } // x and mod must be coprime ll mod_inv(ll x, ll mod) { t2 result = ext_gcd(x, mod); ll ret = get<0>(result); while (ret < 0) ret += mod; ret %= mod; return ret; } ll msec() { struct timeval tv; gettimeofday(&tv, NULL); ll ret = 0; ret += tv.tv_sec * 1000LL; ret += tv.tv_usec / 1000LL; return ret; } template <typename T> void _debug_print(T x) { cout << x << " "; } void _debug_print(const t2 &x) { ll x1 = get<0>(x); ll x2 = get<1>(x); cout << "(" << x1 << ", " << x2 << ") "; } void _debug_print(const t3 &x) { ll x1 = get<0>(x); ll x2 = get<1>(x); ll x3 = get<2>(x); cout << "(" << x1 << ", " << x2 << ", " << x3 << ") "; } void _debug_print(const t4 &x) { ll x1 = get<0>(x); ll x2 = get<1>(x); ll x3 = get<2>(x); ll x4 = get<3>(x); cout << "(" << x1 << ", " << x2 << ", " << x3 << ", " << x4 << ") "; } template <typename T> void _debug_print(T xarray[], ll n) { rep (i, n) _debug_print(xarray[i]); cout << endl; } template <typename T> void _debug_print(const V<T> &xlist) { for (auto x : xlist) _debug_print(x); cout << endl; } template <typename T> void _debug_print(const set<T> &xset) { for (auto x : xset) _debug_print(x); cout << endl; } template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) { for (auto x : xlist) { TT k = x.first; T v = x.second; cout << "K="; _debug_print(k); cout << " V="; _debug_print(v); cout << endl; } } /////////////////////////////////////////////////////////////////////////////// void _main(); int main() { cout << setprecision(12); #if !DEBUG ios::sync_with_stdio(false); cin.tie(0); #endif _main(); return 0; } void _main() { ll n; llin(n); V<ll> alist; llina(alist, n); sort_reverse(alist); ll ans = 0; srep (i, 1, n+1) { ll cnt = -1; ll ii = i; while (ii) { ii >>= 1LL; cnt++; } debug_printf("cnt=%lld a=%lld\n", cnt, alist[i-1]); ans += alist[i-1] * cnt; } cout << ans << endl; } ///////////////////////////////////////////////////////////////////////////////