oj.uz

Submission #91149

# Submission time Handle Problem Language Result Execution time Memory
91149 2018-12-26T11:48:49 Z arman_ferdous Wiring (IOI17_wiring) C++17
20 / 100
 33 ms 18484 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e5+10;
int n, m;
int r[N], b[N];

ll dp[205][205];

long long min_total_length(std::vector<int> r_, std::vector<int> b_) {
	n = r_.size(); m = b_.size();
	for(int i = 0; i < n; i++) r[i] = r_[i];
	for(int i = 0; i < m; i++) b[i] = b_[i];

	if(max(n,m) <= 200) {
		for(int i = 1; i < 205; i++)
			dp[0][i] = dp[i][0] = (ll)1e18;
		for(int i = 1; i <= n; i++) {
			for(int j = 1; j <= m; j++) {
				dp[i][j] = abs(r[i-1] - b[j-1]) + min({dp[i-1][j], dp[i][j-1], dp[i-1][j-1]});
			}
		}
		return dp[n][m];
	}
	ll ret = 0;
	if(n <= m) {
		for(int i = 0; i < m; i++)
			ret += (b[i] - (i >= n ? r[n-1] : r[i]));
	}
	else {
		for(int i = n-1; i >= 0; i--)
			ret += ((i >= m ? b[0] : b[i]) - r[i]);
	}
	return ret;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 656 KB Output is correct
4 Correct 2 ms 808 KB Output is correct
5 Correct 2 ms 808 KB Output is correct
6 Correct 2 ms 808 KB Output is correct
7 Correct 2 ms 908 KB Output is correct
8 Correct 2 ms 908 KB Output is correct
9 Correct 2 ms 1024 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 2 ms 1024 KB Output is correct
12 Correct 2 ms 1024 KB Output is correct
13 Correct 2 ms 1024 KB Output is correct
14 Correct 2 ms 1024 KB Output is correct
15 Correct 2 ms 1112 KB Output is correct
16 Correct 2 ms 1112 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1112 KB Output is correct
2 Correct 2 ms 1112 KB Output is correct
3 Correct 24 ms 3948 KB Output is correct
4 Correct 24 ms 5416 KB Output is correct
5 Correct 23 ms 6884 KB Output is correct
6 Correct 31 ms 9420 KB Output is correct
7 Correct 33 ms 11368 KB Output is correct
8 Correct 31 ms 13300 KB Output is correct
9 Correct 31 ms 15232 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 15232 KB Output is correct
2 Correct 2 ms 15232 KB Output is correct
3 Incorrect 31 ms 17188 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '-303948787415'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 17188 KB Output is correct
2 Incorrect 23 ms 18484 KB 3rd lines differ - on the 1st token, expected: '373710605', found: '2074975518'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 656 KB Output is correct
4 Correct 2 ms 808 KB Output is correct
5 Correct 2 ms 808 KB Output is correct
6 Correct 2 ms 808 KB Output is correct
7 Correct 2 ms 908 KB Output is correct
8 Correct 2 ms 908 KB Output is correct
9 Correct 2 ms 1024 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 2 ms 1024 KB Output is correct
12 Correct 2 ms 1024 KB Output is correct
13 Correct 2 ms 1024 KB Output is correct
14 Correct 2 ms 1024 KB Output is correct
15 Correct 2 ms 1112 KB Output is correct
16 Correct 2 ms 1112 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 2 ms 1112 KB Output is correct
19 Correct 24 ms 3948 KB Output is correct
20 Correct 24 ms 5416 KB Output is correct
21 Correct 23 ms 6884 KB Output is correct
22 Correct 31 ms 9420 KB Output is correct
23 Correct 33 ms 11368 KB Output is correct
24 Correct 31 ms 13300 KB Output is correct
25 Correct 31 ms 15232 KB Output is correct
26 Correct 2 ms 15232 KB Output is correct
27 Correct 2 ms 15232 KB Output is correct
28 Incorrect 31 ms 17188 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '-303948787415'
29 Halted 0 ms 0 KB -