oj.uz

Submission #942819

# Submission time Handle Problem Language Result Execution time Memory
942819 2024-03-11T04:59:39 Z Baizho Cloud Computing (CEOI18_clo) C++14
100 / 100
 308 ms 1616 KB 
#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) {
        if(a.f == b.f) return a.t > b.t;
		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 = 0; 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(); }
}

Compilation message

clo.cpp: In function 'void Baizho()':
clo.cpp:63:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   63 |  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); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 16 ms 1244 KB Output is correct
5 Correct 143 ms 1288 KB Output is correct
6 Correct 147 ms 1116 KB Output is correct
7 Correct 173 ms 1280 KB Output is correct
8 Correct 148 ms 1116 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1112 KB Output is correct
4 Correct 10 ms 1116 KB Output is correct
5 Correct 69 ms 1112 KB Output is correct
6 Correct 67 ms 1248 KB Output is correct
7 Correct 148 ms 1112 KB Output is correct
8 Correct 149 ms 1116 KB Output is correct
9 Correct 159 ms 1116 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 4 ms 1112 KB Output is correct
3 Correct 14 ms 1116 KB Output is correct
4 Correct 14 ms 1252 KB Output is correct
5 Correct 43 ms 1116 KB Output is correct
6 Correct 28 ms 1116 KB Output is correct
7 Correct 38 ms 1232 KB Output is correct
8 Correct 38 ms 1236 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 112 ms 1284 KB Output is correct
4 Correct 133 ms 1280 KB Output is correct
5 Correct 283 ms 1400 KB Output is correct
6 Correct 296 ms 1372 KB Output is correct
7 Correct 302 ms 1412 KB Output is correct
8 Correct 288 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 13 ms 1116 KB Output is correct
3 Correct 60 ms 1116 KB Output is correct
4 Correct 148 ms 1368 KB Output is correct
5 Correct 290 ms 1116 KB Output is correct
6 Correct 306 ms 1372 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 16 ms 1244 KB Output is correct
5 Correct 143 ms 1288 KB Output is correct
6 Correct 147 ms 1116 KB Output is correct
7 Correct 173 ms 1280 KB Output is correct
8 Correct 148 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 9 ms 1112 KB Output is correct
12 Correct 10 ms 1116 KB Output is correct
13 Correct 69 ms 1112 KB Output is correct
14 Correct 67 ms 1248 KB Output is correct
15 Correct 148 ms 1112 KB Output is correct
16 Correct 149 ms 1116 KB Output is correct
17 Correct 159 ms 1116 KB Output is correct
18 Correct 3 ms 1112 KB Output is correct
19 Correct 4 ms 1112 KB Output is correct
20 Correct 14 ms 1116 KB Output is correct
21 Correct 14 ms 1252 KB Output is correct
22 Correct 43 ms 1116 KB Output is correct
23 Correct 28 ms 1116 KB Output is correct
24 Correct 38 ms 1232 KB Output is correct
25 Correct 38 ms 1236 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 112 ms 1284 KB Output is correct
29 Correct 133 ms 1280 KB Output is correct
30 Correct 283 ms 1400 KB Output is correct
31 Correct 296 ms 1372 KB Output is correct
32 Correct 302 ms 1412 KB Output is correct
33 Correct 288 ms 1372 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 13 ms 1116 KB Output is correct
36 Correct 60 ms 1116 KB Output is correct
37 Correct 148 ms 1368 KB Output is correct
38 Correct 290 ms 1116 KB Output is correct
39 Correct 306 ms 1372 KB Output is correct
40 Correct 76 ms 1112 KB Output is correct
41 Correct 144 ms 1112 KB Output is correct
42 Correct 229 ms 1368 KB Output is correct
43 Correct 295 ms 1372 KB Output is correct
44 Correct 308 ms 1368 KB Output is correct
45 Correct 291 ms 1372 KB Output is correct
46 Correct 159 ms 1116 KB Output is correct
47 Correct 222 ms 1616 KB Output is correct
48 Correct 215 ms 1372 KB Output is correct