Submission #1300648

#TimeUsernameProblemLanguageResultExecution timeMemory
1300648Canuc80kRotating Lines (APIO25_rotate)C++20
0 / 100
3095 ms824 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll n;
vector<int> v;
vector<int> pos;
vector<array<int, 2>> a;

void rotate(vector<int> t, int x);

void prepare(int nn, vector<int> vv) {
    n = nn; v = vv; 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];
    vector<int> cur_vector = v;
}

void sub1() {
    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];
    vector<int> cur_vector = v;
}

ll cal(vector<int> v) {
    ll res = 0;
    for (int i = 0; i < (int)v.size(); i ++) {
        for (int j = i + 1; j < (int)v.size(); j ++) {
            int d = abs(v[i] - v[j]);
            res += min(d, 50000 - d);
        }
    } return res;
}

void energy(int nn, vector<int> vv) {
    prepare(nn, vv);
    if (v.back() <= 25000) sub1();
    for (;;) {

    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...