# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1040342 | Nguyenhuutam | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3078 ms | 13116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
while (m--)
{
int l, r, w;
cin >> l >> r >> w;
vector<int> b(r - l + 1);
for (int j = 0; j < r - l + 1; j++)
{
b[j] = a[l + j];
}
vector<int> c = b;
sort(c.begin(), c.end());
bool res = true;
for (int j = 0; j < c.size(); j++)
{
if (b[j] != c[j])
{
int pos = find(b.begin() + j, b.end(), c[j]) - b.begin();
for (int k = pos; k > j; k--)
{
if (b[k] + b[k - 1] <= w)
swap(b[k], b[k - 1]);
else
{
res = false;
break;
}
}
if (!res)
break;
}
}
if (res) cout << 1 << '\n';
else cout << 0 << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |