oj.uz

답안 #742383

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
742383 2023-05-16T08:03:50 Z jamezzz Tortoise (CEOI21_tortoise) C++17
48 / 100
 10 ms 1784 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define pb push_back
#define INF 1023456789

#define maxn 305

int n,a[maxn],pv[maxn],nx[maxn];
vector<int> shop,play;
int memo[2*maxn][maxn][2];

int dp(int t,int i,int hv){
	if(i>=shop.size()||t>2*n)return 0;
	if(memo[t][i][hv]!=-1)return memo[t][i][hv];
	
	int sd=INF;
	if(pv[i]!=-1)sd=min(sd,shop[i]-play[pv[i]]);
	if(nx[i]<play.size())sd=min(sd,play[nx[i]]-shop[i]);
	
	int ans=0;
	
	//transition 0: don't do anything
	if(hv==0)ans=max(ans,dp(t+shop[i+1]-shop[i],i+1,0));
	else{
		ans=max(ans,dp(t+shop[i+1]-shop[i]+2*sd,i+1,0));
		if(nx[i]<play.size()&&play[nx[i]]<shop[i+1]){
			ans=max(ans,dp(t+shop[i+1]-shop[i],i+1,0));
		}
		ans=max(ans,dp(t+shop[i+1]-shop[i],i+1,1));
	}
	
	for(int x=1;x<=a[shop[i]];++x){
		int add=0;
		if(hv)add=hv*2*sd;
		
		if(t+2*(x-1)*sd+add>2*shop[i])break;
		
		//transition 1: back and forth x times
		ans=max(ans,dp(t+2*x*sd+shop[i+1]-shop[i]+add,i+1,0)+x);
		
		//transition 2: back and forth x-1 times, carry 1 to a playground in between i and i+1
		if(nx[i]<play.size()&&play[nx[i]]<shop[i+1]){
			ans=max(ans,dp(t+2*(x-1)*sd+shop[i+1]-shop[i]+add,i+1,0)+x);
		}
		
		//transition 3: back and forth x-1 times, carry 1 to i+1, then let i+1 settle that
		ans=max(ans,dp(t+2*(x-1)*sd+shop[i+1]-shop[i]+add,i+1,1)+x);
	}
	
	//pf("dp %d %d %d: %d\n",t,i,hv,ans);
	return memo[t][i][hv]=ans;
}

int main(){
	sf("%d",&n);
	int sm=0;
	for(int i=0;i<n;++i){
		sf("%d",&a[i]);
		if(a[i]==-1)play.pb(i);
		else shop.pb(i),sm+=a[i];
	}
	if(shop.size()==0){
		pf("0\n");
		return 0;
	}
	shop.pb(n);
	int cur=-1;
	for(int x=0;x<shop.size();++x){
		int i=shop[x];
		while(cur+1<play.size()&&play[cur+1]<i)++cur;
		pv[x]=cur;
		nx[x]=cur+1;
	}
	memset(memo,-1,sizeof memo);
	pf("%d\n",sm-dp(shop[0],0,0));
}

Compilation message

tortoise.cpp: In function 'int dp(int, int, int)':
tortoise.cpp:16:6: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  if(i>=shop.size()||t>2*n)return 0;
      |     ~^~~~~~~~~~~~~
tortoise.cpp:21:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  if(nx[i]<play.size())sd=min(sd,play[nx[i]]-shop[i]);
      |     ~~~~~^~~~~~~~~~~~
tortoise.cpp:29:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |   if(nx[i]<play.size()&&play[nx[i]]<shop[i+1]){
      |      ~~~~~^~~~~~~~~~~~
tortoise.cpp:45:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   if(nx[i]<play.size()&&play[nx[i]]<shop[i+1]){
      |      ~~~~~^~~~~~~~~~~~
tortoise.cpp: In function 'int main()':
tortoise.cpp:71:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |  for(int x=0;x<shop.size();++x){
      |              ~^~~~~~~~~~~~
tortoise.cpp:73:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |   while(cur+1<play.size()&&play[cur+1]<i)++cur;
      |         ~~~~~^~~~~~~~~~~~
tortoise.cpp:58:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |  sf("%d",&n);
      |    ^
tortoise.cpp:61:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |   sf("%d",&a[i]);
      |     ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 2 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1748 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 1 ms 1748 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 2 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1748 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 1 ms 1748 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 2 ms 1748 KB Output is correct
29 Correct 2 ms 1748 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 2 ms 1748 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 2 ms 1748 KB Output is correct
36 Correct 2 ms 1748 KB Output is correct
37 Correct 3 ms 1748 KB Output is correct
38 Correct 2 ms 1748 KB Output is correct
39 Correct 2 ms 1748 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 2 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1748 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 1 ms 1748 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 2 ms 1748 KB Output is correct
29 Correct 2 ms 1748 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 2 ms 1748 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 2 ms 1748 KB Output is correct
36 Correct 2 ms 1748 KB Output is correct
37 Correct 3 ms 1748 KB Output is correct
38 Correct 2 ms 1748 KB Output is correct
39 Correct 2 ms 1748 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 2 ms 1748 KB Output is correct
43 Correct 2 ms 1748 KB Output is correct
44 Correct 2 ms 1748 KB Output is correct
45 Correct 2 ms 1748 KB Output is correct
46 Correct 2 ms 1748 KB Output is correct
47 Correct 2 ms 1748 KB Output is correct
48 Correct 2 ms 1748 KB Output is correct
49 Correct 3 ms 1748 KB Output is correct
50 Correct 6 ms 1784 KB Output is correct
51 Correct 6 ms 1748 KB Output is correct
52 Correct 3 ms 1704 KB Output is correct
53 Correct 9 ms 1748 KB Output is correct
54 Correct 10 ms 1748 KB Output is correct
55 Correct 5 ms 1748 KB Output is correct
56 Correct 2 ms 1748 KB Output is correct
57 Correct 2 ms 1748 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 2 ms 1748 KB Output is correct
60 Correct 4 ms 1748 KB Output is correct
61 Correct 2 ms 1748 KB Output is correct
62 Correct 3 ms 1748 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 2 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1748 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 1 ms 1748 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 2 ms 1748 KB Output is correct
29 Correct 2 ms 1748 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 2 ms 1748 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 2 ms 1748 KB Output is correct
36 Correct 2 ms 1748 KB Output is correct
37 Correct 3 ms 1748 KB Output is correct
38 Correct 2 ms 1748 KB Output is correct
39 Correct 2 ms 1748 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 2 ms 1748 KB Output is correct
43 Correct 2 ms 1748 KB Output is correct
44 Correct 2 ms 1748 KB Output is correct
45 Correct 2 ms 1748 KB Output is correct
46 Correct 2 ms 1748 KB Output is correct
47 Correct 2 ms 1748 KB Output is correct
48 Correct 2 ms 1748 KB Output is correct
49 Correct 3 ms 1748 KB Output is correct
50 Correct 6 ms 1784 KB Output is correct
51 Correct 6 ms 1748 KB Output is correct
52 Correct 3 ms 1704 KB Output is correct
53 Correct 9 ms 1748 KB Output is correct
54 Correct 10 ms 1748 KB Output is correct
55 Correct 5 ms 1748 KB Output is correct
56 Correct 2 ms 1748 KB Output is correct
57 Correct 2 ms 1748 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 2 ms 1748 KB Output is correct
60 Correct 4 ms 1748 KB Output is correct
61 Correct 2 ms 1748 KB Output is correct
62 Correct 3 ms 1748 KB Output is correct
63 Incorrect 1 ms 1748 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 2 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 1 ms 1748 KB Output is correct
20 Correct 1 ms 1748 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 1 ms 1748 KB Output is correct
24 Correct 1 ms 1748 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Correct 1 ms 1748 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 2 ms 1748 KB Output is correct
29 Correct 2 ms 1748 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 2 ms 1748 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 2 ms 1748 KB Output is correct
36 Correct 2 ms 1748 KB Output is correct
37 Correct 3 ms 1748 KB Output is correct
38 Correct 2 ms 1748 KB Output is correct
39 Correct 2 ms 1748 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 2 ms 1748 KB Output is correct
43 Correct 2 ms 1748 KB Output is correct
44 Correct 2 ms 1748 KB Output is correct
45 Correct 2 ms 1748 KB Output is correct
46 Correct 2 ms 1748 KB Output is correct
47 Correct 2 ms 1748 KB Output is correct
48 Correct 2 ms 1748 KB Output is correct
49 Correct 3 ms 1748 KB Output is correct
50 Correct 6 ms 1784 KB Output is correct
51 Correct 6 ms 1748 KB Output is correct
52 Correct 3 ms 1704 KB Output is correct
53 Correct 9 ms 1748 KB Output is correct
54 Correct 10 ms 1748 KB Output is correct
55 Correct 5 ms 1748 KB Output is correct
56 Correct 2 ms 1748 KB Output is correct
57 Correct 2 ms 1748 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 2 ms 1748 KB Output is correct
60 Correct 4 ms 1748 KB Output is correct
61 Correct 2 ms 1748 KB Output is correct
62 Correct 3 ms 1748 KB Output is correct
63 Incorrect 1 ms 1748 KB Output isn't correct
64 Halted 0 ms 0 KB -