oj.uz

Submission #583948

# Submission time Handle Problem Language Result Execution time Memory
583948 2022-06-26T14:25:57 Z MasterTaster Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 1593 ms 158748 KB 
#include<iostream>
#include<map>
#include<vector>
#include<stack>
#include<algorithm>
 
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define pb push_back
#define MAXN 1000005
 
using namespace std;
 
int seg[4*MAXN], n, m, a[MAXN], lg[MAXN];
vector< pair < pii, pii > > all;
vector< pair < pii, int > > order;
int ress[MAXN];
 
void build(int node, int l, int r)
{
    if (l==r) { seg[node]=-1; return; }
    int mid=l+(r-l)/2;
    build(2*node, l, mid);
    build(2*node+1, mid+1, r);
    seg[node]=max(seg[2*node], seg[2*node+1]);
}
 
void upd(int node, int l, int r, int ind, int val)
{
    if (ind>r || ind<l) return;
    if (l==r) { seg[node]=val; return; }
 
    int mid=l+(r-l)/2;
    upd(2*node, l, mid, ind, val);
    upd(2*node+1, mid+1, r, ind, val);
    seg[node]=max(seg[2*node], seg[2*node+1]);
}
 
int maxQuery(int node, int l, int r, int left, int right)
{
    if (left>r || right<l) return -1;
    if (left<=l && right>=r) return seg[node];
 
    int mid=l+(r-l)/2;
    return max(maxQuery(2*node, l, mid, left, right), maxQuery(2*node+1, mid+1, r, left, right));
}
 
int main(){
    cin>>n>>m;
 
    for (int i=1; i<=n; i++) cin>>a[i];
 
    stack<pii> st;
    st.push({1000000001, 0});
    for (int i=1; i<=n; i++)
    {
        while (st.top().xx<=a[i]) st.pop();
        lg[i]=st.top().yy;
        //cout<<i<<" "<<lg[i]<<endl;
        st.push({a[i], i});
        all.pb({{a[i]+a[lg[i]], 0}, {i, lg[i]}});
    }
 
    for (int i=0; i<m; i++)
    {
        int l, r, k; cin>>l>>r>>k;
        order.pb({{l, r}, k});
        all.pb({{k, i+1}, {l, r}});
    }
 
    sort(all.begin(), all.end(), greater< pair < pii, pii > >());
 
    int N=all.size();
    build(1, 1, N);
    for (int i=0; i<all.size(); i++)
    {
        int k=all[i].xx.xx, t=all[i].xx.yy, l=all[i].yy.xx, r=all[i].yy.yy;
        //cout<<k<<" "<<t<<" "<<l<<" "<<r<<endl;
        if (t==0)
        {
            upd(1, 1, N, l, r);
        }
        else
        {
            int x=maxQuery(1, 1, N, l, r), temp=1;
            //cout<<x<<endl;
            if (x>=l) temp=0;
            ress[t-1]=temp;
        }
    }
 
    for (int i=0; i<m; i++)
    {
        cout<<ress[i]<<endl;
    }
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:77:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (int i=0; i<all.size(); i++)
      |                   ~^~~~~~~~~~~
sortbooks.cpp:79:13: warning: unused variable 'k' [-Wunused-variable]
   79 |         int k=all[i].xx.xx, t=all[i].xx.yy, l=all[i].yy.xx, r=all[i].yy.yy;
      |             ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 724 KB Output is correct
12 Correct 10 ms 712 KB Output is correct
13 Correct 10 ms 724 KB Output is correct
14 Correct 17 ms 976 KB Output is correct
15 Correct 15 ms 1000 KB Output is correct
16 Correct 14 ms 960 KB Output is correct
17 Correct 13 ms 924 KB Output is correct
18 Correct 13 ms 848 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1593 ms 158748 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 9588 KB Output is correct
2 Correct 288 ms 11612 KB Output is correct
3 Correct 270 ms 11576 KB Output is correct
4 Correct 274 ms 11512 KB Output is correct
5 Correct 279 ms 11528 KB Output is correct
6 Correct 265 ms 11436 KB Output is correct
7 Correct 330 ms 11528 KB Output is correct
8 Correct 268 ms 11252 KB Output is correct
9 Correct 203 ms 6264 KB Output is correct
10 Correct 302 ms 11352 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 724 KB Output is correct
12 Correct 10 ms 712 KB Output is correct
13 Correct 10 ms 724 KB Output is correct
14 Correct 17 ms 976 KB Output is correct
15 Correct 15 ms 1000 KB Output is correct
16 Correct 14 ms 960 KB Output is correct
17 Correct 13 ms 924 KB Output is correct
18 Correct 13 ms 848 KB Output is correct
19 Correct 643 ms 25600 KB Output is correct
20 Correct 640 ms 25488 KB Output is correct
21 Correct 632 ms 25260 KB Output is correct
22 Correct 678 ms 25236 KB Output is correct
23 Correct 656 ms 25208 KB Output is correct
24 Correct 608 ms 25184 KB Output is correct
25 Correct 630 ms 25252 KB Output is correct
26 Correct 637 ms 25452 KB Output is correct
27 Correct 663 ms 25368 KB Output is correct
28 Correct 673 ms 25364 KB Output is correct
29 Correct 651 ms 25536 KB Output is correct
30 Correct 632 ms 25520 KB Output is correct
31 Correct 642 ms 25452 KB Output is correct
32 Correct 654 ms 25348 KB Output is correct
33 Correct 668 ms 25480 KB Output is correct
34 Correct 617 ms 25116 KB Output is correct
35 Correct 597 ms 25000 KB Output is correct
36 Correct 633 ms 24892 KB Output is correct
37 Correct 589 ms 24912 KB Output is correct
38 Correct 597 ms 25096 KB Output is correct
39 Correct 593 ms 24024 KB Output is correct
40 Correct 545 ms 21636 KB Output is correct
41 Correct 549 ms 23568 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 724 KB Output is correct
12 Correct 10 ms 712 KB Output is correct
13 Correct 10 ms 724 KB Output is correct
14 Correct 17 ms 976 KB Output is correct
15 Correct 15 ms 1000 KB Output is correct
16 Correct 14 ms 960 KB Output is correct
17 Correct 13 ms 924 KB Output is correct
18 Correct 13 ms 848 KB Output is correct
19 Runtime error 1593 ms 158748 KB Execution killed with signal 11
20 Halted 0 ms 0 KB -