#451003 (C++14) No.1051 PQ Permutation

提出ソース

結果

問題	No.1051 PQ Permutation
ユーザー	stoq
提出日時	2020-03-29 08:34:07
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	RE (最新) AC (最初)
実行時間	-
コード長	3,743 bytes
コンパイル時間	1,805 ms
コンパイル使用メモリ	176,320 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-07-05 19:31:02
合計ジャッジ時間	6,149 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	1 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	RE	-
testcase_16	RE	-
testcase_17	RE	-
testcase_18	RE	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	RE	-
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	AC	5 ms 5,376 KB
testcase_26	AC	3 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	7 ms 5,376 KB
testcase_29	AC	3 ms 5,376 KB
testcase_30	AC	5 ms 5,376 KB
testcase_31	AC	2 ms 5,376 KB
testcase_32	AC	5 ms 5,376 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	2 ms 5,376 KB
testcase_35	AC	18 ms 5,376 KB
testcase_36	AC	19 ms 5,376 KB
testcase_37	RE	-
testcase_38	RE	-
testcase_39	RE	-
testcase_40	RE	-
testcase_41	RE	-
testcase_42	AC	2 ms 5,376 KB
testcase_43	AC	2 ms 5,376 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	2 ms 5,376 KB
testcase_46	AC	2 ms 5,376 KB
testcase_47	AC	1 ms 5,376 KB
testcase_48	RE	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/string:47,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/locale_classes.h:40,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/ios_base.h:41,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ios:42,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:1:
In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = int*; _Container = std::vector<int>]',
    inlined from 'int main()' at main.cpp:150:45:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:1144:47: warning: 'q_pos' may be used uninitialized [-Wmaybe-uninitialized]
 1144 |       { return __normal_iterator(_M_current + __n); }
      |                                               ^~~
main.cpp: In function 'int main()':
main.cpp:141:18: note: 'q_pos' was declared here
  141 |       int p_pos, q_pos;
      |                  ^~~~~
main.cpp:141:11: warning: 'p_pos' may be used uninitialized [-Wmaybe-uninitialized]
  141 |       int p_pos, q_pos;
      |           ^~~~~
main.cpp:136:24: warning: 'mi' may be used uninitialized [-Wmaybe-uninitialized]
  136 |     swap(b[match], b[mi]);
      |                        ^
main.cpp:126:18: note: 'mi' was declared here
  126 |     int m = IN

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

const int MOD_TYPE = 1;
const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const ld PI = acos(-1.0);
const ld EPS = 1e-11;

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;

vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);

  int n, p, q;
  cin >> n >> p >> q;
  vector<int> a(n);
  rep(i, n) cin >> a[i];

  int Max1[100010], Max2[100010];
  Max1[n] = -1, Max2[n] = -2;
  for (int i = n; i > 0; i--)
  {
    int t = a[i - 1];
    if (t > Max1[i])
    {
      Max1[i - 1] = t;
      Max2[i - 1] = Max1[i];
    }
    else if (t > Max2[i])
    {
      Max1[i - 1] = Max1[i];
      Max2[i - 1] = t;
    }
    else
    {
      Max1[i - 1] = Max1[i];
      Max2[i - 1] = Max2[i];
    }
  }

  //条件を満たす順列Bで、先頭i文字が一致し、a[i]!=b[i]となるものがあるか
  int match = -1;
  bool used_p = false;
  rep(i, n)
  {
    if (used_p)
    {
      if (Max1[i] > a[i])
        match = i;
    }
    else
    {
      if ((Max1[i] > a[i] && Max1[i] != q) || Max2[i] > a[i])
        match = i;
    }
    if (a[i] == p)
      used_p = true;
    else if (a[i] == q && !used_p)
      break;
  }

  dbg(match);
  if (match == -1)
  {
    cout << -1 << endl;
    return 0;
  }
  vector<int> b(n);
  rep(i, n) b[i] = a[i];
  used_p = false;
  rep(i, match)
  {
    if (a[i] == p)
    {
      used_p = true;
      break;
    }
  }
  if (used_p)
  {
    cerr << 1 << endl;
    rep(i, n) b[i] = a[i];
    int m = INF, mi;
    REP(i, match + 1, n)
    {
      if (a[match] < a[i] && a[i] < m)
      {
        m = min(m, a[i]);
        mi = i;
      }
    }
    swap(b[match], b[mi]);
    sort(b.begin() + match + 1, b.end());
  }
  else
  {
    cerr << 2 << endl;
    int m = INF, mi;
    REP(i, match + 1, n)
    {
      if (a[match] < a[i] && a[i] != q && a[i] < m)
      {
        m = min(m, a[i]);
        mi = i;
      }
    }

    swap(b[match], b[mi]);
    sort(b.begin() + match + 1, b.end());
    if (p > q && m != p)
    {
      cerr << "2+" << endl;
      int p_pos, q_pos;
      REP(i, match + 1, n)
      {
        if (b[i] == p)
          p_pos = i;
        else if (b[i] == q)
          q_pos = i;
      }
      assert(q_pos < p_pos);
      rotate(b.begin() + q_pos, b.begin() + q_pos + 1, b.begin() + p_pos + 1);
    }
  }

  rep(i, n) cout << b[i] << (i == n - 1 ? "\n" : " ");

  //----------debug----------
  assert(a < b);
  int p_pos, q_pos;
  rep(i, n)
  {
    if (b[i] == p)
      p_pos = i;
    else if (b[i] == q)
      q_pos = i;
  }
  assert(p_pos < q_pos);
  prev_permutation(all(b));
  rep(i, n)
  {
    if (b[i] == p)
      p_pos = i;
    else if (b[i] == q)
      q_pos = i;
  }
  assert(p_pos > q_pos || a == b);
  return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード