제출 #678127

#제출 시각아이디문제언어결과실행 시간메모리
678127ByeWorldHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
2 ms724 KiB
#include <bits/stdc++.h> #define pb push_back using namespace std; const int MAXN = 5e3+5; const int INF = 2e9; const int VOD = 0; int a[MAXN], b[MAXN]; vector <int> v; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for(int i=1; i<=n; i++) cin >> a[i]; while(m--){ v.clear(); int l, r, k; cin >> l >> r >> k; for(int i=l; i<=r; i++) b[i] = a[i]; sort(b+l, b+r+1); for(int i=l; i<=r; i++){ if(b[i] != a[i]) v.pb(b[i]); } int mx = 0; int mn = INF; for(auto in : v){ mx = max(mx, in); mn = min(mn, in); } if(mx+mn <= k) cout << "1\n"; else cout << "0\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...