結果

問題 No.2029 Swap Min Max Min
ユーザー a16784542a16784542
提出日時 2022-10-08 14:42:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 68 ms / 2,000 ms
コード長 3,935 bytes
コンパイル時間 5,113 ms
コンパイル使用メモリ 263,256 KB
実行使用メモリ 11,020 KB
最終ジャッジ日時 2023-09-04 20:11:04
合計ジャッジ時間 10,084 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 36 ms
7,400 KB
testcase_04 AC 10 ms
4,376 KB
testcase_05 AC 19 ms
4,380 KB
testcase_06 AC 39 ms
5,092 KB
testcase_07 AC 41 ms
7,980 KB
testcase_08 AC 57 ms
9,768 KB
testcase_09 AC 17 ms
4,836 KB
testcase_10 AC 12 ms
4,376 KB
testcase_11 AC 23 ms
5,744 KB
testcase_12 AC 25 ms
4,388 KB
testcase_13 AC 61 ms
9,940 KB
testcase_14 AC 58 ms
5,700 KB
testcase_15 AC 64 ms
10,608 KB
testcase_16 AC 56 ms
5,860 KB
testcase_17 AC 60 ms
9,928 KB
testcase_18 AC 68 ms
11,020 KB
testcase_19 AC 57 ms
5,588 KB
testcase_20 AC 59 ms
5,608 KB
testcase_21 AC 58 ms
5,612 KB
testcase_22 AC 58 ms
5,540 KB
testcase_23 AC 67 ms
10,944 KB
testcase_24 AC 67 ms
10,900 KB
testcase_25 AC 59 ms
5,624 KB
testcase_26 AC 59 ms
5,616 KB
testcase_27 AC 1 ms
4,380 KB
testcase_28 AC 2 ms
4,380 KB
testcase_29 AC 2 ms
4,380 KB
testcase_30 AC 2 ms
4,376 KB
testcase_31 AC 2 ms
4,380 KB
testcase_32 AC 2 ms
4,376 KB
testcase_33 AC 1 ms
4,376 KB
testcase_34 AC 2 ms
4,376 KB
testcase_35 AC 1 ms
4,380 KB
testcase_36 AC 1 ms
4,380 KB
testcase_37 AC 1 ms
4,380 KB
testcase_38 AC 58 ms
9,672 KB
testcase_39 AC 56 ms
5,860 KB
testcase_40 AC 50 ms
5,440 KB
testcase_41 AC 62 ms
10,332 KB
testcase_42 AC 62 ms
10,280 KB
testcase_43 AC 54 ms
5,568 KB
testcase_44 AC 66 ms
10,876 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

struct Solver {
void solve() {
    int n;cin>>n;
    V<int> a(n);cin>>a;
    V<int> b;
    rep(i,n){
        if(!(a[i]<=n/2))b.emplace_back(i);
    }
    // cout<<b<<endl;
    ll ans=0;
    int now=0;
    rep(i,n/2+1){
        ans+=abs(now-b[i]);
        now+=2;
    }
    if(n%2){
        cout<<n/2<<" "<<ans<<endl;
        return ;
    }
    
    V<V<int>> dp(n/2+1,V<int>(2,INFL));
    dp[0][0]=dp[0][1]=0;
    rep(i,n/2){
        int i0=i*2;
        int i1=i*2+1;
        chmin(dp[i+1][0],dp[i][0]+abs(i0-b[i]));
        chmin(dp[i+1][1],dp[i][0]+abs(i1-b[i]));
        chmin(dp[i+1][1],dp[i][1]+abs(i1-b[i]));
    }
    cout<<n/2<<" "<<min(dp[n/2][0],dp[n/2][1])<<endl;
}};

signed main() {
    int ts = 1;
    // scanf("%lld",&ts);
    rep(ti,ts) {
        Solver solver;
        solver.solve();
    }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;
template <class T> using V = vector<T>;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}
template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}

const int INF = 1001001001;
const ll INFL = 3e18;
const int MAX = 2e6+5;


#endif
0