結果
問題 | No.798 コレクション |
ユーザー | ミドリムシ |
提出日時 | 2019-03-15 21:31:59 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 58 ms / 2,000 ms |
コード長 | 3,344 bytes |
コンパイル時間 | 785 ms |
コンパイル使用メモリ | 80,240 KB |
実行使用メモリ | 35,456 KB |
最終ジャッジ日時 | 2024-07-01 20:28:28 |
合計ジャッジ時間 | 2,488 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
35,200 KB |
testcase_01 | AC | 25 ms
35,328 KB |
testcase_02 | AC | 25 ms
35,328 KB |
testcase_03 | AC | 25 ms
35,200 KB |
testcase_04 | AC | 26 ms
35,328 KB |
testcase_05 | AC | 26 ms
35,328 KB |
testcase_06 | AC | 26 ms
35,200 KB |
testcase_07 | AC | 25 ms
35,200 KB |
testcase_08 | AC | 25 ms
35,328 KB |
testcase_09 | AC | 25 ms
35,328 KB |
testcase_10 | AC | 25 ms
35,200 KB |
testcase_11 | AC | 25 ms
35,200 KB |
testcase_12 | AC | 25 ms
35,200 KB |
testcase_13 | AC | 39 ms
35,328 KB |
testcase_14 | AC | 48 ms
35,328 KB |
testcase_15 | AC | 44 ms
35,328 KB |
testcase_16 | AC | 34 ms
35,456 KB |
testcase_17 | AC | 39 ms
35,328 KB |
testcase_18 | AC | 56 ms
35,456 KB |
testcase_19 | AC | 49 ms
35,328 KB |
testcase_20 | AC | 35 ms
35,456 KB |
testcase_21 | AC | 33 ms
35,328 KB |
testcase_22 | AC | 44 ms
35,456 KB |
testcase_23 | AC | 25 ms
35,200 KB |
testcase_24 | AC | 58 ms
35,456 KB |
testcase_25 | AC | 57 ms
35,328 KB |
ソースコード
#include <iostream> #include <algorithm> #include <vector> #include <string.h> #include <cmath> #include <iomanip> using namespace std; #define mod (long)(1e9 + 7) #define all(x) (x).begin(), (x).end() #define bitcount(n) __builtin_popcountl(long(n)) #define fcout cout << fixed << setprecision(15) #define highest(x) (63 - __builtin_clzl(x)) template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; } template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; } template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; } template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; } template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; } template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; } long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }} struct position{ int y, x; }; position mv[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); } template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; } template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; } template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } } template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; } struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } long C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } }; int N, cnt = 0; vector<pair<long, long>> BA; long dp[2020][2020]; long buy(int now, int day){ if(now == N){ return (day != cnt) * 1e18; }else if(dp[now][day] != -1){ return dp[now][day]; }else{ return dp[now][day] = min(buy(now + 1, day), buy(now + 1, day + 1) + BA[now].second + BA[now].first * day); } } int main(){ cin >> N; BA.resize(N); for(int i = 0; i < N; i++){ cin >> BA[i].second >> BA[i].first; } sort(all(BA), greater<pair<long, long>>()); int sum = 0; while(sum < N){ if(cnt % 2){ sum++; } cnt++; sum++; } memset(dp, -1, sizeof(dp)); cout << buy(0, 0) << endl; }