#include "rotate.h"
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forsn(i, s, n) for (int i = int(s); i < int(n); i++)
#define dforn(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define dforsn(i, s, n) for (int i = int(n) - 1; i >= int(s); i--)
#define sz(x) (int) x.size()
#define all(x) begin(x), end(x)
using namespace std;
#define pb push_back
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
#define fst first
#define snd second
const int M = 50000;
void energy(int n, vi v) {
vector<ii> a(n);
forn(i, n) a[i] = {v[i], i};
sort(all(a));
forn(i, n / 2) {
int need = (a[i].fst + M / 2) % M;
int diff = (need - a[i + (n + 1) / 2].fst + M) % M;
rotate(vi{a[i + (n + 1) / 2].snd}, diff);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |