| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1353582 | tsetsenbileg | Rotating Lines (APIO25_rotate) | C++20 | 27 ms | 2412 KiB |
#include "rotate.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using ld = long double;
using pr = pair<int, int>;
const int MOD = 1e9+7, MAXA = 1e6, MAX = 50000;
void energy(int n, vector<int> v){
vector<pr> a(n);
for (int i = 0; i < n; i++) a[i] = {v[i], i};
sort(a.begin(), a.end(), [](const pr& a, const pr& b) {
return min(a.first, MAX - a.first) < min(b.first, MAX - b.first);
});
for (int i = 0; i < n/2; i++) {
rotate({a[i].second}, MAX - a[i].first);
}
for (int i = n/2; i < n; i++) {
int diff = 25000 - a[i].first;
if (diff < 0) diff += MAX;
rotate({a[i].second}, diff);
}
// return (n / 2 * (n+1) / 2) * 25000;
}| # | 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... | ||||
