oj.uz

Submission #968534

# Submission time Handle Problem Language Result Execution time Memory
968534 2024-04-23T14:52:06 Z nguyentunglam Wiring (IOI17_wiring) C++17
100 / 100
 27 ms 14552 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;

//  return 0;

  for(int i = 1, cnt = 0; i <= n + m; ) {
    int j = i;
    while (j <= n + m && d[j] == d[i]) j++; j--;
//    cout << i << " " << j << endl;
    for(int k = cnt + 1; k <= j - i + 1; k++) pref[k] = min(pref[k], pref[k - 1]);
    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 k = 0; k <= max(j - i + 1, cnt); k++) pref[k] = suff[k] = 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:42:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   42 |     while (j <= n + m && d[j] == d[i]) j++; j--;
      |     ^~~~~
wiring.cpp:42:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   42 |     while (j <= n + m && d[j] == d[i]) j++; j--;
      |                                             ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 1 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 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10584 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 10584 KB Output is correct
3 Correct 15 ms 12052 KB Output is correct
4 Correct 18 ms 12124 KB Output is correct
5 Correct 16 ms 11868 KB Output is correct
6 Correct 20 ms 12380 KB Output is correct
7 Correct 20 ms 12508 KB Output is correct
8 Correct 20 ms 12504 KB Output is correct
9 Correct 20 ms 12380 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10704 KB Output is correct
3 Correct 22 ms 12372 KB Output is correct
4 Correct 19 ms 14016 KB Output is correct
5 Correct 2 ms 10588 KB Output is correct
6 Correct 1 ms 10784 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 2 ms 10688 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 2 ms 10584 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 2 ms 10584 KB Output is correct
16 Correct 2 ms 10840 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 21 ms 14392 KB Output is correct
19 Correct 22 ms 14428 KB Output is correct
20 Correct 21 ms 14424 KB Output is correct
21 Correct 25 ms 14300 KB Output is correct
22 Correct 22 ms 14428 KB Output is correct
23 Correct 22 ms 14496 KB Output is correct
24 Correct 21 ms 14428 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 17 ms 12376 KB Output is correct
3 Correct 19 ms 12508 KB Output is correct
4 Correct 18 ms 12376 KB Output is correct
5 Correct 18 ms 12464 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 1 ms 10840 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10584 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 17 ms 12380 KB Output is correct
19 Correct 18 ms 12496 KB Output is correct
20 Correct 17 ms 12376 KB Output is correct
21 Correct 17 ms 12376 KB Output is correct
22 Correct 18 ms 12380 KB Output is correct
23 Correct 21 ms 12380 KB Output is correct
24 Correct 17 ms 12380 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 1 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 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10584 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 10584 KB Output is correct
19 Correct 15 ms 12052 KB Output is correct
20 Correct 18 ms 12124 KB Output is correct
21 Correct 16 ms 11868 KB Output is correct
22 Correct 20 ms 12380 KB Output is correct
23 Correct 20 ms 12508 KB Output is correct
24 Correct 20 ms 12504 KB Output is correct
25 Correct 20 ms 12380 KB Output is correct
26 Correct 1 ms 10588 KB Output is correct
27 Correct 1 ms 10704 KB Output is correct
28 Correct 22 ms 12372 KB Output is correct
29 Correct 19 ms 14016 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 1 ms 10784 KB Output is correct
32 Correct 1 ms 10588 KB Output is correct
33 Correct 2 ms 10588 KB Output is correct
34 Correct 1 ms 10588 KB Output is correct
35 Correct 2 ms 10688 KB Output is correct
36 Correct 2 ms 10588 KB Output is correct
37 Correct 2 ms 10588 KB Output is correct
38 Correct 2 ms 10584 KB Output is correct
39 Correct 1 ms 10588 KB Output is correct
40 Correct 2 ms 10584 KB Output is correct
41 Correct 2 ms 10840 KB Output is correct
42 Correct 2 ms 10588 KB Output is correct
43 Correct 21 ms 14392 KB Output is correct
44 Correct 22 ms 14428 KB Output is correct
45 Correct 21 ms 14424 KB Output is correct
46 Correct 25 ms 14300 KB Output is correct
47 Correct 22 ms 14428 KB Output is correct
48 Correct 22 ms 14496 KB Output is correct
49 Correct 21 ms 14428 KB Output is correct
50 Correct 1 ms 10588 KB Output is correct
51 Correct 17 ms 12376 KB Output is correct
52 Correct 19 ms 12508 KB Output is correct
53 Correct 18 ms 12376 KB Output is correct
54 Correct 18 ms 12464 KB Output is correct
55 Correct 1 ms 10588 KB Output is correct
56 Correct 2 ms 10588 KB Output is correct
57 Correct 2 ms 10588 KB Output is correct
58 Correct 1 ms 10840 KB Output is correct
59 Correct 2 ms 10588 KB Output is correct
60 Correct 2 ms 10588 KB Output is correct
61 Correct 1 ms 10588 KB Output is correct
62 Correct 1 ms 10588 KB Output is correct
63 Correct 2 ms 10588 KB Output is correct
64 Correct 2 ms 10584 KB Output is correct
65 Correct 2 ms 10588 KB Output is correct
66 Correct 1 ms 10588 KB Output is correct
67 Correct 17 ms 12380 KB Output is correct
68 Correct 18 ms 12496 KB Output is correct
69 Correct 17 ms 12376 KB Output is correct
70 Correct 17 ms 12376 KB Output is correct
71 Correct 18 ms 12380 KB Output is correct
72 Correct 21 ms 12380 KB Output is correct
73 Correct 17 ms 12380 KB Output is correct
74 Correct 22 ms 14408 KB Output is correct
75 Correct 19 ms 13912 KB Output is correct
76 Correct 20 ms 14416 KB Output is correct
77 Correct 18 ms 13916 KB Output is correct
78 Correct 18 ms 13892 KB Output is correct
79 Correct 18 ms 13916 KB Output is correct
80 Correct 18 ms 13952 KB Output is correct
81 Correct 18 ms 14024 KB Output is correct
82 Correct 18 ms 13908 KB Output is correct
83 Correct 20 ms 14172 KB Output is correct
84 Correct 21 ms 14428 KB Output is correct
85 Correct 20 ms 14428 KB Output is correct
86 Correct 24 ms 14552 KB Output is correct
87 Correct 27 ms 14276 KB Output is correct
88 Correct 20 ms 14428 KB Output is correct
89 Correct 21 ms 14428 KB Output is correct
90 Correct 20 ms 14428 KB Output is correct
91 Correct 20 ms 14428 KB Output is correct
92 Correct 20 ms 14284 KB Output is correct
93 Correct 21 ms 14412 KB Output is correct
94 Correct 21 ms 14420 KB Output is correct
95 Correct 20 ms 14400 KB Output is correct
96 Correct 20 ms 14408 KB Output is correct
97 Correct 21 ms 14428 KB Output is correct
98 Correct 22 ms 14416 KB Output is correct
99 Correct 23 ms 14508 KB Output is correct
100 Correct 20 ms 14528 KB Output is correct
101 Correct 21 ms 14424 KB Output is correct
102 Correct 25 ms 14276 KB Output is correct