oj.uz

답안 #780091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780091 2023-07-12T06:36:57 Z 이성호(#10006) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 9536 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#define int long long
using namespace std;
int a[100005], N, K, Q;
struct Query
{
    int l, r;
    int id;
    bool operator<(const Query &q) const {
        if (l / K == q.l / K) return r < q.r;
        else return l < q.l;
    }
};
Query query[100005];
struct maxseg
{
    vector<int> tree;
    maxseg(int n)
    {
        int sz = 1 << ((int)ceil(log2(n+1))+1);
        tree.resize(sz);
    }
    void upd(int s, int e, int node, int id, int x)
    {
        if (e < id || id < s) return;
        if (s == e) {
            tree[node] += x;
            return;
        }
        upd(s, (s+e)/2, 2*node, id, x);
        upd((s+e)/2+1, e, 2*node+1, id, x);
        tree[node] = max(tree[2*node], tree[2*node+1]);
    }
    int query(int s, int e, int node, int l, int r)
    {
        if (e < l || r < s) return 0;
        if (l <= s && e <= r) return tree[node];
        return query(s, (s+e)/2, 2*node, l, r) + query((s+e)/2+1, e, 2*node+1, l, r);
    }
};
int ans[100005];
signed main()
{
    cin >> N >> Q; K = sqrt(N);
    vector<int> cpx;
    for (int i = 0; i < N; i++) cin >> a[i];
    for (int i = 0; i < N; i++) cpx.push_back(a[i]);
    sort(cpx.begin(), cpx.end()); cpx.erase(unique(cpx.begin(), cpx.end()), cpx.end());
    for (int i = 0; i < N; i++) {
        a[i] = lower_bound(cpx.begin(), cpx.end(), a[i]) - cpx.begin();
    }
    for (int i = 0; i < Q; i++) {
        cin >> query[i].l >> query[i].r; --query[i].l; --query[i].r;
        query[i].id = i;
    }
    sort(query, query + Q);
    int l = 0, r = -1;
    maxseg seg(N);
    for (int i = 0; i < Q; i++) {
        int nl = query[i].l, nr = query[i].r;
        while (r < nr) r++, seg.upd(0, N-1, 1, a[r], cpx[a[r]]);
        while (l > nl) l--, seg.upd(0, N-1, 1, a[l], cpx[a[l]]);
        while (r > nr) seg.upd(0, N-1, 1, a[r], -cpx[a[r]]), r--;
        while (l < nl) seg.upd(0, N-1, 1, a[l], -cpx[a[l]]), l++;
        ans[query[i].id] = seg.query(0, N-1, 1, 0, N-1);
    }
    for (int i = 0; i < Q; i++) cout << ans[i] << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 6 ms 448 KB Output is correct
20 Correct 17 ms 596 KB Output is correct
21 Correct 31 ms 832 KB Output is correct
22 Correct 32 ms 820 KB Output is correct
23 Correct 33 ms 816 KB Output is correct
24 Correct 31 ms 816 KB Output is correct
25 Correct 38 ms 832 KB Output is correct
26 Correct 39 ms 832 KB Output is correct
27 Correct 37 ms 852 KB Output is correct
28 Correct 37 ms 824 KB Output is correct
29 Correct 36 ms 852 KB Output is correct
30 Correct 36 ms 852 KB Output is correct
31 Correct 31 ms 852 KB Output is correct
32 Correct 28 ms 852 KB Output is correct
33 Correct 40 ms 924 KB Output is correct
34 Correct 38 ms 852 KB Output is correct
35 Correct 38 ms 864 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 5 ms 576 KB Output is correct
8 Correct 8 ms 980 KB Output is correct
9 Correct 23 ms 1584 KB Output is correct
10 Correct 20 ms 2576 KB Output is correct
11 Correct 123 ms 8132 KB Output is correct
12 Correct 51 ms 4720 KB Output is correct
13 Correct 77 ms 5576 KB Output is correct
14 Correct 111 ms 6964 KB Output is correct
15 Correct 144 ms 9536 KB Output is correct
16 Correct 102 ms 6992 KB Output is correct
17 Correct 58 ms 5776 KB Output is correct
18 Correct 94 ms 7968 KB Output is correct
19 Correct 104 ms 8568 KB Output is correct
20 Correct 56 ms 5540 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 6 ms 448 KB Output is correct
20 Correct 17 ms 596 KB Output is correct
21 Correct 31 ms 832 KB Output is correct
22 Correct 32 ms 820 KB Output is correct
23 Correct 33 ms 816 KB Output is correct
24 Correct 31 ms 816 KB Output is correct
25 Correct 38 ms 832 KB Output is correct
26 Correct 39 ms 832 KB Output is correct
27 Correct 37 ms 852 KB Output is correct
28 Correct 37 ms 824 KB Output is correct
29 Correct 36 ms 852 KB Output is correct
30 Correct 36 ms 852 KB Output is correct
31 Correct 31 ms 852 KB Output is correct
32 Correct 28 ms 852 KB Output is correct
33 Correct 40 ms 924 KB Output is correct
34 Correct 38 ms 852 KB Output is correct
35 Correct 38 ms 864 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 5 ms 576 KB Output is correct
43 Correct 8 ms 980 KB Output is correct
44 Correct 23 ms 1584 KB Output is correct
45 Correct 20 ms 2576 KB Output is correct
46 Correct 123 ms 8132 KB Output is correct
47 Correct 51 ms 4720 KB Output is correct
48 Correct 77 ms 5576 KB Output is correct
49 Correct 111 ms 6964 KB Output is correct
50 Correct 144 ms 9536 KB Output is correct
51 Correct 102 ms 6992 KB Output is correct
52 Correct 58 ms 5776 KB Output is correct
53 Correct 94 ms 7968 KB Output is correct
54 Correct 104 ms 8568 KB Output is correct
55 Correct 56 ms 5540 KB Output is correct
56 Correct 101 ms 1324 KB Output is correct
57 Correct 293 ms 2372 KB Output is correct
58 Correct 635 ms 3028 KB Output is correct
59 Correct 1065 ms 4352 KB Output is correct
60 Correct 1560 ms 5088 KB Output is correct
61 Correct 1872 ms 5684 KB Output is correct
62 Correct 2036 ms 7316 KB Output is correct
63 Correct 2383 ms 8320 KB Output is correct
64 Correct 2965 ms 9156 KB Output is correct
65 Correct 3266 ms 9296 KB Output is correct
66 Correct 3268 ms 9396 KB Output is correct
67 Correct 3635 ms 9472 KB Output is correct
68 Execution timed out 4057 ms 7860 KB Time limit exceeded
69 Halted 0 ms 0 KB -