# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1206831 | friendiks | Rotating Lines (APIO25_rotate) | C++20 | 0 ms | 0 KiB |
#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC diagnostic ignored "-Wpedantic"
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(52);
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename V>
using table = gp_hash_table<T, V>;
using i128 = __int128;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
const ll INF = 2e18;
const int inf = 2e9;
const int maxn = 1e6;
const int MOD = 1e9 + 7;
const ld pi = acos(-1);
const int P = 5167;
const int L = 26;
const ld EPS = 1e-7;
template<typename T, typename V>
void fill(T &container, V value) {
for (auto &c: container)
c = value;
}
#define int ll
void energy(int n, vector<int> v) {
sort(v.begin(), v.end());
for (int i = 0; i < n / 2; ++i) {
v[i] = max(v[i], 24999ll);
}
for (int i = n / 2; i < n; ++i) {
v[i] = 49999;
}
int ans = 0, sum = 0;
for (int i = 0; i < n; ++i) {
ans += v[i] * i - sum;
sum += v[i];
}
cout << ans;
}