oj.uz

Submission #173849

# Submission time Handle Problem Language Result Execution time Memory
173849 2020-01-05T14:25:32 Z arnold518 Safety (NOI18_safety) C++14
49 / 100
 72 ms 4624 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;

int N, K, A[MAXN+10];
ll lx, rx, y;
priority_queue<int, vector<int>, less<int>> l;
priority_queue<int, vector<int>, greater<int>> r;

int main()
{
    int i, j;

    scanf("%d%d", &N, &K);
    for(i=1; i<=N; i++) scanf("%d", &A[i]);

    lx=rx=y=0;
    l.push(A[1]); r.push(A[1]);
    for(i=2; i<=N; i++)
    {
        lx-=K; rx+=K;
        if(l.top()+lx<=A[i] && A[i]<=r.top()+rx)
        {
            l.push(A[i]-lx); r.push(A[i]-rx);
        }
        else if(A[i]<l.top()+lx)
        {
            y+=l.top()+lx-A[i];
            r.push(l.top()+lx-rx);
            l.pop();
            l.push(A[i]-lx);
            l.push(A[i]-lx);
        }
        else
        {
            y+=A[i]-r.top()-rx;
            l.push(r.top()+rx-lx);
            r.pop();
            r.push(A[i]-rx);
            r.push(A[i]-rx);
        }
/*
        vector<ll> VL, VR;
        while(!l.empty()) VL.push_back(l.top()), l.pop();
        for(auto it : VL) l.push(it);

        while(!r.empty()) VR.push_back(r.top()), r.pop();
        for(auto it : VR) r.push(it);

        for(i=0; i<VL.size(); i++) VL[i]+=lx;
        for(i=0; i<VR.size(); i++) VR[i]+=rx;

        printf("VL : "); for(auto it : VL) printf("%lld ", it); printf("\n");
        printf("VR : "); for(auto it : VR) printf("%lld ", it); printf("\n");
        printf("Y : %lld\n", y);
        */
    }
    printf("%lld", y);
}

Compilation message

safety.cpp: In function 'int main()':
safety.cpp:17:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
safety.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &K);
     ~~~~~^~~~~~~~~~~~~~~~
safety.cpp:20:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%d", &A[i]);
                         ~~~~~^~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 3828 KB Output is correct
2 Correct 69 ms 4568 KB Output is correct
3 Correct 72 ms 4624 KB Output is correct

Subtask #5
6.0 / 6.0

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

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 396 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 396 KB Output is correct
17 Correct 2 ms 396 KB Output is correct
18 Correct 0 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 2 ms 400 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 396 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 396 KB Output is correct
17 Correct 2 ms 396 KB Output is correct
18 Correct 0 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 380 KB Output is correct
25 Correct 2 ms 400 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 476 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 380 KB Output is correct
33 Correct 3 ms 476 KB Output is correct
34 Correct 3 ms 476 KB Output is correct

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 428 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 396 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 396 KB Output is correct
23 Correct 2 ms 396 KB Output is correct
24 Correct 0 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 380 KB Output is correct
31 Correct 2 ms 400 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 476 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 3 ms 380 KB Output is correct
39 Correct 3 ms 476 KB Output is correct
40 Correct 3 ms 476 KB Output is correct
41 Correct 4 ms 504 KB Output is correct
42 Correct 3 ms 348 KB Output is correct
43 Incorrect 3 ms 452 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 428 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 49 ms 3828 KB Output is correct
20 Correct 69 ms 4568 KB Output is correct
21 Correct 72 ms 4624 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 396 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 396 KB Output is correct
26 Correct 2 ms 396 KB Output is correct
27 Correct 0 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 380 KB Output is correct
34 Correct 2 ms 400 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 3 ms 476 KB Output is correct
39 Correct 3 ms 376 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 3 ms 380 KB Output is correct
42 Correct 3 ms 476 KB Output is correct
43 Correct 3 ms 476 KB Output is correct
44 Correct 4 ms 504 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Incorrect 3 ms 452 KB Output isn't correct
47 Halted 0 ms 0 KB -