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;
#define MAXN 100004
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
int n,l;
set<int>s;
int arr[MAXN];
void init(int N, int L, int X[]){
n=N;l=L;
for(int i=0;i<n;i++)s.insert(X[i]),arr[i]=X[i];
}
int update(int pos, int val){
s.erase(arr[pos]);arr[pos]=val;s.insert(val);
int ans=0,last=-1;
tr(it,s)
if(last<*it)
ans++,last=*it+l;
return ans;
}
| # | 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... |