oj.uz

Submission #810585

# Submission time Handle Problem Language Result Execution time Memory
810585 2023-08-06T11:43:30 Z welleyth Cloud Computing (CEOI18_clo) C++17
100 / 100
 391 ms 1412 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int N = (int)7e5;

void solve(){
	int n;
	cin >> n;

	int c[n],f[n],v[n];
	for(int i = 0; i < n; i++){
		cin >> c[i] >> f[i] >> v[i];
	}

	int m;
	cin >> m;

	int C[m],F[m],V[m];
	int sumOrderC = 0;

	for(int i = 0; i < m; i++){
		cin >> C[i] >> F[i] >> V[i];
		sumOrderC += C[i];
	}

	{
		vector<int> s;
		for(int i = 0; i < m; i++){
			s.push_back(F[i]);
		}
		s.push_back(0);
		sort(s.begin(),s.end());
		s.erase(unique(s.begin(),s.end()),s.end());
		for(int i = 0; i < n; i++){
			f[i] = *(upper_bound(s.begin(),s.end(),f[i]) - 1);
		}
		for(int i = 0; i < n; i++){
			f[i] = lower_bound(s.begin(),s.end(),f[i]) - s.begin();
		}
		for(int i = 0; i < m; i++){
			F[i] = lower_bound(s.begin(),s.end(),F[i]) - s.begin();
		}
		// cerr << "debug:\n";
		// for(int i = 0; i < n; i++){
		// 	cerr << c[i] << " " << f[i] << " " << v[i] << "\n";
		// }
		// cerr << "\n";
		// for(int i = 0; i < m; i++){
		// 	cerr << C[i] << " " << F[i] << " " << V[i] << "\n";
		// }
		// cerr << "\n";
	}

	vector<pair<int,int>> computers[m+1];
	vector<pair<int,int>> orders[m+1];

	for(int i = 0; i < n; i++){
		computers[f[i]].push_back(make_pair(c[i],v[i]));
	}
	for(int i = 0; i < m; i++){
		orders[F[i]].push_back(make_pair(C[i],V[i]));
	}

	long long dp[sumOrderC+1];
	memset(dp,0,sizeof dp);

	for(int i = 0; i <= m; i++){
		for(auto&[cores,value] : orders[i]){
			for(int j = sumOrderC; j - cores >= 0; j--){
				dp[j] = max(dp[j],dp[j-cores]+value);
			}
		}
		for(auto&[cores,value] : computers[i]){
			for(int j = 0; j <= sumOrderC; j++){
				dp[max(0,j-cores)] = max(dp[max(0,j-cores)],dp[j]-value);
			}
		}
	}

	cout << dp[0] << "\n";

	return;
}

signed main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	int tests = 1;
	for(int test = 1; test <= tests; test++){
		solve();
	}

	return 0;
}
/**
 * dist(1,2) = (a[1] != a[2]) + (a[2] != a[3]) + (a[3] != a[4]) + ... + (a[l] != a[l+1])
 * dist(1,3) = (a[1] != a[3]) + (a[2] != a[4])
 * 
 * 
 * 

**/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 71 ms 880 KB Output is correct
6 Correct 24 ms 596 KB Output is correct
7 Correct 146 ms 1232 KB Output is correct
8 Correct 136 ms 1236 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 324 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 224 KB Output is correct
3 Correct 1 ms 380 KB Output is correct
4 Correct 14 ms 544 KB Output is correct
5 Correct 155 ms 888 KB Output is correct
6 Correct 323 ms 1240 KB Output is correct
7 Correct 324 ms 1236 KB Output is correct
8 Correct 313 ms 1236 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 480 KB Output is correct
5 Correct 322 ms 1296 KB Output is correct
6 Correct 354 ms 1236 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 71 ms 880 KB Output is correct
6 Correct 24 ms 596 KB Output is correct
7 Correct 146 ms 1232 KB Output is correct
8 Correct 136 ms 1236 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 0 ms 324 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 224 KB Output is correct
28 Correct 1 ms 380 KB Output is correct
29 Correct 14 ms 544 KB Output is correct
30 Correct 155 ms 888 KB Output is correct
31 Correct 323 ms 1240 KB Output is correct
32 Correct 324 ms 1236 KB Output is correct
33 Correct 313 ms 1236 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 7 ms 480 KB Output is correct
38 Correct 322 ms 1296 KB Output is correct
39 Correct 354 ms 1236 KB Output is correct
40 Correct 22 ms 468 KB Output is correct
41 Correct 89 ms 852 KB Output is correct
42 Correct 7 ms 468 KB Output is correct
43 Correct 357 ms 1320 KB Output is correct
44 Correct 391 ms 1336 KB Output is correct
45 Correct 356 ms 1412 KB Output is correct
46 Correct 3 ms 340 KB Output is correct
47 Correct 6 ms 460 KB Output is correct
48 Correct 5 ms 468 KB Output is correct