#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n), l(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> l[i];
--a[i];
}
vector<vector<int>> g(n);
for (int i = 0; i < n; i++) {
g[i].push_back(a[i]);
g[a[i]].push_back(i);
}
vector<bool> was(n);
long long res = 0;
vector<long long> d(n, -1);
vector<vector<long long>> dp(n, vector<long long>(3));
for (int i = 0; i < n; i++) {
if (was[i]) {
continue;
}
vector<int> que(1, i);
for (int b = 0; b < (int) que.size(); b++) {
int x = que[b];
for (int y : g[x]) {
if (!was[y]) {
was[y] = true;
que.push_back(y);
}
}
}
for (int x : que) {
was[x] = false;
}
int x = i;
while (!was[x]) {
was[x] = true;
x = a[x];
}
int y = a[x];
vector<int> cyc(1, x);
while (y != x) {
cyc.push_back(y);
y = a[y];
}
for (int x : que) {
was[x] = true;
}
d[cyc[0]] = 0;
for (int i = 1; i < (int) cyc.size(); i++) {
int x = cyc[i - 1], y = cyc[i];
d[y] = d[x] + l[x];
}
function<void(int, int)> Solve = [&](int v, int pv) {
for (int u : g[v]) {
if (d[u] != -1 || u == pv) {
continue;
}
Solve(u, v);
dp[v][2] = max(dp[v][2], dp[u][2]);
dp[v][2] = max(dp[v][2], dp[v][1] + dp[u][1] + l[u]);
dp[v][1] = max(dp[v][1], dp[u][1] + l[u]);
}
};
long long c = 0;
for (int i : cyc) {
Solve(i, i);
c = max(c, dp[i][1]);
c = max(c, dp[i][2]);
}
long long t = d[cyc.back()] + l[cyc.back()];
int ptr = 0;
for (int i = 0; i < (int) cyc.size(); i++) {
for (int j = i + 1; j < (int) cyc.size(); j++) {
long long p = d[cyc[j]] - d[cyc[i]];
c = max(c, max(p, t - p) + dp[cyc[i]][1] + dp[cyc[j]][1]);
}
}
res += c;
}
cout << res << '\n';
return 0;
}
Compilation message
islands.cpp: In function 'int main()':
islands.cpp:78:9: warning: unused variable 'ptr' [-Wunused-variable]
78 | int ptr = 0;
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
600 KB |
Output is correct |
2 |
Correct |
4 ms |
860 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
16 ms |
2396 KB |
Output is correct |
2 |
Correct |
390 ms |
5212 KB |
Output is correct |
3 |
Correct |
6 ms |
3160 KB |
Output is correct |
4 |
Correct |
3 ms |
1628 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
696 ms |
7128 KB |
Output is correct |
2 |
Correct |
371 ms |
13140 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
970 ms |
26832 KB |
Output is correct |
2 |
Execution timed out |
2065 ms |
30380 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1031 ms |
50920 KB |
Output is correct |
2 |
Execution timed out |
2061 ms |
66756 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
155 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
231 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |