Submission #883327

#TimeUsernameProblemLanguageResultExecution timeMemory
883327AI_2512Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
17 / 100
3055 ms66892 KiB
#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++){ int l,r,ki; cin >> l >> r >> ki; vector<int> vec(books.begin()+l-1, books.begin()+r); bool broken = false; for (int k = 0;k < r-l;k++){ if (vec[k] > vec[k+1]){ if (vec[k]+vec[k+1] <= ki){ swap(vec[k], vec[k+1]); }else{ broken = true; break; } } } if (broken){ cout << 0 << "\n"; }else{ cout << 1 << "\n"; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...