#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
const double PI = 4 * atan(1);
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>
#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void io(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
fast_io();
}
const int MAX = 3005;
vector<double> s;
int n, m, k;
double a, b, c;
double t;
int best[MAX][MAX];
double zero = 0;
///int interval bewtwen s_id and s_{id+1} using use stations
int func(double l, double r, double last){
double time = t - l*b;
int sub = floor((time - (last - l)*c)/a) + last;
if(sub >= r){
return max(r -l - 1, zero);
}
else return max(sub -l, zero);
}
int get(int id, int use){
double l = s[id];
double r = s[id+1];
double time = t - l*b;
if(time<0) return 0;
vector<double> loc;
loc.eb(l);
while(true){
best[id][sz(loc) - 1] = func(l, r, loc[sz(loc) - 1]);
if(sz(loc) == use + 1) break;
double past = loc[sz(loc) - 1];
double used = (past - l)*c;
double nxt = past + floor((time - used)/a+1);
if(nxt == past) break;
if(nxt >= r) return (r-l)-1;
else loc.eb(nxt);
}
double last = loc[sz(loc) - 1];
int sub = floor((time - (last - l)*c)/a) + last;
if(sub >= r){
return max(r -l - 1, zero);
}
else return max(sub -l, zero);
// return max(min(r, floor((time - (last - l)/c)/a) + last) - l, zero);
}
int dp[MAX][MAX];
int v[MAX];
int main(){
fast_io();
cin >> n >> m >> k;
k -= m;
cin >> a >> b >> c;
cin >> t;
f0r(i, m){
int si;
cin >> si;
si--;
s.eb(si);
}
sort(all(s));
f0r(i, m-1){
get(i, k);
}
int ans = 0;
f0r(i, m){
if(s[i]*b <= t) ans++;
}
set<pii> s;
f0r(i, m-1){
ans += best[i][0];
s.insert(mp(best[i][1] - best[i][0], i));
}
int use = 0;
while(true){
if(use == k) break;
auto x = *s.rbegin();
if(x.f == 0) break;
use += 1;
ans += x.f;
int id = x.s;
s.erase(*s.rbegin());
v[id]++;
s.insert(mp(best[id][v[id]+1] - best[id][v[id]], id));
}
cout << ans-1 << endl;
return 0;
}
Compilation message
semiexpress.cpp:1:0: warning: ignoring #pragma comment [-Wunknown-pragmas]
#pragma comment(linker, "/stack:200000000")
semiexpress.cpp: In function 'void io(std::__cxx11::string)':
semiexpress.cpp:54:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen(FIN, "r", stdin);
~~~~~~~^~~~~~~~~~~~~~~~~
semiexpress.cpp:55:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen(FOUT, "w", stdout);
~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
