#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
void program();
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
program();
}
//===================//
// begin program //
//===================//
const int MX = 1e6+8;
const int N = (1<<20);
int n, edges;
int a[MX], b[MX], l[MX];
vi adj[MX];
// finding cycles
bitset<MX> visited;
int cycleStart;
int skippedEdge = -1;
vii cycle;
bool dfsVisit(int u, int pe) {
if(visited[u]) {
cycleStart = u;
skippedEdge = pe;
return true;
}
bool res = false;
visited[u] = 1;
FOR(e,adj[u]) {
if(e == pe || e == skippedEdge) continue;
if(!dfsVisit((a[e] == u ? b[e] : a[e]), e)) continue;
cycle.pb({(a[e] == u ? b[e] : a[e]), l[e]});
res = u != cycleStart;
}
return res;
}
// finding depth
ll curBest = 0;
lll combine(lll x, ll y) {return {max(x.fi,y), max(min(x.fi,y),x.se)};}
int i1, i2;
ll dfsDepth(int u, int pe) {
ll res = 0;
lll p = {0,0};
FOR(e,adj[u]) {
if(e == pe) continue;
if((a[e] == u ? b[e] : a[e]) == i1) continue;
if((a[e] == u ? b[e] : a[e]) == i2) continue;
ll d = l[e] + dfsDepth((a[e] == u ? b[e] : a[e]),e);
res = max(res, d);
p = combine(p,d);
}
curBest = max(curBest, p.fi + p.se);
return res;
}
void program() {
IN(n);
RE1(i,n) {
IN(a[edges],l[edges]); b[edges] = i;
adj[a[edges]].pb(edges);
adj[b[edges]].pb(edges);
edges++;
}
ll ans = 0;
RE1(i,n) {
if(visited[i]) continue;
// find the cycle
curBest = 0;
cycle.clear();
dfsVisit(i,-1);
// fill a, b and c
ll m = cycle.size(), totB = 0;
FOR(u,cycle) totB += u.se;
ll curB = totB;
ll bestSum1 = -INF, bestSum2 = -INF;
REV(i,0,m) {
curB -= cycle[i].se;
i1 = cycle[(i+1)%m].fi;
i2 = cycle[(i-1+m)%m].fi;
ll C = dfsDepth(cycle[i].fi, -1);
curBest = max(curBest , bestSum1 - curB + C);
curBest = max(curBest , totB + bestSum2 + curB + C);
bestSum1 = max(bestSum1, curB + C);
bestSum2 = max(bestSum2, -curB + C);
}
ans += curBest;
}
OUTL(ans);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
23776 KB |
Output is correct |
| 2 |
Correct |
15 ms |
23788 KB |
Output is correct |
| 3 |
Correct |
20 ms |
23800 KB |
Output is correct |
| 4 |
Correct |
15 ms |
23704 KB |
Output is correct |
| 5 |
Correct |
15 ms |
23816 KB |
Output is correct |
| 6 |
Correct |
14 ms |
23820 KB |
Output is correct |
| 7 |
Correct |
16 ms |
23756 KB |
Output is correct |
| 8 |
Correct |
16 ms |
23820 KB |
Output is correct |
| 9 |
Correct |
15 ms |
23776 KB |
Output is correct |
| 10 |
Correct |
14 ms |
23820 KB |
Output is correct |
| 11 |
Correct |
17 ms |
23820 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
23824 KB |
Output is correct |
| 2 |
Correct |
17 ms |
23860 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
23884 KB |
Output is correct |
| 2 |
Correct |
18 ms |
24216 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
24820 KB |
Output is correct |
| 2 |
Correct |
35 ms |
27332 KB |
Output is correct |
| 3 |
Correct |
26 ms |
25036 KB |
Output is correct |
| 4 |
Correct |
21 ms |
24384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
40 ms |
28808 KB |
Output is correct |
| 2 |
Correct |
86 ms |
31420 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
110 ms |
37252 KB |
Output is correct |
| 2 |
Correct |
98 ms |
43704 KB |
Output is correct |
| 3 |
Correct |
153 ms |
54468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
155 ms |
48164 KB |
Output is correct |
| 2 |
Correct |
205 ms |
71968 KB |
Output is correct |
| 3 |
Correct |
231 ms |
80176 KB |
Output is correct |
| 4 |
Correct |
305 ms |
95264 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
313 ms |
77072 KB |
Output is correct |
| 2 |
Correct |
870 ms |
124840 KB |
Output is correct |
| 3 |
Correct |
374 ms |
63472 KB |
Output is correct |
| 4 |
Correct |
401 ms |
102728 KB |
Output is correct |
| 5 |
Correct |
490 ms |
102592 KB |
Output is correct |
| 6 |
Correct |
1243 ms |
69040 KB |
Output is correct |
| 7 |
Correct |
433 ms |
131072 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
397 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
