oj.uz

Submission #60375

# Submission time Handle Problem Language Result Execution time Memory
60375 2018-07-24T03:24:37 Z Benq Semiexpress (JOI17_semiexpress) C++11
100 / 100
 4 ms 1056 KB 
#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;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,m,k,A,B,C;
ll s[3001];
ll t, ans;
priority_queue<array<int,3>> p;

int calc(int a, int b) {
    ll dis = (s[b-1]-1)*B;
    dis += (a-s[b-1])*C;
    dis = t-dis;
    if (dis < 0) return a-1;
    return min(a+dis/A,(ll)s[b]-1);
}

void tri(int a, int b) {
    if (a == b) return;
    // cout << "ZZ " << a << " " << b << " " << calc(a,b)-a+1 << "\n";
    p.push({calc(a,b)-a+1,a,b});
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> k >> A >> B >> C >> t;
    
    ans --;;
    F0R(i,m) {
        cin >> s[i];
        // cout << s[i] << "\n";
        if (i) {
            ll S = calc(s[i-1],i); // last one ok
            // cout << "AH " << s[i-1] << " " << S << "\n";
            ans += S+1-s[i-1];
            tri(S+1,i);
        }
    }
    if (B*(s[m-1]-1) <= t) ans ++;
    
    //cout << k-m << " " << ans << "\n";
    F0R(i,k-m) {
        if (sz(p) == 0) break;
        auto a = p.top(); p.pop();
        //cout << "OOH " << a[0] << " " << a[1] << " " << a[2] << "\n";
        ans += a[0];
        tri(a[0]+a[1],a[2]);
    }
    cout << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 656 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 656 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Correct 2 ms 776 KB Output is correct
12 Correct 3 ms 776 KB Output is correct
13 Correct 4 ms 776 KB Output is correct
14 Correct 3 ms 776 KB Output is correct
15 Correct 3 ms 776 KB Output is correct
16 Correct 3 ms 776 KB Output is correct
17 Correct 3 ms 784 KB Output is correct
18 Correct 3 ms 784 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 3 ms 592 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 656 KB Output is correct
9 Correct 3 ms 776 KB Output is correct
10 Correct 3 ms 776 KB Output is correct
11 Correct 2 ms 776 KB Output is correct
12 Correct 3 ms 776 KB Output is correct
13 Correct 4 ms 776 KB Output is correct
14 Correct 3 ms 776 KB Output is correct
15 Correct 3 ms 776 KB Output is correct
16 Correct 3 ms 776 KB Output is correct
17 Correct 3 ms 784 KB Output is correct
18 Correct 3 ms 784 KB Output is correct
19 Correct 4 ms 788 KB Output is correct
20 Correct 2 ms 804 KB Output is correct
21 Correct 3 ms 836 KB Output is correct
22 Correct 4 ms 892 KB Output is correct
23 Correct 3 ms 1056 KB Output is correct
24 Correct 3 ms 1056 KB Output is correct
25 Correct 4 ms 1056 KB Output is correct
26 Correct 4 ms 1056 KB Output is correct
27 Correct 3 ms 1056 KB Output is correct
28 Correct 4 ms 1056 KB Output is correct
29 Correct 4 ms 1056 KB Output is correct
30 Correct 3 ms 1056 KB Output is correct