oj.uz

Submission #867798

# Submission time Handle Problem Language Result Execution time Memory
867798 2023-10-29T13:27:58 Z sleepntsheep Pilot (NOI19_pilot) C++17
100 / 100
 819 ms 52292 KB 
#include <iostream>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using ll = long long;
#define N 1000005

int n, q;
array<int, 2> a[N], b[N];
set<int> s;
ll z, c[N], fw[N];
inline ll C2(ll x) { return x*(x+1)/2; }

int upd(int p) { for (;p<N;p+=p&-p) ++fw[p]; return p; }
int qry(int p) { int z=0; for (;p;p-=p&-p)z+=fw[p];return z; }
int search(int k)
{
    int p = 0, s = 0;
    for (int j=21;j--;) if (p+(1<<j)<N && s+fw[p+(1<<j)]<=k) s += fw[p+=1<<j];
    return p+1;
}

int main()
{
    ShinLena;
    cin >> n >> q;
    for (int i = 0; i < n; ++i) cin >> a[i][0], a[i][1] = i + 2;
    for (int i = 0; i < q; ++i) cin >> b[i][0], b[i][1] = i;
    upd(1); upd(n+2);
    sort(a, a+n);
    sort(b, b+q);
    z = C2(n);
    for (int i = q, j = n - 1; i--;)
    {
        for (; j >= 0 && a[j][0] > b[i][0]; --j)
        {
            int cn = qry(a[j][1]), r = search(cn), l = search(cn-1);
            ll w = (r-l-1), wl=a[j][1]-l-1, wr =r-a[j][1]-1;
            z += -C2(w) + C2(wl) + C2(wr);
            upd(a[j][1]);
        }
        c[b[i][1]] = z;
    }
    for (int i = 0; i < q; ++i) cout << c[i] << '\n';


    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10584 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10584 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 10588 KB Output is correct
2 Correct 15 ms 10588 KB Output is correct
3 Correct 14 ms 10588 KB Output is correct
4 Correct 15 ms 10588 KB Output is correct
5 Correct 14 ms 10748 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 13904 KB Output is correct
2 Correct 43 ms 13904 KB Output is correct
3 Correct 39 ms 13904 KB Output is correct
4 Correct 40 ms 13908 KB Output is correct
5 Correct 38 ms 13904 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 13804 KB Output is correct
2 Correct 39 ms 13792 KB Output is correct
3 Correct 40 ms 14160 KB Output is correct
4 Correct 39 ms 13648 KB Output is correct
5 Correct 43 ms 13924 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10584 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 15 ms 10588 KB Output is correct
12 Correct 15 ms 10588 KB Output is correct
13 Correct 14 ms 10588 KB Output is correct
14 Correct 15 ms 10588 KB Output is correct
15 Correct 14 ms 10748 KB Output is correct
16 Correct 22 ms 10840 KB Output is correct
17 Correct 33 ms 11092 KB Output is correct
18 Correct 41 ms 10844 KB Output is correct
19 Correct 38 ms 10836 KB Output is correct
20 Correct 30 ms 10640 KB Output is correct
21 Correct 14 ms 10588 KB Output is correct
22 Correct 25 ms 10744 KB Output is correct
23 Correct 38 ms 10836 KB Output is correct
24 Correct 35 ms 11148 KB Output is correct
25 Correct 29 ms 11096 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10584 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 15 ms 10588 KB Output is correct
27 Correct 15 ms 10588 KB Output is correct
28 Correct 14 ms 10588 KB Output is correct
29 Correct 15 ms 10588 KB Output is correct
30 Correct 14 ms 10748 KB Output is correct
31 Correct 41 ms 13904 KB Output is correct
32 Correct 43 ms 13904 KB Output is correct
33 Correct 39 ms 13904 KB Output is correct
34 Correct 40 ms 13908 KB Output is correct
35 Correct 38 ms 13904 KB Output is correct
36 Correct 39 ms 13804 KB Output is correct
37 Correct 39 ms 13792 KB Output is correct
38 Correct 40 ms 14160 KB Output is correct
39 Correct 39 ms 13648 KB Output is correct
40 Correct 43 ms 13924 KB Output is correct
41 Correct 22 ms 10840 KB Output is correct
42 Correct 33 ms 11092 KB Output is correct
43 Correct 41 ms 10844 KB Output is correct
44 Correct 38 ms 10836 KB Output is correct
45 Correct 30 ms 10640 KB Output is correct
46 Correct 14 ms 10588 KB Output is correct
47 Correct 25 ms 10744 KB Output is correct
48 Correct 38 ms 10836 KB Output is correct
49 Correct 35 ms 11148 KB Output is correct
50 Correct 29 ms 11096 KB Output is correct
51 Correct 66 ms 13760 KB Output is correct
52 Correct 66 ms 13524 KB Output is correct
53 Correct 60 ms 13648 KB Output is correct
54 Correct 61 ms 13392 KB Output is correct
55 Correct 64 ms 13704 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10584 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 10588 KB Output is correct
14 Correct 1 ms 10588 KB Output is correct
15 Correct 1 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10588 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 15 ms 10588 KB Output is correct
27 Correct 15 ms 10588 KB Output is correct
28 Correct 14 ms 10588 KB Output is correct
29 Correct 15 ms 10588 KB Output is correct
30 Correct 14 ms 10748 KB Output is correct
31 Correct 41 ms 13904 KB Output is correct
32 Correct 43 ms 13904 KB Output is correct
33 Correct 39 ms 13904 KB Output is correct
34 Correct 40 ms 13908 KB Output is correct
35 Correct 38 ms 13904 KB Output is correct
36 Correct 39 ms 13804 KB Output is correct
37 Correct 39 ms 13792 KB Output is correct
38 Correct 40 ms 14160 KB Output is correct
39 Correct 39 ms 13648 KB Output is correct
40 Correct 43 ms 13924 KB Output is correct
41 Correct 22 ms 10840 KB Output is correct
42 Correct 33 ms 11092 KB Output is correct
43 Correct 41 ms 10844 KB Output is correct
44 Correct 38 ms 10836 KB Output is correct
45 Correct 30 ms 10640 KB Output is correct
46 Correct 14 ms 10588 KB Output is correct
47 Correct 25 ms 10744 KB Output is correct
48 Correct 38 ms 10836 KB Output is correct
49 Correct 35 ms 11148 KB Output is correct
50 Correct 29 ms 11096 KB Output is correct
51 Correct 66 ms 13760 KB Output is correct
52 Correct 66 ms 13524 KB Output is correct
53 Correct 60 ms 13648 KB Output is correct
54 Correct 61 ms 13392 KB Output is correct
55 Correct 64 ms 13704 KB Output is correct
56 Correct 800 ms 38864 KB Output is correct
57 Correct 819 ms 51652 KB Output is correct
58 Correct 754 ms 50512 KB Output is correct
59 Correct 766 ms 51012 KB Output is correct
60 Correct 814 ms 52292 KB Output is correct