# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47458 | mirbek01 | Worst Reporter 3 (JOI18_worst_reporter3) | C++17 | 2053 ms | 8508 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 2;
long long n, q, d[N], p[N];
int main(){
cin >> n >> q;
int cn = 0;
for(int i = 1; i <= n; i ++){
cin >> d[i];
if(d[i] == 1) cn ++;
}
if(cn == n){
for(int i = 1; i <= q; i ++){
int t, l, r;
cin >> t >> l >> r;
int L = t - n, R = t;
if(l > R || L > r) {
cout << 0 << endl;
continue;
}
if(l <= L && R <= r){
cout << R - L + 1 << endl;
continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |