結果

問題 No.2642 Don't cut line!
ユーザー kaikeykaikey
提出日時 2024-02-19 22:19:23
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 9,272 bytes
コンパイル時間 3,140 ms
コンパイル使用メモリ 245,184 KB
実行使用メモリ 41,736 KB
最終ジャッジ日時 2024-09-29 03:34:13
合計ジャッジ時間 7,233 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 35 WA * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In member function 'void DoublingLowestCommonAncestor::build()':
main.cpp:217:20: warning: overflow in conversion from 'lint' {aka 'long long int'} to 'int' changes value from '20000000000000' to '-1662697472' [-Woverflow]
  217 |         dfs(0, -1, INF, 0);
      |                    ^~~

ソースコード

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

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#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(30); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](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>; using VVVl = V<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; }
template <class T>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
F f;
rec(F&& f_) : f(std::forward<F>(f_)) {}
template <class... Args> auto operator()(Args &&... args) const {
return f(*this, std::forward<Args>(args)...);
}
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % 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 = 2e13;
lint dx[8] = { 0, 1, 0, -1, 1, -1, 1, -1 }, dy[8] = { 1, 0, -1, 0, -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) {
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<ld, ld> pld;
typedef pair<plint, plint> qlint;
typedef pair<Edge, lint> pEd;
typedef pair<plint, V<plint>> vVl;
typedef pair<string, string> pstr;
typedef pair<ld, lint> pint;
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;
};
struct DoublingLowestCommonAncestor {
int LOG = 2;
vector< int > dep;
const WeightedGraph& g;
vector< vector< int > > table;
vector< vector< lint > > table2;
DoublingLowestCommonAncestor(const WeightedGraph& g) : g(g), dep(g.size()) {
int curr = 1;
while (curr < g.size()) {
curr *= 2;
LOG++;
}
table.assign(LOG, vector< int >(g.size(), -1));
table2.assign(LOG, vector< lint >(g.size(), INF));
}
void dfs(int idx, int par, int w, int d) {
table[0][idx] = par;
table2[0][idx] = w;
dep[idx] = d;
for (auto& to : g[idx]) {
if (to.to != par) dfs(to.to, idx, to.cost, d + 1);
}
}
void build() {
dfs(0, -1, INF, 0);
for (int k = 0; k + 1 < LOG; k++) {
for (int i = 0; i < table[k].size(); i++) {
if (table[k][i] == -1) table[k + 1][i] = -1;
else table[k + 1][i] = table[k][table[k][i]];
if (table[k][i] == -1) table2[k + 1][i] = INF;
else chmin(table2[k + 1][i], table2[k][table[k][i]]);
}
}
}
int query(int u, int v) {
lint res = INF;
if (dep[u] > dep[v]) swap(u, v);
for (int i = LOG - 1; i >= 0; i--) {
if (((dep[v] - dep[u]) >> i) & 1) {
chmin(res, table2[i][v]);
v = table[i][v];
}
}
if (u == v) return u;
for (int i = LOG - 1; i >= 0; i--) {
if (table[i][u] != table[i][v]) {
chmin(res, table2[i][v]);
chmin(res, table2[i][u]);
u = table[i][u];
v = table[i][v];
}
}
return res;
}
};
void solve() {
lint N, K, C;
cin >> N >> K >> C;
V<qlint> edges;
REP(i, K) {
lint u, v, w, c;
cin >> u >> v >> w >> c; u--; v--;
edges.push_back({ {w, -c}, {u, v} });
}
sort(ALL(edges));
lint ans = 0;
UnionFind tree(N);
WeightedGraph g(N);
REP(i, K) {
auto [p1, p2] = edges[i];
auto [u, v] = p2;
if (!tree.same(u, v)) {
C -= p1.first;
g[u].push_back({ v, p1.first });
g[v].push_back({ u, p1.first });
chmax(ans, -p1.second);
tree.merge(u, v);
}
}
DoublingLowestCommonAncestor lca(g);
lca.build();
REP(i, K) {
auto [p1, p2] = edges[i];
auto [u, v] = p2;
if (-p1.second <= ans) continue;
if (lca.query(u, v) + C >= p1.first) chmax(ans, -p1.second);
}
if (C < 0) ans = -1;
cout << ans << endl;
}
int main() {
lint T = 1;
//cin >> T;
while (T--) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0