結果
問題 | No.1400 すごろくで世界旅行 |
ユーザー |
![]() |
提出日時 | 2020-12-09 08:16:28 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,507 bytes |
コンパイル時間 | 2,495 ms |
コンパイル使用メモリ | 198,216 KB |
最終ジャッジ日時 | 2025-01-16 20:39:28 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 WA * 3 |
ソースコード
// head of mylib.h #include <bits/stdc++.h> using ll = long long; using ull = unsigned long long; using pi = std::pair<ll, ll>; #define chmin(x, a) ((x) = std::min({(x), (a)}) #define chmax(x, a) ((x) = std::max({(x), (a)}) template <class T> class V : public std::vector<T> { typedef std::vector<T> vector; public: using vector::begin; using vector::end; using vector::operator[]; using vector::back; using vector::clear; using vector::const_iterator; using vector::empty; using vector::erase; using vector::front; using vector::insert; using vector::iterator; using vector::pop_back; using vector::push_back; using vector::rbegin; using vector::rend; using vector::resize; using vector::size; using vector::vector; ll sum() const { ll x = 0; std::cout << "sum()" << std::endl; return x; } ll max() const { ll x = std::numeric_limits<ll>::min(); std::cout << "max()" << std::endl; return x; } ll min() const { ll x = std::numeric_limits<ll>::max(); std::cout << "min()" << std::endl; return x; } }; template <class T> using VV = V<V<T>>; template <class T> std::ostream& operator<<(std::ostream& os, const V<T>& v) { for (auto itr = v.begin(); itr != v.end();++itr) os << (itr != v.begin() ? " " : "") << *itr; os << std::endl; return os; } template <class T> std::istream& operator>>(std::istream& is, V<T>& v) { for (auto& i : v) is >> i; return is; } void fin(const char* str){ std::cout << str << std::endl; exit(0); } // end of mylib.h using namespace std; #define MAX_LEN 1000 int main() { int v, d; cin >> v >> d; using bs = bitset<MAX_LEN>; V<bs> E(v); for (auto& i : E) { string str; cin >> str; reverse(str.begin(), str.end()); i = bs(str); } for (int i = 0; i < v; ++i) { bs reachable = E[i], back1, back2; back1[i] = true; // already consumed 1 turn for reachable for (int j = 0; j < d - 1; ++j) { bs diff = reachable ^ back2; // back1 ^ back2 if (diff.none()) break; back2 = back1; for (int k = diff._Find_first(); k < v; k = diff._Find_next(k)) back1 |= E[k]; swap(reachable, back1); } if (reachable.count() < v) return cout << "No" << endl, 0; } cout << "Yes" << endl; }