結果
問題 |
No.1244 Black Segment
|
ユーザー |
|
提出日時 | 2022-09-18 23:42:28 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 85 ms / 2,000 ms |
コード長 | 2,865 bytes |
コンパイル時間 | 4,930 ms |
コンパイル使用メモリ | 242,784 KB |
実行使用メモリ | 10,240 KB |
最終ジャッジ日時 | 2024-12-22 01:52:26 |
合計ジャッジ時間 | 8,037 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> typedef long long int ll; using namespace std; using namespace atcoder; typedef pair<ll, ll> P; #define loop(i,n) for(int i=0;i<n;i++) template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>; const ll MOD = 998244353; using mint = modint998244353; // const ll MOD = 1000000007; // using mint = modint1000000007; const int MAX = 2000005; long long fac[MAX], finv[MAX], inv[MAX]; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } long long COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } ll gcd(ll x, ll y) { if (y == 0) return x; else if (y > x) { return gcd (y, x); } else return gcd(x % y, y); } ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } ll my_sqrt(ll x) { ll m = 0; ll M = 3000000001; while (M - m > 1) { ll now = (M + m) / 2; if (now * now <= x) { m = now; } else { M = now; } } return m; } ll keta(ll n, ll hou) { ll ret = 0; while (n) { n /= hou; ret++; } return ret; } ll ceil(ll n, ll m) { // n > 0, m > 0 ll ret = n / m; if (n % m) ret++; return ret; } ll pow_ll(ll x, ll n) { if (n == 0) return 1; if (n % 2) { return pow_ll(x, n - 1) * x; } else { ll tmp = pow_ll(x, n / 2); return tmp * tmp; } } vector<ll> compress(vector<ll> v) { // [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0] vector<ll> u = v; sort(u.begin(), u.end()); u.erase(unique(u.begin(),u.end()),u.end()); map<ll, ll> mp; for (int i = 0; i < u.size(); i++) { mp[u[i]] = i; } for (int i = 0; i < v.size(); i++) { v[i] = mp[v[i]]; } return v; } vector<int> e[100002]; vector<int> dis(100002, 100002); int main() { int n, m, a, b; cin >> n >> m >> a >> b; dsu d(n + 2); for (int i = 1; i <= m; i++) { int l, r; cin >> l >> r; r++; if (l <= a) { l = 1; } if (r >= b + 1) { r = n + 1; } e[l].push_back(r); e[r].push_back(l); } queue<int> que; que.push(1); dis[1] = 0; while (que.size()) { int x = que.front(); que.pop(); for (auto y : e[x]) { if (dis[y] > dis[x] + 1) { dis[y] = dis[x] + 1; que.push(y); } } } if (dis[n + 1] == 100002) { cout << -1 << endl; } else cout << dis[n + 1] << endl; return 0; }