제출 #1304512

#제출 시각아이디문제언어결과실행 시간메모리
1304512thegodbridgexdRotating Lines (APIO25_rotate)C++20
0 / 100
1 ms832 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define matrix vector<vector<int>>
#define fi first
#define se second
#define BIG __int128
#define wtf pair<int,int>
#define db long double
#define filename "input"
const int N = 50000;
//MAIN
void rotate(std::vector<int> t, int x);
void energy(int n, vector<int> v){
    int goc = N / n;
    int du = N % n;
    vector<wtf> a;
    for (int i = 0; i < n; i++) a.push_back({v[i], i});
    sort(a.begin(), a.end());
    for (int id = a.size() - 1; id >= 0; id--){
        auto [x, i] = a[id];
        if (i == n - 1){
            rotate({i}, (i * goc + du) - x);
            a[i].fi = i * goc + du;
        }
        else{
            if (i * goc - x < 0) break;
            rotate({i}, i * goc - x);
            a[i].fi = i * goc;
        }
    }
    for (int id = 0; id < a.size(); id++){
        auto [x, i] = a[id];
        rotate({i}, (N + i * goc) - x);
        a[i].fi = i * goc;
    }
}
#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...