Submission #555191

# Submission time Handle Problem Language Result Execution time Memory
555191 2022-04-30T09:17:45 Z 600Mihnea Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
403 ms 1048576 KB
#include <bits/stdc++.h>

bool home = 1;

using namespace std;

typedef long long ll;
const int N=(int)1e5+7;
const ll INF=(ll)1e18+7;
int n;
int m;
ll a[N];
ll b[N];

signed main() {
#ifdef ONLINE_JUDGE
  home = 0;
#endif
  home = 0;

  if (home) {
    freopen("I_am_iron_man", "r", stdin);
  }
  else {
    ios::sync_with_stdio(0); cin.tie(0);
  }

  cin>>n>>m;
  for (int i=1;i<=n;i++) cin>>a[i];
  for (int i=1;i<=m;i++) cin>>b[i];

  vector<vector<ll>> dp(n+1,vector<ll> (m+1, INF));
  dp[1][1]=0;
  for (int i=1;i<=n;i++){
    int st=1;
    if(i==1) st=2;

    for(int j=st;j<=m;j++){
      dp[i][j]=min(dp[i-1][j]+b[j],dp[i][j-1]+a[i]);
    }
  }
  cout<<dp[n][m]<<"\n";
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen("I_am_iron_man", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 712 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 8 ms 8172 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 8152 KB Output is correct
13 Correct 8 ms 8148 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 8 ms 8148 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 0 ms 332 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 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Runtime error 403 ms 1048576 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 712 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 8 ms 8172 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 8152 KB Output is correct
13 Correct 8 ms 8148 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 8 ms 8148 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 0 ms 332 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 1 ms 212 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 3412 KB Output is correct
32 Runtime error 403 ms 1048576 KB Execution killed with signal 9
33 Halted 0 ms 0 KB -