제출 #942802

#제출 시각아이디문제언어결과실행 시간메모리
942802BaizhoCloud Computing (CEOI18_clo)C++14
18 / 100
302 ms1404 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> // #pragma GCC optimize("Ofast,unroll-loops,fast-math") // #pragma GCC target("popcnt,sse3,avx") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(1e5)+100; const int M = ll(2e5) + 100; const long long inf = 5e18; //const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } int n, m; const int W = 100005; long long dp[W + 10]; struct dat { int c, f, v, t; }; void Baizho() { cin>>n; vector<dat> vec; for(int i = 1; i <= n; i ++) { int c, f, v; cin>>c>>f>>v; vec.pb({c, f, v, 1}); } cin>>m; for(int i = 1; i <= m; i ++) { int c, f, v; cin>>c>>f>>v; vec.pb({c, f, v, 0}); } sort(all(vec), [](dat &a, dat &b) { return a.f > b.f; }); for(int i = 1; i <= W; i ++) dp[i] = -inf; for(auto [c, f, v, t] : vec) { if(t == 1) { // answer for i where we add this which will make us have more core and we spend v dollars for(int i = W; i >= c; i --) dp[i] = max(dp[i], dp[i - c] - v); } else { // answer for i where we add this which will make us have less core and we gain v dolalrs for(int i = 1; i + c <= W; i ++) dp[i] = max(dp[i], dp[i + c] + v); } } long long ans = 0; for(int i = 0; i <= W; i ++) ans = max(ans, dp[i]); cout<<ans; } signed main() { // Freopen("nondec"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }

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

clo.cpp: In function 'void Baizho()':
clo.cpp:62:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   62 |  for(auto [c, f, v, t] : vec) {
      |           ^
clo.cpp: In function 'void Freopen(std::string)':
clo.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "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...
#Verdict Execution timeMemoryGrader output
Fetching results...