Submission #1364884

#TimeUsernameProblemLanguageResultExecution timeMemory
1364884aaatroushRotating Lines (APIO25_rotate)C++20
100 / 100
25 ms2412 KiB
#include "rotate.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll int
#define all(x) x.begin(), x.end()
#define pb push_back
#define pii pair<ll, ll>
#define in(v) for(auto &elem:v){ cin>>elem; }
#define out(v) for(auto elem:v){ cout<<elem.first<<" "; } cout<<endl;
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
typedef tree<pii, null_type, std::greater<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

void energy(int n, std::vector<int> v){
    vector<pii> angles(n);
    for(ll i = 0; i<n; i++){
        angles[i] = {v[i], i};
    }
    sort(all(angles));
    for(ll i = 0; i<n/2; i++){
        rotate({angles[i+n/2].second}, angles[i].first+25000-angles[i+n/2].first);
    }
    
}
#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...