oj.uz

Submission #850168

# Submission time Handle Problem Language Result Execution time Memory
850168 2023-09-15T23:04:32 Z xjonwang Cloud Computing (CEOI18_clo) C++17
100 / 100
 483 ms 2140 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ar array

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;

template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define pll pair<ll, ll>
#define pii pair<int, int>

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

template<class T> bool umin(T& a, const T& b) {
	return b<a?a=b, 1:0;
}
template<class T> bool umax(T& a, const T& b) { 
	return a<b?a=b, 1:0;
} 

ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb)/2;
		f(mb)?rb=mb:lb=mb+1; 
	} 
	return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
	while(lb<rb) {
		ll mb=(lb+rb+1)/2;
		f(mb)?lb=mb:rb=mb-1; 
	} 
	return lb;
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(ar<A, S>& a);
template<class A, class B> void read(pair<A, B>& x);
template<class T> void read(T& x) {
	cin >> x;
}
void read(double& d) {
	string t;
	read(t);
	d=stod(t);
}
void read(long double& d) {
	string t;
	read(t);
	d=stold(t);
}
template<class H, class... T> void read(H& h, T&... t) {
	read(h);
	read(t...);
}
template<class A> void read(vt<A>& x) {
	EACH(a, x)
		read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
	EACH(a, x)
		read(a);
}
template<class A, class B> void read(pair<A, B>& x) {
	cin >> x.first >> x.second;
}


string to_string(char c) {
	return string(1, c);
}
string to_string(bool b) {
	return b?"true":"false";
}
string to_string(const char* s) {
	return string(s);
}
string to_string(string s) {
	return s;
}
string to_string(vt<bool> v) {
	string res;
	FOR(sz(v))
		res+=char('0'+v[i]);
	return res;
}

template<size_t S> string to_string(bitset<S> b) {
	string res;
	FOR(S)
		res+=char('0'+b[i]);
	return res;
}
template<class T> string to_string(T v) {
    bool f=1;
    string res;
    EACH(x, v) {
		if(!f)
			res+=' ';
		f=0;
		res+=to_string(x);
	}
    return res;
}
template<class A, class B> string to_string(pair<A, B>& x) {
	return to_string(x.first) + ' ' + to_string(x.second);
}

template<class A> void write(A x) {
	cout << to_string(x);
}
template<class H, class... T> void write(const H& h, const T&... t) { 
	write(h);
	write(t...);
}
void print() {
	write("\n");
}
template<class H, class... T> void print(const H& h, const T&... t) { 
	write(h);
	if(sizeof...(t))
		write(' ');
	print(t...);
}

mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
	return uniform_int_distribution<ll>(a, b)(mt_rng);
}

struct order {
	int c, f, v;
};

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	read(n);
	vt<order> a(n);
	FOR(n) cin >> a[i].c >> a[i].f >> a[i].v;
	read(m);
	vt<order> b(m);
	FOR(m) cin >> b[i].c >> b[i].f >> b[i].v;
	sort(all(a), [](const order& x, const order& y) { return x.f > y.f; });
	sort(all(b), [](const order& x, const order& y) { return x.f > y.f; });
	int i=0, j=0;
	vt<ll> dp(n*50+1, -1e14);
	dp[0]=0;
	for (; i<m; i++) {
		while (j<n && a[j].f>=b[i].f) {
			vt<ll> t=dp;
			FOR(k, n*50+1) {
				if (k-a[j].c>=0) dp[k]=max(dp[k], t[k-a[j].c]-a[j].v);
			}
			j++;
		}
		vt<ll> t=dp;
		FOR(k, b[i].c, n*50+1) {
			dp[k-b[i].c]=max(dp[k-b[i].c], t[k]+b[i].v);
		}
	}
	ll ans=0;
	EACH(x, dp) ans=max(ans, x);
	print(ans);
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 46 ms 1116 KB Output is correct
6 Correct 46 ms 1112 KB Output is correct
7 Correct 212 ms 2008 KB Output is correct
8 Correct 255 ms 1880 KB Output is correct
9 Correct 237 ms 1892 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct
6 Correct 5 ms 600 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 7 ms 600 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 137 ms 1628 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 444 ms 2100 KB Output is correct
6 Correct 450 ms 2120 KB Output is correct
7 Correct 440 ms 2120 KB Output is correct
8 Correct 421 ms 1888 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 30 ms 888 KB Output is correct
4 Correct 89 ms 1016 KB Output is correct
5 Correct 445 ms 1880 KB Output is correct
6 Correct 476 ms 1880 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 46 ms 1116 KB Output is correct
14 Correct 46 ms 1112 KB Output is correct
15 Correct 212 ms 2008 KB Output is correct
16 Correct 255 ms 1880 KB Output is correct
17 Correct 237 ms 1892 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 5 ms 600 KB Output is correct
23 Correct 5 ms 600 KB Output is correct
24 Correct 7 ms 600 KB Output is correct
25 Correct 7 ms 600 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 137 ms 1628 KB Output is correct
29 Correct 2 ms 344 KB Output is correct
30 Correct 444 ms 2100 KB Output is correct
31 Correct 450 ms 2120 KB Output is correct
32 Correct 440 ms 2120 KB Output is correct
33 Correct 421 ms 1888 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 30 ms 888 KB Output is correct
37 Correct 89 ms 1016 KB Output is correct
38 Correct 445 ms 1880 KB Output is correct
39 Correct 476 ms 1880 KB Output is correct
40 Correct 31 ms 856 KB Output is correct
41 Correct 80 ms 1072 KB Output is correct
42 Correct 259 ms 1624 KB Output is correct
43 Correct 483 ms 2140 KB Output is correct
44 Correct 454 ms 2136 KB Output is correct
45 Correct 465 ms 2136 KB Output is correct
46 Correct 106 ms 1232 KB Output is correct
47 Correct 245 ms 1624 KB Output is correct
48 Correct 280 ms 1712 KB Output is correct