# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646137 | Matteo_Verz | medians (balkan11_medians) | C++17 | 110 ms | 11584 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>
#ifdef BLAT
#include "debug/debug.hpp"
#else
#define debug(x...)
#endif
using namespace std;
void nextValue(int &last, int coef, const set <int> &myset) {
while (myset.find(last) == myset.end())
last += coef;
}
void insertValue(int value, vector <int> &v, set <int> &myset) {
v.push_back(value);
myset.erase(value);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
vector <int> a, b;
set <int> myset;
cin >> n;
b.resize(n);
cin >> b[0];
a.push_back(b[0]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |