Submission #1240215

#TimeUsernameProblemLanguageResultExecution timeMemory
1240215candi_ositosDancing Elephants (IOI11_elephants)C++20
0 / 100
0 ms320 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...