Submission #1040308

#	Time	Username	Problem	Language	Result	Execution time	Memory
1040308		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3065 ms	18260 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= m; i++)
    {
        bool res = true;
        int l, r, w;
        cin >> l >> r >> w;
        int b[r - l + 2];
        for (int j = 1; j <= r - l + 1; j++)
        {
            b[j] = a[l + j - 1];
        }
        vector<int> c(r - l + 2);
        for (int j = 1; j <= r - l + 1; j++)
        {
            c[j] = b[j];
        }
        sort(c.begin() + 1, c.end());
        int temp = r - l + 1;
        for (int j = 1; j <= temp; j++)
        {
            if (b[j] == c[j])
                continue;
            else
            {
                for (int k = j + 1; k <= temp; k++)
                {
                    if (b[k] == c[j])
                    {
                        for (int p = k; p >= l + 1; p--)
                        {
                            if (b[p] + b[p - 1] <= w)
                                swap(b[p], b[p - 1]);
                            else
                            {
                                res = false;
                                break;
                            }
                        }
                    }
                }
            }
        }
        if (res) cout << 1  << '\n';
        else cout << 0 << '\n';
    }
    return 0;
}

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