Submission #631413

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
631413	2022-08-18T05:54:20 Z	Darren0724	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	389 ms	1048576 KB

kyoto

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define rz resize
#define pb emplace_back
int INF=1e18;
int mod=1e9+7;

signed main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n,m;
  cin>>n>>m;
  vector<int> v(n+1),w(m+1);
  for(int i=1;i<=n;i++){
    cin>>v[i];
  }
  for(int i=1;i<=m;i++){
    cin>>w[i];
  }
  vector<vector<int>> dp(n+1,vector<int>(m+1,INF));
  dp[1][1]=0;
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
      if(i==1&&j==1){
        continue;
      }
      dp[i][j]=min(dp[i-1][j]+w[j],dp[i][j-1]+v[i]);
    }
  }
  cout<<dp[n][m]<<endl;

  return 0;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	3 ms	3412 KB	Output is correct
4	Runtime error	389 ms	1048576 KB	Execution killed with signal 9
5	Halted	0 ms	0 KB	-

Subtask #3

0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	9 ms	8272 KB	Output is correct
10	Correct	8 ms	8148 KB	Output is correct
11	Correct	7 ms	8148 KB	Output is correct
12	Correct	8 ms	8148 KB	Output is correct
13	Correct	7 ms	8148 KB	Output is correct
14	Correct	8 ms	8216 KB	Output is correct
15	Correct	9 ms	8116 KB	Output is correct
16	Correct	7 ms	8148 KB	Output is correct
17	Correct	8 ms	8148 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	244 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	3 ms	3412 KB	Output is correct
32	Runtime error	389 ms	1048576 KB	Execution killed with signal 9
33	Halted	0 ms	0 KB	-