oj.uz

답안 #780430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780430 2023-07-12T08:58:38 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 784 ms 99220 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)3e6 + 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 r / B < R.r / B || (r / B == R.r / B && ((l < R.l) ^ (r / 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 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 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

# 결과 실행 시간 메모리 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 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 2 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 15 ms 1712 KB Output is correct
20 Correct 32 ms 2108 KB Output is correct
21 Correct 61 ms 2080 KB Output is correct
22 Correct 53 ms 2880 KB Output is correct
23 Correct 60 ms 1608 KB Output is correct
24 Correct 55 ms 1916 KB Output is correct
25 Correct 34 ms 5900 KB Output is correct
26 Correct 39 ms 4976 KB Output is correct
27 Correct 49 ms 4636 KB Output is correct
28 Correct 37 ms 5588 KB Output is correct
29 Correct 44 ms 4496 KB Output is correct
30 Correct 48 ms 4696 KB Output is correct
31 Correct 55 ms 1720 KB Output is correct
32 Correct 47 ms 1360 KB Output is correct
33 Correct 43 ms 4684 KB Output is correct
34 Correct 42 ms 6340 KB Output is correct
35 Correct 34 ms 6700 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 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 408 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 4 ms 812 KB Output is correct
9 Correct 7 ms 1576 KB Output is correct
10 Correct 15 ms 852 KB Output is correct
11 Correct 83 ms 4828 KB Output is correct
12 Correct 36 ms 3308 KB Output is correct
13 Correct 68 ms 7352 KB Output is correct
14 Correct 83 ms 6664 KB Output is correct
15 Correct 85 ms 7504 KB Output is correct
16 Correct 58 ms 6892 KB Output is correct
17 Correct 34 ms 5140 KB Output is correct
18 Correct 59 ms 8252 KB Output is correct
19 Correct 54 ms 8452 KB Output is correct
20 Correct 28 ms 4376 KB Output is correct

Subtask #4
0 / 60.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 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 2 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 15 ms 1712 KB Output is correct
20 Correct 32 ms 2108 KB Output is correct
21 Correct 61 ms 2080 KB Output is correct
22 Correct 53 ms 2880 KB Output is correct
23 Correct 60 ms 1608 KB Output is correct
24 Correct 55 ms 1916 KB Output is correct
25 Correct 34 ms 5900 KB Output is correct
26 Correct 39 ms 4976 KB Output is correct
27 Correct 49 ms 4636 KB Output is correct
28 Correct 37 ms 5588 KB Output is correct
29 Correct 44 ms 4496 KB Output is correct
30 Correct 48 ms 4696 KB Output is correct
31 Correct 55 ms 1720 KB Output is correct
32 Correct 47 ms 1360 KB Output is correct
33 Correct 43 ms 4684 KB Output is correct
34 Correct 42 ms 6340 KB Output is correct
35 Correct 34 ms 6700 KB Output is correct
36 Correct 0 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 2 ms 408 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 724 KB Output is correct
43 Correct 4 ms 812 KB Output is correct
44 Correct 7 ms 1576 KB Output is correct
45 Correct 15 ms 852 KB Output is correct
46 Correct 83 ms 4828 KB Output is correct
47 Correct 36 ms 3308 KB Output is correct
48 Correct 68 ms 7352 KB Output is correct
49 Correct 83 ms 6664 KB Output is correct
50 Correct 85 ms 7504 KB Output is correct
51 Correct 58 ms 6892 KB Output is correct
52 Correct 34 ms 5140 KB Output is correct
53 Correct 59 ms 8252 KB Output is correct
54 Correct 54 ms 8452 KB Output is correct
55 Correct 28 ms 4376 KB Output is correct
56 Correct 132 ms 2612 KB Output is correct
57 Correct 309 ms 6252 KB Output is correct
58 Correct 412 ms 31644 KB Output is correct
59 Runtime error 784 ms 99220 KB Execution killed with signal 11
60 Halted 0 ms 0 KB -