oj.uz

Submission #968532

# Submission time Handle Problem Language Result Execution time Memory
968532 2024-04-23T14:48:32 Z nguyentunglam Wiring (IOI17_wiring) C++17
45 / 100
 1000 ms 14428 KB 
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;

const int N = 2e5 + 10;

int a[N], b[N];

int c[N], d[N];

long long pref[N], _pref[N], suff[N], _suff[N], sum[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];

  a[n + 1] = b[m + 1] = 1e9;

  for(int i = 1, j = 1, k = 0, sum = 0; i <= n || j <= m;) {
    if (a[i] < b[j]) {
      c[++k] = a[i++];
      d[k] = 0;
    }
    else {
      c[++k] = b[j++];
      d[k] = 1;
    }
  }

  for(int i = 1; i <= n + m; i++) sum[i] = sum[i - 1] + c[i];

  for(int i = 0; i <= n + m; i++) pref[i] = suff[i] = 1e16;
  for(int i = 0; i <= n + m; i++) _pref[i] = _suff[i] = 1e16;

  pref[0] = 0;

  for(int i = 1, cnt = 0; i <= n + m; ) {
    int j = i;
    while (j <= n + m && d[j] == d[i]) j++; j--;
    for(int k = cnt + 1; k <= j - i + 1; k++) pref[k] = min(pref[k], pref[k - 1]);
//    cout << i << " " << j << "@" << endl;
//    cout << pref[2] << endl;
    for(int k = i - 1; k <= j; k++) {
      if (i == 1 && k > 0) break;
      long long f = sum[k] - sum[i - 1] + min(pref[k - i + 1] - 1LL * (k - i + 1) * c[i - 1],
                                          suff[k - i + 1] - 1LL * (k - i + 1) * c[i]);
      _pref[j - k] = f - (sum[j] - sum[k]) + 1LL * (j - k) * c[j];
      _suff[j - k] = f - (sum[j] - sum[k]) + 1LL * (j - k) * c[j + 1];

      if (k == i && k == j) {
        _pref[j - k + 1] = min(_pref[j - k + 1], f - (sum[j] - sum[k]) + c[j]);
        _suff[j - k + 1] = min(_suff[j - k + 1], f - (sum[j] - sum[k]) + c[j + 1]);
      }
    }
    for(int i = 0; i <= max(j - i + 1, cnt); i++) pref[i] = suff[i] = 1e18;
    cnt = j - i + 1;
    for(int i = 0; i <= cnt; i++) pref[i] = _pref[i], suff[i] = _suff[i];
    for(int k = 2; k <= cnt; k++) pref[k] = min(pref[k - 1], pref[k]);
    for(int k = cnt - 1; k >= 0; k--) suff[k] = min(suff[k + 1], suff[k]);
    i = j + 1;
  }

  return pref[0];
}

#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

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:20:32: warning: unused variable 'sum' [-Wunused-variable]
   20 |   for(int i = 1, j = 1, k = 0, sum = 0; i <= n || j <= m;) {
      |                                ^~~
wiring.cpp:40:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   40 |     while (j <= n + m && d[j] == d[i]) j++; j--;
      |     ^~~~~
wiring.cpp:40:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   40 |     while (j <= n + m && d[j] == d[i]) j++; j--;
      |                                             ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10636 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 1 ms 10684 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 16 ms 12056 KB Output is correct
4 Correct 20 ms 13508 KB Output is correct
5 Correct 16 ms 13404 KB Output is correct
6 Correct 20 ms 14428 KB Output is correct
7 Correct 20 ms 14428 KB Output is correct
8 Correct 20 ms 14420 KB Output is correct
9 Correct 19 ms 14428 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Execution timed out 1093 ms 12508 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 18 ms 12504 KB Output is correct
3 Correct 594 ms 12568 KB Output is correct
4 Correct 29 ms 12376 KB Output is correct
5 Correct 593 ms 12572 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 1 ms 10584 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 1 ms 10584 KB Output is correct
14 Correct 1 ms 10840 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 2 ms 10700 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 17 ms 12504 KB Output is correct
19 Correct 32 ms 13768 KB Output is correct
20 Correct 23 ms 13652 KB Output is correct
21 Correct 19 ms 13660 KB Output is correct
22 Correct 18 ms 13660 KB Output is correct
23 Correct 17 ms 13656 KB Output is correct
24 Correct 18 ms 13752 KB Output is correct

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10636 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 1 ms 10584 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10584 KB Output is correct
12 Correct 1 ms 10684 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10584 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 16 ms 12056 KB Output is correct
20 Correct 20 ms 13508 KB Output is correct
21 Correct 16 ms 13404 KB Output is correct
22 Correct 20 ms 14428 KB Output is correct
23 Correct 20 ms 14428 KB Output is correct
24 Correct 20 ms 14420 KB Output is correct
25 Correct 19 ms 14428 KB Output is correct
26 Correct 1 ms 10584 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Execution timed out 1093 ms 12508 KB Time limit exceeded
29 Halted 0 ms 0 KB -