# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124231 | KieranHorgan | 코끼리 (Dancing Elephants) (IOI11_elephants) | C++17 | 9030 ms | 2552 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;
int n;
vector<int> a;
vector<int> isABegin;
vector<pair<int,int>> listOfBegins;
set<pair<int,int>> pos;
int L;
void init(int N, int L_, int X[]) {
L = L_;
n = N;
a.resize(n);
isABegin.resize(n);
for(int i = 0; i < n; i++) {
a[i] = X[i];
pos.insert({a[i], i});
}
}
bool first = 1;
int update(int i, int y) {
pos.erase(make_pair(a[i], i));
a[i] = y;
pos.insert(make_pair(a[i], i));
auto it = pos.begin();
int l = it->first + L+1;
int ans = 1;
for(auto p: pos) {
int i = p.second;
int x = p.first;
if(x >= l) {
l = x + L + 1;
ans++;
}
}
return ans;
}
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... |