#785486 (C++14) No.2029 Swap Min Max Min

• 問題: No.2029 Swap Min Max Min
• ユーザー: どらら
• 提出日時: 2022-08-05 23:46:51
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 68 ms / 2,000 ms
• コード長: 2,143 bytes
• コンパイル時間: 3,872 ms
• コンパイル使用メモリ: 231,104 KB
• 実行使用メモリ: 9,472 KB
• 最終ジャッジ日時: 2024-09-15 21:37:12
• 合計ジャッジ時間: 7,050 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 42

ソースコード

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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
//using mint = modint1000000007;
//using mint = modint998244353;
ll calc(const vector<int>& a, const vector<int>& b){
  int p = 0;
  while(a[p] != 1) p++;
  int q = 0;
  while(b[q] != 1) q++;
  ll ret = 0;
  while(true){
    ret += abs(p-q);
    p++;
    q++;
    while(p<a.size() && a[p] != 1) p++;
    if(p == a.size()) break;
    while(q<b.size() && b[q] != 1) q++;
  }
  return ret;
}
ll calc2(const vector<int>& a){
  int N = a.size();
  vector<int> b1(N), b2(N);
  rep(i,N){
    if(i%2==0){
      b1[i] = 0;
      b2[i] = 1;
    }else{
      b1[i] = 1;
      b2[i] = 0;
    }
  }
  vector<ll> dpl(N,0), dpr(N,0);
  {
    int p = 0;
    while(a[p] != 1) p++;
    int q = 0;
    while(b1[q] != 1) q++;
    
    ll ret = 0;
    while(true){
      ret += abs(p-q);
      dpl[q] = ret;
      p++;
      q++;
      while(p<a.size() && a[p] != 1) p++;
      if(p == a.size()) break;
      while(q<b1.size() && b1[q] != 1) q++;
    }
  }
  {
    int p = a.size()-1;
    while(a[p] != 1) p--;
    int q = b2.size()-1;
    while(b2[q] != 1) q--;
    
    ll ret = 0;
    while(true){
      ret += abs(p-q);
      dpr[q] = ret;
      p--;
      q--;
      while(p>=0 && a[p] != 1) p--;
      if(p < 0) break;
      while(q>=0 && b2[q] != 1) q--;
    }
  }
  ll ret = min(dpl[N-1], dpr[0]);
  for(int i=1; i<N; i+=2){
    ret = min(ret, dpl[i]+dpr[i+1]);
  }
  
  return ret;
}
int main(){
  int N;
  cin >> N;
  vector<int> v(N);
  rep(i,N) cin >> v[i];
  ll X = N/2;
  vector<int> w(N);
  rep(i,N){
    if(v[i] <= X) w[i] = 1;
    else w[i] = 0;
  }
  ll Y = 1e18;
  if(N%2!=0){
    vector<int> z(N);
    rep(i,N){
      if(i%2==0) z[i] = 0;
      else z[i] = 1;
    }
    Y = min(Y, calc(w, z));
  }else{
    Y = min(Y, calc2(w));
  }
  cout << X << " " << Y << endl;
  
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX