| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1344836 | ahmetlbktd4 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++20 | 3095 ms | 8268 KiB |
#include "bits/stdc++.h"
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
int a[n];
for (int i = 0;i < n;i++){
cin >> a[i];
}
while (m--){
int l,r,w;
cin >> l >> r >> w;
l--;r--;
int b[n];
for (int i = 0;i < n;i++){
b[i] = a[i];
}
bool f = 1;
for (int j = 0;j < n-1 && f;j++){
for (int i = l;i < r && f;i++){
if (b[i] + b[i+1] > w && b[i] > b[i+1]){
f = 0;break;
}
if (b[i] > b[i+1] && b[i]+b[i+1] <= w)
swap(b[i],b[i+1]);
}
}
bool b1 = 1;
for (int i = l;i < r;i++){
if (b[i] > b[i+1]){
b1 = 0;break;
}
}
// for (int i = 0;i < n;i++){
// cout << b[i] << " \n"[i==n-1];
// }
cout << b1 << "\n";
}
}| # | 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... | ||||
