답안 #91845 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
91845	2018-12-30T10:36:49 Z	easrui	Islands (IOI08_islands)	C++14	80 / 100	1458 ms	132096 KB

islands

#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6+5;
struct Edge{
    int i,x;
    long long d;
    Edge(){};
    Edge(int a, int b, long long c){i=a;x=b;d=c;};
};

int N;
long long D[MAX],Ans,Len;
bool vE[MAX],vN[MAX],isL[MAX];
vector<Edge> I[MAX];
stack<int> L;
vector<int> Lp;
vector<long long> A,B,C,dis;

void DFS(int i)
{
    if(vN[i]){
        Lp.push_back(i);
        isL[i] = true;
        while(L.top()!=i){
            Lp.push_back(L.top());
            isL[L.top()] = true;
            L.pop();
        }
        return;
    }
    vN[i] = true;
    L.push(i);
    for(auto it : I[i]){
        if(vE[it.i]) continue;
        vE[it.i] = true;
        DFS(it.x);
    }
    if(!L.empty()) L.pop();
}

long long getD(int x, long long d, int r)
{
    long long res=0,tmp=0,subm=0;
    for(auto it : I[x]){
        if(isL[it.x] || it.x==r) continue;
        tmp = getD(it.x,it.d,x);
        if(res<=tmp){
            subm = res;
            res = tmp;
        }
        else subm = max(subm,tmp);
        Len = max(Len,subm+res);
    }
    return res+d;
}

long long getL()
{
    long long res=0,tmp;
    int n = Lp.size();
    Len = 0;
    for(int i=0; i<n; i++)
    {
        for(auto it : I[Lp[i]]){
            if(it.x==Lp[(i+1)%n]) dis.push_back(it.d);
        }
        D[Lp[i]] = getD(Lp[i],0,Lp[i]);
    }
    res = Len;
    A.push_back(D[Lp[0]]);
    for(int i=1; i<n; i++) A.push_back(A[i-1]+D[Lp[i]]-D[Lp[i-1]]+dis[i-1]);
    for(int i=0; i<n; i++) B.push_back(A[i]-D[Lp[i]]*2);
    C.push_back(D[Lp[n-1]]+dis[n-1]);
    for(int i=1; i<n-1; i++) C.push_back(C[i-1]+D[Lp[n-1-i]]-D[Lp[n-i]]+dis[n-1-i]);
    tmp = B[0];
    res = max(res,A[1] - B[0]);
    for(int i=2; i<n; i++){
        tmp = min(tmp,B[i-1]);
        res = max(res,A[i] - tmp);
    }
    tmp = A[0];
    res = max(res,C[n-2] + A[0]);
    for(int i=n-3; i>=0; i--){
        tmp = max(tmp,A[n-2-i]);
        res = max(res,C[i] + tmp);
    }
    return res;
}

int main()
{
    cin >> N;
    for(int i=1; i<=N; i++){
        int x;
        long long d;
        cin >> x >> d;
        I[i].push_back(Edge(i,x,d));
        I[x].push_back(Edge(i,i,d));
    }
    for(int j=1; j<=N; j++){
        if(vN[j]) continue;
        while(!Lp.empty()) Lp.pop_back();
        while(!A.empty()) A.pop_back();
        while(!B.empty()) B.pop_back();
        while(!C.empty()) C.pop_back();
        while(!dis.empty()) dis.pop_back();
        DFS(j);
        Ans += getL();
    }
    cout << Ans;
}


/*8
3 8
7 2
4 2
1 4
1 17
3 4
2 3
1 15
*/

Subtask #1
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	23800 KB	Output is correct
2	Correct	23 ms	23928 KB	Output is correct
3	Correct	24 ms	23900 KB	Output is correct
4	Correct	22 ms	23800 KB	Output is correct
5	Correct	22 ms	23800 KB	Output is correct
6	Correct	23 ms	23800 KB	Output is correct
7	Correct	23 ms	23800 KB	Output is correct
8	Correct	23 ms	23800 KB	Output is correct
9	Correct	24 ms	23928 KB	Output is correct
10	Correct	23 ms	23800 KB	Output is correct
11	Correct	23 ms	23800 KB	Output is correct

Subtask #2
3.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Correct	22 ms	23932 KB	Output is correct
2	Correct	24 ms	23912 KB	Output is correct

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	23928 KB	Output is correct
2	Correct	27 ms	24312 KB	Output is correct

Subtask #4
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	25080 KB	Output is correct
2	Correct	68 ms	27584 KB	Output is correct
3	Correct	49 ms	25208 KB	Output is correct
4	Correct	33 ms	24496 KB	Output is correct

Subtask #5
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	72 ms	28964 KB	Output is correct
2	Correct	108 ms	31828 KB	Output is correct

Subtask #6
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	209 ms	38044 KB	Output is correct
2	Correct	214 ms	44036 KB	Output is correct
3	Correct	282 ms	54532 KB	Output is correct

Subtask #7
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	358 ms	49824 KB	Output is correct
2	Correct	426 ms	74064 KB	Output is correct
3	Correct	451 ms	81804 KB	Output is correct
4	Correct	641 ms	101024 KB	Output is correct

Subtask #8
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	855 ms	72772 KB	Output is correct
2	Runtime error	1458 ms	132096 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
3	Halted	0 ms	0 KB	-

Subtask #9
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	992 ms	132096 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

답안 #91845

Compilation message