oj.uz

Submission #871894

# Submission time Handle Problem Language Result Execution time Memory
871894 2023-11-11T19:39:00 Z sano Cloud Computing (CEOI18_clo) C++14
100 / 100
 471 ms 3164 KB 
#include <iostream>
#include <string>
#include <string.h>
#include <fstream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include<map>
#include <stack>
#include <unordered_map>
#include <set>
#define ll long long
#define For(i, n) for(ll i = 0; i < n; i++)
#define ffor(i, a, n) for(ll i = a; i < n; i++)
#define pb push_back
#define vec vector 
#define ff first
#define ss second
#define pairs pair<ll, ll>
#define NEK 1000000000000000000
#define mod 1000000007
using namespace std;

struct tr {
	ll p, h, c;
};

bool zorad(tr a, tr b) {
	if (a.h == b.h) {
		return a.p > b.p;
	}
	return a.h > b.h;
}

vec<ll> sitko(ll n) {
	vec<bool> A;
	A.resize(n - 2 + 1, true);
	for (ll i = 2; i * i <= n; i++) {
		if (A[i - 2]) {
			for (ll j = i * i; j <= n; j += i) {
				A[j - 2] = false;
			}
		}
	}
	vec<ll> prv;
	For(i, A.size()) {
		if (A[i]) {
			prv.push_back(i + 2);
		}
	}
	return prv;
}


int main() {
	ll n;
	cin >> n;
	vec<tr> p;
	ll c1 = 0;
	ll c2 = 0;
	For(i, n) {
		ll x, y, z;
		cin >> x >> y >> z;
		p.push_back({ x, y, -z });
		c1 += x;
	}
	ll m;
	cin >> m;
	vec<tr> o;
	For(i, m) {
		ll x, y, z;
		cin >> x >> y >> z;
		o.push_back({ -x, y, z });
		c2 += x;
	}
	vec<tr> v;
	For(i, n) {
		v.push_back(p[i]);
	}
	For(i, m) {
		v.push_back(o[i]);
	}
	sort(v.begin(), v.end(), zorad);

	ll cc = c1+1;
	vec<vec<ll>> dp(2, vec<ll>(cc, (-1)*NEK));
	dp[0][0] = 0;
	ffor(i, 1, n+m+1) {
		ll now = i % 2;
		ll last = 1 - now;
		For(j, cc) {
			if ((j - v[i - 1].p) < 0 || (j - v[i - 1].p) >= dp[now].size()) {
				dp[now][j] = dp[last][j];
			}
			else {
				dp[now][j] = max(dp[last][j], dp[last][j - v[i - 1].p] + v[i - 1].c);
			}
		}
	}
	ll naj = -1;
	ll nov = (n + m) % 2;
	For(i, cc) {
		naj = max(naj, dp[nov][i]);
	}
	cout << naj << endl;
	return 0;
}

Compilation message

clo.cpp: In function 'std::vector<long long int> sitko(long long int)':
clo.cpp:14:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 | #define For(i, n) for(ll i = 0; i < n; i++)
......
   47 |  For(i, A.size()) {
      |      ~~~~~~~~~~~                   
clo.cpp:47:2: note: in expansion of macro 'For'
   47 |  For(i, A.size()) {
      |  ^~~
clo.cpp: In function 'int main()':
clo.cpp:93:49: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |    if ((j - v[i - 1].p) < 0 || (j - v[i - 1].p) >= dp[now].size()) {
      |                                ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 26 ms 860 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 123 ms 1628 KB Output is correct
8 Correct 24 ms 876 KB Output is correct
9 Correct 196 ms 2652 KB Output is correct

Subtask #3
18.0 / 18.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 9 ms 600 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 233 ms 1884 KB Output is correct
6 Correct 431 ms 2648 KB Output is correct
7 Correct 430 ms 2908 KB Output is correct
8 Correct 407 ms 2652 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 25 ms 860 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 422 ms 2652 KB Output is correct
6 Correct 415 ms 2648 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 26 ms 860 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 123 ms 1628 KB Output is correct
16 Correct 24 ms 876 KB Output is correct
17 Correct 196 ms 2652 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 9 ms 600 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 233 ms 1884 KB Output is correct
31 Correct 431 ms 2648 KB Output is correct
32 Correct 430 ms 2908 KB Output is correct
33 Correct 407 ms 2652 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 25 ms 860 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 422 ms 2652 KB Output is correct
39 Correct 415 ms 2648 KB Output is correct
40 Correct 28 ms 860 KB Output is correct
41 Correct 85 ms 1372 KB Output is correct
42 Correct 7 ms 604 KB Output is correct
43 Correct 461 ms 2908 KB Output is correct
44 Correct 471 ms 2908 KB Output is correct
45 Correct 460 ms 3164 KB Output is correct
46 Correct 4 ms 348 KB Output is correct
47 Correct 8 ms 732 KB Output is correct
48 Correct 7 ms 720 KB Output is correct