oj.uz

Submission #780008

# Submission time Handle Problem Language Result Execution time Memory
780008 2023-07-12T05:10:01 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 75436 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;

const int NS = (int)1e5 + 4, SZ = (int)1e7 + 4;
int n, q;
int B = 300;
int a[NS];
int srt[NS];
int cnt[NS];
long long ans[NS];
struct ran{
    int l, r, id;
    bool operator<(const ran&R)const{
        return l / B < R.l / B || (l / B == R.l / B && ((r < R.r) ^ (l / B % 2)));
    }
}que[NS];

long long val[SZ], id[SZ];
int hn;
long long imsi;

void push(long long x, int y){
    // cout << "PUSH " << x << ' ' << y << endl;

    val[++hn] = x;
    id[hn] = y;

    int now = hn, nxt;
    while(now > 1 && val[now] > val[nxt = (now >> 1)]){
        imsi = val[now], val[now] = val[nxt], val[nxt] = imsi;
        imsi = id[now], id[now] = id[nxt], id[nxt] = imsi;
        now = nxt;
    }
}

void pop(){
    // cout << "POP" << endl;

    imsi = val[1], val[1] = val[hn], val[hn] = imsi;
    imsi = id[1], id[1] = id[hn], id[hn] = imsi;
    --hn;
    int now = 1, nxt;
    while(now << 1 <= hn){
        nxt = (now << 1);
        if(val[nxt] > val[now] && (nxt + 1 > hn || val[nxt] > val[nxt + 1])){
            imsi = val[now], val[now] = val[nxt], val[nxt] = imsi;
            imsi = id[now], id[now] = id[nxt], id[nxt] = imsi;
            now = nxt;
        }
        else if(nxt + 1 <= hn && val[nxt + 1] > val[now]){
            imsi = val[now], val[now] = val[nxt + 1], val[nxt + 1] = imsi;
            imsi = id[now], id[now] = id[nxt + 1], id[nxt + 1] = imsi;
            now = nxt + 1;
        }
        else{
            break;
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    register int i, l, r;

    cin >> n >> q;
    for(i = 0; i < n; ++i){
        cin >> a[i];
        srt[i] = a[i];
    }
    sort(srt, srt + n);
    for(i = 0; i < n; ++i){
        a[i] = lower_bound(srt, srt + n, a[i]) - srt;
    }
    for(i = 0; i < q; ++i){
        cin >> que[i].l >> que[i].r;
        --que[i].l, --que[i].r;
        que[i].id = i;
    }
    sort(que, que + q);

    r = -1, l = 0;
    for(i = 0; i < q; ++i){
        while(r < que[i].r){
            ++r;
            ++cnt[a[r]];
            push((long long)srt[a[r]] * cnt[a[r]], a[r]);
        }
        while(l > que[i].l){
            --l;
            ++cnt[a[l]];
            push((long long)srt[a[l]] * cnt[a[l]], a[l]);
        }
        while(r > que[i].r){
            --cnt[a[r]];
            push((long long)srt[a[r]] * cnt[a[r]], a[r]);
            --r;
        }
        while(l < que[i].l){
            --cnt[a[l]];
            push((long long)srt[a[l]] * cnt[a[l]], a[l]);
            ++l;
        }

        while(hn > 1 && (long long)srt[id[1]] * cnt[id[1]] != val[1]){
            pop();

            // for(int i = 1; i <= hn; ++i){
            //     cout << val[i] << ' ';
            // }
            // cout << endl;
        }

        ans[que[i].id] = val[1];
    }

    for(i = 0; i < q; ++i){
        cout << ans[i] << '\n';
    }
    
    return 0;
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:68:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |     register int i, l, r;
      |                  ^
historic.cpp:68:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |     register int i, l, r;
      |                     ^
historic.cpp:68:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |     register int i, l, r;
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 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 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 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 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 14 ms 1464 KB Output is correct
20 Correct 34 ms 1780 KB Output is correct
21 Correct 60 ms 1840 KB Output is correct
22 Correct 53 ms 2088 KB Output is correct
23 Correct 55 ms 1620 KB Output is correct
24 Correct 57 ms 1936 KB Output is correct
25 Correct 37 ms 4988 KB Output is correct
26 Correct 42 ms 5196 KB Output is correct
27 Correct 44 ms 4012 KB Output is correct
28 Correct 39 ms 4940 KB Output is correct
29 Correct 52 ms 4416 KB Output is correct
30 Correct 50 ms 3920 KB Output is correct
31 Correct 57 ms 1808 KB Output is correct
32 Correct 49 ms 1464 KB Output is correct
33 Correct 46 ms 4044 KB Output is correct
34 Correct 43 ms 5756 KB Output is correct
35 Correct 37 ms 6320 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 8 ms 1588 KB Output is correct
10 Correct 15 ms 928 KB Output is correct
11 Correct 85 ms 5152 KB Output is correct
12 Correct 35 ms 3408 KB Output is correct
13 Correct 62 ms 7484 KB Output is correct
14 Correct 86 ms 6952 KB Output is correct
15 Correct 88 ms 7756 KB Output is correct
16 Correct 51 ms 7128 KB Output is correct
17 Correct 33 ms 5196 KB Output is correct
18 Correct 56 ms 8588 KB Output is correct
19 Correct 54 ms 8764 KB Output is correct
20 Correct 25 ms 4432 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 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 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 6 ms 980 KB Output is correct
19 Correct 14 ms 1464 KB Output is correct
20 Correct 34 ms 1780 KB Output is correct
21 Correct 60 ms 1840 KB Output is correct
22 Correct 53 ms 2088 KB Output is correct
23 Correct 55 ms 1620 KB Output is correct
24 Correct 57 ms 1936 KB Output is correct
25 Correct 37 ms 4988 KB Output is correct
26 Correct 42 ms 5196 KB Output is correct
27 Correct 44 ms 4012 KB Output is correct
28 Correct 39 ms 4940 KB Output is correct
29 Correct 52 ms 4416 KB Output is correct
30 Correct 50 ms 3920 KB Output is correct
31 Correct 57 ms 1808 KB Output is correct
32 Correct 49 ms 1464 KB Output is correct
33 Correct 46 ms 4044 KB Output is correct
34 Correct 43 ms 5756 KB Output is correct
35 Correct 37 ms 6320 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 8 ms 1588 KB Output is correct
45 Correct 15 ms 928 KB Output is correct
46 Correct 85 ms 5152 KB Output is correct
47 Correct 35 ms 3408 KB Output is correct
48 Correct 62 ms 7484 KB Output is correct
49 Correct 86 ms 6952 KB Output is correct
50 Correct 88 ms 7756 KB Output is correct
51 Correct 51 ms 7128 KB Output is correct
52 Correct 33 ms 5196 KB Output is correct
53 Correct 56 ms 8588 KB Output is correct
54 Correct 54 ms 8764 KB Output is correct
55 Correct 25 ms 4432 KB Output is correct
56 Correct 127 ms 2136 KB Output is correct
57 Correct 318 ms 6320 KB Output is correct
58 Correct 448 ms 27852 KB Output is correct
59 Correct 798 ms 53668 KB Output is correct
60 Correct 961 ms 75436 KB Output is correct
61 Correct 1493 ms 47652 KB Output is correct
62 Correct 1971 ms 13488 KB Output is correct
63 Correct 2158 ms 7604 KB Output is correct
64 Correct 2304 ms 6980 KB Output is correct
65 Correct 2089 ms 5964 KB Output is correct
66 Correct 2805 ms 7196 KB Output is correct
67 Correct 3506 ms 13320 KB Output is correct
68 Execution timed out 4029 ms 74452 KB Time limit exceeded
69 Halted 0 ms 0 KB -