oj.uz

답안 #447012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447012 2021-07-24T08:24:07 Z zaneyu Fire (JOI20_ho_t5) C++14
8 / 100
 1000 ms 69524 KB 
/*input
20 20
2 1 2 2 1 1 1 1 2 2 2 1 2 1 1 2 1 2 1 1
1 1 14
2 3 18
4 10 15
8 2 17
9 20 20
4 8 19
7 2 20
11 1 5
13 2 8
20 1 20
2 12 15
7 1 14
12 7 18
14 2 17
9 19 20
12 12 12
6 2 15
11 2 15
19 12 17
4 1 20
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=4e5+5;
const ll maxlg=__lg(maxn)+2;
/** Interface */

inline int readChar();
template <class T = ll> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );

/** Read */

static const int buf_size = 4096;

inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len)
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    if (pos == len)
        return -1;
    return buf[pos++];
}

inline int readChar() {
    int c = getChar();
    while (c <= 32)
        c = getChar();
    return c;
}

template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}

/** Write */

static int write_pos = 0;
static char write_buf[buf_size];

inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}

template <class T> 
inline void writeInt(T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;

    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}

inline void writeWord( const char *s ) {
    while (*s)
        writeChar(*s++);
}

struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
struct segt{
    ll seg[4*maxn],lazy[4*maxn];
    int n;
    void resize(int _n){
        n=_n;
    } 
    inline void pushdown(int idx,int l,int r){
        if(!lazy[idx]) return;
        if(l==r){
            lazy[idx]=0;
            return;
        }
        int mid=(l+r)/2;
        seg[idx*2]+=lazy[idx]*(mid-l+1);
        seg[idx*2+1]+=lazy[idx]*(r-mid);
        lazy[idx*2]+=lazy[idx];
        lazy[idx*2+1]+=lazy[idx];
        lazy[idx]=0;
    }
    inline void upd(int idx,int l,int r,int ql,int qr,ll x){
        if(ql<=l and r<=qr){
            lazy[idx]+=x;
            seg[idx]+=x*(r-l+1);
            return;
        }
        pushdown(idx,l,r);
        int mid=(l+r)/2;
        if(qr<=mid) upd(idx*2,l,mid,ql,qr,x);
        else if(ql>mid) upd(idx*2+1,mid+1,r,ql,qr,x);
        else upd(idx*2,l,mid,ql,qr,x),upd(idx*2+1,mid+1,r,ql,qr,x);
        seg[idx]=(seg[idx*2]+seg[idx*2+1]);
    }
    inline ll query(int idx,int l,int r,int ql,int qr){
        if(l>qr or r<ql) return 0;
        pushdown(idx,l,r);
        if(ql<=l and r<=qr) return seg[idx];
        int mid=(l+r)/2;
        return (query(idx*2,l,mid,ql,qr)+query(idx*2+1,mid+1,r,ql,qr));
    }
    inline ll query(int l,int r){
        if(l>r) return 0;
        return query(1,0,n-1,l,r);
    }
    inline void upd(int l,int r,ll x){
        if(l>r) return;
        upd(1,0,n-1,l,r,x);
    }
}rect,par;
int n,q;
int arr[maxn];
ll ans[maxn];
vector<pair<pii,int>> upd[maxn];
vector<pair<pii,int>> query[maxn];
inline void tri(int l,int r,int v){
    if(l>r) return;
    //parallelogram-rectangle
    par.upd(l+n,2*n+1,v);
    rect.upd(r+n+1,2*n+1,-v);
    //place where xiao and da intersect
    if((r-l+1)<=n) upd[r-l+1].pb({{l,r},v});
}
int l[maxn],r[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    rect.resize(maxn),par.resize(maxn);
    n=readInt(),q=readInt();
    REP(i,n) arr[i]=readInt();
    vector<int> v;
    REP(i,n){
        while(sz(v) and arr[v.back()]<arr[i]) v.pop_back();
        if(sz(v)) l[i]=v.back();
        else l[i]=-n-1;
        v.pb(i);
    }
    v.clear();
    for(int i=n-1;i>=0;i--){
        while(sz(v) and arr[v.back()]<=arr[i]) v.pop_back();
        if(sz(v)) r[i]=v.back();
        else r[i]=n+1;
        v.pb(i);
    }
    REP(i,n){
        tri(l[i]+1,r[i]-1,arr[i]);
        tri(l[i]+1,i-1,-arr[i]);
        tri(i+1,r[i]-1,-arr[i]);
    }
    REP(i,q){
        int t=readInt(),l=readInt(),r=readInt();
        --l,--r;
        query[t].pb({{l,r},i});
    }
    REP1(i,n){
        for(auto x:upd[i]){
            int l=x.f.f,r=x.f.s,v=x.s;
            par.upd(l+n,2*n+1,-v);
            rect.upd(r+n+1,2*n+1,v);
        }
        for(auto x:query[i]){
            int l=x.f.f,r=x.f.s;
            ans[x.s]=par.query(l-i+n,r-i+n)+rect.query(l+n,r+n);
        }
    }
    REP(i,q) writeInt(ans[i],'\n');
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 19264 KB Output is correct
2 Correct 13 ms 19392 KB Output is correct
3 Correct 14 ms 19396 KB Output is correct
4 Correct 14 ms 19292 KB Output is correct
5 Correct 13 ms 19408 KB Output is correct
6 Correct 11 ms 19276 KB Output is correct
7 Correct 14 ms 19484 KB Output is correct
8 Correct 13 ms 19276 KB Output is correct
9 Correct 15 ms 19276 KB Output is correct
10 Correct 14 ms 19276 KB Output is correct
11 Correct 11 ms 19388 KB Output is correct
12 Correct 13 ms 19276 KB Output is correct
13 Correct 15 ms 19396 KB Output is correct
14 Correct 13 ms 19396 KB Output is correct
15 Correct 16 ms 19392 KB Output is correct
16 Correct 14 ms 19300 KB Output is correct
17 Correct 14 ms 19496 KB Output is correct
18 Correct 15 ms 19276 KB Output is correct
19 Correct 14 ms 19388 KB Output is correct
20 Correct 14 ms 19348 KB Output is correct
21 Correct 12 ms 19404 KB Output is correct
22 Correct 15 ms 19388 KB Output is correct
23 Correct 16 ms 19388 KB Output is correct
24 Correct 11 ms 19276 KB Output is correct
25 Correct 15 ms 19472 KB Output is correct
26 Correct 14 ms 19396 KB Output is correct
27 Correct 11 ms 19384 KB Output is correct
28 Correct 15 ms 19388 KB Output is correct
29 Correct 15 ms 19332 KB Output is correct
30 Correct 12 ms 19276 KB Output is correct
31 Correct 15 ms 19284 KB Output is correct
32 Correct 13 ms 19392 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 19264 KB Output is correct
2 Correct 824 ms 66076 KB Output is correct
3 Correct 773 ms 62828 KB Output is correct
4 Correct 895 ms 63092 KB Output is correct
5 Correct 773 ms 69524 KB Output is correct
6 Correct 850 ms 65660 KB Output is correct
7 Correct 869 ms 66244 KB Output is correct
8 Correct 976 ms 63560 KB Output is correct
9 Correct 845 ms 66156 KB Output is correct
10 Correct 718 ms 62748 KB Output is correct
11 Correct 855 ms 66528 KB Output is correct
12 Correct 847 ms 65412 KB Output is correct
13 Execution timed out 1045 ms 69300 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 19264 KB Output is correct
2 Correct 859 ms 63236 KB Output is correct
3 Correct 858 ms 62640 KB Output is correct
4 Correct 896 ms 64164 KB Output is correct
5 Correct 862 ms 62872 KB Output is correct
6 Correct 752 ms 63312 KB Output is correct
7 Correct 783 ms 63380 KB Output is correct
8 Correct 791 ms 63356 KB Output is correct
9 Correct 814 ms 62972 KB Output is correct
10 Correct 783 ms 62376 KB Output is correct
11 Correct 800 ms 64080 KB Output is correct
12 Correct 795 ms 63620 KB Output is correct
13 Correct 916 ms 63788 KB Output is correct
14 Correct 709 ms 62988 KB Output is correct
15 Correct 839 ms 63936 KB Output is correct
16 Correct 787 ms 63504 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 931 ms 61520 KB Output is correct
2 Correct 798 ms 61588 KB Output is correct
3 Correct 883 ms 62720 KB Output is correct
4 Correct 856 ms 61456 KB Output is correct
5 Execution timed out 1034 ms 61776 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 19264 KB Output is correct
2 Correct 13 ms 19392 KB Output is correct
3 Correct 14 ms 19396 KB Output is correct
4 Correct 14 ms 19292 KB Output is correct
5 Correct 13 ms 19408 KB Output is correct
6 Correct 11 ms 19276 KB Output is correct
7 Correct 14 ms 19484 KB Output is correct
8 Correct 13 ms 19276 KB Output is correct
9 Correct 15 ms 19276 KB Output is correct
10 Correct 14 ms 19276 KB Output is correct
11 Correct 11 ms 19388 KB Output is correct
12 Correct 13 ms 19276 KB Output is correct
13 Correct 15 ms 19396 KB Output is correct
14 Correct 13 ms 19396 KB Output is correct
15 Correct 16 ms 19392 KB Output is correct
16 Correct 14 ms 19300 KB Output is correct
17 Correct 14 ms 19496 KB Output is correct
18 Correct 15 ms 19276 KB Output is correct
19 Correct 14 ms 19388 KB Output is correct
20 Correct 14 ms 19348 KB Output is correct
21 Correct 12 ms 19404 KB Output is correct
22 Correct 15 ms 19388 KB Output is correct
23 Correct 16 ms 19388 KB Output is correct
24 Correct 11 ms 19276 KB Output is correct
25 Correct 15 ms 19472 KB Output is correct
26 Correct 14 ms 19396 KB Output is correct
27 Correct 11 ms 19384 KB Output is correct
28 Correct 15 ms 19388 KB Output is correct
29 Correct 15 ms 19332 KB Output is correct
30 Correct 12 ms 19276 KB Output is correct
31 Correct 15 ms 19284 KB Output is correct
32 Correct 13 ms 19392 KB Output is correct
33 Correct 824 ms 66076 KB Output is correct
34 Correct 773 ms 62828 KB Output is correct
35 Correct 895 ms 63092 KB Output is correct
36 Correct 773 ms 69524 KB Output is correct
37 Correct 850 ms 65660 KB Output is correct
38 Correct 869 ms 66244 KB Output is correct
39 Correct 976 ms 63560 KB Output is correct
40 Correct 845 ms 66156 KB Output is correct
41 Correct 718 ms 62748 KB Output is correct
42 Correct 855 ms 66528 KB Output is correct
43 Correct 847 ms 65412 KB Output is correct
44 Execution timed out 1045 ms 69300 KB Time limit exceeded
45 Halted 0 ms 0 KB -