結果

問題 No.54 Happy Hallowe'en
ユーザー keikei
提出日時 2018-04-22 00:17:46
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 142 ms / 5,000 ms
コード長 2,795 bytes
コンパイル時間 1,645 ms
コンパイル使用メモリ 174,404 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-27 05:31:26
合計ジャッジ時間 3,024 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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;
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:https://yukicoder.me/problems/no/54>
============================================================
N
iVi
Ti
1
=================================================================
=============================================================
================================================================
*/
#define MAX_N 10005
#define MAX_V 20005
bool dp[MAX_V];
ll solve(){
ll res = 0;
ll N; cin >> N;
vector<ll> V(N),T(N);
vector<pll> VT(N);
ll MV = 0,MT = 0;
for(auto& in:VT){ cin >> in.first >> in.second; MV = max(MV,in.first); MT = max(MT,in.second); }
sort(VT.begin(),VT.end(),[](const pll& p1,const pll& p2){return (p1.first + p1.second) < (p2.first + p2.second);});
dp[0] = true;
for(int i = 0; i < N;i++){
for(ll j = MT-1; j >= 0;j--){
if(!dp[j]) continue;
if(j < VT[i].second){
dp[j+VT[i].first] = true;
res = max(res,j+VT[i].first);
}
}
}
return res;
}
int main(void) {
cin.tie(0); ios_base::sync_with_stdio(false);
cout << solve() << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0