結果

問題 No.1473 おでぶなおばけさん
ユーザー kaikeykaikey
提出日時 2021-04-09 22:50:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 115 ms / 2,000 ms
コード長 6,999 bytes
コンパイル時間 2,802 ms
コンパイル使用メモリ 234,488 KB
実行使用メモリ 12,296 KB
最終ジャッジ日時 2024-06-25 06:31:12
合計ジャッジ時間 7,245 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 105 ms
11,740 KB
testcase_03 AC 79 ms
9,944 KB
testcase_04 AC 57 ms
7,872 KB
testcase_05 AC 20 ms
5,376 KB
testcase_06 AC 94 ms
9,892 KB
testcase_07 AC 110 ms
12,292 KB
testcase_08 AC 112 ms
12,296 KB
testcase_09 AC 107 ms
12,164 KB
testcase_10 AC 34 ms
5,632 KB
testcase_11 AC 35 ms
5,632 KB
testcase_12 AC 34 ms
5,632 KB
testcase_13 AC 22 ms
5,376 KB
testcase_14 AC 16 ms
5,376 KB
testcase_15 AC 30 ms
5,376 KB
testcase_16 AC 34 ms
5,504 KB
testcase_17 AC 4 ms
5,376 KB
testcase_18 AC 6 ms
5,376 KB
testcase_19 AC 32 ms
5,888 KB
testcase_20 AC 50 ms
9,072 KB
testcase_21 AC 56 ms
7,680 KB
testcase_22 AC 54 ms
11,064 KB
testcase_23 AC 44 ms
10,040 KB
testcase_24 AC 44 ms
9,836 KB
testcase_25 AC 108 ms
10,784 KB
testcase_26 AC 115 ms
10,804 KB
testcase_27 AC 37 ms
6,016 KB
testcase_28 AC 87 ms
12,132 KB
testcase_29 AC 56 ms
7,552 KB
testcase_30 AC 75 ms
8,192 KB
testcase_31 AC 84 ms
12,124 KB
testcase_32 AC 61 ms
9,852 KB
testcase_33 AC 55 ms
8,848 KB
testcase_34 AC 33 ms
6,528 KB
testcase_35 AC 30 ms
5,760 KB
testcase_36 AC 55 ms
8,320 KB
testcase_37 AC 60 ms
9,428 KB
testcase_38 AC 15 ms
5,376 KB
testcase_39 AC 36 ms
5,504 KB
testcase_40 AC 34 ms
5,632 KB
testcase_41 AC 33 ms
5,632 KB
testcase_42 AC 33 ms
5,632 KB
testcase_43 AC 44 ms
9,516 KB
testcase_44 AC 46 ms
9,512 KB
testcase_45 AC 45 ms
9,512 KB
testcase_46 AC 90 ms
9,444 KB
testcase_47 AC 112 ms
10,588 KB
testcase_48 AC 95 ms
9,944 KB
権限があれば一括ダウンロードができます

ソースコード

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

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef
    pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
for (T& in : v) is >> in;
return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 5e12;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
lint from, to;
lint cost;
Edge() {
}
Edge(lint u, lint v, lint c) {
cost = c;
from = u;
to = v;
}
bool operator<(const Edge& e) const {
return cost < e.cost;
}
};
struct WeightedEdge {
lint to;
lint cost;
WeightedEdge(lint v, lint c = 1) {
to = v;
cost = c;
}
bool operator<(const WeightedEdge& e) const {
return cost < e.cost;
}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<char, lint> valchar;
struct UnionFind {
public:
UnionFind() : _n(0) {}
UnionFind(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
if (used_count) {
if (count_in_set[x].size() < count_in_set[y].size()) {
std::swap(count_in_set[x], count_in_set[y]);
}
for (auto p : count_in_set[y]) {
count_in_set[x][p.first] += p.second;
}
}
if (set_operate) {
root_values[x] = f(root_values[y], root_values[x]);
}
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int>& v) { return v.empty(); }),
result.end());
return result;
}
//update root calc
//set by set operations
void set_operate_and_value(std::vector<lint> array, function<lint(lint, lint)> _f) {
f = _f;
root_values = array;
set_operate = true;
}
lint get_set_value(int a) {
return root_values[leader(a)];
}
//regist count
void regist_count(int a, int label) {
if (!used_count) {
used_count = true;
count_in_set.assign(_n, std::map<int, int>());
}
count_in_set[leader(a)][label]++;
}
int get_count(int a, int label) {
if (!used_count) return -1;
return count_in_set[leader(a)][label];
}
private:
int _n;
std::vector<int> parent_or_size;
std::vector<std::map<int, int>> count_in_set;
bool used_count = false;
std::vector<lint> root_values;
function<lint(lint, lint)> f;
bool set_operate = false;
};
lint N, M, u, v, d;
int main() {
cin >> N >> M;
V<tlint> edges(M);
REP(i, M) {
cin >> u >> v >> d; u--; v--;
edges[i] = { u, {v, d} };
}
auto check = [&](lint v) {
UnionFind tree(N);
REP(i, M) {
if (v <= edges[i].second.second) {
tree.merge(edges[i].first, edges[i].second.first);
}
}
return !tree.same(0, N - 1);
};
lint ng = -1, ok = 1e9 + 1;
while (ok - ng > 1) {
lint mid = (ok + ng) / 2;
if (check(mid)) ok = mid;
else ng = mid;
}
ok = ng;
VVl to(N);
Vl dp(N, INF);
REP(i, M) {
if (ok <= edges[i].second.second) {
to[edges[i].first].push_back(edges[i].second.first);
to[edges[i].second.first].push_back(edges[i].first);
}
}
dp[0] = 0;
queue<lint> que;
que.push(0);
while (!que.empty()) {
lint curr = que.front(); que.pop();
for (lint nxt : to[curr]) {
if (chmin(dp[nxt], dp[curr] + 1)) que.push(nxt);
}
}
cout << ok << " " << dp[N - 1] << endk;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0