oj.uz

답안 #780095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780095 2023-07-12T06:38:13 Z 이성호(#10006) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 8228 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()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    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 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 15 ms 596 KB Output is correct
21 Correct 30 ms 764 KB Output is correct
22 Correct 30 ms 764 KB Output is correct
23 Correct 38 ms 724 KB Output is correct
24 Correct 27 ms 748 KB Output is correct
25 Correct 36 ms 748 KB Output is correct
26 Correct 36 ms 764 KB Output is correct
27 Correct 38 ms 856 KB Output is correct
28 Correct 35 ms 760 KB Output is correct
29 Correct 34 ms 748 KB Output is correct
30 Correct 35 ms 752 KB Output is correct
31 Correct 28 ms 760 KB Output is correct
32 Correct 26 ms 768 KB Output is correct
33 Correct 35 ms 768 KB Output is correct
34 Correct 36 ms 764 KB Output is correct
35 Correct 43 ms 764 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 11 ms 1388 KB Output is correct
10 Correct 12 ms 2324 KB Output is correct
11 Correct 60 ms 7252 KB Output is correct
12 Correct 35 ms 4096 KB Output is correct
13 Correct 50 ms 4840 KB Output is correct
14 Correct 80 ms 6084 KB Output is correct
15 Correct 89 ms 8136 KB Output is correct
16 Correct 61 ms 6128 KB Output is correct
17 Correct 33 ms 5104 KB Output is correct
18 Correct 53 ms 7016 KB Output is correct
19 Correct 56 ms 7364 KB Output is correct
20 Correct 30 ms 4836 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 5 ms 468 KB Output is correct
20 Correct 15 ms 596 KB Output is correct
21 Correct 30 ms 764 KB Output is correct
22 Correct 30 ms 764 KB Output is correct
23 Correct 38 ms 724 KB Output is correct
24 Correct 27 ms 748 KB Output is correct
25 Correct 36 ms 748 KB Output is correct
26 Correct 36 ms 764 KB Output is correct
27 Correct 38 ms 856 KB Output is correct
28 Correct 35 ms 760 KB Output is correct
29 Correct 34 ms 748 KB Output is correct
30 Correct 35 ms 752 KB Output is correct
31 Correct 28 ms 760 KB Output is correct
32 Correct 26 ms 768 KB Output is correct
33 Correct 35 ms 768 KB Output is correct
34 Correct 36 ms 764 KB Output is correct
35 Correct 43 ms 764 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 5 ms 852 KB Output is correct
44 Correct 11 ms 1388 KB Output is correct
45 Correct 12 ms 2324 KB Output is correct
46 Correct 60 ms 7252 KB Output is correct
47 Correct 35 ms 4096 KB Output is correct
48 Correct 50 ms 4840 KB Output is correct
49 Correct 80 ms 6084 KB Output is correct
50 Correct 89 ms 8136 KB Output is correct
51 Correct 61 ms 6128 KB Output is correct
52 Correct 33 ms 5104 KB Output is correct
53 Correct 53 ms 7016 KB Output is correct
54 Correct 56 ms 7364 KB Output is correct
55 Correct 30 ms 4836 KB Output is correct
56 Correct 89 ms 1196 KB Output is correct
57 Correct 301 ms 2052 KB Output is correct
58 Correct 635 ms 2656 KB Output is correct
59 Correct 1066 ms 3632 KB Output is correct
60 Correct 1642 ms 4228 KB Output is correct
61 Correct 1913 ms 4952 KB Output is correct
62 Correct 2047 ms 6580 KB Output is correct
63 Correct 2461 ms 7300 KB Output is correct
64 Correct 3035 ms 7908 KB Output is correct
65 Correct 3319 ms 8228 KB Output is correct
66 Correct 3236 ms 8224 KB Output is correct
67 Correct 3677 ms 8224 KB Output is correct
68 Execution timed out 4080 ms 7188 KB Time limit exceeded
69 Halted 0 ms 0 KB -