#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
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> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
template<class T>
struct Sum{
vector<T> data;
Sum(const vector<T>& v):data(v.size()+1){
for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
}
T get(ll l,ll r) const {
return data[r]-data[l];
}
};
template<class T>
struct Sum2{
vector<vector<T>> data;
Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
}
T get(ll x1,ll y1,ll x2,ll y2) const {
return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
}
};
void cincout(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout<< fixed << setprecision(15);
}
bool now[1000000],visited[1000000];
pair<int,int> g[1000000];
vector<pair<int,int>> g2[1000000];
vector<int> path;
bool cycle[1000000];
ll d[1000000];
ll C[1000000];
int main() {
cincout();
int n;
cin>>n;
ll ans=0;
for(int i=0;i<n;i++){
int p,q;
cin>>p>>q;
p--;
g[i]={p,q};
g2[p].pb({i,q});
}
for(int i=0;i<n;i++){
if(!visited[i]){
vector<int> path;
int p=i;
while(true){
visited[p]=true;
now[p]=true;
path.pb(p);
int q=g[p].fi;
if(cycle[q]) break;
if(now[q]){
for(int j=path.size()-1;j>=0;j--){
cycle[path[j]]=true;
if(path[j]==q) break;
}
break;
}
if(visited[q]) break;
p=q;
}
for(auto e:path) now[e]=false;
}
}
for(int i=0;i<n;i++) visited[i]=false;
multiset<ll> S;
for(int i=0;i<n;i++){
if(cycle[i]){
vector<int> vs;
queue<int> q;
q.push(i);
vs.pb(i);
while(q.size()){
int v=q.front();
q.pop();
visited[i]=true;
chmax(d[i],d[v]);
for(auto e:g2[v]){
if(visited[e.fi]||cycle[e.fi]) continue;
vs.pb(e.fi);
q.push(e.fi);
d[e.fi]=d[v]+e.se;
}
}
rever(vs);
for(auto e:vs){
for(auto f:g2[e]){
if(C[f.fi]==0) continue;
chmax(C[e],C[f.fi]+f.se);
S.insert(C[f.fi]+f.se);
}
if(S.size()>=2){
auto itr=S.end();
itr--;
ll x=0;
x+=(*itr);
itr--;
x+=(*itr);
chmax(C[i],x);
}
while(S.size()){
auto itr=S.begin();
S.erase(itr);
}
}
}
}
vector<bool> memo(n);
vector<ll> p,q,a(n),b(n);
for(int i=0;i<n;i++){
if(cycle[i]){
if(memo[i]) continue;
p.clear();
q.clear();
int now=i,u=-1;
ll z=0;
while(true){
chmax(z,C[now]);
memo[now]=true;
auto e=g[now];
if(cycle[e.fi]){
q.pb(d[now]);
p.pb(e.se);
now=e.fi;
}
if(now==i) break;
}
{
ll ma=q[0];
ll ret=0;
for(int j=1;j<p.size();j++){
chmax(ret,ma+p[j-1]+q[j]);
ma=max(ma+p[j-1],q[j]);
}
chmax(z,ret);
}
{
ll m=p.size();
for(int j=0;j<m;j++) a[j]=b[j]=0;
for(int j=1;j<m;j++){
a[j]=a[j-1]+p[j-1];
}
for(int j=m-2;j>=0;j--){
b[j]=b[j+1]+p[j];
}
for(int j=0;j<m;j++){
a[j]+=q[j];
b[j]+=q[j];
}
for(int j=m-2;j>=0;j--) chmax(b[j],b[j+1]);
ll ret=0;
for(int j=0;j<m-1;j++) chmax(ret,a[j]+b[j+1]);
chmax(z,ret+p[m-1]);
}
ans+=z;
}
}
cout<<ans<<endl;
}
Compilation message
islands.cpp: In function 'int main()':
islands.cpp:205:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
205 | for(int j=1;j<p.size();j++){
| ~^~~~~~~~~
islands.cpp:189:17: warning: unused variable 'u' [-Wunused-variable]
189 | int now=i,u=-1;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
23764 KB |
Output is correct |
| 2 |
Incorrect |
11 ms |
23892 KB |
Output isn't correct |
| 3 |
Correct |
11 ms |
23764 KB |
Output is correct |
| 4 |
Correct |
10 ms |
23764 KB |
Output is correct |
| 5 |
Correct |
10 ms |
23824 KB |
Output is correct |
| 6 |
Correct |
11 ms |
23764 KB |
Output is correct |
| 7 |
Correct |
13 ms |
23724 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23764 KB |
Output is correct |
| 9 |
Correct |
11 ms |
23764 KB |
Output is correct |
| 10 |
Incorrect |
10 ms |
23764 KB |
Output isn't correct |
| 11 |
Correct |
10 ms |
23812 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
23892 KB |
Output is correct |
| 2 |
Correct |
10 ms |
23844 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
23892 KB |
Output is correct |
| 2 |
Correct |
12 ms |
24000 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
24696 KB |
Output is correct |
| 2 |
Correct |
21 ms |
25868 KB |
Output is correct |
| 3 |
Correct |
16 ms |
25044 KB |
Output is correct |
| 4 |
Incorrect |
17 ms |
24332 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
26904 KB |
Output is correct |
| 2 |
Correct |
36 ms |
29692 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
66 ms |
35192 KB |
Output is correct |
| 2 |
Correct |
64 ms |
39628 KB |
Output is correct |
| 3 |
Correct |
77 ms |
41712 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
106 ms |
46168 KB |
Output is correct |
| 2 |
Correct |
133 ms |
54460 KB |
Output is correct |
| 3 |
Correct |
147 ms |
63616 KB |
Output is correct |
| 4 |
Correct |
174 ms |
67376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
210 ms |
65016 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
220 ms |
88556 KB |
Output is correct |
| 2 |
Incorrect |
231 ms |
104004 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
