# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1143833 | SmuggingSpun | Semiexpress (JOI17_semiexpress) | C++20 | 31 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
const ll INF = 1e18;
template<class T>void maximize(T& a, T b){
if(a < b){
a = b;
}
}
int n, m, k, A, B, C;
ll T;
namespace sub1{
void solve(){
vector<bool>express(n + 1, false);
for(int _ = 0; _ < m; _++){
int x;
cin >> x;
express[x] = true;
}
int ans = 0;
for(int i = 1; i < n; i++){
for(int j = n; j > i; j--){
if(!express[i] && !express[j]){
int cnt = 0;
for(int k = 2, pre = 1; k <= n; k++){
if(express[k]){
pre = k;
}
ll sum = 1LL * (pre - 1) * B + min(1LL * (k - pre) * A, min(i >= pre && i <= k ? 1LL * (i - pre) * C + 1LL * (k - i) * A : INF, j >= pre && j <= k ? 1LL * (j - pre) * C + 1LL * (k - j) * A : INF));
if(sum <= T){
cnt++;
}
}
maximize(ans, cnt);
}
}
}
cout << ans;
}
}
namespace sub23{
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> m >> k >> A >> B >> C >> T;
if(n <= 300 && k - m == 2){
sub1::solve();
}
else{
sub23::solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |