제출 #1241057

#제출 시각아이디문제언어결과실행 시간메모리
1241057adriines06Dancing Elephants (IOI11_elephants)C++20
26 / 100
9085 ms1604 KiB
#include "elephants.h" #include<bits/stdc++.h> using namespace std; int n,l; multiset<int>s; vector<int>p; void init(int N, int L, int X[]) { n = N,l=L; p.resize(n); for(int i=0;i<n;i++){ s.insert(X[i]); p[i]=X[i]; } } int update(int i, int y) { if(n==1) return 1; s.erase(p[i]); s.insert(y); p[i]=y; auto f=s.end(); f--; int xf=*f,pos=*s.begin(),cont=0; while(pos<=xf){ int sig=pos+l+1; auto it=s.lower_bound(sig); if(it==s.end()){ pos=xf+1; } else{ pos=*it; } cont++; } return cont; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...