이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 2000006
#define INF 0x3f3f3f3f
int sz;
pair <int ,int> tree[2*MAX_N];
void bld(vector<int>&arr){
for(int i=sz; i<(sz<<1); i++)
tree[i] = make_pair(arr[i-sz] ,i-sz);
for(int i=sz-1; i; i--)
tree[i] = min(tree[i<<1] ,tree[i<<1|1]);
}
void upd(int p ,int v){
for(tree[p+=sz].first = v; p>1; p>>=1)
tree[p>>1] = min(tree[p] ,tree[p^1]);
}
pair <int ,int> qry(int l ,int r){
auto res = make_pair(INF ,INF);
for(l+=sz ,r+=sz+1; l<r; l>>=1 ,r>>=1){
if(l&1) res = min(res ,tree[l++]);
if(r&1) res = min(res ,tree[--r]);
}
return res;
}
int main()
{
int n ,k ,T;
scanf("%d%d%d",&n,&k,&T) ,sz = n+1;
vector <int> a(n);
for(int&i : a)
scanf("%d",&i);
int ans = 0;
vector <int> lf(n ,INF);
vector <pair<int ,int>> q;
for(int i = 0; i < n; i++){
while(!q.empty() && q.back().first > T-i)
q.pop_back();
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())
lf[i-1] = q.back().second;
else
ans++;
}
bld(lf);
for(int s = 0; s < k; s++){
vector <int> cum(n+1);
for(int i = 0; i < n; i++) if(lf[i] != INF)
cum[lf[i]]++ ,cum[i+1]--;
for(int i = 0; i <= n; i++)
cum[i] += (i? cum[i-1] : 0);
int rem = max_element(cum.begin() ,cum.end()) - cum.begin();
while(true){
auto q = qry(rem ,n-1);
if(q.first > rem)
break;
lf[q.second] = INF;
upd(q.second ,INF);
ans++;
}
}
printf("%d\n",n-ans);
}
컴파일 시 표준 에러 (stderr) 메시지
prison.cpp: In function 'int main()':
prison.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
31 | scanf("%d%d%d",&n,&k,&T) ,sz = n+1;
| ~~~~~^~~~~~~~~~~~~~~~~~~
prison.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
34 | scanf("%d",&i);
| ~~~~~^~~~~~~~~
# | 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... |