| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335879 | itslq | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++20 | 1894 ms | 10252 KiB |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, M, l, r, k;
cin >> N >> M;
vector<int> W(N), eq(N);
for (int i = 0; i < N; i++) {
cin >> W[i];
if (i) {
eq[i] = (W[i] >= W[i - 1]);
eq[i] += eq[i - 1];
}
}
while (M--) {
cin >> l >> r >> k;
l--, r--;
if (eq[r] - eq[l] == r - l) {
cout << "1\n";
} else {
cout << "0\n";
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
