結果
| 問題 |
No.1898 Battle and Exchange
|
| コンテスト | |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2022-04-08 22:32:07 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,564 ms / 5,000 ms |
| コード長 | 5,922 bytes |
| コンパイル時間 | 2,205 ms |
| コンパイル使用メモリ | 211,660 KB |
| 最終ジャッジ日時 | 2025-01-28 16:24:58 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 58 |
コンパイルメッセージ
main.cpp: In member function ‘void Graph<directed>::solve() [with bool directed = false]’:
main.cpp:215:19: warning: ‘x’ may be used uninitialized [-Wmaybe-uninitialized]
215 | cout << x << ' ' << y << ' ' << z << '\n';
| ~~~~~~~~~~^~~~~~
main.cpp:186:13: note: ‘x’ was declared here
186 | int x, y, z, s = inf;
| ^
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;
template <bool directed = false>
struct Graph {
struct edge {
int to, id;
edge(int to, int id) : to(to), id(id) {}
};
vector<vector<edge>> es;
const int n;
int m;
vector<int> a, b, c;
Graph(int n) : es(n), n(n), m(0), a(n), b(n), c(n) {}
void add_edge(int from, int to) {
es[from].emplace_back(to, m);
if (!directed) es[to].emplace_back(from, m);
m++;
}
void read() {
int M;
cin >> M;
rep(i, M) {
int u, v;
cin >> u >> v;
u--, v--;
add_edge(u, v);
}
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
void absolve(int a, int b, int c, int &x, int &y, int &z) {
vector<int> u = {a, b, c}, v = {x, y, z};
sort(all(v));
rep(i, 3) {
int t = max_element(all(u)) - begin(u);
if (u[t] > v[i]) swap(u[t], v[i]);
}
x = v[0], y = v[1], z = v[2];
}
bool judge(int x, int y, int z) {
if (x + y + z <= a[0] + b[0] + c[0]) return false;
priority_queue<pii, vector<pii>, greater<pii>> que;
int s = x + y + z;
int d = max({a[0], b[0], c[0]}) - min({x, y, z});
s += d;
vector<bool> used(n, false);
used[0] = true;
each(e, es[0]) {
if (used[e.to]) continue;
used[e.to] = true;
que.emplace(a[e.to] + b[e.to] + c[e.to], e.to);
}
bool fi = true;
while (!empty(que)) {
auto [t, i] = que.top();
que.pop();
// cout << i << ' ' << x << ' ' << y << ' ' << z << '\n';
if (s <= t) return false;
if (i == n - 1) return true;
if (fi) absolve(a[0], b[0], c[0], x, y, z);
fi = false;
absolve(a[i], b[i], c[i], x, y, z);
s = x + y + z;
each(e, es[i]) {
if (used[e.to]) continue;
used[e.to] = true;
que.emplace(a[e.to] + b[e.to] + c[e.to], e.to);
}
}
return true;
}
void solve() {
read();
int x, y, z, s = inf;
// judge(1, 13, 1);
{
int L = 0, R = inf; // (l, r]
while (R - L > 1) {
int M = (L + R) / 2;
(judge(M, 1, 1) ? R : L) = M;
}
if (chmin(s, R + 2)) x = R, y = 1, z = 1;
// cout << R << ' ' << 1 << ' ' << 1 << '\n';
}
{
int L = 0, R = inf; // (l, r]
while (R - L > 1) {
int M = (L + R) / 2;
(judge(1, M, 1) ? R : L) = M;
}
if (chmin(s, R + 2)) x = 1, y = R, z = 1;
// cout << 1 << ' ' << R << ' ' << 1 << '\n';
}
{
int L = 0, R = inf; // (l, r]
while (R - L > 1) {
int M = (L + R) / 2;
(judge(1, 1, M) ? R : L) = M;
}
if (chmin(s, R + 2)) x = 1, y = 1, z = R;
// cout << 1 << ' ' << 1 << ' ' << R << '\n';
}
cout << x << ' ' << y << ' ' << z << '\n';
}
};
int main() {
int N;
cin >> N;
Graph G(N);
G.solve();
}