Submission #673264

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
673264	2022-12-20T04:04:42 Z	Alihan_8	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	1523 ms	74264 KB

sortbooks

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    set <pair<int,int>> st;
    for ( int i = 0; i < n; i++ ){
        int j = i+1;
        while ( j < n and p[j-1] <= p[j] ) j++;
        j--;
        st.insert({i+1, j+1});
        i = j;
    }
    auto ok = [&](int l, int r, int k){
        auto it = st.lower_bound({l+1, 0}); it = prev(it);
        if ( it->first <= l and it->second >= r ) return true;
        return false;
    };
    while ( m-- ){
        int l, r, k; cin >> l >> r >> k;
        cout << ok(l, r, k) << ln;
    }

    cout << '\n';
}

Compilation message

sortbooks.cpp: In function 'void IO(std::string)':
sortbooks.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	212 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	212 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1437 ms	41392 KB	Output is correct
2	Correct	1452 ms	41432 KB	Output is correct
3	Correct	1523 ms	74108 KB	Output is correct
4	Correct	1504 ms	74264 KB	Output is correct
5	Correct	419 ms	42956 KB	Output is correct