結果
問題 | No.1400 すごろくで世界旅行 |
ユーザー | 👑 rin204 |
提出日時 | 2023-01-21 20:18:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 9,318 bytes |
コンパイル時間 | 2,416 ms |
コンパイル使用メモリ | 218,828 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-24 02:58:32 |
合計ジャッジ時間 | 8,522 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,940 KB |
testcase_07 | AC | 7 ms
6,940 KB |
testcase_08 | AC | 3 ms
6,940 KB |
testcase_09 | AC | 3 ms
6,940 KB |
testcase_10 | AC | 4 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 25 ms
6,940 KB |
testcase_13 | AC | 298 ms
6,940 KB |
testcase_14 | WA | - |
testcase_15 | AC | 1,712 ms
6,944 KB |
testcase_16 | AC | 138 ms
6,944 KB |
testcase_17 | AC | 108 ms
6,940 KB |
testcase_18 | AC | 1,095 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,940 KB |
ソースコード
#line 1 "A.cpp" // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; template <class T> using pq = priority_queue<T>; template <class T> using qp = priority_queue<T, vector<T>, greater<T>>; #define vec(T, A, ...) vector<T> A(__VA_ARGS__); #define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__)); #define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__))); #define endl "\n" #define spa ' ' #define len(A) A.size() #define all(A) begin(A), end(A) #define fori1(a) for(ll _ = 0; _ < (a); _++) #define fori2(i, a) for(ll i = 0; i < (a); i++) #define fori3(i, a, b) for(ll i = (a); i < (b); i++) #define fori4(i, a, b, c) for(ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c)) #define overload4(a, b, c, d, e, ...) e #define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__) template <typename T> vector<tuple<ll, T>> ENUMERATE(vector<T> &A, ll s = 0){ vector<tuple<ll, T>> ret(A.size()); for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]}; return ret; } vector<tuple<ll, char>> ENUMERATE(string &A, ll s = 0){ vector<tuple<ll, char>> ret(A.size()); for(int i = 0; i < A.size(); i++) ret[i] = {i + s, A[i]}; return ret; } #define enum1(A) fori(A.size()) #define enum2(a, A) for(auto a:A) #define enum3(i, a, A) for(auto&& [i, a]: ENUMERATE(A)) #define enum4(i, a, A, s) for(auto&& [i, a]: ENUMERATE(A, s)) #define enum(...) overload4(__VA_ARGS__, enum4, enum3, enum2, enum1)(__VA_ARGS__) template <typename T, typename S> vector<tuple<T, S>> ZIP(vector<T> &A, vector<S> &B){ int n = min(A.size(), B.size()); vector<tuple<T, S>> ret(n); for(int i = 0; i < n; i++) ret[i] = {A[i], B[i]}; return ret; } template <typename T, typename S> vector<tuple<ll, T, S>> ENUMZIP(vector<T> &A, vector<S> &B, ll s = 0){ int n = min(A.size(), B.size()); vector<tuple<ll, T, S>> ret(n); for(int i = 0; i < n; i++) ret[i] = {i + s, A[i], B[i]}; return ret; } #define zip4(a, b, A, B) for(auto&& [a, b]: ZIP(A, B)) #define enumzip5(i, a, b, A, B) for(auto&& [i, a, b]: ENUMZIP(A, B)) #define enumzip6(i, a, b, A, B, s) for(auto&& [i, a, b]: ENUMZIP(A, B, s)) #define overload6(a, b, c, d, e, f, g, ...) g #define zip(...) overload6(__VA_ARGS__, enumzip6, enumzip5, zip4, _, _, _)(__VA_ARGS__) vector<char> stoc(string &S){ int n = S.size(); vector<char> ret(n); for(int i = 0; i < n; i++) ret[i] = S[i]; return ret; } #define INT(...) int __VA_ARGS__; inp(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__); #define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__); #define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__); #define VEC(T, A, n) vector<T> A(n); inp(A); #define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A); const ll MOD1 = 1000000007; const ll MOD9 = 998244353; template<class T> auto min(const T& a){ return *min_element(all(a)); } template<class T> auto max(const T& a){ return *max_element(all(a)); } template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } void FLUSH(){cout << flush;} void print(){cout << endl;} template <class Head, class... Tail> void print(Head &&head, Tail &&... tail) { cout << head; if (sizeof...(Tail)) cout << spa; print(forward<Tail>(tail)...); } template<typename T> void print(vector<T> &A){ int n = A.size(); for(int i = 0; i < n; i++){ cout << A[i]; if(i == n - 1) cout << endl; else cout << spa; } } template<typename T> void print(vector<vector<T>> &A){ for(auto &row: A) print(row); } template<typename T, typename S> void print(pair<T, S> &A){ cout << A.first << spa << A.second << endl; } template<typename T, typename S> void print(vector<pair<T, S>> &A){ for(auto &row: A) print(row); } template<typename T, typename S> void prisep(vector<T> &A, S sep){ int n = A.size(); for(int i = 0; i < n; i++){ cout << A[i]; if(i == n - 1) cout << endl; else cout << sep; } } template<typename T, typename S> void priend(T A, S end){ cout << A << end; } template<typename T> void priend(T A){ priend(A, spa); } template<class... T> void inp(T&... a){ (cin >> ... >> a); } template<typename T> void inp(vector<T> &A){ for(auto &a:A) cin >> a; } template<typename T> void inp(vector<vector<T>> &A){ for(auto &row:A) inp(row); } template<typename T, typename S> void inp(pair<T, S> &A){ inp(A.first, A.second); } template<typename T, typename S> void inp(vector<pair<T, S>> &A){ for(auto &row: A) inp(row.first, row.second); } template<typename T> T sum(vector<T> &A){ T tot = 0; for(auto a:A) tot += a; return tot; } template<typename T> pair<vector<T>, map<T, int>> compression(vector<T> X){ sort(all(X)); X.erase(unique(all(X)), X.end()); map<T, int> mp; for(int i = 0; i < X.size(); i++) mp[X[i]] = i; return {X, mp}; } #line 3 "Library/C++/math/BitMatrix.hpp" using namespace std; struct BitMatrix{ using u64 = unsigned long long; int n, m; int m_; vector<vector<u64>> A; BitMatrix() = default; BitMatrix(int n, int m) : n(n), m(m){ m_ = (m + 63) >> 6; A.assign(n, vector<u64>(m_, 0)); } BitMatrix(int n) : n(n), m(n){ m_ = (m + 63) >> 6; A.assign(n, vector<u64>(m_, 0)); } BitMatrix(vector<vector<bool>> &B) : n(B.size()), m(B[0].size()){ m_ = (m + 7) / 8; A.assign(n, vector<u64>(m_, 0)); for(int i = 0; i < n; i++) for(int j = 0; j < m; j++){ A[i][j >> 6] |= 1ull << (j & 63); } } bool at(int i, int j){ return (A[i][j >> 6] >> (j & 63)) & 1; } bool get(int i, int j){ return (A[i][j >> 6] >> (j & 63)) & 1;; } void set(int i, int j, bool t){ if(at(i, j) == t) return; A[i][j >> 6] ^= 1ull << (j & 63); } BitMatrix T(){ BitMatrix B(m, n); for(int i = 0; i < m; i++) for(int j = 0; j < n; j++){ if(at(j, i)){ B.A[i][j >> 6] |= 1ull << (j & 63); } } return B; } BitMatrix &operator&=(const BitMatrix &B){ assert(n == B.n); assert(m == B.m); for(int i = 0; i < n; i++) for(int j = 0; j < m_; j++){ this->A[i][j] &= B.A[i][j]; } return *this; } BitMatrix &operator|=(const BitMatrix &B){ assert(n == B.n); assert(m == B.m); for(int i = 0; i < n; i++) for(int j = 0; j < m_; j++){ this->A[i][j] |= B.A[i][j]; } return *this; } BitMatrix &operator^=(const BitMatrix &B){ assert(n == B.n); assert(m == B.m); for(int i = 0; i < n; i++) for(int j = 0; j < m_; j++){ this->A[i][j] ^= B.A[i][j]; } return *this; } BitMatrix &operator*=(const BitMatrix &B){ assert(m == B.n); vector<vector<u64>> BT(m_, vector<u64>(B.m, 0)); for(int i = 0; i < m; i++) for(int j = 0; j < B.m; j++){ if((B.A[i][j >> 6] >> (j & 63)) & 1){ BT[i >> 6][j] |= 1ull << (i & 63); } } vector<vector<u64>> C(n, vector<u64>((B.m + 63) >> 6, 0)); for(int i = 0; i < n; i++) for(int k = 0; k < B.m; k++){ for(int j = 0; j < m_; j++){ if(A[i][j] & BT[j][k]){ C[i][k >> 6] |= 1ull << (k & 63); break; } } } swap(A, C); return *this; } BitMatrix operator&(const BitMatrix &B) const{ return (BitMatrix(*this) &= B); } BitMatrix operator|(const BitMatrix &B) const{ return (BitMatrix(*this) |= B); } BitMatrix operator^(const BitMatrix &B) const{ return (BitMatrix(*this) ^= B); } BitMatrix operator*(const BitMatrix &B) const{ return (BitMatrix(*this) *= B); } void I(){ assert(n == m); A.assign(n, vector<u64>(m_, 0)); for(int i = 0; i < n; i++){ A[i][i >> 6] |= 1ull << (i & 64); } } BitMatrix pow(u64 k){ assert(n == m); auto B = *this; BitMatrix ret(n, m); ret.I(); while(k > 0){ if(k & 1) ret *= B; B *= B; k >>= 1; } return ret; } }; void print(BitMatrix &M){ for(int i = 0; i < M.n; i++){ for(int j = 0; j < M.m; j++) priend(M.at(i, j), ""); print(); } } #line 186 "A.cpp" void solve(){ LL(v, d); BitMatrix A(v, v); fori(i, v){ STRING(S); enum(j, s, S){ if(s == '1') A.set(i, j, 1); } } A = A.pow(min(v , d)); fori(i, v) fori(j, v){ if(!A.at(i, j)){ print("No"); return; } } print("Yes"); } int main(){ cin.tie(0)->sync_with_stdio(0); int t; t = 1; // cin >> t; while(t--) solve(); return 0; }