oj.uz

답안 #217923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217923 2020-03-31T08:26:36 Z extraterrestrial Long Distance Coach (JOI17_coach) C++14
100 / 100
 1397 ms 50780 KB 
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define int ll

const int N = 2e5 + 10;
const ll BINF = 1e18 + 10;
int can[N], dp[N], f[N], cost[N];

int t[4 * N], ps[4 * N];

void build(int v, int l, int r) {
  t[v] = BINF;
  ps[v] = -1;
  if (l == r) {
    return;
  }
  int mid = (l + r) / 2;
  build(2 * v, l, mid);
  build(2 * v + 1, mid + 1, r);
}

void push(int v, int len1, int len2) {
  if (ps[v] != -1) {
    ps[2 * v] = ps[2 * v + 1] = ps[v];
    t[2 * v] = ps[v] * len1;
    t[2 * v + 1] = ps[v] * len2;
    ps[v] = -1;
    return;
  }
}

void update(int v, int l, int r, int a, int b, int val) {
  if (l > b || r < a) {
    return;
  }
  if (l >= a && r <= b) {
    t[v] = val * (r - l + 1);
    ps[v] = val;
    return;
  }
  int mid = (l + r) / 2;
  push(v, mid - l + 1, r - mid);
  update(2 * v, l, mid, a, b, val);
  update(2 * v + 1, mid + 1, r, a, b, val);
  t[v] = min(BINF, t[2 * v] + t[2 * v + 1]);
}

int get_sum(int v, int l, int r, int a, int b) {
  if (l > b || r < a) {
    return 0;
  }
  if (l >= a && r <= b) {
    return t[v];
  }
  int mid = (l + r) / 2;
  push(v, mid - l + 1, r - mid);
  return min(BINF, get_sum(2 * v, l, mid, a, b) + get_sum(2 * v + 1, mid + 1, r, a, b));
}

pair<int, int> t2[4 * N];

void build2(int v, int l, int r) {
  if (l == r) {
    t2[v] = {-1, l};
    return;
  }
  int mid = (l + r) / 2;
  build2(2 * v, l, mid);
  build2(2 * v + 1, mid + 1, r);
  t2[v] = max(t2[2 * v], t2[2 * v + 1]);
}

void update2(int v, int l, int r, int pos, int val) {
  if (l == r) {
    t2[v] = {val, pos};
    return;
  }
  int mid = (l + r) / 2;
  if (pos <= mid) {
    update2(2 * v, l, mid, pos, val);
  }
  else {
    update2(2 * v + 1, mid + 1, r, pos, val);
  }
  t2[v] = max(t2[2 * v], t2[2 * v + 1]);
}

pair<int, int> get_max(int v, int l, int r, int a, int b) {
  if (l > b || r < a) {
    return {-1, 0};
  }
  if (l >= a && r <= b) {
    return t2[v];
  }
  int mid = (l + r) / 2;
  return max(get_max(2 * v, l, mid, a, b), get_max(2 * v + 1, mid + 1, r, a, b));
}

int pref[N], prv[N];

inline int get_sum(int l, int r) {
  return pref[r] - pref[l - 1];
}

set<int> good;
int w, x, n, m;
inline bool check(int x) {
  auto it = ++good.lower_bound(x);
  if (it == good.end()) {
    update2(1, 1, m, x, -1);
    return false;
  }
  if (get_sum(1, 1, m, x + 1, *it) < BINF && dp[x] + get_sum(x + 1, *it) + w * get_sum(1, 1, m, x + 1, *it) <= dp[*it]) {
    update2(1, 1, m, *it, -1);
    good.erase(it);
    check(x);
    return true;
  }
  else {
    if (dp[*it] - dp[x] - get_sum(x + 1, *it) < 0) {
      update2(1, 1, m, x, -1);
    }
    else {
      update2(1, 1, m, x, (dp[*it] - dp[x] - get_sum(x + 1, *it)) / (w * (*it - x)));  
    }
    return false;
  }
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> x >> n >> m >> w >> t;
  vector<int> s(n);
  for (auto  &it : s) {
    cin >> it;
  }  
  sort(all(s));
  vector<pair<int, int>> srt;
  for (int i = 1; i <= m; i++) {
    cin >> f[i] >> cost[i];
    srt.pb({f[i], i});
  }
  sort(all(srt));
  for (int i = 0; i <= m; i++) {
    can[i] = BINF;
  }
  for (auto it : s) {
    int ps = lower_bound(all(srt), make_pair(it % t, 0ll)) - srt.begin();
    if (ps + 1 <= m) {
      can[ps + 1] = min(can[ps + 1], it / t);
    }
    else {
      can[0] = min(can[0], it / t);
    }
  }
  int ps = lower_bound(all(srt), make_pair(x % t, 0ll)) - srt.begin();
  if (ps + 1 <= m) {
    can[ps + 1] = min(can[ps + 1], x / t);
  }
  else {
    can[0] = min(can[0], x / t);
  }
  for (int i = 1; i <= m; i++) {
    pref[i] = pref[i - 1] + cost[srt[i - 1].S];
  }
  vector<pair<int, int>> st;
  for (int i = 1; i <= m; i++) {
    while (!st.empty() && st.back().F > can[i]) {
      st.pop_back();
    }
    if (!st.empty()) {
      prv[i] = st.back().S;
    }
    else {
      prv[i] = 1;
    }
    st.pb({can[i], i});
  }
  dp[0] = w * (x / t + 1);
  good.insert(0);
  build(1, 1, m);
  build2(1, 1, m);
  vector<int> need;
  for (int i = 1; i <= m; i++) {
    int cnt = x / t;
    if (f[srt[i - 1].S] < x % t) {
      cnt++;
    }
    dp[i] = dp[i - 1] + w * cnt;
    if (can[i] < BINF) {
      update(1, 1, m, prv[i], i - 1, can[i]);
      for (auto it : need) {
        if (good.find(it) != good.end()) {
          check(it);
        }
      }
      need = {};
      for (;;) {
        pair<int, int> kek = get_max(1, 1, m, prv[i] - 1, i - 1);
        if (kek.F < can[i]) {
          break;
        }
        assert(good.find(kek.S) != good.end());
        assert(check(kek.S));
      }
      auto it = good.lower_bound(prv[i] - 1);
      if (it != good.begin()) {
        check(*(--it));
      }
      if (SZ(good) <= 100) {
        vector<int> have;
        for (auto it : good) {
          have.pb(it);
        }
        for (auto it : have) {
          if (good.find(it) != good.end()) {
            check(it);
          }
        }
      }
      int lst = *good.rbegin();
      dp[i] = min(dp[i], dp[lst] + w * cnt + get_sum(lst + 1, i - 1) + w * get_sum(1, 1, m, lst + 1, i - 1)); 
    }
    good.insert(i);
    if (SZ(good) > 1) {
      need.pb(*(----good.end()));
    }
  }
  int ans = dp[m];
  if (can[0] < BINF) {
    int sum = 0, cl = can[0];
    for (int lst = m - 1; lst >= 0; lst--) {
      sum += w * cl + cost[srt[lst].S];
      cl = min(cl, can[lst + 1]);
      ans = min(ans, sum + dp[lst]);
    }
  }
  cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 10 ms 640 KB Output is correct
39 Correct 17 ms 768 KB Output is correct
40 Correct 10 ms 640 KB Output is correct
41 Correct 9 ms 768 KB Output is correct
42 Correct 9 ms 768 KB Output is correct
43 Correct 10 ms 640 KB Output is correct
44 Correct 10 ms 640 KB Output is correct
45 Correct 9 ms 768 KB Output is correct
46 Correct 10 ms 768 KB Output is correct
47 Correct 11 ms 768 KB Output is correct
48 Correct 14 ms 640 KB Output is correct
49 Correct 7 ms 640 KB Output is correct
50 Correct 7 ms 768 KB Output is correct
51 Correct 7 ms 640 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 6 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 10 ms 640 KB Output is correct
39 Correct 17 ms 768 KB Output is correct
40 Correct 10 ms 640 KB Output is correct
41 Correct 9 ms 768 KB Output is correct
42 Correct 9 ms 768 KB Output is correct
43 Correct 10 ms 640 KB Output is correct
44 Correct 10 ms 640 KB Output is correct
45 Correct 9 ms 768 KB Output is correct
46 Correct 10 ms 768 KB Output is correct
47 Correct 11 ms 768 KB Output is correct
48 Correct 14 ms 640 KB Output is correct
49 Correct 7 ms 640 KB Output is correct
50 Correct 7 ms 768 KB Output is correct
51 Correct 7 ms 640 KB Output is correct
52 Correct 421 ms 30948 KB Output is correct
53 Correct 477 ms 31076 KB Output is correct
54 Correct 414 ms 34276 KB Output is correct
55 Correct 462 ms 37732 KB Output is correct
56 Correct 452 ms 39792 KB Output is correct
57 Correct 389 ms 32996 KB Output is correct
58 Correct 386 ms 46440 KB Output is correct
59 Correct 435 ms 40676 KB Output is correct
60 Correct 471 ms 39224 KB Output is correct
61 Correct 441 ms 40600 KB Output is correct
62 Correct 422 ms 39140 KB Output is correct
63 Correct 456 ms 38184 KB Output is correct
64 Correct 172 ms 50780 KB Output is correct
65 Correct 743 ms 37288 KB Output is correct
66 Correct 609 ms 46136 KB Output is correct
67 Correct 1397 ms 36884 KB Output is correct
68 Correct 737 ms 36768 KB Output is correct
69 Correct 432 ms 36452 KB Output is correct
70 Correct 451 ms 36604 KB Output is correct
71 Correct 445 ms 36452 KB Output is correct
72 Correct 892 ms 36648 KB Output is correct
73 Correct 666 ms 36532 KB Output is correct
74 Correct 544 ms 37860 KB Output is correct
75 Correct 547 ms 43264 KB Output is correct
76 Correct 517 ms 46052 KB Output is correct
77 Correct 417 ms 40036 KB Output is correct
78 Correct 482 ms 44772 KB Output is correct
79 Correct 440 ms 36088 KB Output is correct
80 Correct 408 ms 36064 KB Output is correct