oj.uz

Submission #887341

# Submission time Handle Problem Language Result Execution time Memory
887341 2023-12-14T09:24:54 Z hafo Semiexpress (JOI17_semiexpress) C++14
18 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, m, k, a, b, c, s[maxn];
ll t;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n>>m>>k>>a>>b>>c>>t;
    for(int i = 1; i <= m; i++) cin>>s[i];

    k -= m;
    int ans = 0;
    vector<int> val;
    for(int i = 1; i <= m; i++) {
        ll time = 1LL * (s[i] - 1) * b; 
        if(time <= t && i != 1) ans++;

        if(time > t || i == m) break;
        
        ll cnt = 0;
        cnt += (t - time) / a;
        ll last = s[i] + cnt + 1;
        while(k > 0 && last < s[i + 1]) {
            time = 1LL * (s[i] - 1) * b + 1LL * c * (last - s[i]);
            if(time > t) break;
            last = last + (t - time) / a + 1;
            if(last > s[i + 1]) {
                last -= (t - time) / a + 1;
                val.pb(min(s[i + 1] - last, (t - time) / a + 1));
                break;
            }
            cnt += (t - time) / a + 1;
            k--;
        }

        mini(cnt, s[i + 1] - s[i] - 1);
        ans += cnt;
    }

    sort(all(val), greater<int> ());
    for(int i = 0; i < min(k, Size(val)); i++) ans += val[i];
    cout<<ans;
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 0 ms 604 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 0 ms 604 KB Output isn't correct
15 Halted 0 ms 0 KB -