結果

問題 No.3007 組み紐
ユーザー ecotteaecottea
提出日時 2025-01-18 03:00:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 11,165 bytes
コンパイル時間 5,601 ms
コンパイル使用メモリ 254,096 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2025-01-18 03:00:35
合計ジャッジ時間 33,148 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2 WA * 2
other AC * 11 WA * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "YES\n" : "NO\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
using mint = modint998244353;
//using mint = static_modint<1000000007>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(...)
#define dump_math(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//
/*
* Rolling_hash<STR>(STR s, bool reversible = false) : O(n)
* s[0..n) reversible = true
* STR stringvector<T> ll
*
* ull get(int l, int r) : O(1)
* s[l..r) 0
*
* ull get_rev(int l, int r) : O(1)
* s[l..r) 0
*
* ull join(ull hs, ull ht, int len) : O(1)
* hs s ht t[0..len) s+t
*
* ull repeat(ull h, int len, ll K) : O(log K)
* h s[0..len) K
*/
template <class STR>
class Rolling_hash {
// : https://qiita.com/keymoon/items/11fac5627672a6d6a9f6
//
// 2^61 - 1
// a, b < 2^61 - 1 a b mod (2^61 - 1)
//
// a, b
// a = 2^31 ah + al, b = 2^31 bh + bl (ah, bh < 2^30, al, bl < 2^31)
//
// a b
// = (2^31 ah + al)(2^31 bh + bl)
// = 2^62 ah bh + 2^31 (ah bl + bh al) + al bl
// 2^61 ≡ 1 (mod 2^61 - 1) mod 2^61 - 1
//
// 1
// 2^62 ah bh
// = 2 ah bh
// ≦ 2 (2^30-1) (2^30-1)
//
//
// 2 c := ah bl + bh al < 2^62
// c = 2^30 ch + cl (ch < 2^32, cl < 2^30)
//
// 2^31 c
// = 2^31 (2^30 ch + cl)
// = ch + 2^31 cl
// ≦ (2^32-1) + 2^31 (2^30-1)
//
//
// 3
// al bl
// ≦ (2^31-1) (2^31-1)
//
//
//
// 2 ah bh + ch + 2^31 cl + al bl
// ≦ 2 (2^30-1) (2^30-1) + (2^32-1) + 2^31 (2^30-1) + (2^31-1) (2^31-1)
// = 9223372030412324866 < 9223372036854775808 = 2^63 << 2^64
//
static constexpr ull MASK30 = (1ULL << 30) - 1;
static constexpr ull MASK31 = (1ULL << 31) - 1;
static constexpr ull MOD = (1ULL << 61) - 1; //
// a mod (2^61 - 1)
inline ull get_mod(ull a) const {
ull ah = a >> 61, al = a & MOD;
ull res = ah + al;
if (res >= MOD) res -= MOD;
return res;
}
// x ≡ a b mod (2^61 - 1) x < 2^63 a, b < 2^61
inline ull mul(ull a, ull b) const {
ull ah = a >> 31, al = a & MASK31;
ull bh = b >> 31, bl = b & MASK31;
ull c = ah * bl + bh * al;
ull ch = c >> 30, cl = c & MASK30;
ull term1 = 2 * ah * bh;
ull term2 = ch + (cl << 31);
ull term3 = al * bl;
return term1 + term2 + term3; // < 2^63
}
static constexpr ull BASE = 1234567891011; //
static constexpr ull SHIFT = 4295090752; //
//
int n;
// powB[i] : BASE^i
vector<ull> powB;
// v[i] : s[0..i) Σj∈[0..i) (s[j]+SHIFT) BASE^(i-1-j)
// v_rev[i] : s[n-i..n)
vector<ull> v, v_rev;
public:
// s[0..n)
Rolling_hash(const STR& s, bool reversible = false) : n(sz(s)), powB(n + 1), v(n + 1) {
// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec
powB[0] = 1;
rep(i, n) powB[i + 1] = get_mod(mul(powB[i], BASE));
rep(i, n) v[i + 1] = get_mod(mul(v[i], BASE) + (ull)s[i] + SHIFT);
if (reversible) {
v_rev.resize(n + 1);
rep(i, n) v_rev[i + 1] = get_mod(mul(v_rev[i], BASE) + (ull)s[n - 1 - i] + SHIFT);
}
}
Rolling_hash() : n(0) {}
// s[l..r)
ull get(int l, int r) const {
// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec
chmax(l, 0); chmin(r, n);
if (l >= r) return 0;
return get_mod(v[r] + 4 * MOD - mul(v[l], powB[r - l]));
}
// s[l..r)
ull get_rev(int l, int r) {
// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec
chmax(l, 0); chmin(r, n);
if (l >= r) return 0;
Assert(!v_rev.empty());
// s[l..r) s_rev[n-r..n-l)
return get_mod(v_rev[n - l] + 4 * MOD - mul(v_rev[n - r], powB[r - l]));
}
// hs s ht t[0..len) s+t
ull join(ull hs, ull ht, int len) const {
// verify : https://atcoder.jp/contests/abc284/tasks/abc284_f
Assert(len <= n);
return get_mod(ht + mul(hs, powB[len]));
}
// h s[0..len) K
ull repeat(ull h, int len, ll K) const {
// verify : https://mojacoder.app/users/bayashiko/problems/rps
Assert(len <= n);
ull res = 0, pow2 = h; ll len_pow2 = len;
while (K > 0) {
if (K & 1) res = join(res, pow2, len_pow2);
pow2 = join(pow2, pow2, len_pow2);
len_pow2 *= 2;
K /= 2;
}
return res;
}
};
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
auto start = chrono::system_clock::now();
int n, K, L;
cin >> n >> K >> L;
vi a(K + L);
cin >> a;
Rolling_hash A(a);
auto h = A.get(0, INF);
// 5 19 1
int himatubushi = 0;
while (1) {
himatubushi++;
auto now = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(now - start).count();
if (msec >= ((int)(h % 19) + 1) * 100) break;
}
cerr << himatubushi << endl;
EXIT("NO");
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0