#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); i++)
#define Fore(i, a, b) for (auto i = (a); i >= (b); i--)
#define FOR(i, a, b) for (auto i = (a); i <= (b); i++)
#define ret(s) return void(cout << s);
const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;
ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); i++) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; i++) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; i++) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; i++) {if (n % i == 0) {int k = 0; while (n % i == 0) k++, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}
template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)a % 10 + '0'; a/=10;} Reverse(s); out << s; return out;}
#include "factories.h"
const int N = 1e6 + 5;
const ll inf = 2e18;
int n, s[20][N], in[N], out[N], f[N], tp[N], ti = -1;
ll d[N], d1[N], d2[N];
vi t, e;
vpair g[N];
vector<pair<int, ll>> G[N];
void dfs(int u, int p) {
in[u] = ++ti;
f[u] = sz(e);
e.pb(in[u]);
t.pb(u);
trav(v,g[u]){
if (v.first != p) {
d[v.first] = d[u] + v.second;
dfs(v.first, u);
e.pb(in[u]);
}
}
out[u] = ti;
}
void sparse() {
int m = sz(e);
For(i,0,m) s[0][i] = e[i];
For(i,1,20){
For(j,0,m-(1<<(i-1))) s[i][j] = min(s[i - 1][j], s[i - 1][j + (1 << (i - 1))]);
}
}
int que(int l, int r) {
int i = Log2(r - l + 1);
return min(s[i][l], s[i][r - (1 << i) + 1]);
}
int lca(int u, int v) {
u = f[u]; v = f[v];
if (u > v) swap(u, v);
return t[que(u, v)];
}
bool anc(int u, int v) {
return in[u] <= in[v] && out[u] >= out[v];
}
void Dfs(int u, int p) {
d1[u] = d2[u] = inf;
if (tp[u] == 1) d1[u] = 0;
if (tp[u] == 2) d2[u] = 0;
trav(v,G[u]){
if (v.first != p) {
Dfs(v.first, u);
d1[u] = min(d1[u], d1[v.first] + v.second);
d2[u] = min(d2[u], d2[v.first] + v.second);
}
}
}
void Init(int _n, int a[], int b[], int c[]) {
n = _n;
For(i,0,n-1){
g[a[i]].eb(b[i], c[i]); g[b[i]].eb(a[i], c[i]);
}
dfs(0, -1); sparse();
}
ll Query(int s1, int a[], int s2, int b[]) {
vi c;
For(i,0,s1) tp[a[i]] = 1, c.pb(a[i]);
For(i,0,s2) tp[b[i]] = 2, c.pb(b[i]);
sort(all(c), [&](int u, int v){
return in[u] < in[v];
});
For(i,1,s1+s2) c.pb(lca(c[i - 1], c[i]));
Unique(c);
sort(all(c), [&](int u, int v){
return in[u] < in[v];
});
vi st;
trav(v,c){
while (sz(st) && !anc(st.back(), v)) st.pop_back();
if (sz(st)) {
int u = st.back();
G[u].eb(v, d[v] - d[u]); G[v].eb(u, d[v] - d[u]);
}
st.pb(v);
}
Dfs(c[0], -1);
ll x = inf;
trav(i,c) x = min(x, d1[i] + d2[i]);
For(i,0,s1) tp[a[i]] = 0;
For(i,0,s2) tp[b[i]] = 0;
trav(u,c) G[u].clear();
return x;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
78684 KB |
Output is correct |
| 2 |
Correct |
751 ms |
87124 KB |
Output is correct |
| 3 |
Correct |
692 ms |
87068 KB |
Output is correct |
| 4 |
Correct |
710 ms |
87120 KB |
Output is correct |
| 5 |
Correct |
670 ms |
87380 KB |
Output is correct |
| 6 |
Correct |
605 ms |
74916 KB |
Output is correct |
| 7 |
Correct |
734 ms |
75092 KB |
Output is correct |
| 8 |
Correct |
758 ms |
87120 KB |
Output is correct |
| 9 |
Correct |
705 ms |
81268 KB |
Output is correct |
| 10 |
Correct |
606 ms |
79104 KB |
Output is correct |
| 11 |
Correct |
744 ms |
79048 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
18 ms |
70488 KB |
Output is correct |
| 2 |
Correct |
873 ms |
220048 KB |
Output is correct |
| 3 |
Correct |
821 ms |
224360 KB |
Output is correct |
| 4 |
Correct |
654 ms |
220284 KB |
Output is correct |
| 5 |
Correct |
803 ms |
256936 KB |
Output is correct |
| 6 |
Correct |
842 ms |
225324 KB |
Output is correct |
| 7 |
Correct |
772 ms |
111896 KB |
Output is correct |
| 8 |
Correct |
508 ms |
111068 KB |
Output is correct |
| 9 |
Correct |
575 ms |
116136 KB |
Output is correct |
| 10 |
Correct |
727 ms |
114108 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
78684 KB |
Output is correct |
| 2 |
Correct |
751 ms |
87124 KB |
Output is correct |
| 3 |
Correct |
692 ms |
87068 KB |
Output is correct |
| 4 |
Correct |
710 ms |
87120 KB |
Output is correct |
| 5 |
Correct |
670 ms |
87380 KB |
Output is correct |
| 6 |
Correct |
605 ms |
74916 KB |
Output is correct |
| 7 |
Correct |
734 ms |
75092 KB |
Output is correct |
| 8 |
Correct |
758 ms |
87120 KB |
Output is correct |
| 9 |
Correct |
705 ms |
81268 KB |
Output is correct |
| 10 |
Correct |
606 ms |
79104 KB |
Output is correct |
| 11 |
Correct |
744 ms |
79048 KB |
Output is correct |
| 12 |
Correct |
18 ms |
70488 KB |
Output is correct |
| 13 |
Correct |
873 ms |
220048 KB |
Output is correct |
| 14 |
Correct |
821 ms |
224360 KB |
Output is correct |
| 15 |
Correct |
654 ms |
220284 KB |
Output is correct |
| 16 |
Correct |
803 ms |
256936 KB |
Output is correct |
| 17 |
Correct |
842 ms |
225324 KB |
Output is correct |
| 18 |
Correct |
772 ms |
111896 KB |
Output is correct |
| 19 |
Correct |
508 ms |
111068 KB |
Output is correct |
| 20 |
Correct |
575 ms |
116136 KB |
Output is correct |
| 21 |
Correct |
727 ms |
114108 KB |
Output is correct |
| 22 |
Correct |
1752 ms |
233528 KB |
Output is correct |
| 23 |
Correct |
1466 ms |
233376 KB |
Output is correct |
| 24 |
Correct |
1872 ms |
236796 KB |
Output is correct |
| 25 |
Correct |
1770 ms |
238752 KB |
Output is correct |
| 26 |
Correct |
1800 ms |
231480 KB |
Output is correct |
| 27 |
Correct |
1638 ms |
259244 KB |
Output is correct |
| 28 |
Correct |
1271 ms |
229300 KB |
Output is correct |
| 29 |
Correct |
1539 ms |
229960 KB |
Output is correct |
| 30 |
Correct |
1509 ms |
230568 KB |
Output is correct |
| 31 |
Correct |
1494 ms |
233120 KB |
Output is correct |
| 32 |
Correct |
849 ms |
118572 KB |
Output is correct |
| 33 |
Correct |
786 ms |
113600 KB |
Output is correct |
| 34 |
Correct |
988 ms |
101060 KB |
Output is correct |
| 35 |
Correct |
980 ms |
100804 KB |
Output is correct |
| 36 |
Correct |
1082 ms |
101564 KB |
Output is correct |
| 37 |
Correct |
1025 ms |
103104 KB |
Output is correct |
