oj.uz

Submission #779988

# Submission time Handle Problem Language Result Execution time Memory
779988 2023-07-12T04:51:14 Z 이동현(#10007) 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 133768 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;
int n, q;
int B = 100;
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];

struct Data{
    long long val;
    int id;
    Data(){}
    Data(long long val, int id):val(val), id(id){}
    bool operator<(const Data&r)const{
        return val < r.val;
    }
};

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);

    priority_queue<Data> pq;
    r = -1, l = 0;
    for(i = 0; i < q; ++i){
        while(r < que[i].r){
            ++r;
            ++cnt[a[r]];
            pq.push(Data((long long)srt[a[r]] * cnt[a[r]], a[r]));
        }
        while(l > que[i].l){
            --l;
            ++cnt[a[l]];
            pq.push(Data((long long)srt[a[l]] * cnt[a[l]], a[l]));
        }
        while(r > que[i].r){
            --cnt[a[r]];
            pq.push(Data((long long)srt[a[r]] * cnt[a[r]], a[r]));
            --r;
        }
        while(l < que[i].l){
            --cnt[a[l]];
            pq.push(Data((long long)srt[a[l]] * cnt[a[l]], a[l]));
            ++l;
        }

        while((long long)srt[pq.top().id] * cnt[pq.top().id] != pq.top().val){
            pq.pop();
        }

        ans[que[i].id] = pq.top().val;
    }

    for(i = 0; i < q; ++i){
        cout << ans[i] << '\n';
    }
    
    return 0;
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:35:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   35 |     register int i, l, r;
      |                  ^
historic.cpp:35:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   35 |     register int i, l, r;
      |                     ^
historic.cpp:35:24: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   35 |     register int i, l, r;
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 468 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 8 ms 984 KB Output is correct
20 Correct 19 ms 1096 KB Output is correct
21 Correct 37 ms 1564 KB Output is correct
22 Correct 34 ms 1620 KB Output is correct
23 Correct 35 ms 872 KB Output is correct
24 Correct 36 ms 1112 KB Output is correct
25 Correct 28 ms 4668 KB Output is correct
26 Correct 29 ms 4740 KB Output is correct
27 Correct 29 ms 2640 KB Output is correct
28 Correct 30 ms 4672 KB Output is correct
29 Correct 35 ms 4700 KB Output is correct
30 Correct 35 ms 2664 KB Output is correct
31 Correct 35 ms 1112 KB Output is correct
32 Correct 32 ms 856 KB Output is correct
33 Correct 30 ms 2712 KB Output is correct
34 Correct 30 ms 4684 KB Output is correct
35 Correct 22 ms 4648 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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 528 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 728 KB Output is correct
8 Correct 4 ms 1112 KB Output is correct
9 Correct 8 ms 1812 KB Output is correct
10 Correct 14 ms 916 KB Output is correct
11 Correct 93 ms 5072 KB Output is correct
12 Correct 38 ms 3656 KB Output is correct
13 Correct 70 ms 10180 KB Output is correct
14 Correct 79 ms 6692 KB Output is correct
15 Correct 108 ms 7680 KB Output is correct
16 Correct 51 ms 6972 KB Output is correct
17 Correct 39 ms 6220 KB Output is correct
18 Correct 60 ms 11076 KB Output is correct
19 Correct 71 ms 11224 KB Output is correct
20 Correct 29 ms 5956 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory 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 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 468 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 8 ms 984 KB Output is correct
20 Correct 19 ms 1096 KB Output is correct
21 Correct 37 ms 1564 KB Output is correct
22 Correct 34 ms 1620 KB Output is correct
23 Correct 35 ms 872 KB Output is correct
24 Correct 36 ms 1112 KB Output is correct
25 Correct 28 ms 4668 KB Output is correct
26 Correct 29 ms 4740 KB Output is correct
27 Correct 29 ms 2640 KB Output is correct
28 Correct 30 ms 4672 KB Output is correct
29 Correct 35 ms 4700 KB Output is correct
30 Correct 35 ms 2664 KB Output is correct
31 Correct 35 ms 1112 KB Output is correct
32 Correct 32 ms 856 KB Output is correct
33 Correct 30 ms 2712 KB Output is correct
34 Correct 30 ms 4684 KB Output is correct
35 Correct 22 ms 4648 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 528 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 728 KB Output is correct
43 Correct 4 ms 1112 KB Output is correct
44 Correct 8 ms 1812 KB Output is correct
45 Correct 14 ms 916 KB Output is correct
46 Correct 93 ms 5072 KB Output is correct
47 Correct 38 ms 3656 KB Output is correct
48 Correct 70 ms 10180 KB Output is correct
49 Correct 79 ms 6692 KB Output is correct
50 Correct 108 ms 7680 KB Output is correct
51 Correct 51 ms 6972 KB Output is correct
52 Correct 39 ms 6220 KB Output is correct
53 Correct 60 ms 11076 KB Output is correct
54 Correct 71 ms 11224 KB Output is correct
55 Correct 29 ms 5956 KB Output is correct
56 Correct 104 ms 1264 KB Output is correct
57 Correct 370 ms 9288 KB Output is correct
58 Correct 753 ms 34144 KB Output is correct
59 Correct 1456 ms 133116 KB Output is correct
60 Correct 1748 ms 133332 KB Output is correct
61 Correct 2966 ms 133768 KB Output is correct
62 Execution timed out 4059 ms 19040 KB Time limit exceeded
63 Halted 0 ms 0 KB -