oj.uz

답안 #584589

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584589 2022-06-27T15:14:30 Z MasterTaster Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 76928 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:78: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]
   78 |     for (int i=0; i<all.size(); i++)
      |                   ~^~~~~~~~~~~
sortbooks.cpp:80:13: warning: unused variable 'k' [-Wunused-variable]
   80 |         int k=all[i].xx.xx, t=all[i].xx.yy, l=all[i].yy.xx, r=all[i].yy.yy;
      |             ^
sortbooks.cpp:76:9: warning: unused variable 'N' [-Wunused-variable]
   76 |     int N=all.size();
      |         ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 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 2 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 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 2 ms 340 KB Output is correct
11 Correct 8 ms 616 KB Output is correct
12 Correct 9 ms 584 KB Output is correct
13 Correct 10 ms 600 KB Output is correct
14 Correct 15 ms 724 KB Output is correct
15 Correct 15 ms 724 KB Output is correct
16 Correct 15 ms 744 KB Output is correct
17 Correct 12 ms 728 KB Output is correct
18 Correct 13 ms 724 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3081 ms 76928 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 288 ms 9968 KB Output is correct
2 Correct 280 ms 8568 KB Output is correct
3 Correct 271 ms 8716 KB Output is correct
4 Correct 275 ms 8832 KB Output is correct
5 Correct 266 ms 8568 KB Output is correct
6 Correct 276 ms 8828 KB Output is correct
7 Correct 265 ms 8880 KB Output is correct
8 Correct 256 ms 9168 KB Output is correct
9 Correct 194 ms 4704 KB Output is correct
10 Correct 262 ms 8876 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 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 2 ms 340 KB Output is correct
11 Correct 8 ms 616 KB Output is correct
12 Correct 9 ms 584 KB Output is correct
13 Correct 10 ms 600 KB Output is correct
14 Correct 15 ms 724 KB Output is correct
15 Correct 15 ms 724 KB Output is correct
16 Correct 15 ms 744 KB Output is correct
17 Correct 12 ms 728 KB Output is correct
18 Correct 13 ms 724 KB Output is correct
19 Correct 660 ms 16956 KB Output is correct
20 Correct 650 ms 16944 KB Output is correct
21 Correct 663 ms 17892 KB Output is correct
22 Correct 661 ms 18436 KB Output is correct
23 Correct 672 ms 17264 KB Output is correct
24 Correct 651 ms 17296 KB Output is correct
25 Correct 614 ms 17112 KB Output is correct
26 Correct 641 ms 18264 KB Output is correct
27 Correct 622 ms 17556 KB Output is correct
28 Correct 646 ms 18440 KB Output is correct
29 Correct 632 ms 17400 KB Output is correct
30 Correct 647 ms 18316 KB Output is correct
31 Correct 636 ms 18216 KB Output is correct
32 Correct 631 ms 17560 KB Output is correct
33 Correct 642 ms 18380 KB Output is correct
34 Correct 601 ms 18340 KB Output is correct
35 Correct 595 ms 17252 KB Output is correct
36 Correct 587 ms 17196 KB Output is correct
37 Correct 600 ms 17448 KB Output is correct
38 Correct 622 ms 18316 KB Output is correct
39 Correct 573 ms 17580 KB Output is correct
40 Correct 496 ms 15284 KB Output is correct
41 Correct 558 ms 18428 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 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 2 ms 340 KB Output is correct
11 Correct 8 ms 616 KB Output is correct
12 Correct 9 ms 584 KB Output is correct
13 Correct 10 ms 600 KB Output is correct
14 Correct 15 ms 724 KB Output is correct
15 Correct 15 ms 724 KB Output is correct
16 Correct 15 ms 744 KB Output is correct
17 Correct 12 ms 728 KB Output is correct
18 Correct 13 ms 724 KB Output is correct
19 Execution timed out 3081 ms 76928 KB Time limit exceeded
20 Halted 0 ms 0 KB -