#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 500;
vector<int> r , b;
long long dp[N][N];
int n , m;
long long solve(int i,int j){
if(i == n && j == m) return 0;
if(j == m) return 1e18;
if(dp[i][j] != -1) return dp[i][j];
dp[i][j] = min(solve(i+1,j),min(solve(i,j+1),solve(i+1,j+1))) + abs(r[i] - b[j]);
return dp[i][j];
}
long long min_total_length(std::vector<int> R, std::vector<int> B) {
memset(dp,-1,sizeof(dp));
r = R;
b = B;
n = r.size();
m = b.size();
return solve(0,0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3972 KB |
Output is correct |
2 |
Correct |
0 ms |
3972 KB |
Output is correct |
3 |
Correct |
0 ms |
3972 KB |
Output is correct |
4 |
Correct |
0 ms |
3972 KB |
Output is correct |
5 |
Correct |
0 ms |
3972 KB |
Output is correct |
6 |
Correct |
0 ms |
3972 KB |
Output is correct |
7 |
Correct |
3 ms |
3972 KB |
Output is correct |
8 |
Correct |
3 ms |
3972 KB |
Output is correct |
9 |
Correct |
3 ms |
3972 KB |
Output is correct |
10 |
Correct |
0 ms |
3972 KB |
Output is correct |
11 |
Correct |
3 ms |
3972 KB |
Output is correct |
12 |
Correct |
3 ms |
3972 KB |
Output is correct |
13 |
Correct |
3 ms |
3972 KB |
Output is correct |
14 |
Correct |
3 ms |
3972 KB |
Output is correct |
15 |
Correct |
3 ms |
3972 KB |
Output is correct |
16 |
Correct |
0 ms |
3972 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3972 KB |
Output is correct |
2 |
Correct |
0 ms |
3972 KB |
Output is correct |
3 |
Incorrect |
36 ms |
5736 KB |
3rd lines differ - on the 1st token, expected: '41596985758595', found: '332557757188' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3972 KB |
Output is correct |
2 |
Correct |
0 ms |
3972 KB |
Output is correct |
3 |
Incorrect |
33 ms |
6324 KB |
3rd lines differ - on the 1st token, expected: '1068938599', found: '20065159' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3972 KB |
Output is correct |
2 |
Incorrect |
33 ms |
6324 KB |
3rd lines differ - on the 1st token, expected: '373710605', found: '2013500' |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
3972 KB |
Output is correct |
2 |
Correct |
0 ms |
3972 KB |
Output is correct |
3 |
Correct |
0 ms |
3972 KB |
Output is correct |
4 |
Correct |
0 ms |
3972 KB |
Output is correct |
5 |
Correct |
0 ms |
3972 KB |
Output is correct |
6 |
Correct |
0 ms |
3972 KB |
Output is correct |
7 |
Correct |
3 ms |
3972 KB |
Output is correct |
8 |
Correct |
3 ms |
3972 KB |
Output is correct |
9 |
Correct |
3 ms |
3972 KB |
Output is correct |
10 |
Correct |
0 ms |
3972 KB |
Output is correct |
11 |
Correct |
3 ms |
3972 KB |
Output is correct |
12 |
Correct |
3 ms |
3972 KB |
Output is correct |
13 |
Correct |
3 ms |
3972 KB |
Output is correct |
14 |
Correct |
3 ms |
3972 KB |
Output is correct |
15 |
Correct |
3 ms |
3972 KB |
Output is correct |
16 |
Correct |
0 ms |
3972 KB |
Output is correct |
17 |
Correct |
0 ms |
3972 KB |
Output is correct |
18 |
Correct |
0 ms |
3972 KB |
Output is correct |
19 |
Incorrect |
36 ms |
5736 KB |
3rd lines differ - on the 1st token, expected: '41596985758595', found: '332557757188' |
20 |
Halted |
0 ms |
0 KB |
- |