oj.uz

답안 #1060804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060804 2024-08-15T23:03:41 Z MilosMilutinovic Tricks of the Trade (CEOI23_trade) C++14
50 / 100
 2760 ms 182328 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) {
        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;
    }
  }
  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 1 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
5.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 Partially correct 1 ms 604 KB Partially correct
7 Partially correct 1 ms 604 KB Partially correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Partially correct 2 ms 856 KB Partially correct

Subtask #2
5.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 Partially correct 1 ms 604 KB Partially correct
7 Partially correct 1 ms 604 KB Partially correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Partially correct 2 ms 856 KB Partially correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 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 604 KB Output is correct
17 Partially correct 1 ms 600 KB Partially correct
18 Partially correct 1 ms 604 KB Partially correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Partially correct 1 ms 604 KB Partially correct
23 Correct 3 ms 6236 KB Output is correct
24 Partially correct 46 ms 6484 KB Partially correct
25 Partially correct 31 ms 6492 KB Partially correct
26 Partially correct 35 ms 6444 KB Partially correct
27 Correct 20 ms 6492 KB Output is correct
28 Correct 23 ms 6176 KB Output is correct
29 Correct 13 ms 6232 KB Output is correct

Subtask #3
5.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1397 ms 182328 KB Output is correct
3 Correct 1117 ms 168228 KB Output is correct
4 Correct 1898 ms 169672 KB Output is correct
5 Partially correct 2217 ms 176152 KB Partially correct
6 Partially correct 2015 ms 177364 KB Partially correct
7 Partially correct 2044 ms 167308 KB Partially correct
8 Correct 1147 ms 169600 KB Output is correct
9 Correct 1240 ms 168268 KB Output is correct
10 Correct 1346 ms 178896 KB Output is correct

Subtask #4
10.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1397 ms 182328 KB Output is correct
3 Correct 1117 ms 168228 KB Output is correct
4 Correct 1898 ms 169672 KB Output is correct
5 Partially correct 2217 ms 176152 KB Partially correct
6 Partially correct 2015 ms 177364 KB Partially correct
7 Partially correct 2044 ms 167308 KB Partially correct
8 Correct 1147 ms 169600 KB Output is correct
9 Correct 1240 ms 168268 KB Output is correct
10 Correct 1346 ms 178896 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1406 ms 181316 KB Output is correct
13 Correct 1119 ms 168264 KB Output is correct
14 Correct 1868 ms 169668 KB Output is correct
15 Partially correct 2243 ms 176176 KB Partially correct
16 Partially correct 2087 ms 176156 KB Partially correct
17 Partially correct 1991 ms 167248 KB Partially correct
18 Correct 1136 ms 169252 KB Output is correct
19 Correct 1193 ms 168348 KB Output is correct
20 Correct 1362 ms 178932 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Partially correct 1 ms 604 KB Partially correct
26 Partially correct 1 ms 604 KB Partially correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Partially correct 1 ms 616 KB Partially correct
31 Correct 1193 ms 169700 KB Output is correct
32 Partially correct 2450 ms 175128 KB Partially correct
33 Partially correct 2180 ms 174124 KB Partially correct
34 Partially correct 2041 ms 175132 KB Partially correct
35 Partially correct 1867 ms 174176 KB Partially correct
36 Partially correct 1706 ms 166988 KB Partially correct
37 Correct 1787 ms 175660 KB Output is correct

Subtask #5
25.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 0 ms 348 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 Partially correct 1 ms 604 KB Partially correct
9 Partially correct 1 ms 604 KB Partially correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Partially correct 2 ms 856 KB Partially correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 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 604 KB Output is correct
19 Partially correct 1 ms 600 KB Partially correct
20 Partially correct 1 ms 604 KB Partially correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Partially correct 1 ms 604 KB Partially correct
25 Correct 3 ms 6236 KB Output is correct
26 Partially correct 46 ms 6484 KB Partially correct
27 Partially correct 31 ms 6492 KB Partially correct
28 Partially correct 35 ms 6444 KB Partially correct
29 Correct 20 ms 6492 KB Output is correct
30 Correct 23 ms 6176 KB Output is correct
31 Correct 13 ms 6232 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1397 ms 182328 KB Output is correct
34 Correct 1117 ms 168228 KB Output is correct
35 Correct 1898 ms 169672 KB Output is correct
36 Partially correct 2217 ms 176152 KB Partially correct
37 Partially correct 2015 ms 177364 KB Partially correct
38 Partially correct 2044 ms 167308 KB Partially correct
39 Correct 1147 ms 169600 KB Output is correct
40 Correct 1240 ms 168268 KB Output is correct
41 Correct 1346 ms 178896 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1406 ms 181316 KB Output is correct
44 Correct 1119 ms 168264 KB Output is correct
45 Correct 1868 ms 169668 KB Output is correct
46 Partially correct 2243 ms 176176 KB Partially correct
47 Partially correct 2087 ms 176156 KB Partially correct
48 Partially correct 1991 ms 167248 KB Partially correct
49 Correct 1136 ms 169252 KB Output is correct
50 Correct 1193 ms 168348 KB Output is correct
51 Correct 1362 ms 178932 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 604 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Partially correct 1 ms 604 KB Partially correct
57 Partially correct 1 ms 604 KB Partially correct
58 Correct 1 ms 604 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 1 ms 600 KB Output is correct
61 Partially correct 1 ms 616 KB Partially correct
62 Correct 1193 ms 169700 KB Output is correct
63 Partially correct 2450 ms 175128 KB Partially correct
64 Partially correct 2180 ms 174124 KB Partially correct
65 Partially correct 2041 ms 175132 KB Partially correct
66 Partially correct 1867 ms 174176 KB Partially correct
67 Partially correct 1706 ms 166988 KB Partially correct
68 Correct 1787 ms 175660 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 1445 ms 181316 KB Output is correct
71 Correct 1103 ms 168148 KB Output is correct
72 Correct 1954 ms 169412 KB Output is correct
73 Partially correct 2418 ms 176164 KB Partially correct
74 Partially correct 2096 ms 176156 KB Partially correct
75 Partially correct 2083 ms 167028 KB Partially correct
76 Correct 1144 ms 167996 KB Output is correct
77 Correct 1242 ms 166864 KB Output is correct
78 Correct 1375 ms 177464 KB Output is correct
79 Correct 1 ms 600 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 604 KB Output is correct
83 Partially correct 1 ms 604 KB Partially correct
84 Partially correct 2 ms 604 KB Partially correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 1 ms 604 KB Output is correct
88 Partially correct 2 ms 604 KB Partially correct
89 Correct 1287 ms 168280 KB Output is correct
90 Partially correct 2760 ms 173768 KB Partially correct
91 Partially correct 2453 ms 173476 KB Partially correct
92 Partially correct 2032 ms 175132 KB Partially correct
93 Partially correct 1968 ms 174056 KB Partially correct
94 Partially correct 1746 ms 166800 KB Partially correct
95 Correct 1736 ms 176696 KB Output is correct
96 Correct 4 ms 6232 KB Output is correct
97 Partially correct 36 ms 6456 KB Partially correct
98 Partially correct 31 ms 6464 KB Partially correct
99 Partially correct 37 ms 6492 KB Partially correct
100 Correct 21 ms 6480 KB Output is correct
101 Correct 24 ms 6236 KB Output is correct
102 Correct 13 ms 6200 KB Output is correct
103 Correct 1261 ms 169464 KB Output is correct
104 Partially correct 2097 ms 175028 KB Partially correct
105 Partially correct 1984 ms 174648 KB Partially correct
106 Partially correct 1955 ms 174120 KB Partially correct
107 Partially correct 148 ms 167584 KB Partially correct
108 Partially correct 1014 ms 170408 KB Partially correct
109 Correct 1107 ms 173500 KB Output is correct
110 Correct 1333 ms 167360 KB Output is correct
111 Correct 633 ms 165768 KB Output is correct
112 Partially correct 1642 ms 171852 KB Partially correct