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>
#include "koninc.h"
int N, K, t[300005];
void inicjuj(int n, int k, int *D)
{
N = n, K = k;
for (int i = 0; i < n; ++i)
t[i] = D[i];
}
void podlej(int a, int b)
{
for(int i = a; i <= b; i++) {
t[i] += 1;
}
}
int dojrzale(int a, int b)
{
int ans = 0;
for(int i = a; i <= b; i++) {
if(t[i] >= K) {
ans += 1;
}
}
return ans;
}
# | 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... |
# | 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... |