Submission #167876

#TimeUsernameProblemLanguageResultExecution timeMemory
167876munhorgilHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3060 ms13912 KiB
#include<bits/stdc++.h> #define pb push_back using namespace std; vector < long long > a; int Solve(long long l , long long r , long long k) { long long Max = 0; for(long long c = l - 1 ; c < r ; c++) { if(a[c] >= Max) { Max = a[c]; } else { if(Max + a[c] > k) { return 0; } } } return 1; } int main() { long long n , q , i , x , l , r , k; cin >> n >> q; for(i = 0 ; i < n ; i++) { cin >> x; a.pb(x); } for(i = 0 ; i < q ; i++) { cin >> l >> r >> k; cout << Solve(l , r , k) << endl; } }
#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...