oj.uz

Submission #128110

# Submission time Handle Problem Language Result Execution time Memory
128110 2019-07-10T12:33:13 Z TadijaSebez Cloud Computing (CEOI18_clo) C++11
100 / 100
 681 ms 2296 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const int N=2005;
const int K=52;
const int M=N*K;
const ll inf=1e18;
ll dp[2][M];
struct Event
{
	int t,c,f,v;
	Event(){}
	Event(int _t, int _c, int _f, int _v):t(_t),c(_c),f(_f),v(_v){}
	bool operator < (Event b) const { return mp(f,t)>mp(b.f,b.t);}
};
vector<Event> evs;
int main()
{
	int n,m,c,f,v;
	scanf("%i",&n);
	for(int i=1;i<=n;i++) scanf("%i %i %i",&c,&f,&v),evs.pb(Event(1,c,f,v));
	scanf("%i",&m);
	for(int i=1;i<=m;i++) scanf("%i %i %i",&c,&f,&v),evs.pb(Event(0,c,f,v));
	int t=1;
	for(int i=0;i<M;i++) dp[0][i]=dp[1][i]=-inf;
	dp[t^1][0]=0;
	sort(evs.begin(),evs.end());
	for(Event e:evs)
	{
		if(e.t==0) e.c=-e.c;
		else e.v=-e.v;
		for(int i=0;i<M;i++)
		{
			dp[t][i]=dp[t^1][i];
			if(i-e.c>=0 && i-e.c<M) dp[t][i]=max(dp[t][i],dp[t^1][i-e.c]+e.v);
		}
		t^=1;
	}
	ll ans=0;
	for(int i=0;i<M;i++) ans=max(ans,dp[t^1][i]);
	printf("%lld\n",ans);
	return 0;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
clo.cpp:23:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%i %i %i",&c,&f,&v),evs.pb(Event(1,c,f,v));
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&m);
  ~~~~~^~~~~~~~~
clo.cpp:25:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=m;i++) scanf("%i %i %i",&c,&f,&v),evs.pb(Event(0,c,f,v));
                        ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 21 ms 1912 KB Output is correct
4 Correct 38 ms 1996 KB Output is correct
5 Correct 316 ms 2040 KB Output is correct
6 Correct 316 ms 2168 KB Output is correct
7 Correct 340 ms 2100 KB Output is correct
8 Correct 331 ms 2040 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 21 ms 1912 KB Output is correct
4 Correct 21 ms 1912 KB Output is correct
5 Correct 152 ms 2168 KB Output is correct
6 Correct 152 ms 2040 KB Output is correct
7 Correct 331 ms 2168 KB Output is correct
8 Correct 331 ms 2168 KB Output is correct
9 Correct 321 ms 2172 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1912 KB Output is correct
2 Correct 8 ms 1912 KB Output is correct
3 Correct 33 ms 1912 KB Output is correct
4 Correct 33 ms 1912 KB Output is correct
5 Correct 63 ms 1912 KB Output is correct
6 Correct 63 ms 2012 KB Output is correct
7 Correct 86 ms 2016 KB Output is correct
8 Correct 90 ms 1912 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 6 ms 1912 KB Output is correct
3 Correct 249 ms 2168 KB Output is correct
4 Correct 302 ms 2068 KB Output is correct
5 Correct 617 ms 2268 KB Output is correct
6 Correct 660 ms 2168 KB Output is correct
7 Correct 662 ms 2296 KB Output is correct
8 Correct 662 ms 2168 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1912 KB Output is correct
2 Correct 31 ms 1912 KB Output is correct
3 Correct 140 ms 1912 KB Output is correct
4 Correct 333 ms 2040 KB Output is correct
5 Correct 673 ms 2168 KB Output is correct
6 Correct 664 ms 2168 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 21 ms 1912 KB Output is correct
4 Correct 38 ms 1996 KB Output is correct
5 Correct 316 ms 2040 KB Output is correct
6 Correct 316 ms 2168 KB Output is correct
7 Correct 340 ms 2100 KB Output is correct
8 Correct 331 ms 2040 KB Output is correct
9 Correct 4 ms 1912 KB Output is correct
10 Correct 5 ms 1912 KB Output is correct
11 Correct 21 ms 1912 KB Output is correct
12 Correct 21 ms 1912 KB Output is correct
13 Correct 152 ms 2168 KB Output is correct
14 Correct 152 ms 2040 KB Output is correct
15 Correct 331 ms 2168 KB Output is correct
16 Correct 331 ms 2168 KB Output is correct
17 Correct 321 ms 2172 KB Output is correct
18 Correct 9 ms 1912 KB Output is correct
19 Correct 8 ms 1912 KB Output is correct
20 Correct 33 ms 1912 KB Output is correct
21 Correct 33 ms 1912 KB Output is correct
22 Correct 63 ms 1912 KB Output is correct
23 Correct 63 ms 2012 KB Output is correct
24 Correct 86 ms 2016 KB Output is correct
25 Correct 90 ms 1912 KB Output is correct
26 Correct 6 ms 1912 KB Output is correct
27 Correct 6 ms 1912 KB Output is correct
28 Correct 249 ms 2168 KB Output is correct
29 Correct 302 ms 2068 KB Output is correct
30 Correct 617 ms 2268 KB Output is correct
31 Correct 660 ms 2168 KB Output is correct
32 Correct 662 ms 2296 KB Output is correct
33 Correct 662 ms 2168 KB Output is correct
34 Correct 6 ms 1912 KB Output is correct
35 Correct 31 ms 1912 KB Output is correct
36 Correct 140 ms 1912 KB Output is correct
37 Correct 333 ms 2040 KB Output is correct
38 Correct 673 ms 2168 KB Output is correct
39 Correct 664 ms 2168 KB Output is correct
40 Correct 171 ms 2040 KB Output is correct
41 Correct 332 ms 2140 KB Output is correct
42 Correct 536 ms 2144 KB Output is correct
43 Correct 659 ms 2040 KB Output is correct
44 Correct 681 ms 2172 KB Output is correct
45 Correct 655 ms 2296 KB Output is correct
46 Correct 329 ms 2140 KB Output is correct
47 Correct 492 ms 2168 KB Output is correct
48 Correct 503 ms 2180 KB Output is correct