#include using namespace std; struct StronglyConnectedComponent { public: vector> G, R, T; // private: vector cmp, ord; vector used; // public: StronglyConnectedComponent(int n) : G(n), R(n), cmp(n, -1), used(n, false) {} void add_edge(int u, int v) { G[u].emplace_back(v); R[v].emplace_back(u); } // private: void dfs(int now) { if (used[now]) return; used[now] = true; for (auto nxt : G[now]) dfs(nxt); ord.emplace_back(now); } void rdfs(int now, int count) { if (cmp[now] != -1) return; cmp[now] = count; for (auto to : R[now]) rdfs(to, count); } // public: int build() { int n = (int)G.size(); for (int i = 0; i < n; i++) dfs(i); reverse(ord.begin(), ord.end()); int group = 0; for (auto& i : ord) { if (cmp[i] == -1) { rdfs(i, group); group++; } } T.resize(group); for (int i = 0; i < n; i++) { for (auto& to : G[i]) { int s = cmp[i], t = cmp[to]; if (s != t) T[s].emplace_back(t); } } return group; } int operator[](int k) { return cmp[k]; } }; using SCC = StronglyConnectedComponent; // int main() { int N, L[101], S[101]; cin >> N; for (int i = 0; i < N; i++) { cin >> L[i] >> S[i]; S[i]--; } SCC scc(N); for (int i = 0; i < N; i++) { scc.add_edge(S[i], i); } scc.build(); map M; for (int i = 0; i < N; i++) { if (scc[i] == scc[S[i]]) { if (M.count(scc[i])) M[scc[i]] = min(M[scc[i]], L[i]); else M[scc[i]] = L[i]; } } double ans = 0; for (int i = 0; i < N; i++) { ans += L[i] / 2.0; } for (auto& p : M) { ans += p.second / 2.0; } cout << fixed << setprecision(1); cout << ans << endl; }