제출 #51368

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51368		mareksom	Swap (BOI16_swap)	C++17	0 / 100	2 ms	248 KiB

swap

#ifndef LOCAL
#pragma GCC optimize ("O3")
#endif

#include <bits/stdc++.h>

using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return {i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (c it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(x...) " [" #x ": " << (x) << "] "

using ld = long double;
using ll = long long;

constexpr int mod = 1000 * 1000 * 1000 + 7;
constexpr int odw2 = (mod + 1) / 2;

void OdejmijOd(int& a, int b) { a -= b; if (a < 0) a += mod; }
int Odejmij(int a, int b) { OdejmijOd(a, b); return a; }
void DodajDo(int& a, int b) { a += b; if (a >= mod) a -= mod; }
int Dodaj(int a, int b) { DodajDo(a, b); return a; }
int Mnoz(int a, int b) { return (ll) a * b % mod; }
void MnozDo(int& a, int b) { a = Mnoz(a, b); }
int Pot(int a, int b) { int res = 1; while (b) { if (b % 2 == 1) MnozDo(res, a); a = Mnoz(a, a); b /= 2; } return res; }
int Odw(int a) { return Pot(a, mod - 2); }
void PodzielDo(int& a, int b) { MnozDo(a, Odw(b)); }
int Podziel(int a, int b) { return Mnoz(a, Odw(b)); }
int Moduluj(ll x) { x %= mod; if (x < 0) x += mod; return x; }

template <typename T> T Maxi(T& a, T b) { return a = max(a, b); }
template <typename T> T Mini(T& a, T b) { return a = min(a, b); }

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> tab(n + 1);
  auto Zostanie = [&](int pos, int val) -> bool {
    if (pos * 2 > n) return true;
    if (tab[pos * 2] < val) return false;
    if (pos * 2 + 1 > n) return true;
    if (tab[pos * 2 + 1] < val) return false;
    return true;
  };
  for (int i = 1; i <= n; i++) cin >> tab[i];
  for (int i = 1; ; i++) {
    if (i * 2 > n) break;
    if (i + 2 + 1 > n) {
      if (tab[i] > tab[i * 2]) {
        swap(tab[i], tab[i + 2]);
      }
      break;
    }
    const int x[4] = {0, tab[i], tab[i * 2], tab[i * 2 + 1]};
    if (x[1] < x[2] and x[1] < x[3]) {
      // Nic.
    } else if (x[2] < x[1] and x[2] < x[3]) {
      swap(tab[i], tab[i * 2]);
    } else {
      assert(x[3] < x[1] and x[3] < x[2]);
      if (x[1] < x[2] and Zostanie(i * 2, x[1])) {
        swap(tab[i], tab[i * 2]);
        swap(tab[i], tab[i * 2 + 1]);
      } else {
        //assert(x[2] < x[1]);
        swap(tab[i], tab[i * 2 + 1]);
      }
    }
  }

  for (int i = 1; i <= n; i++) {
    cout << tab[i] << " ";
  }
  cout << endl;
  return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 27
• Subtask 4: 0 / 20
• Subtask 5: 0 / 32