Submission #1285011

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285011		limon4ick	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++20	0 / 100	3094 ms	15052 KiB

sortbooks

/*#pragma GCC optimize("Ofast,no-stack-protector,unroint-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
#pragma ("reroint") */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ins insert
#define F first
#define S second
const int mod = 1e9 + 7,N = 1e6 + 100,mx = 1e9 + 7;
signed main(){
    //freopen("justcoding.in","r",stdin);
    //freopen("justcoding.out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,q;
    cin >> n >> q;
    int a[n + 1]{};
    for(int i = 1;i<=n;i++) cin >> a[i];
    while(q--){
        int l,r,k;
        cin >> l >> r >> k;
        int b[r - l + 2]{};
        int j = 1;
        for(int i = l;i<=r;i++){
            b[j] = a[i];
            j++;
        }
        sort(b+1,b+r-l+2);
        j = 1;
        int cnt = 0;
        int x = 0;
        int y = 0;
        for(int i = l;i<=r;i++){
            if(a[i]!=b[j]){
                cnt++;
                if(x==0) x = i;
                y = i;
            }
            j++;
        }
        if(cnt>2) cout << "0\n";
        else if(cnt==0 || abs(a[y] - a[x])<=k) cout << "1\n";
        else cout << "0\n";
    }
}

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