結果
問題 | No.1244 Black Segment |
ユーザー |
![]() |
提出日時 | 2020-10-02 23:15:35 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 3,173 bytes |
コンパイル時間 | 1,677 ms |
コンパイル使用メモリ | 134,236 KB |
実行使用メモリ | 22,952 KB |
最終ジャッジ日時 | 2024-07-17 23:38:20 |
合計ジャッジ時間 | 3,940 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#pragma GCC optimize("Ofast")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")#pragma GCC optimize("unroll-loops")//#pragma warning(disable : 4996)//#define ATCODER#ifdef ATCODER#include<atcoder/all>using namespace atcoder;#endif#include <algorithm>#include <utility>#include <vector>#ifdef _MSC_VER#include <intrin.h>#define __builtin_popcount __popcnt#define __builtin_popcountll __popcnt64#endif#include <limits.h>#include <math.h>#include <time.h>#include <algorithm>#include <array>#include <bitset>#include <cassert>#include <complex>#include <cstdio>#include <cstring>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;#define REP(i, n) for (int i = 0; i < (n); ++i)#define REPR(i, n) for (int i = n - 1; i >= 0; --i)#define FOR(i, m, n) for (int i = m; i < n; ++i)#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)#define SORT(v, n) sort(v, v + n);#define VSORT(v) sort(v.begin(), v.end());#define REVERSE(v, n) reverse(v, v + n);#define VREVERSE(v) reverse(v.begin(), v.end())#define ll long long#define print(x) cout << (x) << '\n'#define pe(x) cout << (x) << " "#define DEBUG(x) cout << #x << ": " << x << endl#define lb(v, n) lower_bound(v.begin(), v.end(), (n))#define ub(v, n) upper_bound(v.begin(), v.end(), (n))#define int long long//#define double long double#define all(x) (x).begin(), (x).end()#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]template <typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }typedef pair<int, int> pii;typedef pair<long long, long long> pll;std::random_device rd;std::mt19937 mt(rd());constexpr ll MOD = 998244353;constexpr int MAX = 440000;const double pi = acos(-1);constexpr double EPS = 1e-8;constexpr ll LINF = 1e17 + 1;constexpr int INF = 1e9 + 1;using P = pii;struct edge { int to, cost; };int V;//頂点数vector<edge>G[MAX];int d[MAX];//始点からの距離void dijkstra(int s) {priority_queue<P, vector<P>, greater<P>>que;fill(d, d + V, INF);d[s] = 0;que.push(P(0, s));while (!que.empty()) {P p = que.top(); que.pop();int v = p.second;if (d[v] < p.first)continue;for (int i = 0; i < G[v].size(); i++) {edge e = G[v][i];if (d[e.to] > d[v] + e.cost) {d[e.to] = d[v] + e.cost;que.push(P(d[e.to], e.to));}}}}void solve() {int N, M, A, B; cin >> N >> M >> A >> B;int pa = A;V = N+1;B -= A;A = 0;B++;vector<pii>vp;REP(i, M) {int l, r; cin >> l >> r;l -= pa, r -= pa;r++;l = max(0LL, l);r = min(B, r);if (r <= 0)continue;G[l].push_back({ r,1 });G[r].push_back({ l,1 });}dijkstra(0);if (d[B] == INF)print(-1);else print(d[B]);}signed main() {cin.tie(0);ios::sync_with_stdio(false);//int q;//cin >> q;//while (q--)solve();}