oj.uz

Submission #217674

# Submission time Handle Problem Language Result Execution time Memory
217674 2020-03-30T12:02:12 Z mhy908 Islands (IOI08_islands) C++14
90 / 100
 1291 ms 131076 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sortvec(x) sort(all(x))
#define compress(x) x.erase(unique(all(x)), x.end())
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=1987654321987654321;
const int inf=2000000000;
int n;
vector<pii> link[1000010];

bool ch[1000010];
void chdfs(int num, int par1, int par2){
    ch[num]=true;
    for(auto i:link[num]){
        if(i.F==par1||i.F==par2)continue;
        chdfs(i.F, num, par2);
    }
}

LL ret, ans;
vector<int> cyc;
vector<LL> sum;
LL get_cyc(int num, int par){
    if(ch[num]){
        cyc.pb(num);
        sum.pb(0);
        return 0;
    }
    ch[num]=true;
    int t=0;
    for(auto i:link[num]){
        if(i.F==par&&!t){
            t++;
            continue;
        }
        LL temp=get_cyc(i.F, num)+i.S;
        if(temp>=0){
            cyc.pb(num);
            sum.pb(temp);
            if(cyc[0]==num)return -llinf;
            return temp;
        }
    }
    return -llinf;
}

LL get_maxd(int num, int par1, int par2){
    LL ret2=0;
    for(auto i:link[num]){
        if(i.F==par1||i.F==par2)continue;
        LL temp=get_maxd(i.F, num, num)+i.S;
        ret=max(ret, ret2+temp);
        ret2=max(ret2, temp);
    }
    return ret2;
}

LL solve(int num){
    vector<int>().swap(cyc);
    vector<LL>().swap(sum);
    ret=0;
    get_cyc(num, 0);
    chdfs(cyc[0], 0, cyc[0]);
    LL max1=llinf, max2=-llinf, dia=sum.back();
    cyc.pop_back();
    sum.pop_back();
    int sz=cyc.size();
    for(int i=0; i<sz; i++){
        LL tmp=get_maxd(cyc[i], cyc[(i+sz-1)%sz], cyc[(i+1)%sz]);
        ret=max(ret, sum[i]+tmp-max1);
        ret=max(ret, dia-sum[i]+tmp+max2);
        max2=max(max2, sum[i]+tmp);
        max1=min(max1, sum[i]-tmp);
    }
    return ret;
}

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++){
        int a; LL b;
        scanf("%d %d", &a, &b);
        link[i].pb(mp(a, b));
        link[a].pb(mp(i, b));
    }
    for(int i=1; i<=n; i++){
        if(ch[i])continue;
        ans+=solve(i);
    }
    printf("%lld", ans);
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:91:30: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'LL* {aka long long int*}' [-Wformat=]
         scanf("%d %d", &a, &b);
                            ~~^
islands.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
islands.cpp:91: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

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23808 KB Output is correct
2 Correct 18 ms 23808 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 23 ms 23764 KB Output is correct
5 Correct 19 ms 23808 KB Output is correct
6 Correct 19 ms 23808 KB Output is correct
7 Correct 18 ms 23808 KB Output is correct
8 Correct 19 ms 23808 KB Output is correct
9 Correct 18 ms 23808 KB Output is correct
10 Correct 18 ms 23808 KB Output is correct
11 Correct 19 ms 23808 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23912 KB Output is correct
2 Correct 21 ms 24192 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 24568 KB Output is correct
2 Correct 38 ms 26752 KB Output is correct
3 Correct 31 ms 24576 KB Output is correct
4 Correct 24 ms 24192 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 27768 KB Output is correct
2 Correct 62 ms 29396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 33528 KB Output is correct
2 Correct 117 ms 39216 KB Output is correct
3 Correct 152 ms 47888 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 39988 KB Output is correct
2 Correct 250 ms 61660 KB Output is correct
3 Correct 278 ms 69164 KB Output is correct
4 Correct 344 ms 84016 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 386 ms 63952 KB Output is correct
2 Correct 998 ms 114572 KB Output is correct
3 Correct 358 ms 55484 KB Output is correct
4 Correct 476 ms 90460 KB Output is correct
5 Correct 468 ms 91356 KB Output is correct
6 Correct 1291 ms 60080 KB Output is correct
7 Correct 534 ms 131072 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 468 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -