oj.uz

Submission #587168

# Submission time Handle Problem Language Result Execution time Memory
587168 2022-07-01T12:22:52 Z MasterTaster Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 76996 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 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;
    if (ind<=mid) upd(2*node, l, mid, ind, val);
    else 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});
        if (lg[i]!=0) 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 > >());
 
    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:67: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]
   67 |     for (int i=0; i<all.size(); i++)
      |                   ~^~~~~~~~~~~
sortbooks.cpp:69:13: warning: unused variable 'k' [-Wunused-variable]
   69 |         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 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 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 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 9 ms 596 KB Output is correct
12 Correct 13 ms 596 KB Output is correct
13 Correct 15 ms 716 KB Output is correct
14 Correct 19 ms 796 KB Output is correct
15 Correct 14 ms 724 KB Output is correct
16 Correct 12 ms 668 KB Output is correct
17 Correct 12 ms 596 KB Output is correct
18 Correct 11 ms 760 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3088 ms 76996 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 8496 KB Output is correct
2 Correct 283 ms 8572 KB Output is correct
3 Correct 266 ms 4576 KB Output is correct
4 Correct 263 ms 4480 KB Output is correct
5 Correct 253 ms 4560 KB Output is correct
6 Correct 272 ms 5076 KB Output is correct
7 Correct 239 ms 5044 KB Output is correct
8 Correct 240 ms 7848 KB Output is correct
9 Correct 212 ms 3740 KB Output is correct
10 Correct 243 ms 7588 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 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 9 ms 596 KB Output is correct
12 Correct 13 ms 596 KB Output is correct
13 Correct 15 ms 716 KB Output is correct
14 Correct 19 ms 796 KB Output is correct
15 Correct 14 ms 724 KB Output is correct
16 Correct 12 ms 668 KB Output is correct
17 Correct 12 ms 596 KB Output is correct
18 Correct 11 ms 760 KB Output is correct
19 Correct 652 ms 16720 KB Output is correct
20 Correct 629 ms 16828 KB Output is correct
21 Correct 657 ms 16744 KB Output is correct
22 Correct 682 ms 16744 KB Output is correct
23 Correct 633 ms 16820 KB Output is correct
24 Correct 570 ms 8784 KB Output is correct
25 Correct 572 ms 8764 KB Output is correct
26 Correct 579 ms 8660 KB Output is correct
27 Correct 577 ms 8664 KB Output is correct
28 Correct 580 ms 8752 KB Output is correct
29 Correct 672 ms 8788 KB Output is correct
30 Correct 586 ms 8788 KB Output is correct
31 Correct 572 ms 8840 KB Output is correct
32 Correct 594 ms 8724 KB Output is correct
33 Correct 562 ms 8640 KB Output is correct
34 Correct 568 ms 8896 KB Output is correct
35 Correct 558 ms 8768 KB Output is correct
36 Correct 565 ms 8808 KB Output is correct
37 Correct 542 ms 8728 KB Output is correct
38 Correct 548 ms 8728 KB Output is correct
39 Correct 534 ms 15480 KB Output is correct
40 Correct 472 ms 9564 KB Output is correct
41 Correct 519 ms 14892 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 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 9 ms 596 KB Output is correct
12 Correct 13 ms 596 KB Output is correct
13 Correct 15 ms 716 KB Output is correct
14 Correct 19 ms 796 KB Output is correct
15 Correct 14 ms 724 KB Output is correct
16 Correct 12 ms 668 KB Output is correct
17 Correct 12 ms 596 KB Output is correct
18 Correct 11 ms 760 KB Output is correct
19 Execution timed out 3088 ms 76996 KB Time limit exceeded
20 Halted 0 ms 0 KB -