Submission #979816

#	Time	Username	Problem	Language	Result	Execution time	Memory
979816		asdasdqwer	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3083 ms	8544 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

signed main() {
    int n,m;cin>>n>>m;
    vector<int> a(n);
    for (auto &x:a)cin>>x;

    for (int i=0;i<m;i++) {
        vector<int> tmp;
        int l, r,k;cin>>l>>r>>k;l--;r--;
        for (int j=l;j<=r;j++) {
            tmp.push_back(a[j]);
        }

        for (int j=0;j<(int)tmp.size();j++) {
            for (int o=1;o<(int)tmp.size();o++) {
                if (tmp[o-1] > tmp[o] && abs(tmp[o] + tmp[o-1]) <= k) {
                    swap(tmp[o-1], tmp[o]);
                }
            }
        }

        vector<int> tmp2 = tmp;
        sort(tmp.begin(), tmp.end());
        bool pos = true;
        for (int j=0;j<(int)tmp.size();j++) {
            if (tmp[j] != tmp2[j]) {
                pos = false;
                break;
            }
        }

        cout<<pos<<"\n";
    }    
}

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