# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093957 | Aviansh | Dancing Elephants (IOI11_elephants) | C++17 | 9063 ms | 5552 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 <bits/stdc++.h>
#include "elephants.h"
using namespace std;
int n;
int l;
int *x;
unordered_map<int,int>mp;
int uni[70000];
int siz = 0;
void init(int N, int L, int X[])
{
n = N;
l=L;
x=X;
for(int i = 0;i<n;i++){
mp[x[i]]++;
}
for(pair<int,int>p:mp){
uni[siz]=p.first;
siz++;
}
sort(uni,uni+siz);
}
void rem(int ind){
for(int i = ind+1;i<siz;i++){
uni[i-1]=uni[i];
# | 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... |