#include<bits/stdc++.h>
using namespace std;
int a[300005];
void inicjuj(int n, int k, int *D)
{
for(int i=0;i<n;i++)
{
a[i] = max(0, k - D[i]);
}
}
void podlej(int le, int ri)
{
for(int i=le;i<=ri;i++)
a[i]--;
}
int dojrzale(int le, int ri)
{
int cnt=0;
for(int i=le;i<=ri;i++)
if(a[i]<=0)
cnt++;
return cnt;
}
# | 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... |