結果
問題 | No.1244 Black Segment |
ユーザー | sak |
提出日時 | 2020-10-11 01:57:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 201 ms / 2,000 ms |
コード長 | 2,798 bytes |
コンパイル時間 | 2,311 ms |
コンパイル使用メモリ | 222,988 KB |
実行使用メモリ | 26,180 KB |
最終ジャッジ日時 | 2023-09-27 22:45:27 |
合計ジャッジ時間 | 8,641 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,384 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 5 ms
4,384 KB |
testcase_14 | AC | 87 ms
10,376 KB |
testcase_15 | AC | 5 ms
4,376 KB |
testcase_16 | AC | 87 ms
10,464 KB |
testcase_17 | AC | 5 ms
4,376 KB |
testcase_18 | AC | 111 ms
14,496 KB |
testcase_19 | AC | 162 ms
17,288 KB |
testcase_20 | AC | 186 ms
19,456 KB |
testcase_21 | AC | 169 ms
19,016 KB |
testcase_22 | AC | 182 ms
19,248 KB |
testcase_23 | AC | 188 ms
19,572 KB |
testcase_24 | AC | 185 ms
19,876 KB |
testcase_25 | AC | 186 ms
20,728 KB |
testcase_26 | AC | 174 ms
19,116 KB |
testcase_27 | AC | 173 ms
19,864 KB |
testcase_28 | AC | 196 ms
20,332 KB |
testcase_29 | AC | 179 ms
19,356 KB |
testcase_30 | AC | 195 ms
20,928 KB |
testcase_31 | AC | 191 ms
19,032 KB |
testcase_32 | AC | 190 ms
19,492 KB |
testcase_33 | AC | 188 ms
18,868 KB |
testcase_34 | AC | 197 ms
23,876 KB |
testcase_35 | AC | 189 ms
26,180 KB |
testcase_36 | AC | 182 ms
24,952 KB |
testcase_37 | AC | 201 ms
23,768 KB |
testcase_38 | AC | 194 ms
23,156 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> p_ll; template<class T> void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; } #define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++) #define all(vec) vec.begin(), vec.end() #define rep(i,N) repr(i,0,N) #define per(i,N) for (int i=(int)N-1; i>=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector<ll> fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); } ll lcm(ll a, ll b) { return a/gcd(a,b)*b; } struct button { ll l, r; }; // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- struct dijkstra { ll N; struct edge { ll to, d; }; vector<vector<edge>> adj; vector<ll> minlen; dijkstra(ll n) { N = n; adj.resize(N); minlen.assign(N,LLINF); } ll operator[](const ll &x) const { return minlen[x]; } void add_edge(ll from, ll to, ll d){ adj[from].push_back({to,d}); adj[to].push_back({from,d}); } vector<ll> calc(ll n=0) { auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;}; priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c); minlen[n] = 0; q.push(make_pair(n,0)); while(q.size()) { p_ll now = q.top(); q.pop(); ll np = now.first, nd = now.second; if (nd>minlen[np]) continue; for (auto x: adj[np]) { if (minlen[x.to]<=minlen[np]+x.d) continue; q.push(make_pair(x.to, minlen[np]+x.d)); minlen[x.to] = minlen[np]+x.d; } } return minlen; } }; // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- int main() { ll N, M, A, B; cin >> N >> M >> A >> B; A--; button b[M]; rep(i,M) { cin >> b[i].l >> b[i].r; b[i].l--; } map<ll, ll> m; rep(i,M) { m[b[i].l]++; m[b[i].r]++; } ll tm = 1; for (auto &x: m) { x.second = tm; tm++; } // for (auto x: m) cout << x.first << "-" << x.second << " "; cout << endl; N = m.size() + 2; dijkstra d(N); rep(i,M) d.add_edge(m[b[i].l],m[b[i].r],1); for (auto x: m) { if (x.first<=A) d.add_edge(0,x.second,0); if (x.first>=B) d.add_edge(N-1,x.second,0); } vector<ll> dis = d.calc(); // debug(all(dis)); ll result = dis[N-1]==LLINF ? -1 : dis[N-1]; cout << result << endl; return 0; }