oj.uz

답안 #393675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393675 2021-04-24T08:28:18 Z 79brue Fire (JOI20_ho_t5) C++14
1 / 100
 1000 ms 61184 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;

struct Query{
    int l, r, idx;
    Query(){}
    Query(int l, int r, int idx): l(l), r(r), idx(idx){}
};

struct maxSegmentTree{
    ll tree[800002];
    void init(int i, int l, int r, ll A[]){
        if(l==r){
            tree[i] = A[l];
            return;
        }
        int m = (l+r)>>1;
        init(i*2, l, m, A);
        init(i*2+1, m+1, r, A);
        tree[i] = max(tree[i*2], tree[i*2+1]);
    }

    int biggerLim(int i, int l, int r, int x, ll lim, int dir){ /// bigger than lim / dir=0: left, dir=1: right
        if(tree[i] <= lim) return dir==0 ? l-1 : r+1;
        if(l==r) return l;
        int m = (l+r)>>1;
        if(dir == 0){
            if(x<=m) return biggerLim(i*2, l, m, x, lim, dir);
            int tmp = biggerLim(i*2+1, m+1, r, x, lim, dir);
            if(tmp > m) return tmp;
            return biggerLim(i*2, l, m, x, lim, dir);
        }
        else{
            if(m<x) return biggerLim(i*2+1, m+1, r, x, lim, dir);
            int tmp = biggerLim(i*2, l, m, x, lim, dir);
            if(tmp <= m) return tmp;
            return biggerLim(i*2+1, m+1, r, x, lim, dir);
        }
    }
} maxSeg;

struct lazySegmentTree{
    ll tree[1600002], lazy[1600002];

    void propagate(int i, int l, int r){
        tree[i] += lazy[i] * (r-l+1);
        if(l!=r){
            lazy[i*2] += lazy[i];
            lazy[i*2+1] += lazy[i];
        }
        lazy[i] = 0;
    }

    void addRange(int i, int l, int r, int s, int e, ll val){
        propagate(i, l, r);
        if(r<s || e<l) return;
        if(s<=l && r<=e){
            lazy[i] += val;
            propagate(i, l, r);
            return;
        }
        int m = (l+r)>>1;
        addRange(i*2, l, m, s, e, val);
        addRange(i*2+1, m+1, r, s, e, val);
        tree[i] = tree[i*2] + tree[i*2+1];
    }

    ll rangeSum(int i, int l, int r, int s, int e){
        propagate(i, l, r);
        if(r<s || e<l) return 0;
        if(s<=l && r<=e) return tree[i];
        int m = (l+r)>>1;
        return rangeSum(i*2, l, m, s, e) + rangeSum(i*2+1, m+1, r, s, e);
    }
} segRight, segDiag;

int n, q;
ll arr[200002];
vector<Query> query[200005];
ll ans[200002];
vector<pair<int, ll> > triangle[200005];

void input();
void makeTriangles();
void sweep();

int main(){
    input();
    makeTriangles();
    sweep();
    for(int i=1; i<=q; i++) printf("%lld\n", ans[i]);
}

void input(){
    scanf("%d %d", &n, &q);
    for(int i=1; i<=n; i++){
        scanf("%lld", &arr[i]);
    }
    for(int i=1; i<=q; i++){
        int t, l, r;
        scanf("%d %d %d", &t, &l, &r);
        query[t+1].push_back(Query(l, r, i));
    }
}

void makeTriangles(){
    maxSeg.init(1, 1, n, arr);
    for(int i=1; i<=n; i++){
        triangle[1].push_back(make_pair(i, arr[i]));
        int rLim = maxSeg.biggerLim(1, 1, n, i+1, arr[i]-1, 1);
        if(i<n && rLim <= n && 1<=rLim-i+1 && rLim-i+1<=n+1)
            triangle[rLim-i+1].push_back(make_pair(rLim, -arr[i]));

        int lLim = maxSeg.biggerLim(1, 1, n, i-1, arr[i], 0);
        if(i>1 && lLim >= 1 && 1<=i-lLim+1 && i-lLim+1<=n+1)
            triangle[i-lLim+1].push_back(make_pair(i, -arr[i]));

        if(i<n && i>1 && rLim <= n && lLim >= 1 &&
           1<=(rLim - i + 1) + (i - lLim + 1) - 1 && (rLim - i + 1) + (i - lLim + 1) - 1 <= n+1){
            triangle[(rLim - i + 1) + (i - lLim + 1) - 1].push_back(make_pair(rLim, arr[i]));
        }
    }
}

void sweep(){
    for(int i=1; i<=n+1; i++){
        for(auto pr: triangle[i]){
            segRight.addRange(1, 1, n, 1, pr.first - 1, -pr.second);
            segDiag.addRange(1, -n, n, -n, pr.first - i, pr.second);
        }

        for(auto qr: query[i]){
            ans[qr.idx] += segRight.rangeSum(1, 1, n, qr.l, qr.r);
            ans[qr.idx] += segDiag.rangeSum(1, -n, n, qr.l - i, qr.r - i);
        }
    }
}

Compilation message

ho_t5.cpp: In function 'void input()':
ho_t5.cpp:101:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  101 |     scanf("%d %d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~
ho_t5.cpp:103:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  103 |         scanf("%lld", &arr[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~
ho_t5.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  107 |         scanf("%d %d %d", &t, &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9748 KB Output is correct
2 Correct 7 ms 9776 KB Output is correct
3 Correct 7 ms 9704 KB Output is correct
4 Correct 7 ms 9780 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 7 ms 9804 KB Output is correct
7 Correct 7 ms 9676 KB Output is correct
8 Correct 7 ms 9776 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9804 KB Output is correct
11 Correct 7 ms 9804 KB Output is correct
12 Correct 7 ms 9804 KB Output is correct
13 Correct 7 ms 9804 KB Output is correct
14 Correct 7 ms 9804 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 7 ms 9804 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 7 ms 9804 KB Output is correct
19 Correct 7 ms 9804 KB Output is correct
20 Correct 7 ms 9784 KB Output is correct
21 Correct 7 ms 9676 KB Output is correct
22 Correct 7 ms 9804 KB Output is correct
23 Correct 7 ms 9804 KB Output is correct
24 Correct 7 ms 9804 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 7 ms 9804 KB Output is correct
27 Correct 7 ms 9804 KB Output is correct
28 Correct 7 ms 9804 KB Output is correct
29 Correct 8 ms 9804 KB Output is correct
30 Correct 7 ms 9724 KB Output is correct
31 Correct 7 ms 9804 KB Output is correct
32 Correct 8 ms 9804 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9748 KB Output is correct
2 Execution timed out 1071 ms 57648 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9748 KB Output is correct
2 Execution timed out 1016 ms 61184 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 965 ms 56608 KB Output is correct
2 Correct 964 ms 58212 KB Output is correct
3 Correct 987 ms 58764 KB Output is correct
4 Correct 993 ms 57032 KB Output is correct
5 Correct 984 ms 58672 KB Output is correct
6 Correct 976 ms 57416 KB Output is correct
7 Correct 990 ms 57448 KB Output is correct
8 Correct 985 ms 58176 KB Output is correct
9 Correct 966 ms 56988 KB Output is correct
10 Correct 970 ms 56904 KB Output is correct
11 Execution timed out 1025 ms 57392 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9748 KB Output is correct
2 Correct 7 ms 9776 KB Output is correct
3 Correct 7 ms 9704 KB Output is correct
4 Correct 7 ms 9780 KB Output is correct
5 Correct 7 ms 9804 KB Output is correct
6 Correct 7 ms 9804 KB Output is correct
7 Correct 7 ms 9676 KB Output is correct
8 Correct 7 ms 9776 KB Output is correct
9 Correct 7 ms 9804 KB Output is correct
10 Correct 7 ms 9804 KB Output is correct
11 Correct 7 ms 9804 KB Output is correct
12 Correct 7 ms 9804 KB Output is correct
13 Correct 7 ms 9804 KB Output is correct
14 Correct 7 ms 9804 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 7 ms 9804 KB Output is correct
17 Correct 7 ms 9804 KB Output is correct
18 Correct 7 ms 9804 KB Output is correct
19 Correct 7 ms 9804 KB Output is correct
20 Correct 7 ms 9784 KB Output is correct
21 Correct 7 ms 9676 KB Output is correct
22 Correct 7 ms 9804 KB Output is correct
23 Correct 7 ms 9804 KB Output is correct
24 Correct 7 ms 9804 KB Output is correct
25 Correct 7 ms 9804 KB Output is correct
26 Correct 7 ms 9804 KB Output is correct
27 Correct 7 ms 9804 KB Output is correct
28 Correct 7 ms 9804 KB Output is correct
29 Correct 8 ms 9804 KB Output is correct
30 Correct 7 ms 9724 KB Output is correct
31 Correct 7 ms 9804 KB Output is correct
32 Correct 8 ms 9804 KB Output is correct
33 Execution timed out 1071 ms 57648 KB Time limit exceeded
34 Halted 0 ms 0 KB -