Submission #1264018

#TimeUsernameProblemLanguageResultExecution timeMemory
1264018rxlfd314Rotating Lines (APIO25_rotate)C++20
16 / 100
3094 ms2120 KiB
#include "rotate.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;
using arl2 = array<ll, 2>;
using arl3 = array<ll, 3>;
template <class T> using vt = vector<T>;
#define all(x) begin(x), end(x)
#define size(x) (int((x).size()))
#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

void energy(const int N, vt<int> A) {
  vt<int> ord(N);
  iota(all(ord), 0);
  sort(all(ord), [&](const int &a, const int &b) {
    return A[a] < A[b];    
  });
  FOR(i, 0, N/2-1)
    rotate({ord[i+N/2]}, A[ord[i]] + 25000 - A[ord[i+N/2]]);
  if (N & 1)
    rotate({ord[N-1]}, A[ord[0]] - A[ord[N-1]]);
  FOR(i, 1, N/2-1)
    rotate({ord[i], ord[i+N/2]}, A[ord[0]] - A[ord[i]]);
}
#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...