oj.uz

Submission #780005

# Submission time Handle Problem Language Result Execution time Memory
780005 2023-07-12T05:06:45 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 81100 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){
    // cout << "PUSH " << x << ' ' << y << endl;

    val[++hn] = x;
    id[hn] = y;

    int now = hn;
    while(now > 1 && val[now] > val[now >> 1]){
        imsi = val[now], val[now] = val[now >> 1], val[now >> 1] = imsi;
        imsi = id[now], id[now] = id[now >> 1], id[now >> 1] = imsi;
        now >>= 1;
    }
}

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

            // for(int i = 1; i <= hn; ++i){
            //     cout << val[i] << ' ';
            // }
            // cout << endl;
        }

        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:68:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |     register int i, l, r;
      |                  ^
historic.cpp:68:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |     register int i, l, r;
      |                     ^
historic.cpp:68:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   68 |     register int i, l, r;
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 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 328 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 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 328 KB Output is correct
14 Correct 1 ms 328 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 332 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 328 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 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 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 8 ms 1236 KB Output is correct
19 Correct 18 ms 2136 KB Output is correct
20 Correct 46 ms 2608 KB Output is correct
21 Correct 75 ms 2576 KB Output is correct
22 Correct 74 ms 2952 KB Output is correct
23 Correct 72 ms 2328 KB Output is correct
24 Correct 74 ms 2936 KB Output is correct
25 Correct 50 ms 6312 KB Output is correct
26 Correct 55 ms 6092 KB Output is correct
27 Correct 57 ms 5196 KB Output is correct
28 Correct 57 ms 6200 KB Output is correct
29 Correct 59 ms 5500 KB Output is correct
30 Correct 62 ms 4796 KB Output is correct
31 Correct 76 ms 2644 KB Output is correct
32 Correct 66 ms 2056 KB Output is correct
33 Correct 58 ms 5812 KB Output is correct
34 Correct 55 ms 6960 KB Output is correct
35 Correct 42 ms 7880 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 1 ms 324 KB Output is correct
3 Correct 1 ms 324 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 380 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 4 ms 980 KB Output is correct
9 Correct 8 ms 1928 KB Output is correct
10 Correct 15 ms 1108 KB Output is correct
11 Correct 84 ms 6292 KB Output is correct
12 Correct 35 ms 4044 KB Output is correct
13 Correct 61 ms 8548 KB Output is correct
14 Correct 76 ms 7984 KB Output is correct
15 Correct 88 ms 8972 KB Output is correct
16 Correct 50 ms 8220 KB Output is correct
17 Correct 32 ms 5692 KB Output is correct
18 Correct 56 ms 9692 KB Output is correct
19 Correct 59 ms 9916 KB Output is correct
20 Correct 26 ms 5452 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 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 328 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 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 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 456 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 8 ms 1236 KB Output is correct
19 Correct 18 ms 2136 KB Output is correct
20 Correct 46 ms 2608 KB Output is correct
21 Correct 75 ms 2576 KB Output is correct
22 Correct 74 ms 2952 KB Output is correct
23 Correct 72 ms 2328 KB Output is correct
24 Correct 74 ms 2936 KB Output is correct
25 Correct 50 ms 6312 KB Output is correct
26 Correct 55 ms 6092 KB Output is correct
27 Correct 57 ms 5196 KB Output is correct
28 Correct 57 ms 6200 KB Output is correct
29 Correct 59 ms 5500 KB Output is correct
30 Correct 62 ms 4796 KB Output is correct
31 Correct 76 ms 2644 KB Output is correct
32 Correct 66 ms 2056 KB Output is correct
33 Correct 58 ms 5812 KB Output is correct
34 Correct 55 ms 6960 KB Output is correct
35 Correct 42 ms 7880 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 324 KB Output is correct
38 Correct 1 ms 324 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 380 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 4 ms 980 KB Output is correct
44 Correct 8 ms 1928 KB Output is correct
45 Correct 15 ms 1108 KB Output is correct
46 Correct 84 ms 6292 KB Output is correct
47 Correct 35 ms 4044 KB Output is correct
48 Correct 61 ms 8548 KB Output is correct
49 Correct 76 ms 7984 KB Output is correct
50 Correct 88 ms 8972 KB Output is correct
51 Correct 50 ms 8220 KB Output is correct
52 Correct 32 ms 5692 KB Output is correct
53 Correct 56 ms 9692 KB Output is correct
54 Correct 59 ms 9916 KB Output is correct
55 Correct 26 ms 5452 KB Output is correct
56 Correct 162 ms 3104 KB Output is correct
57 Correct 389 ms 7876 KB Output is correct
58 Correct 549 ms 31640 KB Output is correct
59 Correct 925 ms 59184 KB Output is correct
60 Correct 994 ms 81100 KB Output is correct
61 Correct 1541 ms 50588 KB Output is correct
62 Correct 2040 ms 15388 KB Output is correct
63 Correct 2181 ms 9712 KB Output is correct
64 Correct 2263 ms 9032 KB Output is correct
65 Correct 1986 ms 7268 KB Output is correct
66 Correct 2752 ms 8984 KB Output is correct
67 Correct 3442 ms 14900 KB Output is correct
68 Execution timed out 4026 ms 75776 KB Time limit exceeded
69 Halted 0 ms 0 KB -