oj.uz

Submission #780230

# Submission time Handle Problem Language Result Execution time Memory
780230 2023-07-12T07:27:41 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 88132 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 = 500;
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((nxt = now << 1) <= hn){
        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:67:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   67 |     register int i, l, r;
      |                  ^
historic.cpp:67:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   67 |     register int i, l, r;
      |                     ^
historic.cpp:67:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   67 |     register int i, l, r;
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 0 ms 340 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 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 0 ms 340 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 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 10 ms 1364 KB Output is correct
19 Correct 21 ms 2340 KB Output is correct
20 Correct 55 ms 3552 KB Output is correct
21 Correct 94 ms 3456 KB Output is correct
22 Correct 97 ms 3952 KB Output is correct
23 Correct 90 ms 3116 KB Output is correct
24 Correct 97 ms 3928 KB Output is correct
25 Correct 63 ms 7568 KB Output is correct
26 Correct 66 ms 7352 KB Output is correct
27 Correct 74 ms 6184 KB Output is correct
28 Correct 71 ms 7196 KB Output is correct
29 Correct 76 ms 6420 KB Output is correct
30 Correct 79 ms 5688 KB Output is correct
31 Correct 94 ms 3360 KB Output is correct
32 Correct 80 ms 2564 KB Output is correct
33 Correct 84 ms 6920 KB Output is correct
34 Correct 73 ms 8508 KB Output is correct
35 Correct 57 ms 9080 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 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 2 ms 340 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 7 ms 1620 KB Output is correct
10 Correct 15 ms 848 KB Output is correct
11 Correct 83 ms 4848 KB Output is correct
12 Correct 36 ms 3288 KB Output is correct
13 Correct 59 ms 7308 KB Output is correct
14 Correct 78 ms 6680 KB Output is correct
15 Correct 87 ms 7504 KB Output is correct
16 Correct 48 ms 6856 KB Output is correct
17 Correct 34 ms 5076 KB Output is correct
18 Correct 57 ms 8316 KB Output is correct
19 Correct 60 ms 8552 KB Output is correct
20 Correct 25 ms 4356 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 0 ms 340 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 340 KB Output is correct
12 Correct 1 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 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 10 ms 1364 KB Output is correct
19 Correct 21 ms 2340 KB Output is correct
20 Correct 55 ms 3552 KB Output is correct
21 Correct 94 ms 3456 KB Output is correct
22 Correct 97 ms 3952 KB Output is correct
23 Correct 90 ms 3116 KB Output is correct
24 Correct 97 ms 3928 KB Output is correct
25 Correct 63 ms 7568 KB Output is correct
26 Correct 66 ms 7352 KB Output is correct
27 Correct 74 ms 6184 KB Output is correct
28 Correct 71 ms 7196 KB Output is correct
29 Correct 76 ms 6420 KB Output is correct
30 Correct 79 ms 5688 KB Output is correct
31 Correct 94 ms 3360 KB Output is correct
32 Correct 80 ms 2564 KB Output is correct
33 Correct 84 ms 6920 KB Output is correct
34 Correct 73 ms 8508 KB Output is correct
35 Correct 57 ms 9080 KB Output is correct
36 Correct 1 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 2 ms 340 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 5 ms 852 KB Output is correct
44 Correct 7 ms 1620 KB Output is correct
45 Correct 15 ms 848 KB Output is correct
46 Correct 83 ms 4848 KB Output is correct
47 Correct 36 ms 3288 KB Output is correct
48 Correct 59 ms 7308 KB Output is correct
49 Correct 78 ms 6680 KB Output is correct
50 Correct 87 ms 7504 KB Output is correct
51 Correct 48 ms 6856 KB Output is correct
52 Correct 34 ms 5076 KB Output is correct
53 Correct 57 ms 8316 KB Output is correct
54 Correct 60 ms 8552 KB Output is correct
55 Correct 25 ms 4356 KB Output is correct
56 Correct 207 ms 4032 KB Output is correct
57 Correct 484 ms 8864 KB Output is correct
58 Correct 653 ms 35328 KB Output is correct
59 Correct 1113 ms 66084 KB Output is correct
60 Correct 1122 ms 88132 KB Output is correct
61 Correct 1724 ms 54016 KB Output is correct
62 Correct 2389 ms 14788 KB Output is correct
63 Correct 2449 ms 9660 KB Output is correct
64 Correct 2470 ms 8560 KB Output is correct
65 Correct 2128 ms 5732 KB Output is correct
66 Correct 2929 ms 8476 KB Output is correct
67 Correct 3758 ms 14304 KB Output is correct
68 Execution timed out 4094 ms 75016 KB Time limit exceeded
69 Halted 0 ms 0 KB -