#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<array<int, 2>> a;
vector<int> pos;
void rotate(std::vector<int> t, int x);
void energy(int n, std::vector<int> v) {
pos.resize(n);
for (int i = 0; i < v.size(); i ++) a.push_back({v[i], i});
sort(a.begin(), a.end());
for (int i = 0; i < v.size(); i ++) v[i] = a[i][0], pos[i] = a[i][1];
if (v[1] - v[0] > 25000) {
rotate({pos[0]}, v[1] - v[0] - 25000);
} else {
if (v[0] + 25000 < 50000) {
rotate({pos[1]}, v[0] + 25000 - v[1]);
} else {
ll x = v[1] - 25000;
// v[0] -> x
rotate({pos[0]}, x + 100000 - v[0]);
}
}
}
| # | 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... |