#784992 (C++17) No.2029 Swap Min Max Min

• 問題: No.2029 Swap Min Max Min
• ユーザー: そすうぽよ
• 提出日時: 2022-08-05 21:48:41
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 1,906 bytes
• コンパイル時間: 2,275 ms
• コンパイル使用メモリ: 196,516 KB
• 最終ジャッジ日時: 2025-01-30 18:00:07
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 2 WA * 1
other	AC * 31 WA * 11

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <bits/stdc++.h>
#include <variant>
#define rep2(i, k, n) for (i64 i = (i64)(k); i < (i64)(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(x) begin(x), end(x)
#ifdef ENV_LOCAL
#define dump \
  if (1) cerr
#else
#define dump \
  if (0) cerr
#endif
using namespace std;
using namespace std::string_literals;
using i32 = int32_t;
using i64 = int64_t;
using f64 = double;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
// using namespace harudake;
// Light version
using Data = int;
const int len = 1 << 18;
struct BIT {
  vector<Data> data;
  BIT() : data(len, 0) {}
  void update(int i, Data value) {
    for (; i < len; i |= i + 1) data[i] += value;
  }
  Data query(int i) {
    Data s = 0;
    for (; i >= 0; i = (i & i + 1) - 1) s += data[i];
    return s;
  }
};
i64 inv_num(const vi64& v) {
  i64 ans = 0;
  BIT bit;
  rep(i, size(v)) {
    ans += i - bit.query(v[i]);
    bit.update(v[i], 1);
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  i64 n;
  cin >> n;
  vi64 a(n);
  rep(i, n) cin >> a[i];
  i64 ans_1 = n / 2;
  i64 count_small = 0, count_large = 0;
  vi64 selo(n), sole(n);
  bool ok_selo = true, ok_sole = true;
  rep(i, n) {
    if (a[i] <= ans_1) {
      selo[i] = count_small * 2;
      sole[i] = count_small * 2 + 1;
      if (sole[i] >= n) ok_sole = false;
      ++count_small;
    } else {
      selo[i] = count_large * 2 + 1;
      sole[i] = count_large * 2;
      if (selo[i] >= n) ok_selo = false;
      ++count_large;
    }
  }
  i64 ans_2 = n * n;
  if (ok_selo) {
    dump << "SELO ";
    for (auto&& e : selo) dump << e << " ";
    dump << endl;
    ans_2 = min(ans_2, inv_num(selo));
  }
  if (ok_sole) {
    dump << "SOLE ";
    for (auto&& e : sole) dump << e << " ";
    dump << endl;
    ans_2 = min(ans_2, inv_num(sole));
  }
  cout << ans_1 << " " << ans_2 << endl;
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX