# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29088 | kavun | Dancing Elephants (IOI11_elephants) | C++14 | 9000 ms | 25700 KiB |
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>
using namespace std;
set <pair<int,int> > st;
vector <int> x;
int n, l;
void init(int N, int L, int X[])
{
n = N; l = L;
for(int i = 0; i < n; i++)
{
st.insert(make_pair(X[i],i));
x.push_back(X[i]);
}
}
int update(int i, int y)
{
int res = 1;
set<pair<int,int> >::iterator it = st.find(make_pair(x[i],i));
x[i] = y;
st.erase(it);
st.insert(make_pair(y,i));
set<pair<int,int> >::iterator leftmost = st.begin();
while(leftmost != st.end())
{
pair<int,int> pr = *leftmost;
int pos = pr.first; int id = pr.second;
leftmost = st.upper_bound(make_pair(pr.first + l,1e9));
if(leftmost != st.end())
res++;
}
return res;
}
Compilation message (stderr)
# | 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... |