oj.uz

답안 #779986

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

# 결과 실행 시간 메모리 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 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 0 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 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 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 0 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 3 ms 984 KB Output is correct
18 Correct 8 ms 1492 KB Output is correct
19 Correct 18 ms 1492 KB Output is correct
20 Correct 42 ms 2576 KB Output is correct
21 Correct 76 ms 2584 KB Output is correct
22 Correct 66 ms 2640 KB Output is correct
23 Correct 71 ms 2636 KB Output is correct
24 Correct 70 ms 2640 KB Output is correct
25 Correct 48 ms 8764 KB Output is correct
26 Correct 54 ms 8764 KB Output is correct
27 Correct 60 ms 4704 KB Output is correct
28 Correct 52 ms 8804 KB Output is correct
29 Correct 58 ms 4740 KB Output is correct
30 Correct 61 ms 4712 KB Output is correct
31 Correct 71 ms 2640 KB Output is correct
32 Correct 63 ms 1620 KB Output is correct
33 Correct 57 ms 4672 KB Output is correct
34 Correct 62 ms 8920 KB Output is correct
35 Correct 42 ms 8792 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 1 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 3 ms 984 KB Output is correct
8 Correct 4 ms 1112 KB Output is correct
9 Correct 8 ms 1748 KB Output is correct
10 Correct 17 ms 964 KB Output is correct
11 Correct 93 ms 4948 KB Output is correct
12 Correct 46 ms 3656 KB Output is correct
13 Correct 70 ms 10176 KB Output is correct
14 Correct 79 ms 6772 KB Output is correct
15 Correct 94 ms 7636 KB Output is correct
16 Correct 49 ms 6976 KB Output is correct
17 Correct 33 ms 6220 KB Output is correct
18 Correct 59 ms 11084 KB Output is correct
19 Correct 59 ms 11232 KB Output is correct
20 Correct 27 ms 6092 KB Output is correct

Subtask #4
0 / 60.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 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 0 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 3 ms 984 KB Output is correct
18 Correct 8 ms 1492 KB Output is correct
19 Correct 18 ms 1492 KB Output is correct
20 Correct 42 ms 2576 KB Output is correct
21 Correct 76 ms 2584 KB Output is correct
22 Correct 66 ms 2640 KB Output is correct
23 Correct 71 ms 2636 KB Output is correct
24 Correct 70 ms 2640 KB Output is correct
25 Correct 48 ms 8764 KB Output is correct
26 Correct 54 ms 8764 KB Output is correct
27 Correct 60 ms 4704 KB Output is correct
28 Correct 52 ms 8804 KB Output is correct
29 Correct 58 ms 4740 KB Output is correct
30 Correct 61 ms 4712 KB Output is correct
31 Correct 71 ms 2640 KB Output is correct
32 Correct 63 ms 1620 KB Output is correct
33 Correct 57 ms 4672 KB Output is correct
34 Correct 62 ms 8920 KB Output is correct
35 Correct 42 ms 8792 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 1 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 984 KB Output is correct
43 Correct 4 ms 1112 KB Output is correct
44 Correct 8 ms 1748 KB Output is correct
45 Correct 17 ms 964 KB Output is correct
46 Correct 93 ms 4948 KB Output is correct
47 Correct 46 ms 3656 KB Output is correct
48 Correct 70 ms 10176 KB Output is correct
49 Correct 79 ms 6772 KB Output is correct
50 Correct 94 ms 7636 KB Output is correct
51 Correct 49 ms 6976 KB Output is correct
52 Correct 33 ms 6220 KB Output is correct
53 Correct 59 ms 11084 KB Output is correct
54 Correct 59 ms 11232 KB Output is correct
55 Correct 27 ms 6092 KB Output is correct
56 Correct 157 ms 2768 KB Output is correct
57 Correct 388 ms 9232 KB Output is correct
58 Correct 554 ms 34252 KB Output is correct
59 Correct 949 ms 67368 KB Output is correct
60 Correct 1154 ms 133352 KB Output is correct
61 Correct 1749 ms 67976 KB Output is correct
62 Correct 2377 ms 19020 KB Output is correct
63 Correct 2737 ms 7500 KB Output is correct
64 Correct 2954 ms 6948 KB Output is correct
65 Correct 2821 ms 5828 KB Output is correct
66 Correct 3724 ms 7280 KB Output is correct
67 Execution timed out 4078 ms 19964 KB Time limit exceeded
68 Halted 0 ms 0 KB -