oj.uz

Submission #583958

# Submission time Handle Problem Language Result Execution time Memory
583958 2022-06-26T14:34:17 Z MasterTaster Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 76984 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[5*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 1 ms 340 KB Output is correct
9 Correct 1 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 11 ms 696 KB Output is correct
14 Correct 15 ms 756 KB Output is correct
15 Correct 15 ms 724 KB Output is correct
16 Correct 14 ms 812 KB Output is correct
17 Correct 13 ms 724 KB Output is correct
18 Correct 13 ms 724 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 8516 KB Output is correct
2 Correct 273 ms 8752 KB Output is correct
3 Correct 273 ms 8580 KB Output is correct
4 Correct 266 ms 8532 KB Output is correct
5 Correct 278 ms 8532 KB Output is correct
6 Correct 269 ms 8664 KB Output is correct
7 Correct 249 ms 8496 KB Output is correct
8 Correct 260 ms 8612 KB Output is correct
9 Correct 197 ms 3812 KB Output is correct
10 Correct 249 ms 8624 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 11 ms 696 KB Output is correct
14 Correct 15 ms 756 KB Output is correct
15 Correct 15 ms 724 KB Output is correct
16 Correct 14 ms 812 KB Output is correct
17 Correct 13 ms 724 KB Output is correct
18 Correct 13 ms 724 KB Output is correct
19 Correct 642 ms 16860 KB Output is correct
20 Correct 636 ms 16932 KB Output is correct
21 Correct 641 ms 16940 KB Output is correct
22 Correct 636 ms 16900 KB Output is correct
23 Correct 618 ms 16932 KB Output is correct
24 Correct 598 ms 16832 KB Output is correct
25 Correct 604 ms 17096 KB Output is correct
26 Correct 616 ms 16848 KB Output is correct
27 Correct 611 ms 16868 KB Output is correct
28 Correct 616 ms 16856 KB Output is correct
29 Correct 622 ms 16912 KB Output is correct
30 Correct 611 ms 16752 KB Output is correct
31 Correct 607 ms 16816 KB Output is correct
32 Correct 636 ms 16812 KB Output is correct
33 Correct 606 ms 16940 KB Output is correct
34 Correct 582 ms 16812 KB Output is correct
35 Correct 580 ms 16924 KB Output is correct
36 Correct 572 ms 16868 KB Output is correct
37 Correct 577 ms 16904 KB Output is correct
38 Correct 580 ms 16856 KB Output is correct
39 Correct 577 ms 16872 KB Output is correct
40 Correct 533 ms 14940 KB Output is correct
41 Correct 555 ms 16804 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 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 596 KB Output is correct
12 Correct 10 ms 596 KB Output is correct
13 Correct 11 ms 696 KB Output is correct
14 Correct 15 ms 756 KB Output is correct
15 Correct 15 ms 724 KB Output is correct
16 Correct 14 ms 812 KB Output is correct
17 Correct 13 ms 724 KB Output is correct
18 Correct 13 ms 724 KB Output is correct
19 Execution timed out 3082 ms 76984 KB Time limit exceeded
20 Halted 0 ms 0 KB -