oj.uz

답안 #667569

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667569 2022-12-01T17:51:37 Z Augustyn Cloud Computing (CEOI18_clo) C++14
100 / 100
 300 ms 1208 KB 
#include<bits/stdc++.h>
using namespace std;
#define takt first
#define cena second.first
#define ilerdz second.second 
int n,m,lacz_rdz,najw_rdz;
pair<int,pair<int,int>>je_kalk[2001],klient[2001];
long long dp[100001];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	{
		scanf("%d%d%d",&je_kalk[i].ilerdz,&je_kalk[i].takt,&je_kalk[i].cena);
		lacz_rdz+=je_kalk[i].ilerdz;
	}
	scanf("%d",&m);
	for(int i=1;i<=m;++i)
	{
		scanf("%d%d%d",&klient[i].ilerdz,&klient[i].takt,&klient[i].cena);
	}
	sort(je_kalk+1,je_kalk+n+1);
	sort(klient+1,klient+m+1);
	for(int i=1;i<=lacz_rdz;++i)
		dp[i]=LONG_LONG_MIN;
	while(m)
	{
		while(n)
		{
			if(je_kalk[n].takt<klient[m].takt)
				break;
			for(int i=najw_rdz+je_kalk[n].ilerdz;i>=je_kalk[n].ilerdz;--i)
			{
				if(dp[i-je_kalk[n].ilerdz]!=LONG_LONG_MIN)
				dp[i]=max(dp[i],dp[i-je_kalk[n].ilerdz]-je_kalk[n].cena);
			}
			najw_rdz+=je_kalk[n].ilerdz;
			--n;
		}
		for(int i=0;i<=najw_rdz-klient[m].ilerdz;++i)
		{
			if(dp[i+klient[m].ilerdz]!=LONG_LONG_MIN)
			dp[i]=max(dp[i],dp[i+klient[m].ilerdz]+klient[m].cena);
		}
		--m;
	}
	long long odp=0;
	for(int i=0;i<=lacz_rdz;++i)
		odp=max(odp,dp[i]);
	printf("%lld",odp);
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
clo.cpp:14:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |   scanf("%d%d%d",&je_kalk[i].ilerdz,&je_kalk[i].takt,&je_kalk[i].cena);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |  scanf("%d",&m);
      |  ~~~~~^~~~~~~~~
clo.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   scanf("%d%d%d",&klient[i].ilerdz,&klient[i].takt,&klient[i].cena);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 2 ms 316 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 324 KB Output is correct
8 Correct 2 ms 340 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 11 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 39 ms 724 KB Output is correct
8 Correct 7 ms 340 KB Output is correct
9 Correct 86 ms 980 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 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 308 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 2 ms 324 KB Output is correct
5 Correct 147 ms 724 KB Output is correct
6 Correct 282 ms 1076 KB Output is correct
7 Correct 280 ms 1084 KB Output is correct
8 Correct 268 ms 1056 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 15 ms 536 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 184 ms 1088 KB Output is correct
6 Correct 287 ms 1064 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 2 ms 316 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 3 ms 324 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 11 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 39 ms 724 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 86 ms 980 KB Output is correct
18 Correct 0 ms 212 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 308 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 308 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 5 ms 340 KB Output is correct
29 Correct 2 ms 324 KB Output is correct
30 Correct 147 ms 724 KB Output is correct
31 Correct 282 ms 1076 KB Output is correct
32 Correct 280 ms 1084 KB Output is correct
33 Correct 268 ms 1056 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 15 ms 536 KB Output is correct
37 Correct 4 ms 340 KB Output is correct
38 Correct 184 ms 1088 KB Output is correct
39 Correct 287 ms 1064 KB Output is correct
40 Correct 13 ms 468 KB Output is correct
41 Correct 37 ms 596 KB Output is correct
42 Correct 4 ms 340 KB Output is correct
43 Correct 288 ms 1160 KB Output is correct
44 Correct 300 ms 1176 KB Output is correct
45 Correct 194 ms 1208 KB Output is correct
46 Correct 2 ms 340 KB Output is correct
47 Correct 5 ms 340 KB Output is correct
48 Correct 3 ms 324 KB Output is correct