結果

問題 No.2254 Reverse Only
ユーザー omgflakaomgflaka
提出日時 2023-03-24 21:51:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,048 bytes
コンパイル時間 2,160 ms
コンパイル使用メモリ 209,588 KB
実行使用メモリ 6,388 KB
最終ジャッジ日時 2023-10-18 20:59:51
合計ジャッジ時間 5,508 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 1 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 71 ms
6,388 KB
testcase_09 WA -
testcase_10 AC 40 ms
6,388 KB
testcase_11 AC 71 ms
6,388 KB
testcase_12 AC 72 ms
6,388 KB
testcase_13 AC 41 ms
6,388 KB
testcase_14 AC 42 ms
6,388 KB
testcase_15 AC 41 ms
6,388 KB
testcase_16 AC 72 ms
6,388 KB
testcase_17 AC 72 ms
6,388 KB
testcase_18 AC 72 ms
6,388 KB
testcase_19 AC 57 ms
6,388 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 42 ms
6,388 KB
testcase_25 AC 45 ms
6,388 KB
testcase_26 AC 45 ms
6,388 KB
testcase_27 AC 3 ms
4,348 KB
testcase_28 AC 16 ms
4,348 KB
testcase_29 AC 20 ms
4,804 KB
testcase_30 AC 29 ms
4,540 KB
testcase_31 AC 11 ms
4,348 KB
testcase_32 AC 13 ms
4,348 KB
testcase_33 AC 7 ms
4,348 KB
testcase_34 AC 25 ms
5,068 KB
testcase_35 AC 17 ms
4,540 KB
testcase_36 AC 61 ms
5,860 KB
testcase_37 AC 64 ms
6,124 KB
testcase_38 AC 9 ms
4,348 KB
testcase_39 AC 56 ms
5,596 KB
testcase_40 AC 3 ms
4,348 KB
testcase_41 AC 16 ms
4,348 KB
testcase_42 AC 9 ms
4,348 KB
testcase_43 AC 28 ms
5,332 KB
testcase_44 AC 39 ms
6,124 KB
testcase_45 AC 42 ms
5,068 KB
testcase_46 AC 3 ms
4,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long           ll;
#define vi                  vector<int> 
#define vll                 vector<ll> 
#define vllp                vector<pair<ll,ll>>> 
#define vb                  vector<bool> 
#define pub                 push_back
#define emb                 emplace_back
#define rep(i,a,b)          for(long long i = a; i < b; i++)
#define rrep(i,a,b)         for(long long i = a; i >= b; i--)
#define iterm(key,val,ok)   for(auto const& [key, val]:ok)
#define all(x)              x.begin(),x.end()
#define py                  cout<<"Yes"<<endl
#define pn                  cout<<"No"<<endl
#define pa                  cout<<ans<<endl
#define pe                  cout<<endl
#define mp                  make_pair
#define f                   first 
#define se                  second 
using pll=pair<ll,ll>;
template<typename T>        istream& operator>>(istream& is, vector<T>& v) { for (auto& i : v) is >> i;        return is; }
template<typename T>        ostream& operator<<(ostream& os, const vector<T>& v) { for (auto& i : v) os << i << " "; return os; }
template<typename T>        istream& operator>>(istream& is, pair<T, T>& v) { is >> v.first >> v.second;        return is; }
template<typename T>        ostream& operator<<(ostream& os, const pair<T, T>& v) { os << v.first << " " << v.second; return os; }
 
 
 
/*
problems with mod or small constraints are DP (2d,3d) or combo
ascii: 1=49 a=97 A=65
check edge cases and constraints CHECK FOR JUST ONE ELEMENT OR SAME NUMBERS ETC
always think about reversing a process
see if theres any dumb tricks if youre not getting it: like only having to check small values or sth
(a-b)modm = (a%m+(m-b%m))%m
mark visited after adding to queue
think about transforming representations of graphs, if some graph is too big to be represented, think about bipartite
representation, if its too small maybe you can expand according to problem to make it easier
you can also bfs on pairs of nodes, different representations of nodes etc etc
lower bound can give beyond end also (check segfaults etc if using)
many smol vectors are slowwww, use std:array instead
to search for and remove particular things fastly just use multiset, like u can use prefix multiset and find closest
value of something also like so many applications in just logn time
READ ALL FUCKING SAMPLES, READ EVERYTHING BEFORE PUTTING PEN TO PAPER, START FROM THE SIMPLEST SAMPLE
*/
 
 
void solve(){
    ll n,k;cin>>n>>k;
    vector<ll> a(n),b(n);cin>>a>>b;
    if(a==b){
        py;return;
    }
    reverse(all(a));
    if(a==b && k==n){
        py;return;
    }
    if(k>n-1){
        pn;return;
    }
    sort(all(a));sort(all(b));
    if(a==b){
        py;return;
    }
    pn;
    

}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}
0