#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
cin >> p.first;
return cin >> p.second;
}
// template<typename A, typename B> ll max(A x, B y) {
// return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
// return x < y ? x : y;
// }
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
void usaco(string filename) {
// #pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
template <typename num_t>
struct segtree {
int n, depth;
vector<num_t> tree, lazy;
void init(int s, long long* arr) {
n = s;
tree = vector<num_t>(4 * s, 0);
lazy = vector<num_t>(4 * s, 0);
init(0, 0, n - 1, arr);
}
num_t init(int i, int l, int r, long long* arr) {
if (l == r) return tree[i] = arr[l];
int mid = (l + r) / 2;
num_t a = init(2 * i + 1, l, mid, arr),
b = init(2 * i + 2, mid + 1, r, arr);
return tree[i] = a.op(b);
}
void update(int l, int r, num_t v) {
if (l > r) return;
update(0, 0, n - 1, l, r, v);
}
num_t update(int i, int tl, int tr, int ql, int qr, num_t v) {
eval_lazy(i, tl, tr);
if (tl > tr || tr < ql || qr < tl) return tree[i];
if (ql <= tl && tr <= qr) {
lazy[i] = lazy[i].val + v.val;
eval_lazy(i, tl, tr);
return tree[i];
}
if (tl == tr) return tree[i];
int mid = (tl + tr) / 2;
num_t a = update(2 * i + 1, tl, mid, ql, qr, v),
b = update(2 * i + 2, mid + 1, tr, ql, qr, v);
return tree[i] = a.op(b);
}
num_t query(int l, int r) {
if (l > r) return num_t::null_v;
return query(0, 0, n-1, l, r);
}
num_t query(int i, int tl, int tr, int ql, int qr) {
eval_lazy(i, tl, tr);
if (ql <= tl && tr <= qr) return tree[i];
if (tl > tr || tr < ql || qr < tl) return num_t::null_v;
int mid = (tl + tr) / 2;
num_t a = query(2 * i + 1, tl, mid, ql, qr),
b = query(2 * i + 2, mid + 1, tr, ql, qr);
return a.op(b);
}
void eval_lazy(int i, int l, int r) {
tree[i] = tree[i].lazy_op(lazy[i], (r - l + 1));
if (l != r) {
lazy[i * 2 + 1] = lazy[i].val + lazy[i * 2 + 1].val;
lazy[i * 2 + 2] = lazy[i].val + lazy[i * 2 + 2].val;
}
lazy[i] = num_t();
}
};
struct max_t {
long long val;
static const long long null_v = -9223372036854775807LL;
max_t(): val(0) {}
max_t(long long v): val(v) {}
max_t op(max_t& other) {
return max_t(max(val, other.val));
}
max_t lazy_op(max_t v, int size) {
return max_t(val + v.val);
}
};
// int travelTime(int n, int m, int l, int a[], int b[], int t[]);
// int main() {
// usaco("file");
// int n, m, l;
// cin >> n >> m >> l;
// int a[m], b[m], t[m];
// f0r(i, m) cin >> a[i] >> b[i] >> t[i];
// int x = travelTime(n,m,l,a,b,t);
// cout << x << endl;
// // int n = 3;
// // int m = 2;
// // int l = 5;
// // int a[2] = {0, 1};
// // int b[2] = {1, 2};
// // int t[2] = {3, 3};
// // int x = travelTime(n, m, l, a, b, t);
// // cout << x << endl;
// }
#include "dreaming.h"
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;
vl tdists;
vpi edges[100005];
bool vis[100005];
int mk[100005];
int ngroup = 0;
ll mx[100005];
vi cont[100005];
void mark(int x) {
if (vis[x]) return;
vis[x] = 1;
mk[x] = ngroup;
cont[ngroup].pb(x);
for (pii y: edges[x]) mark(y.f);
}
ll mn;
segtree<max_t> sm;
int st[100005], en[100005];
int tim = 0;
void pre(int x, int p) {
st[x] = tim++;
for (pii y: edges[x]) if (y.f != p) pre(y.f, x);
en[x] = tim - 1;
}
void dfs(int x, int p, int d) {
sm.update(st[x], st[x], d);
for (pii y: edges[x]) if (y.f != p) dfs(y.f, x, d + y.s);
}
void comp(int x, int p) {
ll v = sm.query(0, tim - 1).val;
ans = max(ans, v);
mn = min(mn, v);
// cout << x << " " << st[x] << " " << en[x] << endl;
// f0r(i, tim) cout << sm.query(i, i).val << " ";
// cout << endl;
for (pii y: edges[x]) if (y.f != p) {
sm.update(0, tim - 1, y.s);
sm.update(st[y.f], en[y.f], -2 * y.s);
comp(y.f, x);
sm.update(st[y.f], en[y.f], 2 * y.s);
sm.update(0, tim - 1, -y.s);
}
}
void gdist(int x) {
vis[mk[x]] = 1;
mn = mod;
tim = 0;
pre(x, -1);
sm.init(tim, c);
dfs(x, -1, 0);
comp(x, -1);
mx[mk[x]] = mn;
}
int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
ms(c, 0);
f0r(i, m) {
edges[a[i]].pb(mp(b[i], t[i]));
edges[b[i]].pb(mp(a[i], t[i]));
}
f0r(i, n) mk[i] = -1;
ms(vis, 0);
f0r(i, n) {
if (!vis[i]) {
mark(i);
++ngroup;
}
}
ms(vis, 0);
f0r(i, ngroup) mx[i] = mod;
f0r(i, n) if (!vis[mk[i]]) {
gdist(i);
}
f0r(i, ngroup) tdists.pb(mx[i]);
sort(all(tdists));
reverse(all(tdists));
ao(mx, ngroup);
cout << tdists << endl;
if (tdists.size() == 2) ans = max(ans, tdists[0] + tdists[1] + l);
else if (tdists.size() > 2) {
ans = max(ans, tdists[0] + tdists[1] + l);
ans = max(ans, tdists[1] + tdists[2] + 2 * l);
}
return ans;
}
// int main() {
// io;
// // freopen("case", "r", stdin);
// // freopen("test.txt", "r", stdin);
// // freopen("case", "w", stdout);
// // freopen("file.in", "r", stdin);
// // usaco("file");
// }
Compilation message
dreaming.cpp: In instantiation of 'std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&) [with A = long long int; std::ostream = std::basic_ostream<char>]':
dreaming.cpp:286:11: required from here
dreaming.cpp:46:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
dreaming.cpp: In function 'void usaco(std::__cxx11::string)':
dreaming.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen((filename + ".in").c_str(), "r", stdin);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dreaming.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen((filename + ".out").c_str(), "w", stdout);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
222 ms |
30580 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
222 ms |
30580 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
222 ms |
30580 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
65 ms |
19828 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
222 ms |
30580 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
222 ms |
30580 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
