제출 #1331256

#제출 시각아이디문제언어결과실행 시간메모리
1331256Mamikonm1코끼리 (Dancing Elephants) (IOI11_elephants)C++17
0 / 100
1 ms344 KiB
#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
vector<int>x;
void init(int N, int L, int X[])
{
    n = N;
    l=L;
    for(int i=0;i<n;++i)x.push_back(X[i]);
}

int update(int i, int y)
{
    x[i]=y;
    sort(begin(x),end(x));
    int ans=0,lf=-(l*2);
    for(int i=0;i<n;++i){
        if(x[i]-lf>l){
            lf=x[i];
            ans++;
        }
    }
    return ans;
}
#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...