結果

問題 No.1544 [Cherry 2nd Tune C] Synchroscope
ユーザー scol_kpscol_kp
提出日時 2021-06-11 21:55:14
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 137 ms / 2,000 ms
コード長 4,171 bytes
コンパイル時間 2,038 ms
コンパイル使用メモリ 201,408 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-08-21 12:17:55
合計ジャッジ時間 4,095 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 5 ms
4,376 KB
testcase_04 AC 8 ms
4,380 KB
testcase_05 AC 6 ms
4,376 KB
testcase_06 AC 7 ms
4,380 KB
testcase_07 AC 7 ms
4,376 KB
testcase_08 AC 5 ms
4,376 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 7 ms
4,376 KB
testcase_11 AC 5 ms
4,376 KB
testcase_12 AC 4 ms
4,380 KB
testcase_13 AC 2 ms
4,376 KB
testcase_14 AC 8 ms
4,376 KB
testcase_15 AC 10 ms
4,380 KB
testcase_16 AC 4 ms
4,376 KB
testcase_17 AC 3 ms
4,380 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 8 ms
4,380 KB
testcase_21 AC 3 ms
4,376 KB
testcase_22 AC 2 ms
4,376 KB
testcase_23 AC 12 ms
4,380 KB
testcase_24 AC 13 ms
4,380 KB
testcase_25 AC 12 ms
4,380 KB
testcase_26 AC 12 ms
4,376 KB
testcase_27 AC 12 ms
4,380 KB
testcase_28 AC 13 ms
4,376 KB
testcase_29 AC 13 ms
4,376 KB
testcase_30 AC 13 ms
4,376 KB
testcase_31 AC 12 ms
4,376 KB
testcase_32 AC 13 ms
4,376 KB
testcase_33 AC 137 ms
4,380 KB
testcase_34 AC 1 ms
4,376 KB
testcase_35 AC 2 ms
4,380 KB
testcase_36 AC 2 ms
4,376 KB
testcase_37 AC 2 ms
4,376 KB
testcase_38 AC 12 ms
4,380 KB
testcase_39 AC 12 ms
4,376 KB
testcase_40 AC 12 ms
4,376 KB
testcase_41 AC 12 ms
4,380 KB
testcase_42 AC 12 ms
4,376 KB
testcase_43 AC 12 ms
4,380 KB
testcase_44 AC 12 ms
4,376 KB
testcase_45 AC 12 ms
4,376 KB
testcase_46 AC 12 ms
4,376 KB
testcase_47 AC 12 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FASTIO
using namespace std;

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <std::ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
#if __cplusplus >= 201703L
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {
#else
        void operator()(const Args&... args) const {
#endif
            print(args...);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
#else
        void pvec(const T& vec, size_t sz) const {
#endif
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
#if __cplusplus >= 201703L
        auto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
#else
        void pmat(const T& mat, size_t h, size_t w) const {
#endif
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

template <typename T>
constexpr std::pair<T, T> extended_euclidean(const T& a, const T& b) {
    T x = 1, y = 0, u = 0, v = 1, s = a, t = b;
    T k = 0, tmp = 0;
    while (t) {
        k = s / t, s -= k * t;
        tmp = s, s = t, t = tmp;
        x -= k * u;
        tmp = x, x = u, u = tmp;
        y -= k * v;
        tmp = y, y = v, v = tmp;
    }
    return {x, y};
}

void solve() {
    ll N, M;
    cin >> N >> M;
    Vl A(N), B(M);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (ll i = 0; i < M; i++) {
        cin >> B[i];
    }

    auto [p, q] = extended_euclidean(N, M);
    ll d = N * p + M * q;
    ll l = N * M / d;

    ll ans = L_INF;
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < M; j++) {
            if (A[i] == B[j] && (j - i) % d == 0) {
                ll s = (j - i) / d;
                ll x = i + s * N * p;
                x %= l;
                if (x < 0) x += l;
                chmin(ans, x);
            }
        }
    }

    if (ans == L_INF) {
        prints()(-1);
    } else {
        prints()(ans + 1);
    }
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}
0