結果
問題 | No.798 コレクション |
ユーザー | kei |
提出日時 | 2019-03-15 23:33:07 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 15 ms / 2,000 ms |
コード長 | 2,147 bytes |
コンパイル時間 | 2,615 ms |
コンパイル使用メモリ | 175,584 KB |
実行使用メモリ | 35,388 KB |
最終ジャッジ日時 | 2023-09-14 14:46:45 |
合計ジャッジ時間 | 3,922 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
35,208 KB |
testcase_01 | AC | 11 ms
35,192 KB |
testcase_02 | AC | 11 ms
35,180 KB |
testcase_03 | AC | 12 ms
35,100 KB |
testcase_04 | AC | 11 ms
35,124 KB |
testcase_05 | AC | 11 ms
35,212 KB |
testcase_06 | AC | 12 ms
35,204 KB |
testcase_07 | AC | 11 ms
35,144 KB |
testcase_08 | AC | 11 ms
35,176 KB |
testcase_09 | AC | 12 ms
35,172 KB |
testcase_10 | AC | 11 ms
35,096 KB |
testcase_11 | AC | 11 ms
35,120 KB |
testcase_12 | AC | 11 ms
35,196 KB |
testcase_13 | AC | 14 ms
35,380 KB |
testcase_14 | AC | 15 ms
35,176 KB |
testcase_15 | AC | 14 ms
35,204 KB |
testcase_16 | AC | 13 ms
35,128 KB |
testcase_17 | AC | 14 ms
35,384 KB |
testcase_18 | AC | 15 ms
35,252 KB |
testcase_19 | AC | 14 ms
35,248 KB |
testcase_20 | AC | 13 ms
35,268 KB |
testcase_21 | AC | 12 ms
35,372 KB |
testcase_22 | AC | 15 ms
35,388 KB |
testcase_23 | AC | 11 ms
35,232 KB |
testcase_24 | AC | 15 ms
35,248 KB |
testcase_25 | AC | 15 ms
35,340 KB |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; } template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ ll dp[2020][2020]; template<class Type> Type solve(Type res = Type()){ ll N; cin >> N; vector<pll> AB(N); for(int i = 0; i < N;i++){ ll A,B; cin >> A >> B; AB[i] = {B,A}; } sort(AB.rbegin(),AB.rend()); fill(*dp,*dp+2020*2020,LINF); dp[0][0] = 0; for(int i = 0; i < N;i++){ ll A,B; tie(B,A) = AB[i]; for(int j = 0; j <= i;j++){ if(dp[i][j]==LINF) continue; // 無料でもらう dp[i+1][j+1] = min(dp[i+1][j+1],dp[i][j]); // 購入 dp[i+1][j] = min(dp[i+1][j],dp[i][j]+A+B*((i+1)-j-1)); } } res = dp[N][N/3]; return res; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); //solve<ll>(0); cout << fixed << setprecision(12) << solve<ll>() << endl; return 0; }