oj.uz

Submission #605370

# Submission time Handle Problem Language Result Execution time Memory
605370 2022-07-25T16:27:20 Z Red_Inside Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 10 ms 8304 KB 
//
#include <bits/stdc++.h>

#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define o cout<<"BUG"<<endl;
#define FOR(i, j, n) for(int j = i; j < n; ++j)
#define forn(i, j, n) for(int j = i; j <= n; ++j)
#define nfor(i, j, n) for(int j = n; j >= i; --j)
#define all(v) v.begin(), v.end()
#define ld long double
#define ull unsigned long long

using namespace std;
const int maxn=1e6+100,LOG=17,mod=1e9+7;
int block = 226, timer = 0;
const ld EPS = 1e-18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

#define bt(i) (1 << (i))
#define int ll
const int inf=2e18;
#define y1 yy
#define prev pre
#define pii pair <int, int>

int n, m, a[maxn], b[maxn], dp[1010][1010];

main()
{
	IOS
	cin >> n >> m;
	forn(1, i, n)
	{
		cin >> a[i];
	}
	forn(1, j, m)
	{
		cin >> b[j];
	}
	forn(0, i, n + 1)
	{
		forn(0, j, m + 1) dp[i][j] = inf;
	}
	dp[1][1] = 0;
	forn(1, i, n)
	{
		forn(1, j, m)
		{
			if(i == 1 && j == 1) continue;
			dp[i][j] = min(dp[i - 1][j] + b[j], dp[i][j - 1] + a[i]);
		}
	}
	cout << dp[n][m];
}

Compilation message

kyoto.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   33 | main()
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1104 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 8 ms 8292 KB Output is correct
10 Correct 9 ms 8300 KB Output is correct
11 Correct 8 ms 8272 KB Output is correct
12 Correct 7 ms 8280 KB Output is correct
13 Correct 8 ms 8304 KB Output is correct
14 Correct 8 ms 8300 KB Output is correct
15 Correct 8 ms 8280 KB Output is correct
16 Correct 10 ms 8300 KB Output is correct
17 Correct 10 ms 8276 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 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
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 4 ms 2772 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1104 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 8 ms 8292 KB Output is correct
10 Correct 9 ms 8300 KB Output is correct
11 Correct 8 ms 8272 KB Output is correct
12 Correct 7 ms 8280 KB Output is correct
13 Correct 8 ms 8304 KB Output is correct
14 Correct 8 ms 8300 KB Output is correct
15 Correct 8 ms 8280 KB Output is correct
16 Correct 10 ms 8300 KB Output is correct
17 Correct 10 ms 8276 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 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
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Incorrect 4 ms 2772 KB Output isn't correct
32 Halted 0 ms 0 KB -