oj.uz

답안 #1060796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060796 2024-08-15T22:54:19 Z MilosMilutinovic Tricks of the Trade (CEOI23_trade) C++14
65 / 100
 2990 ms 257952 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;
  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 - 5); i <= min(mid, optr + 5); i++) {
      long long v = Calc(i, mid);
      if (v > best) {
        best = v;
        opt = i;
        if (best > res) {
          segs.clear();
          res = best;
          segs.emplace_back(opt, mid);
        } else if (best == res) {
          segs.emplace_back(opt, mid);
        }
      } else if (v == best) {
        if (best > res) {
          segs.clear();
          res = best;
          segs.emplace_back(i, mid);
        } else if (best == res) {
          segs.emplace_back(i, mid);
        }
      }
    }
    Solve(l, mid - 1, optl, opt);
    Solve(mid + 1, r, opt, optr);
  };
  Solve(0, n - 1, 0, n - 1);
  cout << res << '\n';
  vector<int> seq(n, 0);
  vector<vector<int>> qs(n + 1);
  for (auto& p : segs) {
    int l = p.first;
    int r = p.second;
    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 0 ms 360 KB Output is correct

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 856 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 4 ms 7120 KB Output is correct
24 Correct 47 ms 6228 KB Output is correct
25 Correct 39 ms 6392 KB Output is correct
26 Correct 44 ms 6384 KB Output is correct
27 Correct 31 ms 7892 KB Output is correct
28 Correct 30 ms 6236 KB Output is correct
29 Correct 19 ms 6116 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1526 ms 176620 KB Output is correct
3 Correct 1426 ms 167900 KB Output is correct
4 Correct 2312 ms 166792 KB Output is correct
5 Correct 2673 ms 174280 KB Output is correct
6 Correct 2482 ms 173612 KB Output is correct
7 Correct 2381 ms 177540 KB Output is correct
8 Correct 1371 ms 167804 KB Output is correct
9 Correct 1498 ms 167724 KB Output is correct
10 Correct 1582 ms 174076 KB Output is correct

Subtask #4
10.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1526 ms 176620 KB Output is correct
3 Correct 1426 ms 167900 KB Output is correct
4 Correct 2312 ms 166792 KB Output is correct
5 Correct 2673 ms 174280 KB Output is correct
6 Correct 2482 ms 173612 KB Output is correct
7 Correct 2381 ms 177540 KB Output is correct
8 Correct 1371 ms 167804 KB Output is correct
9 Correct 1498 ms 167724 KB Output is correct
10 Correct 1582 ms 174076 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1617 ms 175268 KB Output is correct
13 Correct 1464 ms 165020 KB Output is correct
14 Correct 2362 ms 165328 KB Output is correct
15 Correct 2990 ms 171676 KB Output is correct
16 Correct 2552 ms 173564 KB Output is correct
17 Correct 2434 ms 177540 KB Output is correct
18 Correct 1407 ms 164772 KB Output is correct
19 Correct 1490 ms 166248 KB Output is correct
20 Correct 1519 ms 174048 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 2 ms 600 KB Output is correct
31 Correct 1446 ms 164788 KB Output is correct
32 Correct 2793 ms 169600 KB Output is correct
33 Correct 2509 ms 175308 KB Output is correct
34 Correct 2422 ms 171472 KB Output is correct
35 Correct 2253 ms 168400 KB Output is correct
36 Partially correct 2421 ms 167732 KB Partially correct
37 Correct 2315 ms 180992 KB Output is correct

Subtask #5
25.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 360 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 600 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 856 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 4 ms 7120 KB Output is correct
26 Correct 47 ms 6228 KB Output is correct
27 Correct 39 ms 6392 KB Output is correct
28 Correct 44 ms 6384 KB Output is correct
29 Correct 31 ms 7892 KB Output is correct
30 Correct 30 ms 6236 KB Output is correct
31 Correct 19 ms 6116 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1526 ms 176620 KB Output is correct
34 Correct 1426 ms 167900 KB Output is correct
35 Correct 2312 ms 166792 KB Output is correct
36 Correct 2673 ms 174280 KB Output is correct
37 Correct 2482 ms 173612 KB Output is correct
38 Correct 2381 ms 177540 KB Output is correct
39 Correct 1371 ms 167804 KB Output is correct
40 Correct 1498 ms 167724 KB Output is correct
41 Correct 1582 ms 174076 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1617 ms 175268 KB Output is correct
44 Correct 1464 ms 165020 KB Output is correct
45 Correct 2362 ms 165328 KB Output is correct
46 Correct 2990 ms 171676 KB Output is correct
47 Correct 2552 ms 173564 KB Output is correct
48 Correct 2434 ms 177540 KB Output is correct
49 Correct 1407 ms 164772 KB Output is correct
50 Correct 1490 ms 166248 KB Output is correct
51 Correct 1519 ms 174048 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 2 ms 604 KB Output is correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 1 ms 604 KB Output is correct
61 Correct 2 ms 600 KB Output is correct
62 Correct 1446 ms 164788 KB Output is correct
63 Correct 2793 ms 169600 KB Output is correct
64 Correct 2509 ms 175308 KB Output is correct
65 Correct 2422 ms 171472 KB Output is correct
66 Correct 2253 ms 168400 KB Output is correct
67 Partially correct 2421 ms 167732 KB Partially correct
68 Correct 2315 ms 180992 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 1508 ms 176620 KB Output is correct
71 Correct 1432 ms 167724 KB Output is correct
72 Correct 2234 ms 166792 KB Output is correct
73 Correct 2610 ms 174508 KB Output is correct
74 Correct 2487 ms 171984 KB Output is correct
75 Correct 2422 ms 179148 KB Output is correct
76 Correct 1343 ms 167808 KB Output is correct
77 Correct 1449 ms 167728 KB Output is correct
78 Correct 1514 ms 174028 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 0 ms 604 KB Output is correct
83 Correct 2 ms 604 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 2 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1460 ms 166324 KB Output is correct
90 Correct 2683 ms 170932 KB Output is correct
91 Correct 2475 ms 173776 KB Output is correct
92 Correct 2429 ms 171476 KB Output is correct
93 Correct 2257 ms 168444 KB Output is correct
94 Partially correct 2398 ms 167760 KB Partially correct
95 Correct 2361 ms 180960 KB Output is correct
96 Correct 4 ms 7120 KB Output is correct
97 Correct 47 ms 6376 KB Output is correct
98 Correct 40 ms 6384 KB Output is correct
99 Correct 44 ms 6224 KB Output is correct
100 Correct 30 ms 7892 KB Output is correct
101 Correct 30 ms 6120 KB Output is correct
102 Correct 16 ms 6116 KB Output is correct
103 Correct 1395 ms 164996 KB Output is correct
104 Correct 2394 ms 166488 KB Output is correct
105 Correct 2398 ms 168672 KB Output is correct
106 Correct 2339 ms 170032 KB Output is correct
107 Correct 173 ms 190904 KB Output is correct
108 Correct 1186 ms 168672 KB Output is correct
109 Correct 1704 ms 257952 KB Output is correct
110 Correct 1484 ms 172724 KB Output is correct
111 Correct 753 ms 166172 KB Output is correct
112 Correct 2080 ms 199088 KB Output is correct