oj.uz

Submission #12993

# Submission time Handle Problem Language Result Execution time Memory
12993 2015-01-24T04:21:07 Z gs14004 역사적 조사 (JOI14_historical) C++
40 / 100
 4000 ms 6472 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int sz = 250;

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

struct seg{
    long long tree[270000];
    int lim;
    void init(int n){
        for(lim = 1; lim <= n; lim<<= 1);
    }
    void add(int pos, int val){
        pos += lim;
        tree[pos] += 1ll * val * p[pos-lim];
        while(pos > 1){
            pos >>= 1;
            tree[pos] = max(tree[2*pos],tree[2*pos+1]);
        }
    }
    long long q(){return tree[1];}
}seg;

void solve(){
    seg.init(n);
    int s = 1, e = 0;
    for (int i=0; i<q; i++) {
        while (s < qr[i].s) {
            seg.add(a[s],-1);
            s++;
        }
        while (qr[i].s < s) {
            s--;
            seg.add(a[s],1);
        }
        while (e < qr[i].e) {
            e++;
            seg.add(a[e],1);
        }
        while (qr[i].e < e) {
            seg.add(a[e],-1);
            e--;
        }
        res[qr[i].n] = seg.q();
    }
}

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5700 KB Output is correct
2 Correct 0 ms 5700 KB Output is correct
3 Correct 0 ms 5700 KB Output is correct
4 Correct 0 ms 5700 KB Output is correct
5 Correct 0 ms 5700 KB Output is correct
6 Correct 0 ms 5700 KB Output is correct
7 Correct 0 ms 5700 KB Output is correct
8 Correct 0 ms 5700 KB Output is correct
9 Correct 0 ms 5700 KB Output is correct
10 Correct 0 ms 5700 KB Output is correct
11 Correct 0 ms 5700 KB Output is correct
12 Correct 0 ms 5700 KB Output is correct
13 Correct 0 ms 5700 KB Output is correct
14 Correct 0 ms 5700 KB Output is correct
15 Correct 0 ms 5700 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5700 KB Output is correct
2 Correct 0 ms 5700 KB Output is correct
3 Correct 4 ms 5700 KB Output is correct
4 Correct 8 ms 5700 KB Output is correct
5 Correct 20 ms 5700 KB Output is correct
6 Correct 28 ms 5700 KB Output is correct
7 Correct 32 ms 5700 KB Output is correct
8 Correct 36 ms 5700 KB Output is correct
9 Correct 32 ms 5700 KB Output is correct
10 Correct 28 ms 5700 KB Output is correct
11 Correct 32 ms 5700 KB Output is correct
12 Correct 32 ms 5700 KB Output is correct
13 Correct 32 ms 5700 KB Output is correct
14 Correct 36 ms 5700 KB Output is correct
15 Correct 32 ms 5700 KB Output is correct
16 Correct 32 ms 5700 KB Output is correct
17 Correct 36 ms 5700 KB Output is correct
18 Correct 32 ms 5700 KB Output is correct
19 Correct 32 ms 5700 KB Output is correct
20 Correct 36 ms 5700 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5700 KB Output is correct
2 Correct 0 ms 5700 KB Output is correct
3 Correct 0 ms 5700 KB Output is correct
4 Correct 0 ms 5700 KB Output is correct
5 Correct 0 ms 5700 KB Output is correct
6 Correct 0 ms 5700 KB Output is correct
7 Correct 4 ms 5700 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 8 ms 5832 KB Output is correct
10 Correct 20 ms 6088 KB Output is correct
11 Correct 80 ms 6472 KB Output is correct
12 Correct 48 ms 6472 KB Output is correct
13 Correct 56 ms 6472 KB Output is correct
14 Correct 72 ms 6472 KB Output is correct
15 Correct 112 ms 6472 KB Output is correct
16 Correct 80 ms 6472 KB Output is correct
17 Correct 44 ms 6472 KB Output is correct
18 Correct 80 ms 6472 KB Output is correct
19 Correct 80 ms 6472 KB Output is correct
20 Correct 36 ms 6472 KB Output is correct

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 5700 KB Output is correct
2 Correct 232 ms 5832 KB Output is correct
3 Correct 452 ms 5832 KB Output is correct
4 Correct 788 ms 6088 KB Output is correct
5 Correct 1164 ms 6088 KB Output is correct
6 Correct 1488 ms 6088 KB Output is correct
7 Correct 2136 ms 6472 KB Output is correct
8 Correct 3012 ms 6472 KB Output is correct
9 Correct 3888 ms 6472 KB Output is correct
10 Execution timed out 4000 ms 6472 KB Program timed out
11 Halted 0 ms 0 KB -