oj.uz

Submission #231035

# Submission time Handle Problem Language Result Execution time Memory
231035 2020-05-12T12:17:06 Z JooDdae 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 13688 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define mid ((l+r)>>1)
struct query{
    int l, r, id;
    bool operator < (const query &o) const{
        return make_pair(l>>9, r) < make_pair(o.l>>9, o.r);
    }
}q[100100];
int n, m, cnt;
ll x[100100], tree[400400], ans[100100];
map<ll, int> mp;

void update(int id, ll val, int node = 1, int l = 1, int r = cnt){
    if(id < l || r < id) return;
    if(l == r){
        tree[node] += val;
        return;
    }
    update(id, val, node*2, l, mid), update(id, val, node*2+1, mid+1, r);
    tree[node] = max(tree[node*2], tree[node*2+1]);
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin >> x[i], mp[x[i]] = 0;
    for(auto &x : mp) x.second = ++cnt;

    for(int i=1;i<=m;i++) cin >> q[i].l >> q[i].r, q[i].id = i;
    sort(q+1, q+1+m);
    
    int l = 1, r = 0;
    for(int i=1;i<=m;i++){
        while(l > q[i].l) l--, update(mp[x[l]], x[l]);
        while(r < q[i].r) r++, update(mp[x[r]], x[r]);
        while(l < q[i].l) update(mp[x[l]], -x[l]), l++;
        while(r > q[i].r) update(mp[x[r]], -x[r]), r--;

        ans[q[i].id] = tree[1];
    }
    for(int i=1;i<=m;i++) cout << ans[i] << '\n';
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 17 ms 592 KB Output is correct
4 Correct 31 ms 504 KB Output is correct
5 Correct 69 ms 512 KB Output is correct
6 Correct 97 ms 632 KB Output is correct
7 Correct 113 ms 640 KB Output is correct
8 Correct 74 ms 636 KB Output is correct
9 Correct 75 ms 632 KB Output is correct
10 Correct 169 ms 760 KB Output is correct
11 Correct 155 ms 760 KB Output is correct
12 Correct 156 ms 760 KB Output is correct
13 Correct 157 ms 760 KB Output is correct
14 Correct 146 ms 760 KB Output is correct
15 Correct 157 ms 760 KB Output is correct
16 Correct 80 ms 640 KB Output is correct
17 Correct 29 ms 640 KB Output is correct
18 Correct 146 ms 760 KB Output is correct
19 Correct 170 ms 768 KB Output is correct
20 Correct 174 ms 888 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 14 ms 896 KB Output is correct
9 Correct 27 ms 1408 KB Output is correct
10 Correct 13 ms 1024 KB Output is correct
11 Correct 64 ms 4984 KB Output is correct
12 Correct 53 ms 1920 KB Output is correct
13 Correct 94 ms 3320 KB Output is correct
14 Correct 157 ms 7672 KB Output is correct
15 Correct 189 ms 10868 KB Output is correct
16 Correct 212 ms 12536 KB Output is correct
17 Correct 39 ms 2556 KB Output is correct
18 Correct 72 ms 4984 KB Output is correct
19 Correct 127 ms 13688 KB Output is correct
20 Correct 88 ms 11244 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 888 KB Output is correct
2 Correct 660 ms 1528 KB Output is correct
3 Correct 1595 ms 2480 KB Output is correct
4 Correct 2839 ms 3704 KB Output is correct
5 Execution timed out 4074 ms 4352 KB Time limit exceeded
6 Halted 0 ms 0 KB -