Submission #569664

#TimeUsernameProblemLanguageResultExecution timeMemory
569664SSRSHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
2575 ms32160 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int N, M; cin >> N >> M; vector<int> w(N); for (int i = 0; i < N; i++){ cin >> w[i]; } vector<int> S(N); S[0] = 0; for (int i = 0; i < N - 1; i++){ S[i + 1] = S[i]; if (w[i + 1] > w[i]){ S[i + 1]++; } } for (int i = 0; i < M; i++){ int l, r, k; cin >> l >> r >> k; l--; if (S[r - 1] - S[l] == 0){ cout << 1 << endl; } else { cout << 0 << 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...