oj.uz

답안 #780397

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

        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:65:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   65 |     register int i, l, r;
      |                  ^
historic.cpp:65:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   65 |     register int i, l, r;
      |                     ^
historic.cpp:65:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   65 |     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 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 300 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 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 300 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 460 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 8 ms 1236 KB Output is correct
19 Correct 21 ms 2128 KB Output is correct
20 Correct 46 ms 2592 KB Output is correct
21 Correct 76 ms 2652 KB Output is correct
22 Correct 72 ms 2948 KB Output is correct
23 Correct 72 ms 2316 KB Output is correct
24 Correct 77 ms 2936 KB Output is correct
25 Correct 52 ms 6312 KB Output is correct
26 Correct 62 ms 6292 KB Output is correct
27 Correct 57 ms 5112 KB Output is correct
28 Correct 50 ms 6196 KB Output is correct
29 Correct 59 ms 5452 KB Output is correct
30 Correct 62 ms 4804 KB Output is correct
31 Correct 75 ms 2644 KB Output is correct
32 Correct 65 ms 2064 KB Output is correct
33 Correct 58 ms 5832 KB Output is correct
34 Correct 60 ms 6964 KB Output is correct
35 Correct 39 ms 7880 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 328 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 3 ms 712 KB Output is correct
8 Correct 4 ms 976 KB Output is correct
9 Correct 9 ms 1876 KB Output is correct
10 Correct 16 ms 1068 KB Output is correct
11 Correct 87 ms 6452 KB Output is correct
12 Correct 35 ms 4048 KB Output is correct
13 Correct 63 ms 8560 KB Output is correct
14 Correct 77 ms 8248 KB Output is correct
15 Correct 97 ms 9576 KB Output is correct
16 Correct 47 ms 8400 KB Output is correct
17 Correct 32 ms 5692 KB Output is correct
18 Correct 55 ms 9972 KB Output is correct
19 Correct 57 ms 10468 KB Output is correct
20 Correct 25 ms 5460 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 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 300 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 460 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 8 ms 1236 KB Output is correct
19 Correct 21 ms 2128 KB Output is correct
20 Correct 46 ms 2592 KB Output is correct
21 Correct 76 ms 2652 KB Output is correct
22 Correct 72 ms 2948 KB Output is correct
23 Correct 72 ms 2316 KB Output is correct
24 Correct 77 ms 2936 KB Output is correct
25 Correct 52 ms 6312 KB Output is correct
26 Correct 62 ms 6292 KB Output is correct
27 Correct 57 ms 5112 KB Output is correct
28 Correct 50 ms 6196 KB Output is correct
29 Correct 59 ms 5452 KB Output is correct
30 Correct 62 ms 4804 KB Output is correct
31 Correct 75 ms 2644 KB Output is correct
32 Correct 65 ms 2064 KB Output is correct
33 Correct 58 ms 5832 KB Output is correct
34 Correct 60 ms 6964 KB Output is correct
35 Correct 39 ms 7880 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 328 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 2 ms 464 KB Output is correct
42 Correct 3 ms 712 KB Output is correct
43 Correct 4 ms 976 KB Output is correct
44 Correct 9 ms 1876 KB Output is correct
45 Correct 16 ms 1068 KB Output is correct
46 Correct 87 ms 6452 KB Output is correct
47 Correct 35 ms 4048 KB Output is correct
48 Correct 63 ms 8560 KB Output is correct
49 Correct 77 ms 8248 KB Output is correct
50 Correct 97 ms 9576 KB Output is correct
51 Correct 47 ms 8400 KB Output is correct
52 Correct 32 ms 5692 KB Output is correct
53 Correct 55 ms 9972 KB Output is correct
54 Correct 57 ms 10468 KB Output is correct
55 Correct 25 ms 5460 KB Output is correct
56 Correct 163 ms 3096 KB Output is correct
57 Correct 381 ms 7860 KB Output is correct
58 Correct 549 ms 31732 KB Output is correct
59 Correct 916 ms 59260 KB Output is correct
60 Correct 1018 ms 81148 KB Output is correct
61 Correct 1558 ms 50788 KB Output is correct
62 Correct 2043 ms 15392 KB Output is correct
63 Correct 2188 ms 9988 KB Output is correct
64 Correct 2386 ms 9540 KB Output is correct
65 Correct 2015 ms 7484 KB Output is correct
66 Correct 2741 ms 9408 KB Output is correct
67 Correct 3423 ms 15372 KB Output is correct
68 Execution timed out 4038 ms 75668 KB Time limit exceeded
69 Halted 0 ms 0 KB -