oj.uz

답안 #763643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
763643 2023-06-22T14:46:46 Z vjudge1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 238 ms 2152 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long

const int maxn = (int) 2e5 + 5;

struct node { int c, f, v; bool data; } a[4005];
int C, n, m, num, ans, dp[maxn];

bool cmp(node x, node y) {
	if(x.f != y.f)
		return x.f > y.f;
	if(x.data != y.data)
		return x.data < y.data;
	if(!x.data) 
		return x.v < y.v;
	return x.v > y.v;
}

signed main() {
	memset(dp, -0x3f, sizeof(dp));
	dp[0] = 0;
	scanf("%lld", &n);
	for(int i = 1; i <= n; i++) {
		scanf("%lld %lld %lld", &a[i].c, &a[i].f, &a[i].v);
		a[i].data = 0;
	}
	scanf("%lld", &m);
	for(int i = n + 1; i <= n + m; i++) {
		scanf("%lld %lld %lld", &a[i].c, &a[i].f, &a[i].v);
		a[i].data = 1;
	}
	num = m + n;
	std :: stable_sort(a + 1, a + num + 1, cmp);
	/*
	for(int i = 1; i <= num; i++) 
		printf("%d %d %d %d\n", a[i].c, a[i].f, a[i].v, a[i].data);
	*/
	for(int i = 1; i <= num; i++) {
		if(!a[i].data) { // 计算机 
			C += a[i].c;
			for(int j = C; j >= a[i].c; j--)
				dp[j] = std :: max(dp[j], dp[j - a[i].c] - a[i].v);
		} else { // 客户 
			for(int j = 0; j <= C - a[i].c; j++) 
				dp[j] = std :: max(dp[j], dp[j + a[i].c] + a[i].v);
		}
	}
	for(int i = 0; i <= C; i++)
		ans = std :: max(ans, dp[i]);
	printf("%lld", ans);
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  scanf("%lld", &n);
      |  ~~~~~^~~~~~~~~~~~
clo.cpp:26:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   scanf("%lld %lld %lld", &a[i].c, &a[i].f, &a[i].v);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  scanf("%lld", &m);
      |  ~~~~~^~~~~~~~~~~~
clo.cpp:31:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   scanf("%lld %lld %lld", &a[i].c, &a[i].f, &a[i].v);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1748 KB Output is correct
2 Correct 2 ms 1748 KB Output is correct
3 Correct 2 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1860 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 9 ms 1876 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 39 ms 2004 KB Output is correct
8 Correct 7 ms 1876 KB Output is correct
9 Correct 65 ms 1876 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1856 KB Output is correct
3 Correct 1 ms 1852 KB Output is correct
4 Correct 1 ms 1856 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1860 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 4 ms 1876 KB Output is correct
4 Correct 2 ms 1876 KB Output is correct
5 Correct 109 ms 2152 KB Output is correct
6 Correct 203 ms 2064 KB Output is correct
7 Correct 202 ms 2072 KB Output is correct
8 Correct 196 ms 2068 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1856 KB Output is correct
2 Correct 2 ms 1748 KB Output is correct
3 Correct 9 ms 1900 KB Output is correct
4 Correct 4 ms 1868 KB Output is correct
5 Correct 144 ms 2076 KB Output is correct
6 Correct 205 ms 2060 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1748 KB Output is correct
2 Correct 2 ms 1748 KB Output is correct
3 Correct 2 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 2 ms 1876 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1876 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1860 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 9 ms 1876 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 39 ms 2004 KB Output is correct
16 Correct 7 ms 1876 KB Output is correct
17 Correct 65 ms 1876 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1856 KB Output is correct
20 Correct 1 ms 1852 KB Output is correct
21 Correct 1 ms 1856 KB Output is correct
22 Correct 1 ms 1876 KB Output is correct
23 Correct 1 ms 1876 KB Output is correct
24 Correct 1 ms 1860 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 1 ms 1748 KB Output is correct
27 Correct 1 ms 1748 KB Output is correct
28 Correct 4 ms 1876 KB Output is correct
29 Correct 2 ms 1876 KB Output is correct
30 Correct 109 ms 2152 KB Output is correct
31 Correct 203 ms 2064 KB Output is correct
32 Correct 202 ms 2072 KB Output is correct
33 Correct 196 ms 2068 KB Output is correct
34 Correct 1 ms 1856 KB Output is correct
35 Correct 2 ms 1748 KB Output is correct
36 Correct 9 ms 1900 KB Output is correct
37 Correct 4 ms 1868 KB Output is correct
38 Correct 144 ms 2076 KB Output is correct
39 Correct 205 ms 2060 KB Output is correct
40 Correct 10 ms 1876 KB Output is correct
41 Correct 26 ms 1876 KB Output is correct
42 Correct 4 ms 1992 KB Output is correct
43 Correct 238 ms 2076 KB Output is correct
44 Correct 225 ms 2080 KB Output is correct
45 Correct 147 ms 2132 KB Output is correct
46 Correct 2 ms 1876 KB Output is correct
47 Correct 4 ms 2004 KB Output is correct
48 Correct 3 ms 2004 KB Output is correct