Submission #245680

#	Time	Username	Problem	Language	Result	Execution time	Memory
245680		hollwo_pelw	Semiexpress (JOI17_semiexpress)	C++17	100 / 100	20 ms	4596 KiB

semiexpress

#include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
typedef long double ld;
// loop
//#define For(i, l, r, x)     for (int i = l; i < r; i+=x)
//#define ForE(i, l, r, x)    for (int i = l; i <= r; i+=x)
//#define Ford(i, r, l)       for (int i = r; i > l; i--)
//#define FordE(i, r, l)      for (int i = r; i >= l; i--)
//#define Fora(i, a)          for (auto i : a)
// I/O 
#define FAST_IO             std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//#define PrintV(a)           Fora(ii, a) cout << ii << ' '; cout << rl;
//#define PrintVl(a)          Fora(ii, a) cout << ii << rl;
//#define PrintA(a, l, r)     for (int ii = l; ii <= r; ii++) cout << a[ii] << ' '; cout << rl;
//#define PrintAl(a, l, r)    for (int ii = l; ii <= r; ii++) cout << a[ii] << rl;
//#define Ptest(x)            return cout << x, 0;
#define setpre(n)           fixed << setprecision(n)
// pair
#define F                   first
#define S                   second
#define pii                 pair<int, int>
#define pll                 pair<ll, ll>
#define pdd                 pair<ld, ld>
// vector & !!?(string)
#define eb                  emplace_back
#define pb                  push_back
#define all(a)              a.begin(), a.end()
#define rall(a)             a.rbegin(), a.rend()
#define sz(a)               (int) a.size()
//#define len(a)              a.length()
// geometry calc    
#define pi                  acos(-1.0)
#define g_sin(a)            sin(a*pi/180)
#define g_cos(a)            cos(a*pi/180)
#define g_tan(a)            tan(a*pi/180)
// set val
#define ms0(a)              memset(a,        0, sizeof(a));
#define ms1(a)              memset(a,        1, sizeof(a));
#define msn1(a)             memset(a,       -1, sizeof(a));
#define msinf(a)            memset(a, 0x3f3f3f, sizeof(a));
// constant
const int mod1 = 998244353, mod = 1e9+7;
const int MAXN = 100005, MAX_M = 200010;
// code
#define int long long
int N, M, K, a, b, c, T, stat[3030], ans;
vector<int> res;
void Solve(){
	cin >> N >> M >> K >> a >> b >> c >> T;
	for(int i = 0; i < M; i++) 
	    cin >> stat[i];
	K -= M;
	stat[M] = N+1;
	for(int i = 0; i < M; i++){
		int tml = T - (stat[i] - 1) * b;
		int len = stat[i+1] - stat[i];
		if(tml < 0) break;
		// number of station can reach from this :v
		int mx = min(len, tml/a+1);
		ans += mx;
		len -= mx; tml -= c*mx;
		
		int temp = K;
		while(temp-- && len && tml >= 0){
		    // number of station can reach from this :v
			int mx = min(len, tml/a+1);
			res.push_back(mx);
			len -= mx; tml -= c*mx;
		}
	}
	sort(rall(res));
	for(int i = 0; i < min(K, sz(res)); i++)
	    ans += res[i];
	
	cout << ans-1;
}

signed main(){
    FAST_IO;
    int TC = 1; 
	//cin >> TC;
    while(TC--) Solve();
    return 0;
}

• Subtask 1: 18 / 18
• Subtask 2: 30 / 30
• Subtask 3: 52 / 52