oj.uz

Submission #217876

# Submission time Handle Problem Language Result Execution time Memory
217876 2020-03-31T07:12:04 Z extraterrestrial Long Distance Coach (JOI17_coach) C++14
71 / 100
 2000 ms 21488 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] = 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 get_sum(2 * v, l, mid, a, b) + get_sum(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];
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	int x, n, m, w, 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);
  build(1, 1, m);
  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 (int lst = i - 2; lst >= 0; lst--) {
        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));
      }
    }
  }
  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

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 384 KB Output is correct
5 Correct 4 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 5 ms 384 KB Output is correct
9 Correct 5 ms 416 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 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 4 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 384 KB Output is correct
5 Correct 4 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 5 ms 384 KB Output is correct
9 Correct 5 ms 416 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 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 4 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 5 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 5 ms 384 KB Output is correct
33 Correct 5 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

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 384 KB Output is correct
5 Correct 4 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 5 ms 384 KB Output is correct
9 Correct 5 ms 416 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 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 4 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 5 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 5 ms 384 KB Output is correct
33 Correct 5 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 141 ms 640 KB Output is correct
39 Correct 268 ms 760 KB Output is correct
40 Correct 258 ms 640 KB Output is correct
41 Correct 142 ms 640 KB Output is correct
42 Correct 135 ms 640 KB Output is correct
43 Correct 138 ms 888 KB Output is correct
44 Correct 145 ms 640 KB Output is correct
45 Correct 134 ms 640 KB Output is correct
46 Correct 266 ms 760 KB Output is correct
47 Correct 270 ms 684 KB Output is correct
48 Correct 133 ms 640 KB Output is correct
49 Correct 137 ms 760 KB Output is correct
50 Correct 142 ms 640 KB Output is correct
51 Correct 139 ms 676 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 5 ms 384 KB Output is correct
5 Correct 4 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 5 ms 384 KB Output is correct
9 Correct 5 ms 416 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 4 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 4 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 5 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 5 ms 384 KB Output is correct
33 Correct 5 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 141 ms 640 KB Output is correct
39 Correct 268 ms 760 KB Output is correct
40 Correct 258 ms 640 KB Output is correct
41 Correct 142 ms 640 KB Output is correct
42 Correct 135 ms 640 KB Output is correct
43 Correct 138 ms 888 KB Output is correct
44 Correct 145 ms 640 KB Output is correct
45 Correct 134 ms 640 KB Output is correct
46 Correct 266 ms 760 KB Output is correct
47 Correct 270 ms 684 KB Output is correct
48 Correct 133 ms 640 KB Output is correct
49 Correct 137 ms 760 KB Output is correct
50 Correct 142 ms 640 KB Output is correct
51 Correct 139 ms 676 KB Output is correct
52 Execution timed out 2085 ms 21488 KB Time limit exceeded
53 Halted 0 ms 0 KB -