Submission #29116

#TimeUsernameProblemLanguageResultExecution timeMemory
29116dereotuDancing Elephants (IOI11_elephants)C++14
0 / 100
129 ms17644 KiB
#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,a[2]; void init(int N, int L, int X[]){ l=L; n = N; forr(i,0,n){ a[i]=X[i]; } } int update(int i, int y){ a[i]=y; int ans=1; sort(a,a+n); int lp=0,rp=0; while(rp<n){ if(a[rp]-a[lp]<=l){ rp++; } else{ ans++; lp=rp++; } } 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...