제출 #348553

#제출 시각아이디문제언어결과실행 시간메모리
348553Kerim코끼리 (Dancing Elephants) (IOI11_elephants)C++17
26 / 100
9092 ms1772 KiB
#include "elephants.h" #include "bits/stdc++.h" using namespace std; #define MAXN 100004 int n,l,arr[MAXN],org[MAXN]; void init(int N, int L, int X[]){ n = N; l = L; //printf("L = %d\n",L); for(int i=0;i<n;i++) org[i]=X[i]; } int update(int pos, int val){ org[pos]=val; for(int i=0;i<n;i++) arr[i]=org[i]; sort(arr,arr+n); int ans=0,last=-1; for(int i=0;i<n;i++) if(last<arr[i]){ ans++; last=arr[i]+l; } 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...