oj.uz

답안 #780425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780425 2023-07-12T08:57:27 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 97904 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 = 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 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 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

# 결과 실행 시간 메모리 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 340 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 5 ms 1364 KB Output is correct
19 Correct 12 ms 2212 KB Output is correct
20 Correct 41 ms 2880 KB Output is correct
21 Correct 74 ms 2904 KB Output is correct
22 Correct 68 ms 3644 KB Output is correct
23 Correct 69 ms 2152 KB Output is correct
24 Correct 69 ms 2768 KB Output is correct
25 Correct 50 ms 7572 KB Output is correct
26 Correct 50 ms 6464 KB Output is correct
27 Correct 61 ms 5808 KB Output is correct
28 Correct 47 ms 7200 KB Output is correct
29 Correct 64 ms 5708 KB Output is correct
30 Correct 60 ms 6200 KB Output is correct
31 Correct 73 ms 2424 KB Output is correct
32 Correct 62 ms 1764 KB Output is correct
33 Correct 59 ms 5864 KB Output is correct
34 Correct 59 ms 7688 KB Output is correct
35 Correct 35 ms 8520 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 2 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 4 ms 852 KB Output is correct
9 Correct 10 ms 1504 KB Output is correct
10 Correct 14 ms 852 KB Output is correct
11 Correct 82 ms 4892 KB Output is correct
12 Correct 40 ms 3280 KB Output is correct
13 Correct 59 ms 7372 KB Output is correct
14 Correct 82 ms 6680 KB Output is correct
15 Correct 99 ms 7504 KB Output is correct
16 Correct 47 ms 6860 KB Output is correct
17 Correct 32 ms 5080 KB Output is correct
18 Correct 56 ms 8324 KB Output is correct
19 Correct 60 ms 8524 KB Output is correct
20 Correct 25 ms 4396 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 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 596 KB Output is correct
18 Correct 5 ms 1364 KB Output is correct
19 Correct 12 ms 2212 KB Output is correct
20 Correct 41 ms 2880 KB Output is correct
21 Correct 74 ms 2904 KB Output is correct
22 Correct 68 ms 3644 KB Output is correct
23 Correct 69 ms 2152 KB Output is correct
24 Correct 69 ms 2768 KB Output is correct
25 Correct 50 ms 7572 KB Output is correct
26 Correct 50 ms 6464 KB Output is correct
27 Correct 61 ms 5808 KB Output is correct
28 Correct 47 ms 7200 KB Output is correct
29 Correct 64 ms 5708 KB Output is correct
30 Correct 60 ms 6200 KB Output is correct
31 Correct 73 ms 2424 KB Output is correct
32 Correct 62 ms 1764 KB Output is correct
33 Correct 59 ms 5864 KB Output is correct
34 Correct 59 ms 7688 KB Output is correct
35 Correct 35 ms 8520 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 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 2 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 4 ms 852 KB Output is correct
44 Correct 10 ms 1504 KB Output is correct
45 Correct 14 ms 852 KB Output is correct
46 Correct 82 ms 4892 KB Output is correct
47 Correct 40 ms 3280 KB Output is correct
48 Correct 59 ms 7372 KB Output is correct
49 Correct 82 ms 6680 KB Output is correct
50 Correct 99 ms 7504 KB Output is correct
51 Correct 47 ms 6860 KB Output is correct
52 Correct 32 ms 5080 KB Output is correct
53 Correct 56 ms 8324 KB Output is correct
54 Correct 60 ms 8524 KB Output is correct
55 Correct 25 ms 4396 KB Output is correct
56 Correct 161 ms 3588 KB Output is correct
57 Correct 363 ms 7868 KB Output is correct
58 Correct 485 ms 36732 KB Output is correct
59 Correct 900 ms 56760 KB Output is correct
60 Correct 795 ms 97904 KB Output is correct
61 Correct 1535 ms 56796 KB Output is correct
62 Correct 2177 ms 17456 KB Output is correct
63 Correct 2203 ms 8644 KB Output is correct
64 Correct 2305 ms 7584 KB Output is correct
65 Correct 2025 ms 5776 KB Output is correct
66 Correct 2770 ms 8004 KB Output is correct
67 Correct 3743 ms 16416 KB Output is correct
68 Execution timed out 4082 ms 75712 KB Time limit exceeded
69 Halted 0 ms 0 KB -