oj.uz

Submission #1040308

# Submission time Handle Problem Language Result Execution time Memory
1040308 2024-08-01T00:48:48 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 18260 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 18260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 2176 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 2 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -