oj.uz

답안 #207077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207077 2020-03-06T10:50:20 Z Saboon Fire (JOI20_ho_t5) C++14
8 / 100
 1000 ms 96384 KB 
#include<bits/stdc++.h> 
using namespace std; 
  
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math") 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0) 
#define F first 
#define S second 
#define int long long 
const int maxn = 2e5 + 12; 
vector <pair <pair <int, int>, pair <pair <int, int> , int> > > Q; 
int n, q; 
int L[maxn], R[maxn]; 
int LQ[maxn], RQ[maxn], TQ[maxn]; 
int ans[maxn], seg[16 * maxn], lazy[16 * maxn], a[maxn]; 
  
inline void shift(int id, int l, int r) { 
    if(lazy[id] == 0) return; 
    int val = lazy[id]; 
    lazy[id] = 0; 
    int mid = (l + r) >> 1; 
    if(l == r - 1) return; 
    seg[id * 2 + 0] += (mid - l) * val; 
    seg[id * 2 + 1] += (r - mid) * val; 
    lazy[id * 2 + 0] += val; 
    lazy[id * 2 + 1] += val; 
    return; 
} 
  
inline void add(int id, int l, int r, int st, int en, int val) { 
    //shift(id, l, r); 
    if(en <= l || r <= st) return; 
    if(st <= l && r <= en) { 
        seg[id] += (r - l) * val; 
        lazy[id] += val; 
        return; 
    } 
    int mid = (l + r) >> 1; 
    shift(id, l, r); 
    add(id * 2 + 0, l, mid, st, en, val); 
    add(id * 2 + 1, mid, r, st, en, val); 
    seg[id] = seg[id * 2 + 0] + seg[id * 2 + 1]; 
    return; 
} 
  
inline int get(int id, int l, int r, int st, int en) { 
    if(en <= l || r <= st) return 0; 
    if(st <= l && r <= en) return seg[id]; 
    shift(id, l, r); 
    int mid = (l + r) >> 1; 
    return get(id * 2 + 0, l, mid, st, en) + 
           get(id * 2 + 1, mid, r, st, en); 
} 
  
//type, time, l, r, val 
//FF FS SFF SFS SS 
bool cmp(pair <pair <int, int>, pair <pair <int, int> , int> > a, pair <pair <int, int>, pair <pair <int, int> , int> > b) { 
    if(a.F.S != b.F.S) return a.F.S < b.F.S; 
    return a.F.F < b.F.F; 
} 
  
int32_t main() { 
    IOS; 
    cin >> n >> q; 
    for (int i = 0; i < n; i++) cin >> a[i]; 
    for (int i = 0; i < q; i++) cin >> TQ[i] >> LQ[i] >> RQ[i], LQ[i]--; 
    vector <pair <int, int> > V; 
    V.push_back({1e9, -maxn + 1}); 
    for (int i = 0; i < n; i++) { 
        while(V.back().F < a[i]) V.pop_back(); 
        L[i] = V.back().S; 
        V.push_back({a[i], i}); 
    } 
    V.clear(); 
    V.push_back({1e9, n}); 
    for (int i = n - 1; i >= 0; i--) { 
        while(V.back().F <= a[i]) V.pop_back(); 
        R[i] = V.back().S; 
        V.push_back({a[i], i}); 
    } 
    V.clear(); 
    for (int i = 0; i < n; i++) { 
        //id, l, r, st, en, val 
        add(1, -maxn, maxn, i + 1, maxn, -a[i]); 
        //type, time,  l,   r,  val 
        //FF     FS    SFF SFS  SS 
        Q.push_back({{0, R[i] - L[i] - 1}, {{L[i] + 1, maxn}, -a[i]}}); 
        Q.push_back({{0, i - L[i]}, {{L[i] + 1, maxn}, a[i]}}); 
        Q.push_back({{0, R[i] - i - 1}, {{i + 1, maxn}, a[i]}}); 
    } 
    for (int i = 0; i < q; i++) { 
        Q.push_back({{1,TQ[i]}, {{LQ[i] - TQ[i], RQ[i] - TQ[i]}, i}}); 
    } 
    sort(Q.begin(), Q.end(), cmp); 
    for (auto x : Q) { 
        if(x.F.F == 1) { 
            ans[x.S.S] += get(1, -maxn + 1, maxn, x.S.F.F, x.S.F.S); 
            continue; 
        } 
        add(1, -maxn + 1, maxn, x.S.F.F, x.S.F.S, x.S.S); 
    } 
    Q.clear(); 
    for (int i = 0; i < 16 * maxn; i++) seg[i] = 0, lazy[i] = 0; 
    for (int i = 0; i < n; i++) { 
        add(1, -maxn + 1, maxn, i, maxn, a[i]); 
        Q.push_back({{0, i - L[i]}, {{i, maxn}, -a[i]}}); 
        Q.push_back({{0, R[i] - i - 1}, {{R[i], maxn}, -a[i]}}); 
        Q.push_back({{0, R[i] - L[i] - 1}, {{R[i], maxn}, a[i]}}); 
    } 
    for (int i = 0; i < q; i++) { 
        Q.push_back({{1,TQ[i]}, {{LQ[i], RQ[i]}, i}}); 
    } 
    sort(Q.begin(), Q.end(), cmp); 
    for (auto x : Q) { 
        if(x.F.F == 1) { 
            ans[x.S.S] += get(1, -maxn + 1, maxn, x.S.F.F, x.S.F.S); 
            continue; 
        } 
        add(1, -maxn + 1, maxn, x.S.F.F, x.S.F.S, x.S.S); 
    } 
    for (int i = 0; i < q; i++) cout << ans[i] << '\n'; 
    return 0; 
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 50552 KB Output is correct
2 Correct 32 ms 50552 KB Output is correct
3 Correct 36 ms 50560 KB Output is correct
4 Correct 36 ms 50552 KB Output is correct
5 Correct 38 ms 50552 KB Output is correct
6 Correct 39 ms 50552 KB Output is correct
7 Correct 30 ms 50552 KB Output is correct
8 Correct 32 ms 50552 KB Output is correct
9 Correct 39 ms 50552 KB Output is correct
10 Correct 30 ms 50552 KB Output is correct
11 Correct 34 ms 50556 KB Output is correct
12 Correct 29 ms 50552 KB Output is correct
13 Correct 30 ms 50524 KB Output is correct
14 Correct 35 ms 50552 KB Output is correct
15 Correct 36 ms 50552 KB Output is correct
16 Correct 31 ms 50552 KB Output is correct
17 Correct 37 ms 50552 KB Output is correct
18 Correct 32 ms 50552 KB Output is correct
19 Correct 42 ms 50552 KB Output is correct
20 Correct 32 ms 50552 KB Output is correct
21 Correct 36 ms 50552 KB Output is correct
22 Correct 30 ms 50552 KB Output is correct
23 Correct 31 ms 50552 KB Output is correct
24 Correct 37 ms 50680 KB Output is correct
25 Correct 30 ms 50552 KB Output is correct
26 Correct 35 ms 50552 KB Output is correct
27 Correct 29 ms 50552 KB Output is correct
28 Correct 30 ms 50568 KB Output is correct
29 Correct 30 ms 50500 KB Output is correct
30 Correct 30 ms 50552 KB Output is correct
31 Correct 32 ms 50552 KB Output is correct
32 Correct 30 ms 50552 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 50552 KB Output is correct
2 Correct 967 ms 94584 KB Output is correct
3 Correct 930 ms 95752 KB Output is correct
4 Execution timed out 1008 ms 94916 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 50552 KB Output is correct
2 Correct 885 ms 93960 KB Output is correct
3 Correct 858 ms 93196 KB Output is correct
4 Correct 936 ms 94728 KB Output is correct
5 Correct 859 ms 93452 KB Output is correct
6 Correct 908 ms 93836 KB Output is correct
7 Correct 932 ms 93960 KB Output is correct
8 Correct 912 ms 94148 KB Output is correct
9 Correct 942 ms 93576 KB Output is correct
10 Correct 935 ms 92912 KB Output is correct
11 Correct 931 ms 94472 KB Output is correct
12 Correct 920 ms 94060 KB Output is correct
13 Correct 961 ms 94452 KB Output is correct
14 Correct 910 ms 93556 KB Output is correct
15 Correct 937 ms 94216 KB Output is correct
16 Correct 922 ms 93960 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 965 ms 95244 KB Output is correct
2 Correct 940 ms 95368 KB Output is correct
3 Correct 938 ms 96384 KB Output is correct
4 Correct 957 ms 95328 KB Output is correct
5 Execution timed out 1000 ms 95420 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 50552 KB Output is correct
2 Correct 32 ms 50552 KB Output is correct
3 Correct 36 ms 50560 KB Output is correct
4 Correct 36 ms 50552 KB Output is correct
5 Correct 38 ms 50552 KB Output is correct
6 Correct 39 ms 50552 KB Output is correct
7 Correct 30 ms 50552 KB Output is correct
8 Correct 32 ms 50552 KB Output is correct
9 Correct 39 ms 50552 KB Output is correct
10 Correct 30 ms 50552 KB Output is correct
11 Correct 34 ms 50556 KB Output is correct
12 Correct 29 ms 50552 KB Output is correct
13 Correct 30 ms 50524 KB Output is correct
14 Correct 35 ms 50552 KB Output is correct
15 Correct 36 ms 50552 KB Output is correct
16 Correct 31 ms 50552 KB Output is correct
17 Correct 37 ms 50552 KB Output is correct
18 Correct 32 ms 50552 KB Output is correct
19 Correct 42 ms 50552 KB Output is correct
20 Correct 32 ms 50552 KB Output is correct
21 Correct 36 ms 50552 KB Output is correct
22 Correct 30 ms 50552 KB Output is correct
23 Correct 31 ms 50552 KB Output is correct
24 Correct 37 ms 50680 KB Output is correct
25 Correct 30 ms 50552 KB Output is correct
26 Correct 35 ms 50552 KB Output is correct
27 Correct 29 ms 50552 KB Output is correct
28 Correct 30 ms 50568 KB Output is correct
29 Correct 30 ms 50500 KB Output is correct
30 Correct 30 ms 50552 KB Output is correct
31 Correct 32 ms 50552 KB Output is correct
32 Correct 30 ms 50552 KB Output is correct
33 Correct 978 ms 94600 KB Output is correct
34 Correct 982 ms 95368 KB Output is correct
35 Execution timed out 1016 ms 95024 KB Time limit exceeded
36 Halted 0 ms 0 KB -