結果

問題 No.1867 Partitions and Inversions
ユーザー SSRSSSRS
提出日時 2022-03-04 23:09:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 2,840 bytes
コンパイル時間 2,294 ms
コンパイル使用メモリ 211,688 KB
実行使用メモリ 75,004 KB
最終ジャッジ日時 2023-09-26 02:25:23
合計ジャッジ時間 84,424 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2,017 ms
74,784 KB
testcase_03 AC 2,055 ms
74,916 KB
testcase_04 AC 2,046 ms
74,756 KB
testcase_05 AC 2,032 ms
74,752 KB
testcase_06 AC 1,983 ms
74,920 KB
testcase_07 AC 2,034 ms
74,868 KB
testcase_08 AC 2,029 ms
74,728 KB
testcase_09 AC 1,976 ms
74,756 KB
testcase_10 AC 2,069 ms
74,832 KB
testcase_11 AC 2,060 ms
74,864 KB
testcase_12 AC 1,996 ms
74,928 KB
testcase_13 AC 2,017 ms
74,680 KB
testcase_14 AC 2,013 ms
74,972 KB
testcase_15 AC 1,957 ms
74,784 KB
testcase_16 AC 2,010 ms
74,724 KB
testcase_17 AC 1,990 ms
74,684 KB
testcase_18 AC 2,138 ms
74,776 KB
testcase_19 AC 1,974 ms
74,912 KB
testcase_20 AC 2,021 ms
74,928 KB
testcase_21 AC 1,968 ms
74,740 KB
testcase_22 AC 1,959 ms
74,784 KB
testcase_23 AC 2,036 ms
74,868 KB
testcase_24 AC 1,962 ms
74,836 KB
testcase_25 AC 1,955 ms
74,836 KB
testcase_26 AC 2,153 ms
74,836 KB
testcase_27 AC 1,965 ms
74,980 KB
testcase_28 AC 1,962 ms
74,828 KB
testcase_29 AC 2,025 ms
74,968 KB
testcase_30 WA -
testcase_31 AC 2,000 ms
74,832 KB
testcase_32 AC 2 ms
4,380 KB
testcase_33 AC 2 ms
4,384 KB
testcase_34 AC 1 ms
4,380 KB
testcase_35 AC 1 ms
4,380 KB
testcase_36 AC 2 ms
4,380 KB
testcase_37 AC 2 ms
4,388 KB
testcase_38 AC 37 ms
5,500 KB
testcase_39 AC 36 ms
5,500 KB
testcase_40 AC 36 ms
5,496 KB
testcase_41 AC 36 ms
5,616 KB
testcase_42 AC 36 ms
5,624 KB
testcase_43 AC 728 ms
35,092 KB
testcase_44 AC 745 ms
35,188 KB
testcase_45 AC 747 ms
35,236 KB
testcase_46 AC 701 ms
35,316 KB
testcase_47 AC 696 ms
35,232 KB
testcase_48 AC 733 ms
35,312 KB
testcase_49 AC 713 ms
35,324 KB
testcase_50 AC 730 ms
35,080 KB
testcase_51 AC 725 ms
35,152 KB
testcase_52 AC 709 ms
35,128 KB
testcase_53 AC 737 ms
35,300 KB
testcase_54 AC 724 ms
35,128 KB
testcase_55 AC 733 ms
35,316 KB
testcase_56 AC 712 ms
35,352 KB
testcase_57 AC 704 ms
35,236 KB
testcase_58 AC 726 ms
35,088 KB
testcase_59 AC 725 ms
35,184 KB
testcase_60 AC 724 ms
35,232 KB
testcase_61 AC 717 ms
35,296 KB
testcase_62 AC 713 ms
35,312 KB
testcase_63 AC 2,294 ms
74,688 KB
testcase_64 AC 2 ms
4,380 KB
testcase_65 AC 1 ms
4,380 KB
testcase_66 AC 2 ms
4,384 KB
testcase_67 AC 2,285 ms
75,004 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
次のファイルから読み込み:  /usr/local/gcc7/include/c++/12.2.0/bits/stl_algobase.h:64,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/bits/specfun.h:45,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/cmath:1935,
         次から読み込み:  /usr/local/gcc7/include/c++/12.2.0/x86_64-pc-linux-gnu/bits/stdc++.h:41,
         次から読み込み:  main.cpp:2:
メンバ関数 ‘std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::__conditional_t<std::__and_<std::is_move_assignable<_Tp>, std::is_move_assignable<_T2> >::value, std::pair<_T1, _T2>&&, std::__nonesuch&&>) [with _T1 = int; _T2 = int]’ 内,
    inlined from ‘monotone_minima<int, std::less<int> >(int, int, const std::function<int(int, int)>&, const std::less<int>&)::<ラムダ(int, int, int, int)>’ at main.cpp:25:14,
    inlined from ‘constexpr _Res std::__invoke_impl(__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = monotone_minima<int, std::less<int> >(int, int, const std::function<int(int, int)>&, const std::less<int>&)::<ラムダ(int, int, int, int)>&; _Args = {int, int, int, int}]’ at /usr/local/gcc7/include/c++/12.2.0/bits/invoke.h:61:36,
    inlined from ‘constexpr std::enable_if_t<is_invocable_r_v<_Res, _Callable, _Args ...>, _Res> std::__invoke_r(_Callable&&, _Args&& ...) [with _Res = void; _Callable = monotone_minima<int, std::less<int> >(int, int, const std::function<int(int, int)>&, const std::less<int>&)::<ラムダ(int, int, int, int)>&; _Args = {int, int, int, int}]’ at /usr/local/gcc7/include/c++/12.2.0/bits/invoke.h:111:28,
    inlined from ‘static _Res std::_Function_handler<_Res(_ArgTypes ...), _Functor>::_M_invoke(const std::_Any_data&, _ArgTypes&& ...) [with _Res = void; _Functor = monotone_minima<int, std::less<int> >(int, int, const std::function<int(int, int)>&, const std::less<int>&)::<ラムダ(int, int, int, int)>; _ArgTypes = {int, int, int, int}]’ at /usr/local/gcc7/include/c++/12.2.0/bits/st

ソースコード

diff # 

//嘘
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
vector<vector<int>> S;
int op(int i, int j){
  return S[i][j];
}
//https://ei1333.github.io/library/dp/monotone-minima.cpp
template< typename T, typename Compare = less< T > >
vector< pair< int, T > > monotone_minima(int H, int W, const function< T(int, int) > &f, const Compare &comp = Compare()) {
  vector< pair< int, T > > dp(H);
  function< void(int, int, int, int) > dfs = [&](int top, int bottom, int left, int right) {
    if(top > bottom) return;
    int line = (top + bottom) / 2;
    T ma;
    int mi = -1;
    for(int i = left; i <= right; i++) {
      T cst = f(line, i);
      if(mi == -1 || comp(cst, ma)) {
        ma = cst;
        mi = i;
      }
    }
    dp[line] = make_pair(mi, ma);
    dfs(top, line - 1, left, mi);
    dfs(line + 1, bottom, mi, right);
  };
  dfs(0, H - 1, 0, W - 1);
  return dp;
}
//https://ei1333.github.io/library/dp/divide-and-conquer-optimization.cpp
template< typename T, typename Compare = less< T > >
vector< vector< T > > divide_and_conquer_optimization(int H, int W, T INF, const function< T(int, int) > &f, const Compare &comp = Compare()) {
  vector< vector< T > > dp(H + 1, vector< T >(W + 1, INF));
  dp[0][0] = 0;
  for(int i = 1; i <= H; i++) {
    function< T(int, int) > get_cost = [&](int y, int x) {
      if(x >= y) return INF;
      return dp[i - 1][x] + f(x, y);
    };
    auto ret = monotone_minima(W + 1, W + 1, get_cost, comp);
    for(int j = 0; j <= W; j++) dp[i][j] = ret[j].second;
  }
  return dp;
}
int main(){
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
    P[i]--;
  }
  S = vector<vector<int>>(N + 1, vector<int>(N + 1, 0));
  for (int i = 0; i < N; i++){
    for (int j = i + 1; j < N; j++){
      if (P[i] > P[j]){
        S[i][j + 1]++;
      }
    }
  }  
  for (int i = 0; i <= N; i++){
    for (int j = 0; j < N; j++){
      S[i][j + 1] += S[i][j];
    }
  }
  for (int i = N; i >= 1; i--){
    for (int j = 0; j <= N; j++){
      S[i - 1][j] += S[i][j];
    }
  }
  vector<int> mx(N + 1, 0);
  for (int i = 0; i <= N; i++){
    for (int j = i; j <= N; j++){
      mx[j - i] = max(mx[j - i], S[i][j]);
      S[i][j] *= -1;
    }
  }
  vector<vector<int>> dp = divide_and_conquer_optimization<int>(N + 1, N + 1, INF, op);
  vector<vector<int>> dp2(101, vector<int>(N + 1, INF));
  dp2[0][0] = 0;
  for (int i = 0; i < 100; i++){
    for (int j = 0; j < N; j++){
      for (int k = j + 1; k <= N; k++){
        dp2[i + 1][k] = min(dp2[i + 1][k], dp2[i][j] + S[j][k]);
      }
    }
  }
  for (int i = 1; i <= N; i++){
    if (i <= 100){
      cout << min({-S[0][N] + dp[i][N], -S[0][N] - mx[N + 1 - i], -S[0][N] + dp2[i][N]}) << endl;
    } else {
      cout << min(-S[0][N] + dp[i][N], -S[0][N] - mx[N + 1 - i]) << endl;
    }
  }
}
0