oj.uz

Submission #538286

# Submission time Handle Problem Language Result Execution time Memory
538286 2022-03-16T13:34:14 Z mario05092929 Cloud Computing (CEOI18_clo) C++17
100 / 100
 610 ms 2004 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast") 
#pragma gcc optimize("unroll-loops")
using namespace std;
const int INF = 1e9;
const long long llINF = 1e18;
long long mod = 1e9+7;
typedef long long ll;
typedef long double ld;
typedef pair <int,int> pi;
typedef vector <int> vec;
typedef vector <pi> vecpi; 
typedef long long ll;
int n,m;
ll d[2][100005];

struct Computer {
	int c,f,v;
}a[4005];

bool cmp(Computer x,Computer y) {
	if(x.f == y.f) return x.c > y.c; 
	return x.f > y.f;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n;
	for(int i = 1;i <= n;i++) cin >> a[i].c >> a[i].f >> a[i].v, a[i].v *= -1;
	cin >> m;
	for(int i = n+1;i <= n+m;i++) cin >> a[i].c >> a[i].f >> a[i].v, a[i].c *= -1;
	sort(a+1,a+n+m+1,cmp);
	for(int i = 1;i <= 100000;i++) d[0][i] = d[1][i] = -llINF;
	for(int i = 1;i <= n+m;i++) {
		for(int j = 0;j <= 100000;j++) {
			d[i%2][j] = d[(i-1)%2][j];
			if(j-a[i].c < 0||j-a[i].c > 100000) continue;
			d[i%2][j] = max(d[i%2][j],d[(i-1)%2][j-a[i].c]+a[i].v);
		}
	}
	ll ans = -INF;
	for(int j = 0;j <= 100000;j++) ans = max(ans,d[(n+m)%2][j]);
	cout << ans;
}

Compilation message

clo.cpp:6: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    6 | #pragma gcc optimize("O3")
      | 
clo.cpp:7: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    7 | #pragma gcc optimize("Ofast")
      | 
clo.cpp:8: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    8 | #pragma gcc optimize("unroll-loops")
      |

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 17 ms 1876 KB Output is correct
4 Correct 31 ms 1876 KB Output is correct
5 Correct 304 ms 1932 KB Output is correct
6 Correct 282 ms 1932 KB Output is correct
7 Correct 307 ms 1944 KB Output is correct
8 Correct 280 ms 1940 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 17 ms 1892 KB Output is correct
4 Correct 17 ms 1888 KB Output is correct
5 Correct 137 ms 1876 KB Output is correct
6 Correct 132 ms 1896 KB Output is correct
7 Correct 312 ms 1940 KB Output is correct
8 Correct 283 ms 1952 KB Output is correct
9 Correct 296 ms 1912 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1896 KB Output is correct
2 Correct 6 ms 1876 KB Output is correct
3 Correct 26 ms 1876 KB Output is correct
4 Correct 31 ms 1896 KB Output is correct
5 Correct 65 ms 1876 KB Output is correct
6 Correct 58 ms 1876 KB Output is correct
7 Correct 75 ms 1876 KB Output is correct
8 Correct 77 ms 1892 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1876 KB Output is correct
2 Correct 4 ms 1864 KB Output is correct
3 Correct 220 ms 1900 KB Output is correct
4 Correct 303 ms 1904 KB Output is correct
5 Correct 571 ms 1972 KB Output is correct
6 Correct 581 ms 1960 KB Output is correct
7 Correct 579 ms 1968 KB Output is correct
8 Correct 565 ms 1876 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 29 ms 1876 KB Output is correct
3 Correct 150 ms 1892 KB Output is correct
4 Correct 278 ms 1920 KB Output is correct
5 Correct 602 ms 1980 KB Output is correct
6 Correct 583 ms 1940 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 17 ms 1876 KB Output is correct
4 Correct 31 ms 1876 KB Output is correct
5 Correct 304 ms 1932 KB Output is correct
6 Correct 282 ms 1932 KB Output is correct
7 Correct 307 ms 1944 KB Output is correct
8 Correct 280 ms 1940 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 2 ms 1876 KB Output is correct
11 Correct 17 ms 1892 KB Output is correct
12 Correct 17 ms 1888 KB Output is correct
13 Correct 137 ms 1876 KB Output is correct
14 Correct 132 ms 1896 KB Output is correct
15 Correct 312 ms 1940 KB Output is correct
16 Correct 283 ms 1952 KB Output is correct
17 Correct 296 ms 1912 KB Output is correct
18 Correct 5 ms 1896 KB Output is correct
19 Correct 6 ms 1876 KB Output is correct
20 Correct 26 ms 1876 KB Output is correct
21 Correct 31 ms 1896 KB Output is correct
22 Correct 65 ms 1876 KB Output is correct
23 Correct 58 ms 1876 KB Output is correct
24 Correct 75 ms 1876 KB Output is correct
25 Correct 77 ms 1892 KB Output is correct
26 Correct 4 ms 1876 KB Output is correct
27 Correct 4 ms 1864 KB Output is correct
28 Correct 220 ms 1900 KB Output is correct
29 Correct 303 ms 1904 KB Output is correct
30 Correct 571 ms 1972 KB Output is correct
31 Correct 581 ms 1960 KB Output is correct
32 Correct 579 ms 1968 KB Output is correct
33 Correct 565 ms 1876 KB Output is correct
34 Correct 2 ms 1876 KB Output is correct
35 Correct 29 ms 1876 KB Output is correct
36 Correct 150 ms 1892 KB Output is correct
37 Correct 278 ms 1920 KB Output is correct
38 Correct 602 ms 1980 KB Output is correct
39 Correct 583 ms 1940 KB Output is correct
40 Correct 158 ms 1996 KB Output is correct
41 Correct 300 ms 1916 KB Output is correct
42 Correct 461 ms 1960 KB Output is correct
43 Correct 596 ms 1964 KB Output is correct
44 Correct 584 ms 1972 KB Output is correct
45 Correct 610 ms 2004 KB Output is correct
46 Correct 295 ms 1920 KB Output is correct
47 Correct 481 ms 1876 KB Output is correct
48 Correct 429 ms 1948 KB Output is correct