제출 #447669

#제출 시각아이디문제언어결과실행 시간메모리
447669dxz05코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9064 ms2764 KiB
#include "elephants.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 3e2;

int N, L;
int X[MAXN];

set<int> s;
void init(int _N, int _L, int _X[]){
    N = _N;
    L = _L;

    for (int i = 0; i < N; i++){
        X[i] = _X[i];
        s.insert(X[i]);
    }

}

int update(int i, int y){
    s.erase(X[i]);
    X[i] = y;
    s.insert(y);

    int ans = 1, last = *s.begin();
    for (int x : s){
        if (x - last > L){
            ans++;
            last = x;
        }
    }

    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...