# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883289 | AI_2512 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3059 ms | 77068 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 main() {
long long n,m;
cin >> n >> m;
vector<int> books(n);
vector<vector<int>> days(m,vector<int>(3));
for (int i = 0; i <n; i++){
cin >> books[i];
}
for (int i = 0; i<m; i++){
cin >>days[i][0] >> days[i][1] >> days[i][2];
vector<int> vec(books.begin()+days[i][0]-1, books.begin()+days[i][1]);
bool broken = false;
while (is_sorted(vec.begin(), vec.end()) == false){
for (int k = 0;k < vec.size()-1;k++){
if (vec[k] > vec[k+1]){
if (vec[k]+vec[k+1] <=days[i][2]){
int t = vec[k];
vec[k] = vec[k+1];
vec[k+1] = t;
}else{
broken = true;
break;
}
}
}
if (broken){
break;
}
}
if (broken){
cout << 0 << "\n";
}else{
cout << 1 << "\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... |