| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1240215 | candi_ositos | 코끼리 (Dancing Elephants) (IOI11_elephants) | C++20 | 0 ms | 320 KiB |
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
int n;
multiset <int> a;
multiset <int> b;
vector <int> ap;
int c;
void init(int N, int L, int X[]){
n=N;
c=L;
ap.resize(n);
for(int i=0; i<n; ++i){
ap[i]=X[i];
a.insert(X[i]);
b.insert(-X[i]);
}
}
int update(int i, int y){
a.erase(ap[i]);
b.erase(-ap[i]);
ap[i]=y;
a.insert(y);
b.insert(-y);
int aux=-1, aguss=-1;
for(auto i: a){
aux=i;
break;
}
for(auto i: b){
aguss=-i;
break;
}
int d=aguss-aux;
d/=c;
++d;
return d;
}
| # | 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... | ||||
