#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
#define int long long
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e5 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);
//ifstream in(".in");
//ofstream out(".out");
int n, k, m, a, b, c, t, v[N], w[N];
void solve(){
cin >> n >> m >> k >> a >> b >> c >> t;
k -= m;
for(int i = 1; i <= m; i++){
cin >> v[i];
}
for(int i = 1; i <= m; i++){
int timp = b*(v[i] - 1);
if(timp > t){
w[i] = -1; //cant reach
continue;
}
if(i != m)w[i] = min((t - timp) / a, v[i + 1] - v[i] - 1); //number of position we can reach starting from v[i]
}
while(k--){
int pos = 0, mx = 0;
for(int i = 1; i <= m; i++){
if(w[i] == -1 || v[i + 1] - v[i] - 1 == w[i])continue; //no need to add semiexpress
int timp = b*(v[i] - 1) + c*(w[i] + 1);
if(timp > t)continue;
int more = min((t - timp) / a + 1, v[i + 1] - (v[i] + w[i] + 1));
if(more > mx){
mx = more;
pos = i;
}
}
w[pos] += mx;
}
int ans = 0;
for(int i = 1; i <= m; i++){
ans += (w[i] + 1);
//cout << w[i] + 1 << ' ';
}//cout << '\n';
cout << ans - 1 << '\n';
}
Compilation message
/usr/lib/gcc/x86_64-linux-gnu/9/../../../x86_64-linux-gnu/crt1.o: In function `_start':
(.text+0x20): undefined reference to `main'
collect2: error: ld returned 1 exit status
