Submission #671693

#TimeUsernameProblemLanguageResultExecution timeMemory
671693Hacv16Dancing Elephants (IOI11_elephants)C++17
26 / 100
9049 ms5196 KiB
#include "elephants.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAX = 2e6 + 15; int n, l, x[MAX]; multiset<int> s; void init(int n_, int l_, int x_[]){ n = n_, l = l_; for(int i = 0; i < n; i++) x[i] = x_[i], s.insert(x[i]); } int update(int i, int y){ s.erase(s.find(x[i])); s.insert(y); x[i] = y; int ans = 0, r = -1; for(auto x : s) if(x > r) ans++, r = x + 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...