This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
int n,l;
set<int> s;
int a[101];
void init(int N, int L, int X[])
{
n = N;l = L;
for(int i = 0;i < n;i++) s.insert(X[i]);
for(int i = 0;i < n;i++) a[i] = X[i];
}
int update(int i, int y)
{
s.erase(a[i]);
a[i] = y;
s.insert(a[i]);
int now = *(s.begin()),used = 1;
for(int x : s)
{
if(now+l>=x) continue;
now = x,used++;
}
return used;
}
# | 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... |