oj.uz

Submission #639087

# Submission time Handle Problem Language Result Execution time Memory
639087 2022-09-08T14:28:36 Z puppy Islands (IOI08_islands) C++17
70 / 100
 435 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
int N;
vector<pair<pair<int, int>, int>> adj[1000005];
bool visitededge[1000005];
bool visited[1000005];
bool cycle[1000005];
pair<int, int> parent[1000005];
int cyc, cyc2;
int cycval;
long long far[1000005];
long long dp[1000005];
vector<int> chd[1000005];

struct maxheap
{
    priority_queue<long long> pq;
    priority_queue<long long> del;
    void push(long long v)
    {
        pq.push(v);
        while(!del.empty() && del.top() == pq.top()) {
            pq.pop();
            del.pop();
        }
    }
    void dsp(long long v)
    {
        del.push(v);
        while(!del.empty() && del.top() == pq.top()) {
            pq.pop();
            del.pop();
        }
    }
    long long top()
    {
        return pq.top();
    }
    void pop()
    {
        pq.pop();
        while(!del.empty() && del.top() == pq.top()) {
            pq.pop();
            del.pop();
        }
    }
    int Size()
    {
        return pq.size() - del.size();
    }
    bool isEmpty()
    {
        return Size() == 0;
    }
    void reset()
    {
        while(!pq.empty()) pq.pop();
        while(!del.empty()) del.pop();
    }
};

void dfs(int v, int p, int asg, int edgenum)
{
    visitededge[edgenum] = true;
    visited[v] = true;
    parent[v] = make_pair(p, asg);
    for(auto &i:adj[v]){
        if(visitededge[i.second]) continue;
        if(visited[i.first.first]){
            if(cyc == -1){
                cyc = v;
                cyc2 = i.first.first;
                cycval = i.first.second;
                cycle[v] = true;
            }
            continue;
        }
        dfs(i.first.first, v, i.first.second, i.second);
    }
}
void treedfs(int v, int prv, int p)
{
    chd[p].push_back(v);
    for(auto &i:adj[v]){
        if(i.first.first == prv || cycle[i.first.first]) continue;
        dp[i.first.first] = dp[v] + i.first.second;
        treedfs(i.first.first, v, p);
    }
}
void treedfs2(int v, int prv, int p)
{
    for(auto &i:adj[v]){
        if(cycle[i.first.first] && i.first.first != p) continue;
        if(i.first.first == prv) continue;
        dp[i.first.first] = dp[v] + i.first.second;
        treedfs2(i.first.first, v, p);
    }
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    long long ans = 0;
    cin>>N;
    int tmp, k;
    for(int i=1;i<=N;i++){
        cin>>tmp>>k;
        adj[tmp].push_back(make_pair(make_pair(i, k), i));
        adj[i].push_back(make_pair(make_pair(tmp, k), i));
    }
    int cycstart, cycend, tt;
    long long cur, dsp, sub;
    vector<int> fun, val;
    for(int i=1;i<=N;i++){
        if(visited[i]) continue;
        long long tmpans = 0;
        fun.clear();
        val.clear();
        cyc = -1;
        cyc2 = -1;
        dfs(i, 0, 0, 0);
        cycstart = cyc;
        cycend = cyc2;
        fun.push_back(cycstart);
        val.push_back(cycval);
        while(cycstart != cycend){
            //if(cnt--) cout<<cycstart<<' '<<cycend<<'\n';
            tt = parent[cycstart].second;
            cycstart = parent[cycstart].first;
            cycle[cycstart] = true;
            fun.push_back(cycstart);
            val.push_back(tt);
        }
        long long m, loc;
        for(int i:fun){
            treedfs(i, i, i);
            m = -1;
            for(int k:chd[i]){
                if(dp[k] > m){
                    m = dp[k];
                    loc = k;
                }
            }
            far[i] = m;
            dp[loc] = 0;
            treedfs2(loc, loc, i);
            m = -1;
            for(int k:chd[i]) m = max(m, dp[k]);
            tmpans = max(tmpans, m);
        }
        maxheap heap;
        cur = dsp = sub = 0;
        for(int i=1;i<(int)fun.size();i++){
            cur += val[i];
            heap.push(cur+far[fun[i]]);
        }
        tmpans = max(tmpans, heap.top()+far[fun[0]]);
        for(int i=1;i<(int)fun.size();i++){
            dsp += val[i];
            heap.dsp(dsp + far[fun[i]]);
            sub += val[i];
            cur += val[i-1];
            heap.push(cur+far[fun[i-1]]);
            tmpans = max(tmpans, heap.top()+far[fun[i]]-sub);
        }
        heap.reset();
        cur = dsp = sub = 0;
        for(int i=(int)fun.size()-2;i>=0;i--){
            cur += val[i+1];
            heap.push(cur+far[fun[i]]);
        }
        tmpans = max(tmpans, heap.top()+far[fun.back()]);
        for(int i=(int)fun.size()-2;i>=0;i--){
            sub += val[i+1];
            dsp += val[i+1];
            cur += val[(i+2)%val.size()];
            heap.dsp(dsp+far[fun[i]]);
            heap.push(cur+far[fun[(i+1)%fun.size()]]);
            tmpans = max(tmpans, heap.top() + far[fun[i]]-sub);
        }
        ans += tmpans;
    }
    cout<<ans<<'\n';
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:145:21: warning: 'loc' may be used uninitialized in this function [-Wmaybe-uninitialized]
  145 |             treedfs2(loc, loc, i);
      |             ~~~~~~~~^~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47256 KB Output is correct
2 Correct 23 ms 47296 KB Output is correct
3 Correct 23 ms 47316 KB Output is correct
4 Correct 24 ms 47248 KB Output is correct
5 Correct 22 ms 47316 KB Output is correct
6 Correct 24 ms 47240 KB Output is correct
7 Correct 22 ms 47300 KB Output is correct
8 Correct 23 ms 47316 KB Output is correct
9 Correct 23 ms 47272 KB Output is correct
10 Correct 22 ms 47324 KB Output is correct
11 Correct 23 ms 47260 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 47460 KB Output is correct
2 Correct 25 ms 47468 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47444 KB Output is correct
2 Correct 25 ms 47812 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 48748 KB Output is correct
2 Correct 47 ms 51724 KB Output is correct
3 Correct 36 ms 48912 KB Output is correct
4 Correct 28 ms 48084 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 53548 KB Output is correct
2 Correct 75 ms 57348 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 64460 KB Output is correct
2 Correct 172 ms 73548 KB Output is correct
3 Correct 177 ms 86136 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 81512 KB Output is correct
2 Correct 278 ms 109804 KB Output is correct
3 Correct 411 ms 124448 KB Output is correct
4 Runtime error 249 ms 131072 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 116368 KB Output is correct
2 Runtime error 435 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 328 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -