oj.uz

답안 #497901

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497901 2021-12-24T04:35:08 Z Nalrimet Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 1371 ms 67628 KB 
#include<bits/stdc++.h>

//#pragma GCC optimization("g", on)
//#pragma GCC optimize ("inline")
//#pragma GCC optimization("03")
//#pragma GCC optimization("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popused,abm,mmx,avx,tune=native")
using namespace std;

const int N = 1e6 + 5;
const long long inf = 2000000000;
#define ll long long

#define F first
#define S second
#define pb push_back

int n, m, a[N], l[N], r[N], k[N];
int t[4 * N], mx;
bool ans[N];
vector<int> v[N];

void update(int pos, int val, int tl = 0, int tr = n, int v = 1){
    if(tl == tr) {
        t[v] = max(t[v], val);
    }
    else{
        int tm = (tl + tr) / 2;
        if(pos <= tm) update(pos, val, tl, tm, v * 2);
        else update(pos, val, tm + 1, tr, v * 2 + 1);
        t[v] = max(t[v * 2], t[v * 2 + 1]);
    }
}

int get(int v, int tl, int tr, int l, int r){
    if(l <= tl && tr <= r) return t[v];
    if(l > tr || r < tl) return 0;
    int tm = (tl + tr) / 2;
    return max(get(v * 2, tl, tm, l, r), get(v * 2 + 1, tm + 1, tr, l, r));
}


 main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;

    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }

    for(int i = 1; i <= m; ++i){
        cin >> l[i] >> r[i] >> k[i];
        v[r[i]].pb(i);
    }

    stack<int> st;
    st.push(0);
    a[0] = inf;

    for(int i = 1; i <= n; ++i){
        while(a[st.top()] <= a[i]) st.pop();
        if(st.top() != 0) update(st.top(), a[st.top()] + a[i]);
        st.push(i);
        for(auto to : v[i]){
            mx = get(1, 1, n, l[to], i);
            if(mx <= k[to]) ans[to] = 1;
        }
    }

    for(int i = 1; i <= m; ++i){
        cout << ans[i] << '\n';
    }
}

Compilation message

sortbooks.cpp:45:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 |  main() {
      |  ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 13 ms 23736 KB Output is correct
3 Incorrect 12 ms 23756 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 13 ms 23736 KB Output is correct
3 Incorrect 12 ms 23756 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1371 ms 67628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 28292 KB Output is correct
2 Correct 95 ms 27588 KB Output is correct
3 Correct 80 ms 27012 KB Output is correct
4 Correct 80 ms 27116 KB Output is correct
5 Correct 84 ms 27180 KB Output is correct
6 Correct 70 ms 26132 KB Output is correct
7 Correct 75 ms 26172 KB Output is correct
8 Correct 78 ms 27228 KB Output is correct
9 Correct 45 ms 25792 KB Output is correct
10 Correct 90 ms 27236 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 13 ms 23736 KB Output is correct
3 Incorrect 12 ms 23756 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 13 ms 23736 KB Output is correct
3 Incorrect 12 ms 23756 KB Output isn't correct
4 Halted 0 ms 0 KB -