제출 #344268

#제출 시각아이디문제언어결과실행 시간메모리
344268koketsuHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
17 / 100
3070 ms11772 KiB
#include <bits/stdc++.h> #define pb push_back #define LL long long #define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; const LL Mxn = 1e6 + 7; const LL Mod = 1e9 + 7; const LL Inf = 1e14 + 7; int main() { Kultivator; int N, M, A[Mxn]; cin >> N >> M; for(int i = 1; i <= N; i++){ cin >> A[i]; } while(M--){ int L, R, X, Mx = 0; bool Was = false; cin >> L >> R >> X; for(int i = L; i <= R; i++){ if(Mx + A[i] > X && Mx > A[i]){ Was = true; break; } Mx = max(Mx, A[i]); } if(Was) cout << 0 << '\n'; else cout << 1 << '\n'; } }
#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...