oj.uz

답안 #552167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552167 2022-04-22T14:33:12 Z errorgorn Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 10 ms 8404 KB 
// Super Idol的笑容
//    都没你的甜
//  八月正午的阳光
//    都没你耀眼
//  热爱105°C的你
// 滴滴清纯的蒸馏水

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m;
int arr[100005];
int brr[100005];
int memo[1005][1005];

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m;
	rep(x,1,n+1) cin>>arr[x];
	rep(x,1,m+1) cin>>brr[x];
	
	memset(memo,63,sizeof(memo));
	memo[1][1]=0;
	rep(x,1,n+1) rep(y,1,m+1){
		memo[x][y]=min({
						memo[x][y],
						memo[x-1][y]+brr[y],
						memo[x][y-1]+arr[x]
					});
	}
	
	cout<<memo[n][m]<<endl;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8144 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8164 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 8 ms 8288 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 10 ms 8280 KB Output is correct
12 Correct 8 ms 8280 KB Output is correct
13 Correct 8 ms 8284 KB Output is correct
14 Correct 8 ms 8276 KB Output is correct
15 Correct 8 ms 8244 KB Output is correct
16 Correct 8 ms 8276 KB Output is correct
17 Correct 8 ms 8404 KB Output is correct
18 Correct 4 ms 8152 KB Output is correct
19 Correct 5 ms 8196 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 5 ms 8148 KB Output is correct
22 Correct 5 ms 8148 KB Output is correct
23 Correct 4 ms 8144 KB Output is correct
24 Correct 4 ms 8148 KB Output is correct
25 Correct 4 ms 8148 KB Output is correct
26 Correct 4 ms 8148 KB Output is correct
27 Correct 4 ms 8144 KB Output is correct
28 Correct 3 ms 8148 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Incorrect 5 ms 8148 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 4 ms 8148 KB Output is correct
4 Correct 4 ms 8144 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8164 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 8 ms 8288 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 10 ms 8280 KB Output is correct
12 Correct 8 ms 8280 KB Output is correct
13 Correct 8 ms 8284 KB Output is correct
14 Correct 8 ms 8276 KB Output is correct
15 Correct 8 ms 8244 KB Output is correct
16 Correct 8 ms 8276 KB Output is correct
17 Correct 8 ms 8404 KB Output is correct
18 Correct 4 ms 8152 KB Output is correct
19 Correct 5 ms 8196 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 5 ms 8148 KB Output is correct
22 Correct 5 ms 8148 KB Output is correct
23 Correct 4 ms 8144 KB Output is correct
24 Correct 4 ms 8148 KB Output is correct
25 Correct 4 ms 8148 KB Output is correct
26 Correct 4 ms 8148 KB Output is correct
27 Correct 4 ms 8144 KB Output is correct
28 Correct 3 ms 8148 KB Output is correct
29 Correct 4 ms 8148 KB Output is correct
30 Correct 4 ms 8148 KB Output is correct
31 Incorrect 5 ms 8148 KB Output isn't correct
32 Halted 0 ms 0 KB -