結果
問題 | No.1051 PQ Permutation |
ユーザー |
![]() |
提出日時 | 2020-03-26 19:27:45 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,789 bytes |
コンパイル時間 | 1,810 ms |
コンパイル使用メモリ | 170,592 KB |
実行使用メモリ | 10,624 KB |
最終ジャッジ日時 | 2024-07-05 19:28:30 |
合計ジャッジ時間 | 6,263 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 12 TLE * 1 -- * 33 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:60:5: warning: 'q_pos' may be used uninitialized [-Wmaybe-uninitialized] 60 | if (p_pos < q_pos) | ^~ main.cpp:51:16: note: 'q_pos' was declared here 51 | int p_pos, q_pos; | ^~~~~ main.cpp:60:5: warning: 'p_pos' may be used uninitialized [-Wmaybe-uninitialized] 60 | if (p_pos < q_pos) | ^~ main.cpp:51:9: note: 'p_pos' was declared here 51 | int p_pos, q_pos; | ^~~~~
ソースコード
#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 DINF = 1e12;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") << "\n"#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];vector<int> b(all(a));while (NP(b)){int p_pos, q_pos;rep(i, n){if (b[i] == p)p_pos = i;else if (b[i] == q)q_pos = i;}if (p_pos < q_pos){rep(i, n) cout << b[i] << (i == n - 1 ? "\n" : " ");return 0;}}cout << -1 << endl;return 0;}