oj.uz

Submission #110181

# Submission time Handle Problem Language Result Execution time Memory
110181 2019-05-09T20:20:23 Z WLZ Semiexpress (JOI17_semiexpress) C++17
18 / 100
 4 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n;
  int m, k;
  cin >> n >> m >> k;
  long long a, b, c;
  cin >> a >> b >> c;
  long long t;
  cin >> t;
  vector<long long> s(m);
  for (int i = 0; i < m; i++) {
    cin >> s[i];
  }
  long long ans = 0;
  if ((n - 1) * b <= t) {
    ans++;
  }
  priority_queue<long long> pq;
  for (int i = 0; i < m - 1; i++) {
    long long need = (s[i] - 1) * b;
    if (need > t) {
      break;
    } 
    long long q = (t - need) / a;
    long long to = min(s[i] + q, s[i + 1] - 1);
    ans += to - s[i] + 1;
    to++;
    for (int j = 0; j < k && to < s[i + 1]; j++) {
      if (need + (to - s[i]) * c > t) {
        break;
      }
      q = (t - need - (to - s[i]) * c) / a;
      to = min(s[i + 1], to + q + 1);
      pq.push(q + 1);
    }
  }
  for (int i = 0; i < k - m && !pq.empty(); i++) {
    ans += pq.top();
    pq.pop();
  }
  ans--;
  cout << ans << '\n';
  return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Incorrect 2 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Incorrect 2 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -