제출 #889990

#제출 시각아이디문제언어결과실행 시간메모리
889990KutanKnapsack (NOI18_knapsack)C++14
73 / 100
1076 ms1740 KiB
// Cao Quang Hung #include <cassert> #include <cctype> #include <cerrno> #include <cfloat> #include <ciso646> #include <climits> #include <clocale> #include <cmath> #include <csetjmp> #include <csignal> #include <cstdarg> #include <cstddef> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <ccomplex> #include <cfenv> #include <cinttypes> #include <cstdbool> #include <cstdint> #include <ctgmath> #include <cwchar> #include <cwctype> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <array> #include <atomic> #include <chrono> #include <condition_variable> #include <forward_list> #include <future> #include <initializer_list> #include <mutex> #include <random> #include <ratio> #include <regex> #include <scoped_allocator> #include <system_error> #include <thread> #include <tuple> #include <typeindex> #include <type_traits> #include <unordered_map> #include <unordered_set> using namespace std; #define pb push_back #define eb emplace_back #define mp make_pair #define pii pair<int,int> #define pll pair<long long , long long> #define vi vector<int> #define vpii vector<pii> #define SZ(x) ((int)(x.size())) #define fi first #define se second #define IN(x,y) ((y).find((x))!=(y).end()) #define ALL(t) t.begin(),t.end() #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i) #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i) #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i)) #define dem(x) __builtin_popcount(x) #define Mask(x) (1LL << (x)) #define BIT(x, i) ((x) >> (i) & 1) #define ln '\n' #define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); ///mt19937 rnd(time(0)); const int INF = 1e9 , mod = 1e9 + 7; template <class T1, class T2> inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; } template <class T1 , class T2> inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;} template <class T> inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; } template <class T> inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; } template <class T> inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; } template <class T> inline T product (const T &x , const T &y) { return 1LL * x * y % mod; } #define PROB "a" void file(){ if(fopen(PROB".inp", "r")){ freopen(PROB".inp","r",stdin); freopen(PROB".out","w",stdout); } } void sinh_(){ // srand(time(0)); // freopen(PROB".inp" , "w" , stdout); // int n; } typedef long long ll; typedef double db; const int N = 1e5 + 5; int n, S, w[N], v[N], k[N]; void readip(){ cin >> S >> n; REP(i, 1, n) { cin >> v[i] >> w[i] >> k[i]; minimize(k[i], S / w[i]); assert(k[i] <= 2000); } } ll dp[2005] = {}; void solve(){ vector<pair<int, int>> compress; REP(i, 1, n) { compress.clear(); int j = 1; while(j <= k[i]) { compress.eb(j * w[i], j * v[i]); k[i] -= j; j <<= 1; } if (k[i] > 0) compress.eb(k[i] * w[i], k[i] * v[i]); for (auto &it : compress) for (int s = S; s >= it.first; --s) maximize(dp[s] , dp[s - it.first] + it.second); } cout << dp[S] << ln; } int main(){ sinh_(); io_faster file(); int t = 1; // cin >> t; while (t--){ readip(); solve(); } }

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'void readip()':
knapsack.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
knapsack.cpp:143:5: note: in expansion of macro 'REP'
  143 |     REP(i, 1, n) {
      |     ^~~
knapsack.cpp: In function 'void solve()':
knapsack.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
knapsack.cpp:154:5: note: in expansion of macro 'REP'
  154 |     REP(i, 1, n) {
      |     ^~~
knapsack.cpp: In function 'void file()':
knapsack.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...