#852867 (C++17) No.2254 Reverse Only

提出ソース

結果

問題	No.2254 Reverse Only
ユーザー	dyktr_06
提出日時	2023-03-24 23:43:37
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	103 ms / 2,000 ms
コード長	5,585 bytes
コンパイル時間	3,965 ms
コンパイル使用メモリ	268,744 KB
実行使用メモリ	28,244 KB
最終ジャッジ日時	2024-09-18 17:42:57
合計ジャッジ時間	7,563 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	3 ms 6,940 KB
testcase_07	AC	3 ms 6,944 KB
testcase_08	AC	68 ms 12,668 KB
testcase_09	AC	103 ms 26,928 KB
testcase_10	AC	41 ms 9,468 KB
testcase_11	AC	71 ms 12,668 KB
testcase_12	AC	67 ms 9,468 KB
testcase_13	AC	66 ms 9,468 KB
testcase_14	AC	66 ms 9,468 KB
testcase_15	AC	71 ms 12,624 KB
testcase_16	AC	96 ms 28,160 KB
testcase_17	AC	91 ms 27,804 KB
testcase_18	AC	65 ms 9,468 KB
testcase_19	AC	54 ms 12,668 KB
testcase_20	AC	74 ms 27,584 KB
testcase_21	AC	74 ms 26,880 KB
testcase_22	AC	53 ms 27,212 KB
testcase_23	AC	65 ms 28,128 KB
testcase_24	AC	63 ms 26,752 KB
testcase_25	AC	63 ms 27,096 KB
testcase_26	AC	64 ms 28,244 KB
testcase_27	AC	4 ms 6,944 KB
testcase_28	AC	17 ms 6,944 KB
testcase_29	AC	30 ms 6,940 KB
testcase_30	AC	27 ms 7,892 KB
testcase_31	AC	15 ms 6,944 KB
testcase_32	AC	16 ms 6,944 KB
testcase_33	AC	9 ms 6,940 KB
testcase_34	AC	38 ms 6,940 KB
testcase_35	AC	26 ms 6,940 KB
testcase_36	AC	59 ms 11,280 KB
testcase_37	AC	60 ms 11,588 KB
testcase_38	AC	12 ms 6,940 KB
testcase_39	AC	53 ms 10,928 KB
testcase_40	AC	3 ms 6,944 KB
testcase_41	AC	22 ms 6,940 KB
testcase_42	AC	13 ms 6,940 KB
testcase_43	AC	40 ms 7,108 KB
testcase_44	AC	60 ms 9,116 KB
testcase_45	AC	40 ms 9,324 KB
testcase_46	AC	3 ms 6,940 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
vector<int> z_algorithm(const T &s) {
    int n = s.size();
    vector<int> res(n, 0);
    for(int i = 1, j = 0; i < n; ++i){
        if(i + res[i - j] < j + res[j]){
            res[i] = res[i - j];
        }else{
            res[i] = max(j + res[j] - i, 0);
            while(i + res[i] < n && s[i + res[i]] == s[res[i]]) ++res[i];
            j = i;
        }
    }
    res[0] = n;
    return res;
}

ll n, k;
vll a, b;

void input(){
    in(n, k);
    vin(a, n);
    vin(b, n);
}

void solve(){
    vll a2 = a, b2 = b;
    Sort(a2); Sort(b2);
    if(a2 != b2){
        out("No");
        return;
    }
    if(a == b){
        out("Yes");
        return;
    }
    if(k > n){
        out("No");
        return;
    }
    vll inv(200001, -1);
    rep(i, n){
        if(inv[b[i]] == -1) inv[b[i]] = i;
        b[i] = inv[b[i]];
    }
    rep(i, n){
        a[i] = inv[a[i]];
    }
    vll ra = a;
    reverse(ALL(ra));
    if(k == n){
        if(a == b || ra == b){
            out("Yes");
        }else{
            out("No");
        }
    }else if(k == n - 1){
        string ans = "No";
        vll c = b;
        rep(i, 2 * n) c.push_back(a[i % n]);
        rep(i, 2 * n) c.push_back(ra[i % n]);
        vi z = z_algorithm(c);
        rep(i, n, 5 * n){
            if(z[i] >= n){
                ans = "Yes";
                break;
            }
        }
        // vout(z, " ");
        out(ans);
    }else{
        out("Yes");
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード