//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("unroll-all-loops")
#include <bits/stdc++.h>
//#define TASK "lca"
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define int long long
#define pii pair<int, int>
typedef long long ll;
//typedef long double ld;
using namespace std;
const int INF = 1e18;
const int MAXN = 1e8;
const int MOD = 1e9 + 7;
const double EPS = 1e-12;
const vector<int> dx = {1, 0, -1, 0, 0, 1, 0, -1};
//char buf[(int)1e9];
//size_t p_ = 0;
//
//inline void *operator new(size_t n_) {
// p_ += n_;
// return buf + p_ - n_;
//}
//inline void operator delete(void*) {};
ll power(ll x, ll n, ll mod = 1e9 + 7) {
if (n == 0) return 1ll;
if (n & 1ll) return power(x, n - 1ll, mod) * x % mod;
ll tmp = power(x, n >> 1ll, mod);
return (tmp * tmp) % mod;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd (b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
set<int> semiexpress;
int A, B, C, T;
int n, m, k;
int calc(vector<int> s) {
int ans = 0;
int last = 0;
int base_time = 0;
for (int i = 0; i < s.size(); i++) {
if (i != 0 && semiexpress.count(s[i])) {
base_time = (last - 1) * B + (s[i] - last) * C;
} else {
last = s[i];
base_time = (s[i] - 1) * B;
}
if (base_time < T) ans++;
int cnt = max(0ll, ((T - base_time - 1) / A));
if (s[i] + cnt > n || (s[i] + cnt >= s[i + 1] && i + 1 < s.size())) {
if (s[i] + cnt > n) cnt = n - s[i];
if (i + 1 < s.size() && s[i] + cnt >= s[i + 1]) {
cnt = s[i + 1] - s[i] - 1;
}
}
ans += cnt;
}
return ans;
}
signed main() {
#ifndef LOCAL
#ifdef TASK
freopen(TASK".in", "r", stdin);
freopen(TASK".out", "w", stdout);
#endif
#endif
#ifdef LOCAL
//freopen("/Users/alekseygolub/Desktop/с++/ABS/ABS/input.txt", "r", stdin);
#endif
iostream::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
srand(924653523);
// == SOLUTION == //
cin >> n >> m >> k;
cin >> A >> B >> C >> T;
T++;
vector<int> s(m);
for (auto &in: s) cin >> in;
set<pii, greater<pii>> active;
for (int i = 0; i < m - 1; i++) {
//if (active.size() >= 2 * k) break;
int base_time = (s[i] - 1) * B;
int r = s[i] + ((T - base_time - 1) / A);
int add = r + 1;
while (r + 1 < s[i + 1] && base_time < T && active.size() < 2 * (k - m)) {
base_time = base_time + (add - s[i]) * C;
//if (base_time >= T) break;
int cnt = max(0ll, ((T - base_time - 1) / A));
assert(add != s[i] && add != s[i + 1]);
active.insert({cnt, add});
r = add + cnt;
add = r + 1;
}
}
k -= m;
for (auto in: active) {
if (k <= 0) break;
s.pb(in.S);
semiexpress.insert(in.S);
k--;
}
sort(all(s));
cout << calc(s) - 1 << "\n";
cerr << "OK\n";
}
Compilation message
semiexpress.cpp: In function 'long long int calc(std::vector<long long int>)':
semiexpress.cpp:64:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < s.size(); i++) {
~~^~~~~~~~~~
semiexpress.cpp:73:64: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (s[i] + cnt > n || (s[i] + cnt >= s[i + 1] && i + 1 < s.size())) {
~~~~~~^~~~~~~~~~
semiexpress.cpp:75:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (i + 1 < s.size() && s[i] + cnt >= s[i + 1]) {
~~~~~~^~~~~~~~~~
semiexpress.cpp: In function 'int main()':
semiexpress.cpp:111:67: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (r + 1 < s[i + 1] && base_time < T && active.size() < 2 * (k - m)) {
~~~~~~~~~~~~~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
