oj.uz

답안 #1061273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1061273 2024-08-16T07:37:22 Z MilosMilutinovic Tricks of the Trade (CEOI23_trade) C++14
100 / 100
 2650 ms 192900 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 250000;
 
const int MAX = (int) 1.00001e9;
 
int root[N * 60], ch[N * 60][2], cnt[N * 60], tsz;
long long sum[N * 60];
 
void Modify(int& x, int y, int l, int r, int i) {
  x = ++tsz;
  ch[x][0] = ch[y][0];
  ch[x][1] = ch[y][1];
  sum[x] = sum[y] + i;
  cnt[x] = cnt[y] + 1;
  if (l == r) {
    return;
  }
  int mid = (l + r) >> 1;
  if (i <= mid) {
    Modify(ch[x][0], ch[y][0], l, mid, i);
  } else {
    Modify(ch[x][1], ch[y][1], mid + 1, r, i);
  }
}
 
int Walk(int x, int y, int l, int r, int k) {
  if (l == r) {
    return l;
  }
  int mid = (l + r) >> 1;
  if (cnt[ch[x][1]] - cnt[ch[y][1]] >= k) {
    return Walk(ch[x][1], ch[y][1], mid + 1, r, k);
  } else {
    return Walk(ch[x][0], ch[y][0], l, mid, k - (cnt[ch[x][1]] - cnt[ch[y][1]]));
  }
}
 
int QueryCnt(int x, int y, int l, int r, int ll, int rr) {
  if (ll <= l && r <= rr) {
    return cnt[x] - cnt[y];
  }
  int mid = (l + r) >> 1;
  if (rr <= mid) {
    return QueryCnt(ch[x][0], ch[y][0], l, mid, ll, rr);
  } else if (ll > mid) {
    return QueryCnt(ch[x][1], ch[y][1], mid + 1, r, ll, rr);
  } else {
    return QueryCnt(ch[x][0], ch[y][0], l, mid, ll, rr) + QueryCnt(ch[x][1], ch[y][1], mid + 1, r, ll, rr);
  }
}
 
long long QuerySum(int x, int y, int l, int r, int ll, int rr) {
  if (ll <= l && r <= rr) {
    return sum[x] - sum[y];
  }
  int mid = (l + r) >> 1;
  if (rr <= mid) {
    return QuerySum(ch[x][0], ch[y][0], l, mid, ll, rr);
  } else if (ll > mid) {
    return QuerySum(ch[x][1], ch[y][1], mid + 1, r, ll, rr);
  } else {
    return QuerySum(ch[x][0], ch[y][0], l, mid, ll, rr) + QuerySum(ch[x][1], ch[y][1], mid + 1, r, ll, rr);
  }
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> c(n);
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  vector<int> s(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }
  vector<long long> pref(n);
  for (int i = 0; i < n; i++) {
    pref[i] = (i == 0 ? 0LL : pref[i - 1]) + c[i];
  }
  for (int i = 0; i < n; i++) {
    if (i > 0) {
      root[i] = root[i - 1];
    }
    Modify(root[i], root[i], 0, MAX, s[i]);
  }
  const long long inf = (long long) -1e18;
  long long res = inf;
  int from = -1, to = -1;
  auto Calc = [&](int l, int r) {
    if (r - l + 1 < k) {
      return inf;
    }
    long long ret = -(pref[r] - (l == 0 ? 0LL : pref[l - 1]));
    int el = Walk(root[r], l == 0 ? 0 : root[l - 1], 0, MAX, k);
    int c = QueryCnt(root[r], l == 0 ? 0 : root[l - 1], 0, MAX, el + 1, MAX);
    ret += QuerySum(root[r], l == 0 ? 0 : root[l - 1], 0, MAX, el + 1, MAX);
    ret += el * 1LL * (k - c);
    return ret;
  };
  vector<pair<int, int>> segs;
  vector<int> idx(n);
  function<void(int, int, int, int)> Solve = [&](int l, int r, int optl, int optr) {
    if (l > r) {
      return;
    }
    int mid = (l + r) >> 1;
    int opt = min(optl, mid);
    long long best = Calc(opt, mid);
    for (int i = max(0, optl); i <= min(mid, optr); i++) {
      long long v = Calc(i, mid);
      if (v >= best && v != inf) {
        best = v;
        opt = i;
      }
    }
    res = max(res, best);
    idx[mid] = opt;
    Solve(l, mid - 1, optl, opt);
    Solve(mid + 1, r, opt, optr);
  };
  Solve(0, n - 1, 0, n - 1);
  cout << res << '\n';
  vector<int> ids;
  for (int i = 0; i < n; i++) {
    if (Calc(idx[i], i) == res) {
      ids.push_back(i);
    }
  }
  int ptr = 0;
  for (int b = 0; b < (int) ids.size(); b++) {
    int i = ids[b];
    while (ptr <= idx[i]) {
      segs.emplace_back(ptr, i);
      if (b > 0) {
        segs.emplace_back(ptr, ids[b - 1]);
      }
      if (b + 1 < (int) ids.size()) {
        segs.emplace_back(ptr, ids[b + 1]);
      }
      ptr += 1;
    }
    ptr = max(ptr - 1, 0);
  }
  vector<int> seq(n, 0);
  vector<vector<int>> qs(n + 1);
  for (auto& p : segs) {
    int l = p.first;
    int r = p.second;
    if (l > r || Calc(l, r) != res) {
      continue;
    }
    int el = Walk(root[r], l == 0 ? 0 : root[l - 1], 0, MAX, k);
    qs[l].push_back(el);
    qs[r + 1].push_back(~el);
  }
  multiset<int> st;
  for (int i = 0; i < n; i++) {
    for (int j : qs[i]) {
      if (j >= 0) {
        st.insert(j);
      } else {
        st.erase(st.find(~j));
      }
    }
    if (!st.empty() && s[i] >= *st.begin()) {
      seq[i] = 1;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << seq[i];
  }
  cout << '\n';
  return 0;
}

Compilation message

trade.cpp: In function 'int main()':
trade.cpp:94:7: warning: unused variable 'from' [-Wunused-variable]
   94 |   int from = -1, to = -1;
      |       ^~~~
trade.cpp:94:18: warning: unused variable 'to' [-Wunused-variable]
   94 |   int from = -1, to = -1;
      |                  ^~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 3 ms 6236 KB Output is correct
24 Correct 46 ms 6612 KB Output is correct
25 Correct 40 ms 6444 KB Output is correct
26 Correct 53 ms 6688 KB Output is correct
27 Correct 22 ms 6932 KB Output is correct
28 Correct 27 ms 6164 KB Output is correct
29 Correct 15 ms 6204 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1834 ms 184312 KB Output is correct
3 Correct 1261 ms 169432 KB Output is correct
4 Correct 2199 ms 170968 KB Output is correct
5 Correct 2496 ms 182844 KB Output is correct
6 Correct 2356 ms 181112 KB Output is correct
7 Correct 2352 ms 180512 KB Output is correct
8 Correct 1201 ms 170448 KB Output is correct
9 Correct 1324 ms 168500 KB Output is correct
10 Correct 1442 ms 181412 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1834 ms 184312 KB Output is correct
3 Correct 1261 ms 169432 KB Output is correct
4 Correct 2199 ms 170968 KB Output is correct
5 Correct 2496 ms 182844 KB Output is correct
6 Correct 2356 ms 181112 KB Output is correct
7 Correct 2352 ms 180512 KB Output is correct
8 Correct 1201 ms 170448 KB Output is correct
9 Correct 1324 ms 168500 KB Output is correct
10 Correct 1442 ms 181412 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1524 ms 184324 KB Output is correct
13 Correct 1108 ms 169180 KB Output is correct
14 Correct 1889 ms 170740 KB Output is correct
15 Correct 2256 ms 182836 KB Output is correct
16 Correct 2109 ms 181484 KB Output is correct
17 Correct 2152 ms 180112 KB Output is correct
18 Correct 1091 ms 170440 KB Output is correct
19 Correct 1191 ms 168652 KB Output is correct
20 Correct 1388 ms 181564 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1203 ms 171016 KB Output is correct
32 Correct 2375 ms 180188 KB Output is correct
33 Correct 2154 ms 182640 KB Output is correct
34 Correct 2011 ms 178820 KB Output is correct
35 Correct 1970 ms 176776 KB Output is correct
36 Correct 1791 ms 168396 KB Output is correct
37 Correct 1724 ms 181796 KB Output is correct

Subtask #5
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 456 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 3 ms 6236 KB Output is correct
26 Correct 46 ms 6612 KB Output is correct
27 Correct 40 ms 6444 KB Output is correct
28 Correct 53 ms 6688 KB Output is correct
29 Correct 22 ms 6932 KB Output is correct
30 Correct 27 ms 6164 KB Output is correct
31 Correct 15 ms 6204 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1834 ms 184312 KB Output is correct
34 Correct 1261 ms 169432 KB Output is correct
35 Correct 2199 ms 170968 KB Output is correct
36 Correct 2496 ms 182844 KB Output is correct
37 Correct 2356 ms 181112 KB Output is correct
38 Correct 2352 ms 180512 KB Output is correct
39 Correct 1201 ms 170448 KB Output is correct
40 Correct 1324 ms 168500 KB Output is correct
41 Correct 1442 ms 181412 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1524 ms 184324 KB Output is correct
44 Correct 1108 ms 169180 KB Output is correct
45 Correct 1889 ms 170740 KB Output is correct
46 Correct 2256 ms 182836 KB Output is correct
47 Correct 2109 ms 181484 KB Output is correct
48 Correct 2152 ms 180112 KB Output is correct
49 Correct 1091 ms 170440 KB Output is correct
50 Correct 1191 ms 168652 KB Output is correct
51 Correct 1388 ms 181564 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 1 ms 600 KB Output is correct
60 Correct 1 ms 604 KB Output is correct
61 Correct 1 ms 604 KB Output is correct
62 Correct 1203 ms 171016 KB Output is correct
63 Correct 2375 ms 180188 KB Output is correct
64 Correct 2154 ms 182640 KB Output is correct
65 Correct 2011 ms 178820 KB Output is correct
66 Correct 1970 ms 176776 KB Output is correct
67 Correct 1791 ms 168396 KB Output is correct
68 Correct 1724 ms 181796 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1527 ms 184320 KB Output is correct
71 Correct 1174 ms 169176 KB Output is correct
72 Correct 2024 ms 170960 KB Output is correct
73 Correct 2308 ms 183072 KB Output is correct
74 Correct 2162 ms 181300 KB Output is correct
75 Correct 2217 ms 180328 KB Output is correct
76 Correct 1094 ms 170600 KB Output is correct
77 Correct 1264 ms 168952 KB Output is correct
78 Correct 1441 ms 181568 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 1 ms 604 KB Output is correct
82 Correct 1 ms 468 KB Output is correct
83 Correct 1 ms 604 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 1 ms 600 KB Output is correct
88 Correct 1 ms 600 KB Output is correct
89 Correct 1196 ms 170792 KB Output is correct
90 Correct 2650 ms 180188 KB Output is correct
91 Correct 2227 ms 182856 KB Output is correct
92 Correct 2079 ms 178584 KB Output is correct
93 Correct 2019 ms 176776 KB Output is correct
94 Correct 1771 ms 168100 KB Output is correct
95 Correct 1682 ms 181564 KB Output is correct
96 Correct 3 ms 6488 KB Output is correct
97 Correct 38 ms 6612 KB Output is correct
98 Correct 32 ms 6484 KB Output is correct
99 Correct 36 ms 6684 KB Output is correct
100 Correct 20 ms 6744 KB Output is correct
101 Correct 22 ms 6176 KB Output is correct
102 Correct 13 ms 6236 KB Output is correct
103 Correct 1204 ms 171668 KB Output is correct
104 Correct 2076 ms 175792 KB Output is correct
105 Correct 2011 ms 178556 KB Output is correct
106 Correct 1977 ms 180400 KB Output is correct
107 Correct 142 ms 168328 KB Output is correct
108 Correct 1093 ms 175044 KB Output is correct
109 Correct 1082 ms 192900 KB Output is correct
110 Correct 1141 ms 175052 KB Output is correct
111 Correct 663 ms 169384 KB Output is correct
112 Correct 1566 ms 182644 KB Output is correct