제출 #1208494

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1208494		kunzaZa183	Rotating Lines (APIO25_rotate)	C++20	63 / 100	3090 ms	4392 KiB

rotate

#include <bits/stdc++.h>

#include "rotate.h"
using namespace std;
using ll = long long;

void energy(int n, vector<int> v) {
  const ll mod = 50000;

  vector<pair<int, int>> vpii;
  for (int i = 0; i < v.size(); i++) vpii.emplace_back(v[i], i);

  sort(vpii.begin(), vpii.end());

  vector<int> sth;
  vector<bool> used(n);
  for (int i = 0; i < vpii.size(); i++) {
    if (used[vpii[i].second]) continue;
    int more = 0, les = 0;
    vector<pair<int, int>> close, far;
    for (int j = i + 1; j < v.size(); j++) {
      if (used[vpii[j].second]) continue;
      if (vpii[j].first - vpii[i].first > mod / 2) {
        far.push_back(vpii[j]);
      } else {
        close.push_back(vpii[j]);
      }
    }

    if (close.empty() && far.empty()) break;

    // for (auto a : far) cout << a.first << ", " << a.second << "  ";
    // cout << "\n";
    // for (auto a : close) cout << a.first << ", " << a.second << "  ";
    // cout << "\n";

    if (close.size() > far.size()) {
      // cout << v[0] << " " << v[1] << "\n";
      rotate(
          {vpii[i].second},
          ((close.back().first + mod / 2) % mod - vpii[i].first + mod) % mod);
      used[close.back().second] = 1;
      used[vpii[i].second] = 1;
    } else {
      rotate({vpii[i].second},
             ((far.front().first + mod / 2) % mod - vpii[i].first + mod) % mod);
      used[far.front().second] = 1;
      used[vpii[i].second] = 1;
    }
  }

  return;
}

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