結果
問題 | No.549 素材合成システム |
ユーザー | mai |
提出日時 | 2017-07-28 22:45:49 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 3,776 bytes |
コンパイル時間 | 3,327 ms |
コンパイル使用メモリ | 219,572 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-14 20:10:35 |
合計ジャッジ時間 | 5,310 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,820 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 27 ms
6,816 KB |
testcase_08 | AC | 27 ms
6,820 KB |
testcase_09 | AC | 27 ms
6,820 KB |
testcase_10 | AC | 27 ms
6,816 KB |
testcase_11 | AC | 27 ms
6,816 KB |
testcase_12 | AC | 27 ms
6,820 KB |
testcase_13 | AC | 27 ms
6,816 KB |
testcase_14 | AC | 27 ms
6,820 KB |
testcase_15 | AC | 28 ms
6,820 KB |
testcase_16 | AC | 27 ms
6,816 KB |
testcase_17 | AC | 10 ms
6,816 KB |
testcase_18 | AC | 8 ms
6,820 KB |
testcase_19 | AC | 10 ms
6,816 KB |
testcase_20 | AC | 10 ms
6,816 KB |
testcase_21 | AC | 12 ms
6,816 KB |
testcase_22 | AC | 11 ms
6,820 KB |
testcase_23 | AC | 13 ms
6,816 KB |
testcase_24 | AC | 25 ms
6,816 KB |
testcase_25 | AC | 22 ms
6,816 KB |
testcase_26 | AC | 26 ms
6,816 KB |
testcase_27 | AC | 23 ms
6,820 KB |
testcase_28 | AC | 2 ms
6,816 KB |
testcase_29 | AC | 2 ms
6,820 KB |
testcase_30 | AC | 2 ms
6,816 KB |
testcase_31 | AC | 13 ms
6,816 KB |
testcase_32 | AC | 12 ms
6,816 KB |
testcase_33 | AC | 12 ms
6,820 KB |
testcase_34 | AC | 12 ms
6,816 KB |
testcase_35 | AC | 17 ms
6,820 KB |
testcase_36 | AC | 15 ms
6,816 KB |
testcase_37 | AC | 15 ms
6,816 KB |
testcase_38 | AC | 2 ms
6,820 KB |
testcase_39 | AC | 2 ms
6,820 KB |
testcase_40 | AC | 17 ms
6,820 KB |
testcase_41 | AC | 8 ms
6,820 KB |
testcase_42 | AC | 2 ms
6,816 KB |
testcase_43 | AC | 5 ms
6,816 KB |
testcase_44 | AC | 2 ms
6,820 KB |
testcase_45 | AC | 6 ms
6,816 KB |
testcase_46 | AC | 4 ms
6,816 KB |
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)': main.cpp:63:9: warning: no return statement in function returning non-void [-Wreturn-type] 63 | } | ^
ソースコード
#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;} #define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}} #define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;} #define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}} #define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}} #define ALL(v) (v).begin(),(v).end() #define repeat(cnt,l) for(auto cnt=0;cnt<(l);++cnt) #define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt) #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; } mt19937 mt(8901016); inline int rand_int(int l, int h) { return uniform_int_distribution<>(l, h)(mt); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template<typename T> void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'<cc; cc = getchar_unlocked()) if (cc == '-') sign = -1; for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked()) var = (var << 3) + (var << 1) + cc - '0'; var = var*sign; } inline int c() { return getchar_unlocked(); } inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiablechar(cc); cc = getchar_unlocked()); for (; isvisiablechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; template<typename T> inline T gcd(T a, T b) { return b ? gcd(b, a % b) : a; } template<typename T> inline T lcm(T a, T b) { return a * b / gcd(a, b); } template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); } template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); } template<typename iterator, typename T, typename F> T reduce(iterator begin, iterator end, T init, F func) { T sum = init; for (; begin != end; ++begin) if (!func(sum, *begin)) break; return sum; } ll n; vector<ll> aa; int main() { scanner >> n; aa.resize(n); scanner.in(ALL(aa)); priority_queue<ll> pq; for (auto a : aa) { pq.push(a); } while (true) { ll b = pq.top(); pq.pop(); if (pq.empty()) break; ll a = pq.top(); pq.pop(); ll c = b + a / 2; pq.push(c); } cout << pq.top() << endl; return 0; }