제출 #493102

#제출 시각아이디문제언어결과실행 시간메모리
493102AkmalAgzamovHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3071 ms9368 KiB
#include "bits/stdc++.h" using namespace std; void solve(vector<int> v){ int l, r, x; cin >> l >> r >> x; for(int i = l; i <= r; ++i){ for(int j = i; j <= r; ++j){ if(v[j] < v[i]) { if(v[j] + v[i] > x) { cout << "0\n"; return; } } } } cout << 1 << "\n"; } int main(){ int n, q; cin >> n >> q; vector<int> v(n + 1); for(int i = 1; i <= n; ++i) cin >> v[i]; while(q--){ solve(v); } }
#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...