oj.uz

Submission #567144

# Submission time Handle Problem Language Result Execution time Memory
567144 2022-05-23T08:26:34 Z jamielim Sightseeing in Kyoto (JOI22_kyoto) C++14
40 / 100
 2000 ms 204816 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;

int h,w;
ll a[100005],b[100005];
ll pa[100005],sa[100005],pb[100005],sb[100005];
ll dp[5005][5005];

int main(){
	scanf("%d%d",&h,&w);
	pa[0]=LLINF;pb[0]=LLINF;
	sa[h+1]=LLINF;sb[w+1]=LLINF;
	for(int i=1;i<=h;i++){
		scanf("%lld",&a[i]);
		pa[i]=min(pa[i-1],a[i]);
	}
	for(int i=h;i>=1;i--)sa[i]=min(sa[i+1],a[i]);
	for(int i=1;i<=w;i++){
		scanf("%lld",&b[i]);
		pb[i]=min(pb[i-1],b[i]);
	}
	for(int i=w;i>=1;i--)sb[i]=min(sb[i+1],b[i]);
	vector<pair<ll,ll> > A,B;
	for(int i=1;i<=h;i++){
		if(a[i]<pa[i-1]||a[i]<sa[i+1])A.pb(a[i],i);
	}
	for(int i=1;i<=w;i++){
		if(b[i]<pb[i-1]||b[i]<sb[i+1])B.pb(b[i],i);
	}
	
	h=SZ(A);w=SZ(B);
	dp[0][0]=0;
	for(int i=0;i<h;i++){
		for(int j=0;j<w;j++){
			if(i==0&&j==0)continue;
			dp[i][j]=LLINF;
			if(i!=0)dp[i][j]=min(dp[i][j],dp[i-1][j]+B[j].fi*(A[i].se-A[i-1].se));
			if(j!=0)dp[i][j]=min(dp[i][j],dp[i][j-1]+A[i].fi*(B[j].se-B[j-1].se));
		}
	}
	printf("%lld",dp[h-1][w-1]);
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  scanf("%d%d",&h,&w);
      |  ~~~~~^~~~~~~~~~~~~~
kyoto.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |   scanf("%lld",&a[i]);
      |   ~~~~~^~~~~~~~~~~~~~
kyoto.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |   scanf("%lld",&b[i]);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 10 ms 12244 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 9 ms 12244 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 3 ms 3924 KB Output is correct
4 Correct 8 ms 4052 KB Output is correct
5 Correct 14 ms 4956 KB Output is correct
6 Correct 5 ms 1236 KB Output is correct
7 Correct 19 ms 5284 KB Output is correct
8 Correct 23 ms 5324 KB Output is correct
9 Correct 23 ms 7716 KB Output is correct
10 Correct 23 ms 7600 KB Output is correct
11 Correct 51 ms 44716 KB Output is correct
12 Correct 21 ms 8100 KB Output is correct
13 Correct 23 ms 8096 KB Output is correct
14 Correct 52 ms 44232 KB Output is correct
15 Correct 22 ms 5324 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 264 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 10 ms 12244 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 9 ms 12244 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 3 ms 3924 KB Output is correct
32 Correct 8 ms 4052 KB Output is correct
33 Correct 14 ms 4956 KB Output is correct
34 Correct 5 ms 1236 KB Output is correct
35 Correct 19 ms 5284 KB Output is correct
36 Correct 23 ms 5324 KB Output is correct
37 Correct 23 ms 7716 KB Output is correct
38 Correct 23 ms 7600 KB Output is correct
39 Correct 51 ms 44716 KB Output is correct
40 Correct 21 ms 8100 KB Output is correct
41 Correct 23 ms 8096 KB Output is correct
42 Correct 52 ms 44232 KB Output is correct
43 Correct 22 ms 5324 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 264 KB Output is correct
48 Correct 1 ms 308 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 12 ms 2788 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 2 ms 1108 KB Output is correct
58 Correct 5 ms 2260 KB Output is correct
59 Correct 26 ms 5456 KB Output is correct
60 Correct 29 ms 5368 KB Output is correct
61 Correct 29 ms 8332 KB Output is correct
62 Correct 33 ms 8612 KB Output is correct
63 Execution timed out 2061 ms 204816 KB Time limit exceeded
64 Halted 0 ms 0 KB -