oj.uz

답안 #780420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780420 2023-07-12T08:56:18 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 1147 ms 162488 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 = 450;
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;
    int now, nxt;
    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];

            for(now = hn; 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];

            for(now = hn; 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];

            for(now = hn; 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];

            for(now = hn; 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;
            for(now = 1; (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

# 결과 실행 시간 메모리 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 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 0 ms 340 KB Output is correct
11 Correct 1 ms 292 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 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 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 0 ms 340 KB Output is correct
11 Correct 1 ms 292 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 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 10 ms 1236 KB Output is correct
19 Correct 19 ms 2272 KB Output is correct
20 Correct 52 ms 3096 KB Output is correct
21 Correct 82 ms 2968 KB Output is correct
22 Correct 77 ms 3412 KB Output is correct
23 Correct 79 ms 2644 KB Output is correct
24 Correct 96 ms 3540 KB Output is correct
25 Correct 60 ms 6764 KB Output is correct
26 Correct 61 ms 6988 KB Output is correct
27 Correct 72 ms 5644 KB Output is correct
28 Correct 63 ms 6712 KB Output is correct
29 Correct 65 ms 6068 KB Output is correct
30 Correct 67 ms 5076 KB Output is correct
31 Correct 85 ms 2888 KB Output is correct
32 Correct 76 ms 2252 KB Output is correct
33 Correct 66 ms 6300 KB Output is correct
34 Correct 64 ms 7480 KB Output is correct
35 Correct 43 ms 8424 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 468 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 10 ms 1692 KB Output is correct
10 Correct 19 ms 860 KB Output is correct
11 Correct 83 ms 4828 KB Output is correct
12 Correct 36 ms 3352 KB Output is correct
13 Correct 80 ms 7380 KB Output is correct
14 Correct 73 ms 6700 KB Output is correct
15 Correct 87 ms 7472 KB Output is correct
16 Correct 64 ms 6864 KB Output is correct
17 Correct 41 ms 5160 KB Output is correct
18 Correct 63 ms 8296 KB Output is correct
19 Correct 55 ms 8540 KB Output is correct
20 Correct 28 ms 4424 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 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 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 0 ms 340 KB Output is correct
11 Correct 1 ms 292 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 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 10 ms 1236 KB Output is correct
19 Correct 19 ms 2272 KB Output is correct
20 Correct 52 ms 3096 KB Output is correct
21 Correct 82 ms 2968 KB Output is correct
22 Correct 77 ms 3412 KB Output is correct
23 Correct 79 ms 2644 KB Output is correct
24 Correct 96 ms 3540 KB Output is correct
25 Correct 60 ms 6764 KB Output is correct
26 Correct 61 ms 6988 KB Output is correct
27 Correct 72 ms 5644 KB Output is correct
28 Correct 63 ms 6712 KB Output is correct
29 Correct 65 ms 6068 KB Output is correct
30 Correct 67 ms 5076 KB Output is correct
31 Correct 85 ms 2888 KB Output is correct
32 Correct 76 ms 2252 KB Output is correct
33 Correct 66 ms 6300 KB Output is correct
34 Correct 64 ms 7480 KB Output is correct
35 Correct 43 ms 8424 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 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 1 ms 468 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 724 KB Output is correct
43 Correct 5 ms 852 KB Output is correct
44 Correct 10 ms 1692 KB Output is correct
45 Correct 19 ms 860 KB Output is correct
46 Correct 83 ms 4828 KB Output is correct
47 Correct 36 ms 3352 KB Output is correct
48 Correct 80 ms 7380 KB Output is correct
49 Correct 73 ms 6700 KB Output is correct
50 Correct 87 ms 7472 KB Output is correct
51 Correct 64 ms 6864 KB Output is correct
52 Correct 41 ms 5160 KB Output is correct
53 Correct 63 ms 8296 KB Output is correct
54 Correct 55 ms 8540 KB Output is correct
55 Correct 28 ms 4424 KB Output is correct
56 Correct 186 ms 3496 KB Output is correct
57 Correct 456 ms 8112 KB Output is correct
58 Correct 624 ms 33272 KB Output is correct
59 Correct 1049 ms 62240 KB Output is correct
60 Runtime error 1147 ms 162488 KB Execution killed with signal 11
61 Halted 0 ms 0 KB -