Submission #1207008

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207008		friendiks	Rotating Lines (APIO25_rotate)	C++20	0 / 100	1 ms	836 KiB

rotate

#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 = 1e5;
const int MOD = 988244353;
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;
}

void rotate(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 = 0; i < n; ++i) {
        int k = 0;
        vector<int> d;
        if (v[i] < 12500) {
            k = v[i];
            for (int j = i; j < n; ++j) {
                d.push_back(j);
                v[j] -= k;
            }
            rotate(d, 50000 - k);
        }
        else if (v[i] < 25000) {
            k = v[i] - 12500;
            for (int j = i; j < n; ++j) {
                d.push_back(j);
                v[j] -= k;
            }
            rotate(d, 50000 - k);
        }
        else if (v[i] < 37500) {
            k = v[i] - 25000;
            for (int j = i; j < n; ++j) {
                d.push_back(j);
                v[j] -= k;
            }
            rotate(d, 50000 - k);
        }
        else{
            k = v[i] - 37500;
            for (int j = i; j < n; ++j) {
                d.push_back(j);
                v[j] -= k;
            }
        }
        if (k > 0)rotate(d, 50000 - k);
    }
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 26