oj.uz

답안 #651815

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651815 2022-10-20T07:21:08 Z lunchbox Semiexpress (JOI17_semiexpress) C++17
0 / 100
 1 ms 320 KB 
/*
 author: lunchbox
 problem link: https://oj.uz/problem/view/JOI17_semiexpress
*/
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

int main() {
 ios::sync_with_stdio(0), cin.tie(0);
 int n, m, k; cin >> n >> m >> k;
 LL a, b, c; cin >> a >> b >> c;
 long long t; cin >> t;
 vector<LL> s(m), p(m - 1); for (LL& x : s) cin >> x;
 priority_queue<pair<LL, int>> pq;
 LL ans = 0;
 for (int i = 0; i < m - 1; i++) {
  if (b * (s[i] - 1) > t) continue;
  LL u = min(s[i + 1] - 1, s[i] + (t - b * (s[i] - 1)) / a);
  ans += u - s[i] + 1;
  p[i] = u + 1;
  if (p[i] < s[i + 1] && b * (s[i] - 1) + c * (p[i] - s[i] - 1) + a <= t) {
   LL v = min(s[i + 1] - 1, p[i] + (t - b * (s[i] - 1) - c * (p[i] - s[i])) / a);
   pq.push({v - p[i] + 1, i});
  }
 }
 for (int it = 0; it < k - m; it++) {
  if (pq.empty()) break;
  auto [v, i] = pq.top(); pq.pop();
  ans += v, p[i] += v;
  if (p[i] < s[i + 1] && b * (s[i] - 1) + c * (p[i] - s[i] - 1) + a <= t) {
   LL v = min(s[i + 1] - 1, p[i] + (t - b * (s[i] - 1) - c * (p[i] - s[i])) / a);
   pq.push({v - p[i] + 1, i});
  }
 }
 cout << ans << '\n';
 return 0;
}

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -