Submission #1269161

#TimeUsernameProblemLanguageResultExecution timeMemory
1269161nerrrminDancing Elephants (IOI11_elephants)C++20
26 / 100
9088 ms3652 KiB
#include "elephants.h" #include<bits/stdc++.h> using namespace std; const int maxn = 5e4 + 10; int n, l; multiset < int > s; int a[maxn]; void init(int N, int L, int X[]) { n = N; l = L; for (int i = 0; i < n; ++ i) { s.insert(X[i]); a[i] = X[i]; } } int update(int i, int y) { s.erase(s.find(a[i])); s.insert(y); a[i] = y; int start = -1; int ans = 0; for (auto x: s) { if(start == -1 || start + l < x) { ans ++; start = x; } } 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...