oj.uz

Submission #445596

# Submission time Handle Problem Language Result Execution time Memory
445596 2021-07-18T20:44:28 Z JerryLiu06 Islands (IOI08_islands) C++17
100 / 100
 388 ms 44396 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 1e6 + 10;
const ll INF = 1e18;

int N; pi nxt[MX]; int deg[MX]; ll diam[MX], dist[MX], ans = 0;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N; FOR(i, 1, N + 1) { int A, L; cin >> A >> L; nxt[i] = {A, L}; deg[A]++; }

    queue<int> Q; FOR(i, 1, N + 1) if (deg[i] == 0) Q.push(i);

    while (!Q.empty()) {
        int cur = Q.front(); Q.pop(); int par = nxt[cur].f; 
        
        ckmax(diam[par], max(diam[cur], dist[par] + dist[cur] + nxt[cur].s));

        ckmax(dist[par], dist[cur] + nxt[cur].s); deg[par]--; if (deg[par] == 0) Q.push(par);
    }
    FOR(i, 1, N + 1) if (deg[i] > 0) {

        ll maxDiam = 0, FT = -INF, BK = -INF; ll curDist = 0; ll MX1 = -INF, MX2 = -INF;

        for (int j = i; deg[j] > 0; j = nxt[j].f) {
            ckmax(maxDiam, diam[j]); ckmax(FT, curDist + dist[j] + MX1); ckmax(BK, -curDist + dist[j] + MX2);

            ckmax(MX1, dist[j] - curDist); ckmax(MX2, dist[j] + curDist); deg[j] = 0; curDist += nxt[j].s;
        }
        ans += max(maxDiam, max(FT, BK + curDist));
    }
    cout << ans;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 460 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 972 KB Output is correct
2 Correct 10 ms 1716 KB Output is correct
3 Correct 6 ms 1204 KB Output is correct
4 Correct 3 ms 716 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2380 KB Output is correct
2 Correct 24 ms 3512 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 7108 KB Output is correct
2 Correct 50 ms 5236 KB Output is correct
3 Correct 72 ms 9028 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 12308 KB Output is correct
2 Correct 117 ms 16672 KB Output is correct
3 Correct 116 ms 9652 KB Output is correct
4 Correct 161 ms 19928 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 13532 KB Output is correct
2 Correct 270 ms 24592 KB Output is correct
3 Correct 191 ms 23720 KB Output is correct
4 Correct 240 ms 34336 KB Output is correct
5 Correct 236 ms 34024 KB Output is correct
6 Correct 375 ms 30044 KB Output is correct
7 Correct 258 ms 44396 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 43012 KB Output is correct
2 Correct 284 ms 43112 KB Output is correct
3 Correct 242 ms 27448 KB Output is correct
4 Correct 245 ms 26972 KB Output is correct
5 Correct 255 ms 42404 KB Output is correct
6 Correct 245 ms 41424 KB Output is correct
7 Correct 388 ms 43592 KB Output is correct