oj.uz

Submission #780405

# Submission time Handle Problem Language Result Execution time Memory
780405 2023-07-12T08:50:22 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 3977 ms 167616 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)5e6 + 4;
int n, q;
int B = 400;
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;

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]];

            val[++hn] = (long long)srt[a[r]] * cnt[a[r]];
            id[hn] = a[r];

            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;
            }
        }
        while(l > que[i].l){
            --l;
            ++cnt[a[l]];
            val[++hn] = (long long)srt[a[l]] * cnt[a[l]];
            id[hn] = a[l];

            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;
            }
        }
        while(r > que[i].r){
            --cnt[a[r]];
            val[++hn] = (long long)srt[a[r]] * cnt[a[r]];
            id[hn] = a[r];

            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;
            }
            --r;
        }
        while(l < que[i].l){
            --cnt[a[l]];
            val[++hn] = (long long)srt[a[l]] * cnt[a[l]];
            id[hn] = a[l];

            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;
            }
            ++l;
        }

        while(hn > 1 && (long long)srt[id[1]] * cnt[id[1]] != val[1]){
            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) + 1 <= hn){
                if(val[nxt] > val[now] && 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(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;
                }
            }
            if((nxt = now << 1) <= hn && val[nxt] > val[now]){
                imsi = val[now], val[now] = val[nxt], val[nxt] = imsi;
                imsi = id[now], id[now] = id[nxt], id[nxt] = imsi;
            }
        }

        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:29:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   29 |     register int i, l, r;
      |                  ^
historic.cpp:29:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   29 |     register int i, l, r;
      |                     ^
historic.cpp:29:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   29 |     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 0 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 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 1 ms 340 KB Output is correct
2 Correct 0 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 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 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 7 ms 1236 KB Output is correct
19 Correct 19 ms 2104 KB Output is correct
20 Correct 44 ms 2568 KB Output is correct
21 Correct 90 ms 2504 KB Output is correct
22 Correct 75 ms 2888 KB Output is correct
23 Correct 73 ms 2264 KB Output is correct
24 Correct 71 ms 2880 KB Output is correct
25 Correct 53 ms 6248 KB Output is correct
26 Correct 58 ms 6096 KB Output is correct
27 Correct 57 ms 5028 KB Output is correct
28 Correct 55 ms 6128 KB Output is correct
29 Correct 58 ms 5404 KB Output is correct
30 Correct 64 ms 4760 KB Output is correct
31 Correct 76 ms 2540 KB Output is correct
32 Correct 68 ms 1968 KB Output is correct
33 Correct 58 ms 5708 KB Output is correct
34 Correct 57 ms 6860 KB Output is correct
35 Correct 39 ms 7768 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 0 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 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 7 ms 1620 KB Output is correct
10 Correct 14 ms 852 KB Output is correct
11 Correct 78 ms 4920 KB Output is correct
12 Correct 34 ms 3276 KB Output is correct
13 Correct 61 ms 7364 KB Output is correct
14 Correct 71 ms 6692 KB Output is correct
15 Correct 80 ms 7524 KB Output is correct
16 Correct 47 ms 6856 KB Output is correct
17 Correct 30 ms 5100 KB Output is correct
18 Correct 50 ms 8284 KB Output is correct
19 Correct 51 ms 8512 KB Output is correct
20 Correct 33 ms 4404 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 0 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 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 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 7 ms 1236 KB Output is correct
19 Correct 19 ms 2104 KB Output is correct
20 Correct 44 ms 2568 KB Output is correct
21 Correct 90 ms 2504 KB Output is correct
22 Correct 75 ms 2888 KB Output is correct
23 Correct 73 ms 2264 KB Output is correct
24 Correct 71 ms 2880 KB Output is correct
25 Correct 53 ms 6248 KB Output is correct
26 Correct 58 ms 6096 KB Output is correct
27 Correct 57 ms 5028 KB Output is correct
28 Correct 55 ms 6128 KB Output is correct
29 Correct 58 ms 5404 KB Output is correct
30 Correct 64 ms 4760 KB Output is correct
31 Correct 76 ms 2540 KB Output is correct
32 Correct 68 ms 1968 KB Output is correct
33 Correct 58 ms 5708 KB Output is correct
34 Correct 57 ms 6860 KB Output is correct
35 Correct 39 ms 7768 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 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 2 ms 724 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 7 ms 1620 KB Output is correct
45 Correct 14 ms 852 KB Output is correct
46 Correct 78 ms 4920 KB Output is correct
47 Correct 34 ms 3276 KB Output is correct
48 Correct 61 ms 7364 KB Output is correct
49 Correct 71 ms 6692 KB Output is correct
50 Correct 80 ms 7524 KB Output is correct
51 Correct 47 ms 6856 KB Output is correct
52 Correct 30 ms 5100 KB Output is correct
53 Correct 50 ms 8284 KB Output is correct
54 Correct 51 ms 8512 KB Output is correct
55 Correct 33 ms 4404 KB Output is correct
56 Correct 166 ms 2948 KB Output is correct
57 Correct 378 ms 7488 KB Output is correct
58 Correct 582 ms 31296 KB Output is correct
59 Correct 968 ms 58432 KB Output is correct
60 Correct 1068 ms 80152 KB Output is correct
61 Correct 1503 ms 49368 KB Output is correct
62 Correct 1944 ms 13992 KB Output is correct
63 Correct 2101 ms 8316 KB Output is correct
64 Correct 2254 ms 7624 KB Output is correct
65 Correct 2068 ms 5744 KB Output is correct
66 Correct 2688 ms 7544 KB Output is correct
67 Correct 3360 ms 13460 KB Output is correct
68 Correct 3977 ms 73632 KB Output is correct
69 Runtime error 1493 ms 167616 KB Execution killed with signal 11
70 Halted 0 ms 0 KB -