oj.uz

Submission #968487

# Submission time Handle Problem Language Result Execution time Memory
968487 2024-04-23T13:35:36 Z nguyentunglam Wiring (IOI17_wiring) C++17
7 / 100
 232 ms 21648 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 1010;

long long dp[N][N];

int a[N], b[N];

long long min_total_length(std::vector<int> R, std::vector<int> B) {
  int n = R.size(), m = B.size();
  for(int i = 1; i <= n; i++) a[i] = R[i - 1];
  for(int i = 1; i <= m; i++) b[i] = B[i - 1];

  memset(dp, 61, sizeof(dp));
  dp[0][0] = 0;
  for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) {
    dp[i][j] = min({dp[i - 1][j - 1], dp[i][j - 1], dp[i - 1][j]}) + abs(a[i] - b[j]);
  }

  return dp[n][m];
}

#ifdef ngu
int main() {
  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> r(n), b(m);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));
	for(int i = 0; i < m; i++)
		assert(1 == scanf("%d", &b[i]));

	long long res = min_total_length(r, b);
	printf("%lld\n", res);

	return 0;
}
#endif // ngu

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8380 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8280 KB Output is correct
4 Correct 2 ms 8392 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8284 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8280 KB Output is correct
10 Correct 2 ms 8536 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8332 KB Output is correct
15 Correct 2 ms 8280 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 2 ms 8384 KB Output is correct
3 Runtime error 130 ms 20560 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Runtime error 232 ms 21648 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8480 KB Output is correct
2 Runtime error 229 ms 20976 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8380 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 2 ms 8280 KB Output is correct
4 Correct 2 ms 8392 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 2 ms 8284 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8280 KB Output is correct
10 Correct 2 ms 8536 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 2 ms 8332 KB Output is correct
15 Correct 2 ms 8280 KB Output is correct
16 Correct 2 ms 8284 KB Output is correct
17 Correct 2 ms 8284 KB Output is correct
18 Correct 2 ms 8384 KB Output is correct
19 Runtime error 130 ms 20560 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -