Submission #887303

#	Time	Username	Problem	Language	Result	Execution time	Memory
887303		votranngocvy	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	922 ms	33108 KiB

sortbooks

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

#define int long long
const int N = 1e6 + 5;
int a[N],l[N],r[N],k[N],n,m;

namespace sub1 {
    int b[N];
    void solve() {
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) b[j] = a[j];
            bool check = true;
            for (int j = l[i]; j < r[i]; j++)
                if (b[j] > b[j + 1]) {
                    check = false;
                    break;
                }
            while (!check) {
                bool found = false;
                for (int j = l[i]; j < r[i]; j++)
                    if (b[j] > b[j + 1]) {
                        if (b[j] + b[j + 1] <= k[i]) swap(b[j],b[j + 1]);
                        else found = true;
                        break;
                    }
                if (found) break;
                check = true;
                for (int j = l[i]; j < r[i]; j++)
                if (b[j] > b[j + 1]) {
                    check = false;
                    break;
                }
            }
            cout << check << "\n";
        }
    }
}

namespace sub2 {
    void solve() {
        for (int i = 1; i <= m; i++) {
            set<int>s;
            bool check = true;
            for (int j = r[i]; j >= l[i]; j--) {
                auto it = s.lower_bound(a[j]);
                if (it != s.begin()) {
                    it--;
                    if ((*it) + a[j] > k[i]) {
                        check = false;
                        break;
                    }
                }
                s.insert(a[j]);
            }
            cout << check << "\n";
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= m; i++) cin >> l[i] >> r[i] >> k[i];
    if (n <= 500 && m <= 500) 
        sub1::solve();
    else if (n <= 5000 && m <= 5000)
        sub2::solve(); 
}

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