Submission #1156467

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156467		hynmj	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	13 / 100	358 ms	18104 KiB

sortbooks

//~~~~~~~~~~~~~MJ®™~~~~~~~~~~~~~
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define ll long long
#define ln cout<<endl
#define int long long
#define vv vector<vi>
#define vp vector<pi>
#define append push_back
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define vi vector<int>
#define ret(x) {cout<<x;return;}
#define ui map<int,int>
#define pi pair<int,int>
#define ff first
#define ss second
using namespace std;
const int INF = 1e18, MOD = 1e9+7, N = 2e5+7;
void solve()
{
    int q;
    int n, k, e, m, ans = 0;
        cin >> n >> q;
        vi a(n);
        rep(n)
        {
            cin >> a[i];
        }
        vi b(n+1);

        int l,r;
        rep(n-1)
            b[i+1] = a[i]>a[i+1];
        rep(i,1,n)
            b[i+1] += b[i];
        rep(q)
        {
            cin >> l >> r >> k;
            if (l == r)
            {
                cout << "1\n";
                continue;
            }
            // cout << l<< " " << r << " ";ln;
            // cout << b[r] << " " << b[l] << " ";ln;
            if (b[--r] - b[--l] == 0)
            {
                cout << "1\n";
            }
            else
            {
                cout << "0\n";
            }
        }





// ln;
     // cout << ans;
    // cout << a.size();
    // for (auto i: b){cout << i << " ";}
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int ans=1;
    //cout<<setprecision(1000);
    // cin>>ans;
    rep(ans){
        // cout << "Case #" << i+1 << ": ";
        solve();ln;}}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 13 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23