oj.uz

답안 #12999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
12999 2015-01-24T04:40:59 Z gs14004 역사적 조사 (JOI14_historical) C++
100 / 100
 3272 ms 6092 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int sz = 450;

struct q{int s,e,n;}qr[100005];
bool cmp(q a, q b){return a.s / sz == b.s / sz ? (a.e < b.e) : (a.s < b.s);}

int a[100005],n,q;
vector<int> p;
long long res[100005];
int lim;

inline void add(int pos, int val, long long* tree){
    pos += lim;
    tree[pos] += 1ll * val * p[pos-lim];
    while(pos > 1){
        pos >>= 1;
        tree[pos] = max(tree[2*pos],tree[2*pos+1]);
    }
}

inline void solve(){
    long long tree[270000] = {};
    for(lim = 1; lim <= p.size(); lim <<= 1);
    int s = 1, e = 0;
    for (int i=0; i<q; i++) {
        while (s < qr[i].s) {
            add(a[s],-1,tree);
            s++;
        }
        while (qr[i].s < s) {
            s--;
            add(a[s],1,tree);
        }
        while (e < qr[i].e) {
            e++;
            add(a[e],1,tree);
        }
        while (qr[i].e < e) {
            add(a[e],-1,tree);
            e--;
        }
        res[qr[i].n] = tree[1];
    }
}

int main(){
    scanf("%d %d",&n,&q);
    for (int i=1; i<=n; i++) {
        scanf("%d",&a[i]);
        p.push_back(a[i]);
    }
    for (int i=0; i<q; i++) {
        scanf("%d %d",&qr[i].s,&qr[i].e);
        qr[i].n = i;
    }
    sort(qr,qr+q,cmp);
    sort(p.begin(),p.end());
    p.resize(unique(p.begin(),p.end()) - p.begin());
    for (int i=1; i<=n; i++) {
        a[i] = (int)(lower_bound(p.begin(),p.end(),a[i]) - p.begin());
    }
    solve();
    for (int i=0; i<q; i++) {
        printf("%lld\n",res[i]);
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5572 KB Output is correct
2 Correct 0 ms 5568 KB Output is correct
3 Correct 0 ms 5572 KB Output is correct
4 Correct 0 ms 5572 KB Output is correct
5 Correct 0 ms 5568 KB Output is correct
6 Correct 0 ms 5568 KB Output is correct
7 Correct 0 ms 5572 KB Output is correct
8 Correct 0 ms 5576 KB Output is correct
9 Correct 0 ms 5572 KB Output is correct
10 Correct 0 ms 5576 KB Output is correct
11 Correct 0 ms 5576 KB Output is correct
12 Correct 0 ms 5576 KB Output is correct
13 Correct 0 ms 5576 KB Output is correct
14 Correct 0 ms 5576 KB Output is correct
15 Correct 0 ms 5568 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5572 KB Output is correct
2 Correct 0 ms 5568 KB Output is correct
3 Correct 4 ms 5572 KB Output is correct
4 Correct 8 ms 5576 KB Output is correct
5 Correct 20 ms 5572 KB Output is correct
6 Correct 32 ms 5572 KB Output is correct
7 Correct 32 ms 5572 KB Output is correct
8 Correct 20 ms 5576 KB Output is correct
9 Correct 20 ms 5568 KB Output is correct
10 Correct 44 ms 5572 KB Output is correct
11 Correct 40 ms 5572 KB Output is correct
12 Correct 44 ms 5576 KB Output is correct
13 Correct 40 ms 5572 KB Output is correct
14 Correct 40 ms 5576 KB Output is correct
15 Correct 40 ms 5572 KB Output is correct
16 Correct 28 ms 5572 KB Output is correct
17 Correct 12 ms 5568 KB Output is correct
18 Correct 40 ms 5568 KB Output is correct
19 Correct 44 ms 5572 KB Output is correct
20 Correct 44 ms 5576 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5568 KB Output is correct
2 Correct 0 ms 5568 KB Output is correct
3 Correct 0 ms 5572 KB Output is correct
4 Correct 0 ms 5568 KB Output is correct
5 Correct 0 ms 5572 KB Output is correct
6 Correct 0 ms 5572 KB Output is correct
7 Correct 4 ms 5572 KB Output is correct
8 Correct 8 ms 5572 KB Output is correct
9 Correct 16 ms 5700 KB Output is correct
10 Correct 12 ms 5832 KB Output is correct
11 Correct 76 ms 6092 KB Output is correct
12 Correct 36 ms 6092 KB Output is correct
13 Correct 52 ms 6092 KB Output is correct
14 Correct 88 ms 6088 KB Output is correct
15 Correct 128 ms 6088 KB Output is correct
16 Correct 72 ms 6088 KB Output is correct
17 Correct 40 ms 6088 KB Output is correct
18 Correct 76 ms 6092 KB Output is correct
19 Correct 80 ms 6088 KB Output is correct
20 Correct 36 ms 6088 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 5572 KB Output is correct
2 Correct 180 ms 5700 KB Output is correct
3 Correct 408 ms 5700 KB Output is correct
4 Correct 664 ms 5836 KB Output is correct
5 Correct 932 ms 5832 KB Output is correct
6 Correct 1052 ms 5836 KB Output is correct
7 Correct 988 ms 6084 KB Output is correct
8 Correct 808 ms 6088 KB Output is correct
9 Correct 556 ms 6084 KB Output is correct
10 Correct 388 ms 6084 KB Output is correct
11 Correct 784 ms 6088 KB Output is correct
12 Correct 1540 ms 6092 KB Output is correct
13 Correct 2284 ms 6088 KB Output is correct
14 Correct 2972 ms 6088 KB Output is correct
15 Correct 3272 ms 6092 KB Output is correct
16 Correct 3256 ms 6084 KB Output is correct
17 Correct 3212 ms 6088 KB Output is correct
18 Correct 3228 ms 6088 KB Output is correct
19 Correct 3204 ms 6088 KB Output is correct
20 Correct 2976 ms 6088 KB Output is correct
21 Correct 2960 ms 6088 KB Output is correct
22 Correct 2964 ms 6088 KB Output is correct
23 Correct 2920 ms 6084 KB Output is correct
24 Correct 2924 ms 6088 KB Output is correct
25 Correct 272 ms 6088 KB Output is correct