제출 #119994

#제출 시각아이디문제언어결과실행 시간메모리
119994Osama_Alkhodairy코끼리 (Dancing Elephants) (IOI11_elephants)C++17
0 / 100
2 ms384 KiB
#include <bits/stdc++.h>
#include "elephants.h"
//~ #include "grader.cpp"
using namespace std;

int n, l;
vector <int> a;

void init(int N, int L, int X[]){
    n = N;
    l = L;
    for(int i = 0 ; i < n ; i++){
        a.push_back(X[i]);
    }
}
int update(int i, int y){
    a.erase(a.begin() + i);
    for(int i = 0 ; i < (int)a.size() ; i++){
        if(a[i] > y){
            a.insert(a.begin() + i, y);
            break;
        }
    }
    if((int)a.size() != n) a.push_back(y);
    int cur = a[0];
    int ans = 1;
    for(auto &i : a){
        if(cur + l < i){
            cur = 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...