結果

問題 No.614 壊れたキャンパス
ユーザー Konton7
提出日時 2020-07-08 17:40:11
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,806 bytes
コンパイル時間 4,025 ms
コンパイル使用メモリ 224,964 KB
最終ジャッジ日時 2025-01-11 16:59:48
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 13 WA * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()
const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(const vector<T> &v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
int n = v.size();
rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
return;
}
template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
int n = v.size();
rep(i, n)
{
t.push_back(v[i].first);
s.push_back(v[i].second);
}
return;
}
template <typename T>
void maxvec(vector<T> &v)
{
T s = v[0];
int n = v.size();
rep(i, n - 1)
{
if (s > v[i + 1])
{
v[i + 1] = s;
}
s = v[i + 1];
}
}
template <typename T, typename S>
bool myfind(T t, S s)
{
return find(t.cbegin(), t.cend(), s) != t.cend();
}
bool check(int y, int x, int h, int w)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
template <typename T>
vector<T> cumsum(const vector<T> &v)
{
T s = 0;
vector<T> ret;
rep(i, v.size())
{
s += v[i];
s %= mod;
ret.emplace_back(s);
}
return ret;
}
bool iskadomatsu(int a, int b, int c)
{
return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}
VS split(string s, char c)
{
VS ret;
string part;
s += c;
rep(i, s.length())
{
if (s[i] == c)
{
ret.emplace_back(part);
part = "";
}
else if (s[i] != c)
{
part += s[i];
}
}
return ret;
}
string removezero(string &s)
{
string ret;
for (auto z : s)
if (z != '0')
ret += z;
return ret;
}
ll sumdigit(ll x)
{
ll ans{0};
while (x > 0)
{
ans += x % 10;
x /= 10;
}
return ans;
}
template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
ll ret = 1, r = p;
while (q)
{
if (q % 2)
ret *= r, ret %= mod;
r = (r * r) % mod, q /= 2;
}
return ret % mod;
}
template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
ll ret = 1, r = p;
while (q)
{
if (q % 2)
ret *= r;
r = (r * r), q /= 2;
}
return ret;
}
void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
rep(i, frac_list.size() - 1)
{
frac_list[i + 1] *= frac_list[i] * (i + 1);
frac_list[i + 1] %= mod;
frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
frac_inv_list[i + 1] %= mod;
}
}
ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
if (a < b)
return 0;
if (b < 0)
return 0;
ll ret = frac_list[a];
ret *= frac_inv_list[b];
ret %= mod;
ret *= frac_inv_list[a - b];
ret %= mod;
return ret;
}
vector<ll> shortest;
VB used;
vector<vector<pair<int, int>>> connective;
void djkstra(int x)
{
priority_queue<ll, VL, greater<ll>> search;
shortest[x] = 0;
search.push(x);
used[x] = true;
while (!search.empty())
{
auto i = search.top();
search.pop();
for (auto [v, d] : connective[i])
{
if (shortest[v] > d + shortest[i])
{
shortest[v] = d + shortest[i];
if (!used[v])
{
search.push(v);
used[v] = true;
}
}
}
}
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt"); //for debug
cin.rdbuf(in.rdbuf()); //for debug
#endif
int n, m, k, s, g, a, b, c, d{0}, diff;
cin >> n >> m >> k >> s >> g;
VVI nodes(n);
VVI node_indexes(n);
vector<TI3> corridors(m);
rep(i, n)
{
nodes[i].emplace_back(1);
nodes[i].emplace_back(k);
}
nodes[0].emplace_back(s);
nodes[n - 1].emplace_back(g);
rep(i, m)
{
cin >> a >> b >> c;
nodes[a - 1].emplace_back(b);
nodes[a].emplace_back(c);
corridors[i] = (TI3){a, b, c};
}
rep(i, n)
{
sort(allpt(nodes[i]));
nodes[i].erase(unique(nodes[i].begin(), nodes[i].end()), nodes[i].end());
for (auto j : nodes[i])
{
node_indexes[i].emplace_back(d);
d++;
}
}
s = lower_bound(allpt_c(nodes[0]), s) - nodes[0].cbegin();
g = lower_bound(allpt_c(nodes[n - 1]), g) - nodes[n - 1].cbegin() + node_indexes[n - 1][0];
// cout << s << wsp << g << rt;
shortest.resize(d);
fill(allpt(shortest), inf);
connective.resize(d);
used.resize(d);
fill(allpt(used), false);
rep(i, n) rep(j, nodes[i].size() - 1)
{
diff = nodes[i][j + 1] - nodes[i][j];
connective[node_indexes[i][j + 1]].emplace_back((PII){node_indexes[i][j], diff});
connective[node_indexes[i][j]].emplace_back((PII){node_indexes[i][j + 1], diff});
}
rep(i, m)
{
auto [a, b, c] = corridors[i];
auto p = lower_bound(allpt_c(nodes[a - 1]), b) - nodes[a - 1].cbegin() + node_indexes[a - 1][0];
auto q = lower_bound(allpt_c(nodes[a]), c) - nodes[a].cbegin() + node_indexes[a][0];
connective[p].emplace_back((PII){q, 0});
}
djkstra(s);
cout << (shortest[g] == inf ? -1 : shortest[g]) << rt;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0