# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425032 | zoooma13 | The short shank; Redemption (BOI21_prison) | C++14 | 95 ms | 9980 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;
int main()
{
int n ,k ,T;
scanf("%d%d%d",&n,&k,&T);
assert(k == 1);
vector <int> a(n);
for(int&i : a)
scanf("%d",&i);
int ans = 0;
vector <pair<int ,int>> rs;
deque <pair<int ,int>> q;
for(int i = 0; i < n; i++){
while(!q.empty() && q.front().first > T-i)
q.pop_front();
if(a[i] <= T){
while(!q.empty() && q.back().first >= a[i]-i)
q.pop_back();
q.push_back({a[i]-i ,i});
}else if(!q.empty())
rs.push_back({q.back().second ,i-1});
else
ans++;
}
vector <int> cum(n+1);
for(auto&p : rs){
cum[p.first]++;
cum[p.second+1]--;
}
int mx = 0;
for(int i = 0; i < n; i++){
cum[i] += i? cum[i-1] : 0;
mx = max(mx ,cum[i]);
}
printf("%d\n",n-ans-mx);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |