| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1206850 | 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 rotate(std::vector<int> t, int x);
void energy(int n, vector<int> v) {
vector<pair<int, int> > a(n);
for (int i = 0; i < n; ++i) a[i] = {v[i], i};
sort(a.begin(), a.end());
for (int i = n-1; i >= n/2; --i) {
if (a[i].first < 49999) {
rotate({a[i].second}, 49999 - a[i].first);
}
}
for (int i = n/2-1; i >= 0; --i) {
if (a[i].first < 24999) {
rotate({a[i].second}, 24999 - a[i].first);
}
}
}