oj.uz

Submission #584590

# Submission time Handle Problem Language Result Execution time Memory
584590 2022-06-27T15:17:33 Z MasterTaster Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 77040 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;
    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});
        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 2 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 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 2 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 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 9 ms 700 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 15 ms 724 KB Output is correct
15 Correct 15 ms 796 KB Output is correct
16 Correct 13 ms 724 KB Output is correct
17 Correct 12 ms 664 KB Output is correct
18 Correct 12 ms 768 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 8576 KB Output is correct
2 Correct 274 ms 8480 KB Output is correct
3 Correct 261 ms 4536 KB Output is correct
4 Correct 267 ms 4560 KB Output is correct
5 Correct 252 ms 4532 KB Output is correct
6 Correct 236 ms 5092 KB Output is correct
7 Correct 236 ms 5056 KB Output is correct
8 Correct 236 ms 7832 KB Output is correct
9 Correct 236 ms 3820 KB Output is correct
10 Correct 238 ms 7752 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 2 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 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 9 ms 700 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 15 ms 724 KB Output is correct
15 Correct 15 ms 796 KB Output is correct
16 Correct 13 ms 724 KB Output is correct
17 Correct 12 ms 664 KB Output is correct
18 Correct 12 ms 768 KB Output is correct
19 Correct 689 ms 16816 KB Output is correct
20 Correct 639 ms 16756 KB Output is correct
21 Correct 619 ms 16816 KB Output is correct
22 Correct 655 ms 16796 KB Output is correct
23 Correct 619 ms 16892 KB Output is correct
24 Correct 546 ms 8664 KB Output is correct
25 Correct 551 ms 8616 KB Output is correct
26 Correct 580 ms 8816 KB Output is correct
27 Correct 568 ms 8724 KB Output is correct
28 Correct 549 ms 8756 KB Output is correct
29 Correct 570 ms 8664 KB Output is correct
30 Correct 571 ms 8640 KB Output is correct
31 Correct 566 ms 8692 KB Output is correct
32 Correct 566 ms 8728 KB Output is correct
33 Correct 586 ms 8608 KB Output is correct
34 Correct 553 ms 8760 KB Output is correct
35 Correct 551 ms 8700 KB Output is correct
36 Correct 534 ms 8720 KB Output is correct
37 Correct 548 ms 8804 KB Output is correct
38 Correct 543 ms 8788 KB Output is correct
39 Correct 541 ms 15452 KB Output is correct
40 Correct 491 ms 9484 KB Output is correct
41 Correct 521 ms 14924 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 2 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 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 9 ms 700 KB Output is correct
13 Correct 10 ms 632 KB Output is correct
14 Correct 15 ms 724 KB Output is correct
15 Correct 15 ms 796 KB Output is correct
16 Correct 13 ms 724 KB Output is correct
17 Correct 12 ms 664 KB Output is correct
18 Correct 12 ms 768 KB Output is correct
19 Execution timed out 3101 ms 77040 KB Time limit exceeded
20 Halted 0 ms 0 KB -