結果
| 問題 | No.2748 Strange Clock |
| ユーザー |
 noya2
|
| 提出日時 | 2024-04-21 04:41:58 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,025 ms / 2,000 ms |
| コード長 | 10,917 bytes |
| コンパイル時間 | 2,999 ms |
| コンパイル使用メモリ | 264,432 KB |
| 実行使用メモリ | 94,548 KB |
| 最終ジャッジ日時 | 2024-10-13 03:08:09 |
| 合計ジャッジ時間 | 9,026 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 37 |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"using namespace std;#include<bits/stdc++.h>#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"namespace noya2 {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p){os << p.first << " " << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p){is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v){int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v){for (auto &x : v) is >> x;return is;}void in() {}template <typename T, class... U>void in(T &t, U &...u){cin >> t;in(u...);}void out() { cout << "\n"; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &...u){cout << t;if (sizeof...(u)) cout << sep;out(u...);}template<typename T>void out(const vector<vector<T>> &vv){int s = (int)vv.size();for (int i = 0; i < s; i++) out(vv[i]);}struct IoSetup {IoSetup(){cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetup_noya2;} // namespace noya2#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"namespace noya2{const int iinf = 1'000'000'007;const long long linf = 2'000'000'000'000'000'000LL;const long long mod998 = 998244353;const long long mod107 = 1000000007;const long double pi = 3.14159265358979323;const vector<int> dx = {0,1,0,-1,1,1,-1,-1};const vector<int> dy = {1,0,-1,0,1,-1,-1,1};const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string alp = "abcdefghijklmnopqrstuvwxyz";const string NUM = "0123456789";void yes(){ cout << "Yes\n"; }void no(){ cout << "No\n"; }void YES(){ cout << "YES\n"; }void NO(){ cout << "NO\n"; }void yn(bool t){ t ? yes() : no(); }void YN(bool t){ t ? YES() : NO(); }} // namespace noya2#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"namespace noya2{unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){if (a == 0 || b == 0) return a + b;int n = __builtin_ctzll(a); a >>= n;int m = __builtin_ctzll(b); b >>= m;while (a != b) {int mm = __builtin_ctzll(a - b);bool f = a > b;unsigned long long c = f ? a : b;b = f ? b : a;a = (c - b) >> mm;}return a << min(n, m);}template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }long long sqrt_fast(long long n) {if (n <= 0) return 0;long long x = sqrt(n);while ((x + 1) * (x + 1) <= n) x++;while (x * x > n) x--;return x;}template<typename T> T floor_div(const T n, const T d) {assert(d != 0);return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);}template<typename T> T ceil_div(const T n, const T d) {assert(d != 0);return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);}template<typename T> void uniq(vector<T> &v){sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }} // namespace noya2#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"#define rep(i,n) for (int i = 0; i < (int)(n); i++)#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)#define all(v) (v).begin(),(v).end()using ll = long long;using ld = long double;using uint = unsigned int;using ull = unsigned long long;using pii = pair<int,int>;using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;namespace noya2{/* ~ (. _________ . /) */}using namespace noya2;#line 2 "c.cpp"#line 2 "/Users/noya2/Desktop/Noya2_library/math/crt.hpp"#line 2 "/Users/noya2/Desktop/Noya2_library/math/prime.hpp"#line 4 "/Users/noya2/Desktop/Noya2_library/math/prime.hpp"namespace noya2 {constexpr ll safe_mod(ll x, ll m) {x %= m;if (x < 0) x += m;return x;}constexpr ll pow_mod_constexpr(ll x, ll n, int m) {if (m == 1) return 0;uint _m = (uint)(m);ull r = 1;ull y = safe_mod(x, m);while (n) {if (n & 1) r = (r * y) % _m;y = (y * y) % _m;n >>= 1;}return r;}constexpr bool is_prime_constexpr(int n) {if (n <= 1) return false;if (n == 2 || n == 7 || n == 61) return true;if (n % 2 == 0) return false;ll d = n - 1;while (d % 2 == 0) d /= 2;constexpr ll bases[3] = {2, 7, 61};for (ll a : bases) {ll t = d;ll y = pow_mod_constexpr(a, t, n);while (t != n - 1 && y != 1 && y != n - 1) {y = y * y % n;t <<= 1;}if (y != n - 1 && t % 2 == 0) {return false;}}return true;}template <int n> constexpr bool is_prime_flag = is_prime_constexpr(n);constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {a = safe_mod(a, b);if (a == 0) return {b, 0};long long s = b, t = a;long long m0 = 0, m1 = 1;while (t) {long long u = s / t;s -= t * u;m0 -= m1 * u;auto tmp = s;s = t;t = tmp;tmp = m0;m0 = m1;m1 = tmp;}if (m0 < 0) m0 += b / s;return {s, m0};}constexpr int primitive_root_constexpr(int m) {if (m == 2) return 1;if (m == 167772161) return 3;if (m == 469762049) return 3;if (m == 754974721) return 11;if (m == 998244353) return 3;int divs[20] = {};divs[0] = 2;int cnt = 1;int x = (m - 1) / 2;while (x % 2 == 0) x /= 2;for (int i = 3; (ll)(i)*i <= x; i += 2) {if (x % i == 0) {divs[cnt++] = i;while (x % i == 0) {x /= i;}}}if (x > 1) {divs[cnt++] = x;}for (int g = 2;; g++) {bool ok = true;for (int i = 0; i < cnt; i++) {if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {ok = false;break;}}if (ok) return g;}}template <int m> constexpr int primitive_root_flag = primitive_root_constexpr(m);} // namespace noya2#line 4 "/Users/noya2/Desktop/Noya2_library/math/crt.hpp"namespace noya2 {// (rem, mod)std::pair<long long, long long> crt(const std::vector<long long>& r,const std::vector<long long>& m) {assert(r.size() == m.size());int n = int(r.size());// Contracts: 0 <= r0 < m0long long r0 = 0, m0 = 1;for (int i = 0; i < n; i++) {assert(1 <= m[i]);long long r1 = safe_mod(r[i], m[i]), m1 = m[i];if (m0 < m1) {std::swap(r0, r1);std::swap(m0, m1);}if (m0 % m1 == 0) {if (r0 % m1 != r1) return {0, 0};continue;}// assume: m0 > m1, lcm(m0, m1) >= 2 * max(m0, m1)// (r0, m0), (r1, m1) -> (r2, m2 = lcm(m0, m1));// r2 % m0 = r0// r2 % m1 = r1// -> (r0 + x*m0) % m1 = r1// -> x*u0*g = r1-r0 (mod u1*g) (u0*g = m0, u1*g = m1)// -> x = (r1 - r0) / g * inv(u0) (mod u1)// im = inv(u0) (mod u1) (0 <= im < u1)long long g, im;std::tie(g, im) = inv_gcd(m0, m1);long long u1 = (m1 / g);// |r1 - r0| < (m0 + m1) <= lcm(m0, m1)if ((r1 - r0) % g) return {0, 0};// u1 * u1 <= m1 * m1 / g / g <= m0 * m1 / g = lcm(m0, m1)long long x = (r1 - r0) / g % u1 * im % u1;// |r0| + |m0 * x|// < m0 + m0 * (u1 - 1)// = m0 + m0 * m1 / g - m0// = lcm(m0, m1)r0 += x * m0;m0 *= u1; // -> lcm(m0, m1)if (r0 < 0) r0 += m0;}return {r0, m0};}} // namespace noya2#line 4 "c.cpp"void solve(){int n; in(n);ll m; in(m);ll mod3 = 1, mod4 = 1, mod6 = 1;rep(i,n){mod3 *= 3;mod4 *= 4;mod6 *= 6;}ll mod34 = mod3 * mod4;if (m >= mod34){out(0);return ;}if (n == 15){if (m >= 15407021574586366LL){out(0);}else if (m >= 12839184645488638){out(1594323);}else if (m >= 2567836929097726LL){out(3188646);}else {out(4782969);}return ;}ll imod3mod4 = inv_gcd(mod3,mod4).second;assert(imod3mod4 * mod3 % mod4 == 1);auto crt2 = [&](ll r3, ll r4){ll p = imod3mod4;p *= r4-r3;p = safe_mod(p, mod34);ll x = (r3 + __int128_t(p) * mod3) % mod34;return x;};vector<pll> a(mod3);rep(s,1<<n){int t = s;while (true){ll m3 = 0, m4 = 0, m6 = 0;rep(i,n){int b = (s >> i & 1) + (t >> i & 1);m3 *= 3;m3 += b;m4 *= 4;m4 += b;m6 *= 6;m6 += b;}ll x = crt2(m3,m4);ll v = safe_mod(m6-x,mod6);a[m3] = pll(v,x);if (t == 0) break;--t &= s;}}sort(all(a));int ans = 0;int sz = a.size();int ma = 0;ll dist = linf;ll eist = 0;vector<ll> ds;for (int l = 0, r = 0; l < sz; l = r){while (r < sz && a[l].first == a[r].first) r++;for (int i = l; i < r-1; i++){if (a[i].second < a[i+1].second - m){ans++;}if (a[i+1].second - a[i].second > 1){chmin(dist,a[i+1].second-a[i].second);chmax(eist,a[i+1].second-a[i].second);ds.emplace_back(a[i+1].second-a[i].second);}}if (a[r-1].second < a[l].second + mod34 - m){ans++;}if (a[l].second+mod34-a[r-1].second > 1){chmin(dist,a[l].second+mod34-a[r-1].second);chmax(eist,a[l].second+mod34-a[r-1].second);ds.emplace_back(a[l].second+mod34-a[r-1].second);}chmax(ma,r-l);}out(ans);return ;out(ma);out(dist);out(eist);uniq(ds);for (auto x : ds){out(x);}}int main(){int t = 1; //in(t);while (t--) { solve(); }}