| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 489248 |
2021-11-21T18:12:20 Z |
dxz05 |
Islands (IOI08_islands) |
C++14 |
|
326 ms |
131076 KB |
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <bitset>
#include <stack>
#include <algorithm>
#include <chrono>
#include <random>
using namespace std;
#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define MP make_pair
typedef long long ll;
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 1;
const int M = 222;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int f[N], w[N];
vector<int> cycle;
stack<int> st;
bitset<N> used;
inline void find_cycle(int x){
while (!st.empty()) st.pop();
cycle.clear();
while (true){
st.push(x);
used[x] = true;
if (used[f[x]]){
while (!st.empty()){
int y = st.top(); st.pop();
cycle.push_back(y);
if (y == f[x]) break;
}
return;
}
x = f[x];
}
}
int parent[N];
int find(const int x){
return (x == parent[x] ? x : parent[x] = find(parent[x]));
}
vector<int> g[N];
inline int A(const int &u, const int &v){
if (f[u] == v && f[v] != u) return w[u];
if (f[u] != v && f[v] == u) return w[v];
return max(w[u], w[v]);
}
int X; ll D;
void dfs(const int v, const int p, const ll d, const int c1, const int c2, const bool flag){
if (d > D) D = d, X = v;
for (int u : g[v]){
if (u != p && u != c1 && u != c2) dfs(u, v, d + A(u, v), c1, c2, flag);
}
if (flag) g[v].clear();
}
ll arr[N];
inline ll component(const int root){
find_cycle(root);
const int n = cycle.size();
ll ans = 0;
for (int i = 0; i < n; i++){
int v = cycle[i];
D = -1;
dfs(v, v, 0, cycle[(i + n - 1) % n], cycle[(i + 1) % n], false);
ans = max(ans, D);
arr[v] = D;
D = -1;
// dfs(X, X, 0, cycle[(i + n - 1) % n], cycle[(i + 1) % n], true);
ans = max(ans, D);
}
if (n == 2){
int u = cycle[0], v = cycle[1];
ans = max(ans, arr[u] + arr[v] + A(u, v));
return ans;
}
vector<ll> a(n);
a[0] = {arr[cycle[0]]};
ll sum = 0;
for (int i = 1; i < n; i++){
sum += A(cycle[i - 1], cycle[i]);
a[i] = arr[cycle[i]] + sum;
}
sum += A(cycle[0], cycle.back());
// for (int x : cycle) cout << x << ' '; cout << endl;
// for (ll x : a) cout << x << ' '; cout << endl;
ans = max(ans, arr[cycle[0]] + *max_element(a.begin() + 1, a.end()));
vector<ll> sf(n, a.back());
for (int i = n - 2; i >= 0; i--) sf[i] = max(sf[i + 1], a[i]);
ll add = 0;
int v, u;
ll mx = 0;
for (int i = 1; i < n; i++){
v = cycle[i], u = cycle[i - 1];
add -= A(v, u);
mx = max(mx, a[i - 1] + sum);
ans = max(ans, arr[v] + add + mx);
if (i + 1 < n) ans = max(ans, arr[v] + add + sf[i + 1]);
mx = max(mx, a[i]);
// for (int j = 1; j <= n; j++) cout << ST.get(j, j) << ' '; cout << endl;
}
return ans;
}
void solve(int TC) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) parent[i] = i;
for (int i = 1; i <= n; i++){
cin >> f[i] >> w[i];
if (rng() & 1) parent[find(i)] = find(f[i]); else
parent[find(f[i])] = find(i);
if (f[f[i]] != i){
g[i].push_back(f[i]);
g[f[i]].push_back(i);
}
}
bitset<N> comp;
ll ans = 0;
for (int i = 1; i <= n; i++){
if (!comp[find(i)]){
comp[find(i)] = true;
const ll cur = component(i);
ans += cur;
}
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef dddxxz
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int TC = 1;
// cin >> TC;
for (int test = 1; test <= TC; test++) {
//debug(test);
//cout << "Case #" << test << ": ";
solve(test);
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
23936 KB |
Output is correct |
| 2 |
Incorrect |
12 ms |
23900 KB |
Output isn't correct |
| 3 |
Correct |
12 ms |
23896 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23944 KB |
Output is correct |
| 5 |
Correct |
13 ms |
23884 KB |
Output is correct |
| 6 |
Correct |
12 ms |
23908 KB |
Output is correct |
| 7 |
Correct |
12 ms |
23880 KB |
Output is correct |
| 8 |
Correct |
15 ms |
23884 KB |
Output is correct |
| 9 |
Correct |
12 ms |
23848 KB |
Output is correct |
| 10 |
Incorrect |
12 ms |
23884 KB |
Output isn't correct |
| 11 |
Correct |
13 ms |
23884 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
24012 KB |
Output is correct |
| 2 |
Correct |
13 ms |
23916 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
24024 KB |
Output is correct |
| 2 |
Correct |
13 ms |
24224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
24780 KB |
Output is correct |
| 2 |
Correct |
25 ms |
26104 KB |
Output is correct |
| 3 |
Correct |
21 ms |
24976 KB |
Output is correct |
| 4 |
Incorrect |
16 ms |
24484 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
27120 KB |
Output is correct |
| 2 |
Correct |
48 ms |
29496 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
81 ms |
35512 KB |
Output is correct |
| 2 |
Correct |
80 ms |
37364 KB |
Output is correct |
| 3 |
Correct |
107 ms |
41660 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
135 ms |
44868 KB |
Output is correct |
| 2 |
Correct |
169 ms |
57044 KB |
Output is correct |
| 3 |
Correct |
183 ms |
61680 KB |
Output is correct |
| 4 |
Correct |
225 ms |
69172 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
283 ms |
74760 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
326 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
