oj.uz

답안 #92271

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92271 2019-01-02T11:09:22 Z Retro3014 Islands (IOI08_islands) C++17
100 / 100
 1456 ms 107532 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>

using namespace std;
#define MAX_N 1000000
typedef long long ll;

int N;
struct S{
    int idx;
    int data;
};
vector<S> gp[MAX_N+1];
int a, b;

struct C{
    ll a, b;
};
deque<C> cycle;
bool vst[MAX_N+1];

int num[MAX_N+1];
ll len[MAX_N+1];
deque<int> leaf;
ll m[MAX_N+1][3];
ll ans=0;
vector<S> gp2;

int main(){
    scanf("%d", &N);
    for(int i=1; i<=N; i++){
        scanf("%d%d", &a, &b);
        gp[i].push_back((S){a, b}); num[i]++;
        gp[a].push_back((S){i, b}); num[a]++;
    }
    for(int i=1; i<=N; i++){
        if(num[i]==1){
            leaf.push_back(i);
        }
    }
    while(!leaf.empty()){
        int now=leaf.front(); leaf.pop_front();
        vst[now]=true;
        m[now][0]=max(m[now][0], m[now][1]+m[now][2]);
        for(int i=0; i<gp[now].size(); i++){
            if(!vst[gp[now][i].idx]){
                len[gp[now][i].idx]=max(len[gp[now][i].idx], len[now]+(ll)gp[now][i].data);
                m[gp[now][i].idx][0]=max(m[gp[now][i].idx][0], m[now][0]);
                if(len[now]+(ll)gp[now][i].data>m[gp[now][i].idx][1]){
                    m[gp[now][i].idx][2]=m[gp[now][i].idx][1];
                    m[gp[now][i].idx][1]=len[now]+(ll)gp[now][i].data;
                }else if(len[now]+gp[now][i].data>m[gp[now][i].idx][2]){
                    m[gp[now][i].idx][2]=len[now]+(ll)gp[now][i].data;
                }
                num[gp[now][i].idx]--;
                if(num[gp[now][i].idx]==1){
                    leaf.push_back(gp[now][i].idx);
                }
            }
        }
    }
    ll ans2=0;
    ll sum=0, m1, m2;
    int t;
    for(int i=1; i<=N; i++){
        if(!vst[i]){
            for(int j=0; j<gp[i].size(); j++){
                if(!vst[gp[i][j].idx]){
                    gp2.push_back(gp[i][j]);
                }
            }
            while(!gp[i].empty())    gp[i].pop_back();
            while(!gp2.empty()){
                gp[i].push_back(gp2.back()); gp2.pop_back();
            }
        }
    }
    for(int i=1; i<=N; i++){
        t=i;
        if(!vst[i]){
            cycle.push_front({gp[i][1].idx, (ll)gp[i][1].data});
            while(1){
                vst[t]=true;
                if(vst[gp[t][0].idx]){
                    if(vst[gp[t][1].idx]){
                        break;
                    }
                    cycle.push_front({t, (ll)gp[t][1].data});
                    t=gp[t][1].idx;
                }else{
                    cycle.push_front({t, (ll)gp[t][0].data});
                    t=gp[t][0].idx;
                }
            }
            ans2=0; sum=0;
            for(int j=0; j<cycle.size(); j++){
                sum+=cycle[j].b;
                ans2=max(ans2, max(m[cycle[j].a][0], m[cycle[j].a][1]+m[cycle[j].a][2]));
            }
            /*while(!c.empty()){
             S now = c.back(); c.pop_back();
             ans2=max(ans2, max(m[now.idx][0], m[now.idx][1]+m[now.idx][2]));
             sum+=now.data;
             cycle.push_back({now.data, len[now.idx]});
             }*/
            m1 = m2 = 0;
            while(!cycle.empty()){
                C now = cycle.back(); cycle.pop_back();
                ans2=max(ans2, max(len[now.a], max(m1+len[now.a], m2+len[now.a])));
                m1=max(m1+now.b, now.b+len[now.a]);
                m2=max(m2-now.b, sum-now.b+len[now.a]);
            }
            ans+=ans2;
        }
    }
    printf("%lld", ans);
    return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:47:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<gp[now].size(); i++){
                      ~^~~~~~~~~~~~~~~
islands.cpp:69:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0; j<gp[i].size(); j++){
                          ~^~~~~~~~~~~~~
islands.cpp:98:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=0; j<cycle.size(); j++){
                          ~^~~~~~~~~~~~~
islands.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
islands.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

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

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 23900 KB Output is correct
2 Correct 25 ms 24284 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 24952 KB Output is correct
2 Correct 38 ms 26716 KB Output is correct
3 Correct 36 ms 25432 KB Output is correct
4 Correct 29 ms 24568 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 27896 KB Output is correct
2 Correct 58 ms 30428 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 38868 KB Output is correct
2 Correct 103 ms 36216 KB Output is correct
3 Correct 144 ms 44772 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 50448 KB Output is correct
2 Correct 261 ms 64236 KB Output is correct
3 Correct 257 ms 52728 KB Output is correct
4 Correct 326 ms 77128 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 397 ms 95484 KB Output is correct
2 Correct 947 ms 102012 KB Output is correct
3 Correct 368 ms 81400 KB Output is correct
4 Correct 467 ms 102232 KB Output is correct
5 Correct 452 ms 103008 KB Output is correct
6 Correct 1409 ms 95304 KB Output is correct
7 Correct 485 ms 107532 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 450 ms 91388 KB Output is correct
2 Correct 441 ms 91664 KB Output is correct
3 Correct 474 ms 76720 KB Output is correct
4 Correct 438 ms 60280 KB Output is correct
5 Correct 450 ms 102456 KB Output is correct
6 Correct 555 ms 97212 KB Output is correct
7 Correct 1456 ms 96632 KB Output is correct