# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671489 | dooompy | Meandian (CEOI06_meandian) | C++17 | 0 ms | 0 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 "libmean.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int ans[1005];
void find5(vector<int> idx) {
vector<pair<int, int>> total;
for (int i = 0; i < 5; i++) {
vector<int> temp;
for (int j = 0; j < 5; j++) {
if (i == j) continue;
temp.push_back(idx[j]);
}
int res = Median(temp[0], temp[1], temp[2], temp[3]);
total.push_back({res * 2, i});
}
sort(total.begin(), total.end());
int mid = total[0].first + total[4].first - total[2].first;
mid /= 2;
ans[idx[total[2].second]] = mid;
return;
}
int main()
{
n = Init();
fill(ans, ans+1005, -1);
for (int t = 1; t <= n; t++) {
vector<int> temp;
for (int i = 1; i <= n; i++) {
if (ans[i] == -1) {
temp.push_back(i);
}
if (temp.size() == 5) break;
}
find5(temp);
}
}