結果
問題 | No.710 チーム戦 |
ユーザー |
|
提出日時 | 2018-06-29 22:43:05 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 97 ms / 3,000 ms |
コード長 | 2,716 bytes |
コンパイル時間 | 844 ms |
コンパイル使用メモリ | 74,248 KB |
実行使用メモリ | 43,876 KB |
最終ジャッジ日時 | 2024-07-01 00:04:01 |
合計ジャッジ時間 | 3,572 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 25 |
ソースコード
#include <iostream>#include <algorithm>#include <vector>#include <string.h>using namespace std;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; }int character_count(string text, char character){ int ans = 0; for(int i = 0; i < text.size(); i++){ ans += (text[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 move_pattern[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); }template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }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; }#define mod long(1e9 + 7)#define all(x) (x).begin(), (x).end()#define bitcount(n) __builtin_popcountl(long(n))struct question{int A, B;};int N;vector<question> questions;int dp[103][100200];int choose(int now, int remaining){if(remaining < 0){return 1e9;}else if(now == N){return (!!remaining) * 1e9;}else if(dp[now][remaining] != -1){return dp[now][remaining];}else{return dp[now][remaining] = min(choose(now + 1, remaining - questions[now].A), choose(now + 1, remaining) + questions[now].B);}}int main(){cin >> N;questions.resize(N);for(int i = 0; i < N; i++){cin >> questions[i].A >> questions[i].B;}memset(dp, -1, sizeof(dp));int ans = 1e9;for(int i = 0; i < 1e5 + 100; i++){ans = min(ans, max(choose(0, i), i));}cout << ans << endl;}