結果
問題 | No.1051 PQ Permutation |
ユーザー | 👑 tute7627 |
提出日時 | 2020-05-08 22:20:49 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,470 bytes |
コンパイル時間 | 2,432 ms |
コンパイル使用メモリ | 210,392 KB |
実行使用メモリ | 7,160 KB |
最終ジャッジ日時 | 2024-07-05 19:42:51 |
合計ジャッジ時間 | 5,506 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 51 ms
5,376 KB |
testcase_16 | AC | 51 ms
5,376 KB |
testcase_17 | AC | 38 ms
5,376 KB |
testcase_18 | AC | 38 ms
5,376 KB |
testcase_19 | AC | 37 ms
5,376 KB |
testcase_20 | AC | 49 ms
7,160 KB |
testcase_21 | AC | 46 ms
5,376 KB |
testcase_22 | AC | 37 ms
5,376 KB |
testcase_23 | AC | 46 ms
5,376 KB |
testcase_24 | AC | 46 ms
5,376 KB |
testcase_25 | AC | 5 ms
5,376 KB |
testcase_26 | AC | 4 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 | 6 ms
5,376 KB |
testcase_31 | AC | 3 ms
5,376 KB |
testcase_32 | AC | 6 ms
5,376 KB |
testcase_33 | AC | 3 ms
5,376 KB |
testcase_34 | AC | 3 ms
5,376 KB |
testcase_35 | AC | 19 ms
5,376 KB |
testcase_36 | AC | 21 ms
5,376 KB |
testcase_37 | AC | 21 ms
5,376 KB |
testcase_38 | AC | 41 ms
7,044 KB |
testcase_39 | AC | 21 ms
5,376 KB |
testcase_40 | AC | 36 ms
5,376 KB |
testcase_41 | AC | 36 ms
5,376 KB |
testcase_42 | WA | - |
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 | WA | - |
testcase_48 | WA | - |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:78:3: warning: 'idx1' may be used uninitialized [-Wmaybe-uninitialized] 78 | if(idx1<idx2){ | ^~ main.cpp:73:6: note: 'idx1' was declared here 73 | ll idx1,idx2; | ^~~~ main.cpp:78:3: warning: 'idx2' may be used uninitialized [-Wmaybe-uninitialized] 78 | if(idx1<idx2){ | ^~ main.cpp:73:11: note: 'idx2' was declared here 73 | ll idx1,idx2; | ^~~~
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2> bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2> bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2> void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++) {for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0]; for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T> vector<vector<T>>vec(ll x, ll y, T w){ vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,0,-1,0,1,1,-1,-1}; vector<ll>dy={0,1,0,-1,1,-1,1,-1}; template<typename T> vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts> auto make_v(size_t a,Ts... ts){ return vector<decltype(make_v(ts...))>(a,make_v(ts...)); } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2>&p){ return os << p.first << " " << p.second; } //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,p,q;cin>>n>>p>>q; vector<ll>a(n); rep(i,0,n)cin>>a[i]; if(!next_permutation(ALL(a))){ cout<<-1<<endl; return 0; } ll idx1,idx2; rep(i,0,n){ if(a[i]==p)idx1=i; if(a[i]==q)idx2=i; } if(idx1<idx2){ debug(a,n); return 0; } ll mx=0; rrep(i,0,n){ chmax(mx,a[i]); //cout<<i spa mx spa a[i] spa idx2<<endl; if(i<=idx2&&mx>a[i]){ ll mi=INF,midx=-1; rep(j,i,n){ if(a[i]<a[j]){ if(chmin(mi,a[j])){ midx=j; } } } //cout<<i spa mi spa midx<<endl; swap(a[i],a[midx]); if(mi==p||p<q){ sort(a.begin()+i+1,a.end()); debug(a,n); } else{ auto v=vector<ll>(a.begin(),a.begin()+i+1); sort(a.begin()+i+1,a.end()); //debug(a,n); rep(j,i+1,n){ if(a[j]<p&&a[j]!=q){ v.PB(a[j]); } else if(a[j]==p){ //cout<<j spa p spa q<<endl; v.PB(p); v.PB(q); p=INF; } } debug(v,n); } return 0; } } cout<<-1<<endl; return 0; return 0; }