| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331261 | Mamikonm1 | Dancing Elephants (IOI11_elephants) | C++17 | 9094 ms | 1676 KiB |
#include "elephants.h"
#include<bits/stdc++.h>
using namespace std;
int n,l;
vector<int>x,Y;
void init(int N, int L, int X[])
{
n = N;
l=L;
for(int i=0;i<n;++i)Y.push_back(X[i]);
}
int update(int i, int y)
{
Y[i]=y;
x=Y;
sort(begin(x),end(x));
int ans=0,lf=-(l*2);
for(int i=0;i<n;++i){
if(x[i]-lf>l){
lf=x[i];
ans++;
}
}
return ans;
}| # | 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... | ||||
