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>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
using namespace std;
int n,l;
pair<int,int> a[100005];
void init(int N, int L, int X[]){
l=L;
n = N;
forr(i,0,N){
a[i].st=X[i];
a[i].nd=i;
}
}
int update(int i, int y){
int ans=1;
a[a[i].nd].st=y;
sort(a,a+n);
int lp=0,rp=0;
while(rp<n){
if(a[rp].st-a[lp].st<=l){
rp++;
}
else{
ans++;
lp=rp;
++rp;
}
}
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... |