Submission #1367627

#TimeUsernameProblemLanguageResultExecution timeMemory
1367627nagorn_phRotating Lines (APIO25_rotate)C++20
0 / 100
3093 ms1644 KiB
#include "rotate.h"
#include <bits/stdc++.h>
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()

using namespace std;

const int N = 2e5 + 5;
// const int inf = 1e18;

void energy(int n, std::vector<int> v){
    vector <bool> visited(n);
    for (int round = 0; round < n; round++) {
        // cout << "ROUND : " << round << "\n";
        if (round % 2) {
            for (int i = 0; i < n; i++) {
                if (visited[i]) continue;
                int initcost = 0, newcost = 0;
                for (int j = 0; j < n; j++) {
                    if (i == j) continue;
                    initcost += min(abs(v[i] - v[j]), 50000 - abs(v[i] - v[j]));
                    newcost += min(v[j], 50000 - v[j]);
                }
                // cout << i << " : " << initcost << ", " << newcost << "\n";
                if (newcost >= initcost) {
                    rotate({i}, 50000 - v[i]);
                    v[i] = 0;
                    visited[i] = 1;
                    break;
                }
            }
        }
        else {
            for (int i = 0; i < n; i++) {
                if (visited[i]) continue;
                int initcost = 0, newcost = 0;
                for (int j = 0; j < n; j++) {
                    if (i == j) continue;
                    initcost += min(abs(v[i] - v[j]), 50000 - abs(v[i] - v[j]));
                    newcost += min(abs(25000 - v[j]), 50000 - abs(25000 - v[j]));
                }
                // cout << i << " : " << initcost << ", " << newcost << "\n";
                if (newcost >= initcost) {
                    rotate({i}, (25000 - v[i] + 50000) % 50000);
                    v[i] = 25000;
                    visited[i] = 1;
                    break;
                }
            }
        }
        // cout << "-------------------\n";
    }
}

/*
25000*n*n/4 = 6250n^2
what if we distribute?
5
40000 45000 12000 6500 0 

*/
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...