Submission #419333

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
419333	2021-06-07T00:02:54 Z	gmyu	Safety (NOI18_safety)	C++14	100 / 100	61 ms	5432 KB

safety

/*
ID: USACO_template
LANG: C++
PROG: https://oj.uz/problem/view/NOI18_safety
*/
#include <iostream>  //cin , cout
#include <fstream>   //fin, fout
#include <stdio.h>   // scanf , pringf
#include <cstdio>
#include <algorithm> // sort , stuff
#include <stack>     // stacks
#include <queue>     // queues
#include <map>
#include <string>
#include <string.h>
#include <set>

using namespace std;

typedef pair<int, int>          pii;
typedef vector<int>             vi;     /// adjlist without weight
typedef vector<pii>             vii;    /// adjlist with weight
typedef vector<pair<int,pii>>   vpip;   /// edge with weight
typedef long long               ll;

#define mp  make_pair
#define ff  first
#define ss  second
#define pb  push_back
#define sz(x)   (int)(x).size()

const int MOD = 1e9+7;  // 998244353;
const int MX  = 2e5+5;   //
const ll  INF = 1e18;    //

#define MAXV 300007
#define MAXE 100007

bool debug;

int N;
ll H;

/// left and right side queue for the strictly increase/decrease array, with range of H.
priority_queue<ll> lq;
priority_queue<ll, vector<ll>, greater<ll>> rq;

int main() {
    debug = false;
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N >> H;

    ll ans = 0LL;
    for(int i=0;i<N;i++) {
        ll a; cin >> a;

        if(i==0) {
            lq.push(a); rq.push(a);
            continue;
        }

        ll range = (ll)i * (ll)H;
        if(a + range < lq.top()) {
            lq.push(a + range);             /// max coverage
            ans += lq.top() - (a + range);  /// touch historical set by H
            lq.push(a + range);             /// compensate
            rq.push(lq.top() - range * 2LL);     /// also a possible option for right side
            lq.pop();
        } else if ( a - range > rq.top()) {
            rq.push(a - range);
            ans += (a - range) - rq.top();
            rq.push(a - range);
            lq.push(rq.top() + range *2LL);
            rq.pop();
        } else {
            lq.push(a + range);
            rq.push(a - range);
        }

    }

    cout << ans << endl;

    if(debug) cout << endl << "EOL" << endl;

}

/**
6 1
2 10 0 2 4 3

6 3
2 10 2 6 4 3

*/

Subtask #1
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct

Subtask #2
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct

Subtask #4
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	39 ms	4732 KB	Output is correct
2	Correct	53 ms	5140 KB	Output is correct
3	Correct	56 ms	5268 KB	Output is correct

Subtask #5
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct

Subtask #6
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct

Subtask #7
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	2 ms	460 KB	Output is correct
29	Correct	2 ms	460 KB	Output is correct
30	Correct	2 ms	460 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	460 KB	Output is correct
33	Correct	1 ms	448 KB	Output is correct
34	Correct	1 ms	460 KB	Output is correct

Subtask #8
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	312 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	2 ms	460 KB	Output is correct
35	Correct	2 ms	460 KB	Output is correct
36	Correct	2 ms	460 KB	Output is correct
37	Correct	1 ms	332 KB	Output is correct
38	Correct	1 ms	460 KB	Output is correct
39	Correct	1 ms	448 KB	Output is correct
40	Correct	1 ms	460 KB	Output is correct
41	Correct	2 ms	460 KB	Output is correct
42	Correct	2 ms	332 KB	Output is correct
43	Correct	2 ms	436 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	1 ms	456 KB	Output is correct
46	Correct	2 ms	460 KB	Output is correct

Subtask #9
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	316 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	39 ms	4732 KB	Output is correct
20	Correct	53 ms	5140 KB	Output is correct
21	Correct	56 ms	5268 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	312 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	204 KB	Output is correct
33	Correct	1 ms	204 KB	Output is correct
34	Correct	1 ms	204 KB	Output is correct
35	Correct	1 ms	204 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	2 ms	460 KB	Output is correct
38	Correct	2 ms	460 KB	Output is correct
39	Correct	2 ms	460 KB	Output is correct
40	Correct	1 ms	332 KB	Output is correct
41	Correct	1 ms	460 KB	Output is correct
42	Correct	1 ms	448 KB	Output is correct
43	Correct	1 ms	460 KB	Output is correct
44	Correct	2 ms	460 KB	Output is correct
45	Correct	2 ms	332 KB	Output is correct
46	Correct	2 ms	436 KB	Output is correct
47	Correct	2 ms	460 KB	Output is correct
48	Correct	1 ms	456 KB	Output is correct
49	Correct	2 ms	460 KB	Output is correct
50	Correct	61 ms	5432 KB	Output is correct
51	Correct	48 ms	5024 KB	Output is correct
52	Correct	38 ms	5108 KB	Output is correct
53	Correct	39 ms	5216 KB	Output is correct
54	Correct	57 ms	5120 KB	Output is correct
55	Correct	35 ms	5056 KB	Output is correct
56	Correct	38 ms	5124 KB	Output is correct
57	Correct	34 ms	5040 KB	Output is correct
58	Correct	35 ms	4424 KB	Output is correct
59	Correct	42 ms	5120 KB	Output is correct

Submission #419333

Compilation message