oj.uz

Submission #69460

# Submission time Handle Problem Language Result Execution time Memory
69460 2018-08-21T01:14:35 Z Benq Long Distance Coach (JOI17_coach) C++14
71 / 100
 2000 ms 15112 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
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 = 4e18;
const int MX = 200001;

ll X,N,M,W,T,dp[MX];
vl S;
vpl D;

void mn(ll& a, ll b) { a = min(a,b); }

int getLst(ll x) {
    return lb(all(D),mp(x%T,0LL))-D.begin()-1;
}

ll cost[MX];

void genCost (int a) {
    F0Rd(i,sz(S)) if (getLst(S[i]) == a) 
        FOR(j,getLst(S[i])+1,M+1) mn(cost[j],S[i]/T*W);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> X >> N >> M >> W >> T; 
    S.resize(N+1); F0R(i,N) cin >> S[i];
    S[N] = X;
    D.resize(M+1); F0R(i,M) cin >> D[i].f >> D[i].s;
    D[M] = {T,0};
    
    sort(all(D));
    
    F0R(i,M+1) dp[i] = cost[i] = INF;
    dp[M] = (X/T+1)*W;
    F0Rd(i,M) {
        genCost(i);
        FOR(j,i+1,M+1) {
            mn(dp[i],dp[j]); 
            dp[j] += D[i].s+cost[j]; mn(dp[j],INF);
        }
        dp[i] += ((X-D[i].f)/T+1)*W;
        /*F0R(j,M+1) cout << cost[j] << " ";
        cout << "\n";
        F0R(j,M+1) cout << dp[j] << " ";
        cout << "\n\n";*/
    }
    ll ans = INF; F0R(i,M+1) mn(ans,dp[i]);
    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
* if you have no idea just guess the appropriate well-known algo instead of doing nothing :/
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 660 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 3 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 3 ms 684 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 836 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 2 ms 1016 KB Output is correct
19 Correct 3 ms 1016 KB Output is correct
20 Correct 3 ms 1016 KB Output is correct
21 Correct 3 ms 1016 KB Output is correct
22 Correct 2 ms 1016 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 616 KB Output is correct
3 Correct 3 ms 660 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 3 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 3 ms 684 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 836 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 2 ms 1016 KB Output is correct
19 Correct 3 ms 1016 KB Output is correct
20 Correct 3 ms 1016 KB Output is correct
21 Correct 3 ms 1016 KB Output is correct
22 Correct 2 ms 1016 KB Output is correct
23 Correct 4 ms 1016 KB Output is correct
24 Correct 3 ms 1016 KB Output is correct
25 Correct 3 ms 1016 KB Output is correct
26 Correct 2 ms 1016 KB Output is correct
27 Correct 3 ms 1016 KB Output is correct
28 Correct 3 ms 1040 KB Output is correct
29 Correct 3 ms 1040 KB Output is correct
30 Correct 2 ms 1040 KB Output is correct
31 Correct 3 ms 1040 KB Output is correct
32 Correct 3 ms 1040 KB Output is correct
33 Correct 3 ms 1040 KB Output is correct
34 Correct 2 ms 1040 KB Output is correct
35 Correct 3 ms 1040 KB Output is correct
36 Correct 3 ms 1040 KB Output is correct
37 Correct 3 ms 1040 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 660 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 3 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 3 ms 684 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 836 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 2 ms 1016 KB Output is correct
19 Correct 3 ms 1016 KB Output is correct
20 Correct 3 ms 1016 KB Output is correct
21 Correct 3 ms 1016 KB Output is correct
22 Correct 2 ms 1016 KB Output is correct
23 Correct 4 ms 1016 KB Output is correct
24 Correct 3 ms 1016 KB Output is correct
25 Correct 3 ms 1016 KB Output is correct
26 Correct 2 ms 1016 KB Output is correct
27 Correct 3 ms 1016 KB Output is correct
28 Correct 3 ms 1040 KB Output is correct
29 Correct 3 ms 1040 KB Output is correct
30 Correct 2 ms 1040 KB Output is correct
31 Correct 3 ms 1040 KB Output is correct
32 Correct 3 ms 1040 KB Output is correct
33 Correct 3 ms 1040 KB Output is correct
34 Correct 2 ms 1040 KB Output is correct
35 Correct 3 ms 1040 KB Output is correct
36 Correct 3 ms 1040 KB Output is correct
37 Correct 3 ms 1040 KB Output is correct
38 Correct 438 ms 1252 KB Output is correct
39 Correct 351 ms 1252 KB Output is correct
40 Correct 360 ms 1272 KB Output is correct
41 Correct 446 ms 1332 KB Output is correct
42 Correct 436 ms 1388 KB Output is correct
43 Correct 332 ms 1412 KB Output is correct
44 Correct 472 ms 1472 KB Output is correct
45 Correct 441 ms 1624 KB Output is correct
46 Correct 387 ms 1668 KB Output is correct
47 Correct 335 ms 1668 KB Output is correct
48 Correct 449 ms 1748 KB Output is correct
49 Correct 464 ms 1748 KB Output is correct
50 Correct 444 ms 1848 KB Output is correct
51 Correct 429 ms 1888 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 616 KB Output is correct
3 Correct 3 ms 660 KB Output is correct
4 Correct 3 ms 660 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 3 ms 672 KB Output is correct
7 Correct 2 ms 672 KB Output is correct
8 Correct 3 ms 684 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 2 ms 696 KB Output is correct
11 Correct 2 ms 700 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 3 ms 836 KB Output is correct
14 Correct 2 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 2 ms 888 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 2 ms 1016 KB Output is correct
19 Correct 3 ms 1016 KB Output is correct
20 Correct 3 ms 1016 KB Output is correct
21 Correct 3 ms 1016 KB Output is correct
22 Correct 2 ms 1016 KB Output is correct
23 Correct 4 ms 1016 KB Output is correct
24 Correct 3 ms 1016 KB Output is correct
25 Correct 3 ms 1016 KB Output is correct
26 Correct 2 ms 1016 KB Output is correct
27 Correct 3 ms 1016 KB Output is correct
28 Correct 3 ms 1040 KB Output is correct
29 Correct 3 ms 1040 KB Output is correct
30 Correct 2 ms 1040 KB Output is correct
31 Correct 3 ms 1040 KB Output is correct
32 Correct 3 ms 1040 KB Output is correct
33 Correct 3 ms 1040 KB Output is correct
34 Correct 2 ms 1040 KB Output is correct
35 Correct 3 ms 1040 KB Output is correct
36 Correct 3 ms 1040 KB Output is correct
37 Correct 3 ms 1040 KB Output is correct
38 Correct 438 ms 1252 KB Output is correct
39 Correct 351 ms 1252 KB Output is correct
40 Correct 360 ms 1272 KB Output is correct
41 Correct 446 ms 1332 KB Output is correct
42 Correct 436 ms 1388 KB Output is correct
43 Correct 332 ms 1412 KB Output is correct
44 Correct 472 ms 1472 KB Output is correct
45 Correct 441 ms 1624 KB Output is correct
46 Correct 387 ms 1668 KB Output is correct
47 Correct 335 ms 1668 KB Output is correct
48 Correct 449 ms 1748 KB Output is correct
49 Correct 464 ms 1748 KB Output is correct
50 Correct 444 ms 1848 KB Output is correct
51 Correct 429 ms 1888 KB Output is correct
52 Execution timed out 2054 ms 15112 KB Time limit exceeded
53 Halted 0 ms 0 KB -