oj.uz

답안 #284435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284435 2020-08-27T11:35:44 Z Haunted_Cpp Islands (IOI08_islands) C++17
90 / 100
 1857 ms 131076 KB 
/**
 *  author: Haunted_Cpp
**/
 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
template<typename T> ostream &operator << (ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename T, size_t size> ostream &operator << (ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream &operator << (ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
 
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
 
#ifdef LOCAL
#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#else
#define debug(...) 47
#endif
 
typedef long long i64;
 
const int MAX_N = 1e6 + 5;
 
vector<vector<int>> g(MAX_N);
 
 
int Time = 0, cycle_start, cycle_end;
 
vector<short> color(MAX_N); 
vector<int> nxt(MAX_N), cost(MAX_N), par(MAX_N), cycle;
 
bitset<MAX_N> is_cycle;
bitset<MAX_N> vis;
 
void find_cycle(int node, int p) {
  color[node] = 1;
  for (auto et : g[node]) {
    if (et == p && !(nxt[p] == node && nxt[node] == p)) continue;
    if (color[et] == 0) {
     par[et] = node;
     find_cycle(et, node);
    } else if (color[et] == 1) {
      cycle_start = et;
      cycle_end = node;
    }
  }
  color[node] = 2;
}
 
int root;
 
pair<i64, int> dfs(int node, int p) {
  pair<i64, int> best_way = {0, node};
  for (auto et : g[node]) {
    const int w = (nxt[node] == et ? cost[node] : cost[et]);
    if (et != root && is_cycle[et]) continue;
    if (et != p) {
      pair<i64, int> cur = dfs(et, node);
      cur.first += w;
      best_way = max(best_way, cur);
    }
  } 
  return best_way;
}
 
i64 get_depth(int node, int p) {
  i64 mx = 0;
  for (auto et : g[node]) {
    const int w = (nxt[node] == et ? cost[node] : cost[et]);
    if (is_cycle[et]) continue;
    if (et != p) {
      mx = max(mx, w + get_depth(et, node));
    }
  }
  return mx;
}
 
i64 find_cost(int node) {
  vis[node] = true;
  i64 res = 0;
  for (auto et : g[node]) {
    const int w = (nxt[node] == et ? cost[node] : cost[et]);
    if (is_cycle[node] && is_cycle[et]) {
      res += w;
    }
    if (!vis[et]) {
      vis[et] = true;
      res += find_cost(et);
    }
  }
  return res;
}
 
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0); 
  int n;
  cin >> n;
  for (int st = 0; st < n; st++) {
    int et, w;
    cin >> et >> w;
    --et;
    nxt[st] = et;
    cost[st] = w;
    g[st].emplace_back(et);
    g[et].emplace_back(st);
  }
  i64 ans = 0;
  for (int i = 0; i < n; i++) {
    if (color[i]) continue;
    cycle.clear();
    find_cycle(i, -1);
    for (int cur = cycle_end; cur != cycle_start; cur = par[cur]) {
      cycle.emplace_back(cur);
      is_cycle[cur] = 1;
    }
    is_cycle[cycle_start] = 1;
    cycle.emplace_back(cycle_start);
    i64 res = 0;
    for (auto to : cycle) {
      root = to;
      pair<i64, int> best_way = dfs(root, -1);
      res = max(res, dfs(best_way.second, -1).first);
    }
    i64 cycle_cost = find_cost(i) / 2;
    i64 ccw = get_depth(cycle[0], -1); 
    i64 cw = get_depth(cycle[0], -1); 
    i64 start = 0;
    for (int j = 1; j < (int) cycle.size(); j++) {
      const int st = cycle[j - 1];
      const int et = cycle[j];
      const int w = (nxt[st] == et ? cost[st] : cost[et]);
      start += w;
      res = max(res, cw + start + get_depth(et, -1));
      cw = max(cw, -start + get_depth(et, -1));
      const i64 other = cycle_cost - start;
      res = max(res, ccw + other + get_depth(et, -1));
      ccw = max(ccw, start + get_depth(et, -1));
    }
    res = max({res, cw, ccw});
    ans += res;
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 37504 KB Output is correct
2 Correct 25 ms 37496 KB Output is correct
3 Correct 25 ms 37624 KB Output is correct
4 Correct 25 ms 37504 KB Output is correct
5 Correct 25 ms 37496 KB Output is correct
6 Correct 25 ms 37504 KB Output is correct
7 Correct 25 ms 37632 KB Output is correct
8 Correct 27 ms 37632 KB Output is correct
9 Correct 25 ms 37496 KB Output is correct
10 Correct 29 ms 37504 KB Output is correct
11 Correct 25 ms 37504 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 37632 KB Output is correct
2 Correct 27 ms 37664 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 37632 KB Output is correct
2 Correct 28 ms 37888 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 38392 KB Output is correct
2 Correct 46 ms 40312 KB Output is correct
3 Correct 41 ms 38528 KB Output is correct
4 Correct 31 ms 38012 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 41592 KB Output is correct
2 Correct 68 ms 43128 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 46584 KB Output is correct
2 Correct 131 ms 51956 KB Output is correct
3 Correct 161 ms 58996 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 52384 KB Output is correct
2 Correct 261 ms 71028 KB Output is correct
3 Correct 299 ms 78828 KB Output is correct
4 Correct 347 ms 91116 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 73696 KB Output is correct
2 Correct 1285 ms 120172 KB Output is correct
3 Correct 377 ms 65144 KB Output is correct
4 Correct 484 ms 95724 KB Output is correct
5 Correct 482 ms 95636 KB Output is correct
6 Correct 1857 ms 69604 KB Output is correct
7 Correct 541 ms 131072 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 468 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -