#ifndef hwe
#include "libmean.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
int ans[N];
#ifdef hwe
#endif
ll ask(vector<int> ve) {
assert(ve.size() == 4);
return Meandian(ve[0], ve[1], ve[2], ve[3]);
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n = Init();
vector<int> pivot(5, 0);
pivot[0] = 1, pivot[1] = 2, pivot[2] = 3, pivot[3] = 4;
for (int i = 5; i <= n; ++i) {
vector<int> ve; pivot[4] = i;
for (int j = 0; j < 5; ++j) {
vector<int> tmp = pivot;
tmp.erase(tmp.begin() + j);
ve.emplace_back(ask(tmp));
}
int mi = *min_element(ve.begin(), ve.end());
int ma = *max_element(ve.begin(), ve.end());
int med = 0, posMed = 0;
for (int j = 0; j < 5; ++j)
if (ve[j] != mi && ve[j] != ma) {
med = ve[j];
posMed = j;
}
int sum = 2 * (mi + ma + med); // a2 + a3 + a4
ans[pivot[posMed] - 1] = sum - 2 * med;
pivot[posMed] = i;
}
Solution(ans);
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
