結果
問題 | No.1577 織姫と彦星2 |
ユーザー | ゆにぽけ |
提出日時 | 2023-10-17 18:47:29 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 212 ms / 2,000 ms |
コード長 | 4,141 bytes |
コンパイル時間 | 1,218 ms |
コンパイル使用メモリ | 142,788 KB |
実行使用メモリ | 9,344 KB |
最終ジャッジ日時 | 2024-09-17 16:03:43 |
合計ジャッジ時間 | 8,184 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 3 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 3 ms
6,940 KB |
testcase_05 | AC | 36 ms
6,944 KB |
testcase_06 | AC | 11 ms
6,944 KB |
testcase_07 | AC | 152 ms
8,064 KB |
testcase_08 | AC | 55 ms
6,940 KB |
testcase_09 | AC | 212 ms
9,344 KB |
testcase_10 | AC | 51 ms
6,944 KB |
testcase_11 | AC | 8 ms
6,940 KB |
testcase_12 | AC | 91 ms
6,944 KB |
testcase_13 | AC | 43 ms
6,944 KB |
testcase_14 | AC | 120 ms
7,168 KB |
testcase_15 | AC | 37 ms
6,944 KB |
testcase_16 | AC | 165 ms
8,064 KB |
testcase_17 | AC | 81 ms
6,944 KB |
testcase_18 | AC | 3 ms
6,940 KB |
testcase_19 | AC | 134 ms
7,680 KB |
testcase_20 | AC | 103 ms
7,296 KB |
testcase_21 | AC | 141 ms
8,192 KB |
testcase_22 | AC | 150 ms
7,808 KB |
testcase_23 | AC | 49 ms
6,940 KB |
testcase_24 | AC | 202 ms
8,320 KB |
testcase_25 | AC | 33 ms
6,944 KB |
testcase_26 | AC | 51 ms
6,940 KB |
testcase_27 | AC | 154 ms
7,424 KB |
testcase_28 | AC | 106 ms
7,296 KB |
testcase_29 | AC | 69 ms
6,940 KB |
testcase_30 | AC | 80 ms
6,944 KB |
testcase_31 | AC | 152 ms
8,064 KB |
testcase_32 | AC | 5 ms
6,944 KB |
testcase_33 | AC | 4 ms
6,944 KB |
testcase_34 | AC | 63 ms
6,940 KB |
testcase_35 | AC | 130 ms
7,680 KB |
testcase_36 | AC | 139 ms
7,680 KB |
testcase_37 | AC | 197 ms
8,832 KB |
testcase_38 | AC | 195 ms
8,832 KB |
testcase_39 | AC | 53 ms
6,940 KB |
testcase_40 | AC | 58 ms
6,940 KB |
testcase_41 | AC | 170 ms
8,064 KB |
testcase_42 | AC | 99 ms
6,940 KB |
testcase_43 | AC | 102 ms
6,940 KB |
testcase_44 | AC | 6 ms
6,940 KB |
testcase_45 | AC | 24 ms
6,944 KB |
testcase_46 | AC | 32 ms
6,940 KB |
testcase_47 | AC | 163 ms
7,680 KB |
testcase_48 | AC | 58 ms
6,944 KB |
testcase_49 | AC | 70 ms
6,940 KB |
testcase_50 | AC | 47 ms
6,944 KB |
testcase_51 | AC | 14 ms
6,940 KB |
testcase_52 | AC | 195 ms
8,320 KB |
testcase_53 | AC | 187 ms
8,448 KB |
testcase_54 | AC | 76 ms
6,944 KB |
testcase_55 | AC | 189 ms
8,064 KB |
testcase_56 | AC | 38 ms
6,940 KB |
testcase_57 | AC | 18 ms
6,940 KB |
ソースコード
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cassert> #include<cmath> #include<ctime> #include<iomanip> #include<numeric> #include<stack> #include<queue> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<bitset> #include<random> using namespace std; template<int m> struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; //using mint = modint<998244353>; using mint = modint<1000000007>; #include<algorithm> #include<vector> #include<cassert> using namespace std; struct UnionFind { private: int n; vector<int> par,siz; public: UnionFind(int n) :n(n),par(n,-1),siz(n,1) {} int root(int u) { assert(0 <= u && u < n); return (par[u] < 0 ? u:par[u] = root(par[u])); } bool same(int u,int v) { assert(0 <= u && u < n && 0 <= v && v < n); return root(u) == root(v); } bool unite(int u,int v) { assert(0 <= u && u < n && 0 <= v && v < n); u = root(u),v = root(v); if(u == v) return false; if(siz[u] < siz[v]) swap(u,v); siz[u] += siz[v]; par[v] = u; return true; } int size(int u) { assert(0 <= u && u < n); return siz[root(u)]; } vector<vector<int>> components() { vector<vector<int>> ret(n); for(int u = 0;u < n;u++) ret[root(u)].push_back(u); ret.erase(remove_if(ret.begin(),ret.end(),[](vector<int> v) { return v.empty();}),ret.end()); return ret; } }; int N,A[1 << 16]; vector<int> G[1 << 16]; int dp[1 << 16]; void solve() { cin >> N; map<int,int> mp; cin >> A[0] >> A[N+1]; mp[A[0]] = 0,mp[A[N+1]] = N+1; for(int i = 1;i <= N;i++) { cin >> A[i]; mp[A[i]] = i; } for(int i = 0;i <= N+1;i++) { for(int k = 0;k < 30;k++) { int B = A[i] ^ 1 << k; if(mp.count(B)) { int j = mp[B]; G[i].push_back(j); G[j].push_back(i); } } } for(int i = 0;i <= N+1;i++) dp[i] = -1; dp[0] = 0; queue<int> Q; Q.push(0); while(!Q.empty()) { int u = Q.front(); Q.pop(); for(int v:G[u]) if(dp[v] < 0) dp[v] = dp[u] + 1,Q.push(v); } if(dp[N+1] < 0) cout << -1 << endl; else cout << dp[N+1]-1 << endl; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; //cin >> tt; while(tt--) solve(); }