結果
問題 | No.1244 Black Segment |
ユーザー |
![]() |
提出日時 | 2020-10-02 23:16:54 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 114 ms / 2,000 ms |
コード長 | 5,281 bytes |
コンパイル時間 | 2,046 ms |
コンパイル使用メモリ | 185,796 KB |
実行使用メモリ | 45,728 KB |
最終ジャッジ日時 | 2024-07-17 23:42:08 |
合計ジャッジ時間 | 5,383 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define pb(x) push_back(x)#define mp(a, b) make_pair(a, b)#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define lscan(x) scanf("%I64d", &x)#define lprint(x) printf("%I64d", x)#define rep(i, n) for (ll i = 0; i < (n); i++)#define rep2(i, n) for (ll i = n - 1; i >= 0; i--)const int mod = 1e9 + 7;ll gcd(ll a, ll b){ll c = a % b;while (c != 0){a = b;b = c;c = a % b;}return b;}long long extGCD(long long a, long long b, long long &x, long long &y){if (b == 0){x = 1;y = 0;return a;}long long d = extGCD(b, a % b, y, x);y -= a / b * x;return d;}struct UnionFind{vector<ll> data;UnionFind(int sz){data.assign(sz, -1);}bool unite(int x, int y){x = find(x), y = find(y);if (x == y)return (false);if (data[x] > data[y])swap(x, y);data[x] += data[y];data[y] = x;return (true);}int find(int k){if (data[k] < 0)return (k);return (data[k] = find(data[k]));}ll size(int k){return (-data[find(k)]);}};ll M = 1000000007;vector<ll> fac(2000011); //n!(mod M)vector<ll> ifac(2000011); //k!^{M-2} (mod M)ll mpow(ll x, ll n){ll ans = 1;while (n != 0){if (n & 1)ans = ans * x % M;x = x * x % M;n = n >> 1;}return ans;}ll mpow2(ll x, ll n, ll mod){ll ans = 1;while (n != 0){if (n & 1)ans = ans * x % mod;x = x * x % mod;n = n >> 1;}return ans;}void setcomb(){fac[0] = 1;ifac[0] = 1;for (ll i = 0; i < 2000010; i++){fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)}ifac[2000010] = mpow(fac[2000010], M - 2);for (ll i = 2000010; i > 0; i--){ifac[i - 1] = ifac[i] * i % M;}}ll comb(ll a, ll b){if (a == 0 && b == 0)return 1;if (a < b || a < 0)return 0;ll tmp = ifac[a - b] * ifac[b] % M;return tmp * fac[a] % M;}ll perm(ll a, ll b){if (a == 0 && b == 0)return 1;if (a < b || a < 0)return 0;return fac[a] * ifac[a - b] % M;}long long modinv(long long a){long long b = M, u = 1, v = 0;while (b){long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}u %= M;if (u < 0)u += M;return u;}ll modinv2(ll a, ll mod){ll b = mod, u = 1, v = 0;while (b){ll t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}u %= mod;if (u < 0)u += mod;return u;}template <int mod>struct ModInt{int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p){if ((x += p.x) >= mod)x -= mod;return *this;}ModInt &operator-=(const ModInt &p){if ((x += mod - p.x) >= mod)x -= mod;return *this;}ModInt &operator*=(const ModInt &p){x = (int)(1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p){*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const{int a = x, b = mod, u = 1, v = 0, t;while (b > 0){t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const{ModInt ret(1), mul(x);while (n > 0){if (n & 1)ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p){return os << p.x;}friend istream &operator>>(istream &is, ModInt &a){int64_t t;is >> t;a = ModInt<mod>(t);return (is);}static int get_mod() { return mod; }};using mint = ModInt<mod>;vector<vector<mint>> mul(vector<vector<mint>> a, vector<vector<mint>> b){int i, j, k;mint t;int n = a.size(), m = b[0].size(), l = a[0].size();vector<vector<mint>> c(n, vector<mint>(m));for (i = 0; i < n; i++){for (j = 0; j < m; j++){t = 0;for (k = 0; k < l; k++)t += a[i][k] * b[k][j];c[i][j] = t;}}return c;}vector<vector<mint>> mat_pow(vector<vector<mint>> x, ll n){ll k = x.size();vector<vector<mint>> ans(k, vector<mint>(k, 0));for (int i = 0; i < k; i++)ans[i][i] = 1;while (n != 0){if (n & 1)ans = mul(ans, x);x = mul(x, x);n = n >> 1;}return ans;}int main(){ll n, m, a, b;cin >> n >> m >> a >> b;ll l, r;vector<ll> li[111111];rep(i, m){cin >> l >> r;if(l<=r||a<=r){l = max(l, a);r = min(r, b) + 1;li[l].pb(r);li[r].pb(l);}}ll d[111111];rep(i, n + 2) d[i] = 1e9;priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> que;que.push(mp(0, a));while(!que.empty()){auto q = que.top();que.pop();ll now = q.second, nd = q.first;if(nd < d[now]){d[now] = nd;for(auto &e:li[now])que.push(mp(nd + 1, e));}}if(d[b+1]<1e8)cout << d[b + 1] << endl;elsecout << "-1" << endl;}