oj.uz

Submission #710159

# Submission time Handle Problem Language Result Execution time Memory
710159 2023-03-15T05:18:47 Z victor_gao Designated Cities (JOI19_designated_cities) C++17
0 / 100
 2000 ms 122596 KB 
//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define N 200015
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int n,dp[N],fa[N],ans[N],mx[N],pos[N],total=0,s,t;
vector<int>g[N],leaf;
multiset<pii>st[N];
map<pii,int>cost;
void count_max(int p){
    if (!st[p].empty()){
        pii big=*(--st[p].end());
        mx[p]=big.x; pos[p]=big.y;
    }
    else mx[p]=0,pos[p]=p;
}
void Insert(int p,int i,int val){
    int cs=mx[i]+val;
    st[p].insert({cs,pos[i]});
    count_max(p);
}
void Erase(int p,int i,int val){
    int cs=mx[i]+val;
    st[p].erase(st[p].find({cs,pos[i]}));
    count_max(p);
}
void dfs1(int p,int lp){
    if (g[p].size()==1){
        leaf.push_back(p);
        pos[p]=p;
    }
    for (auto i:g[p]){
        if (i!=lp){
            dfs1(i,p);
            dp[p]=dp[p]+dp[i]+cost[{i,p}];
            Insert(p,i,cost[{p,i}]);
        }
    }
}
void dfs2(int p,int lp){
    dp[p]=(dp[p]+dp[lp]+cost[{lp,p}]);
    Insert(p,lp,cost[{p,lp}]);
    ans[1]=min(ans[1],total-dp[p]);
    if (ans[2]>total-dp[p]-mx[p]){
        ans[2]=total-dp[p]-mx[p];
        s=p; t=pos[p];
    }
    for (auto i:g[p]){
        if (i!=lp){
            Erase(p,i,cost[{p,i}]);
            dp[p]=dp[p]-dp[i]-cost[{i,p}];
            dfs2(i,p);
            dp[p]=dp[p]+dp[i]+cost[{i,p}];
            Insert(p,i,cost[{p,i}]);
        }
    }
    Erase(p,lp,cost[{p,lp}]);
    dp[p]=(dp[p]-dp[lp]-cost[{lp,p}]);
}
signed main(){
    fast
    cin>>n;
    for (int i=0;i<=n;i++){
        ans[i]=1e18;
        cost[{0,i}]=0; cost[{i,0}]=0;
    }
    for (int i=1;i<n;i++){
        int a,b,c,d; cin>>a>>b>>c>>d;
        total=(total+c+d);
        g[a].push_back(b);
        g[b].push_back(a);
        cost[{a,b}]=c; cost[{b,a}]=d;
    }
    dfs1(1,0);
    dfs2(1,0);
    int q; cin>>q;
    while (q--){
        int c; cin>>c;
        cout<<ans[c]<<'\n';
    }
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 7 ms 14412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 1734 ms 91188 KB Output is correct
3 Correct 1877 ms 112508 KB Output is correct
4 Correct 1686 ms 91388 KB Output is correct
5 Correct 1884 ms 91608 KB Output is correct
6 Correct 1796 ms 94440 KB Output is correct
7 Correct 1936 ms 91780 KB Output is correct
8 Correct 1864 ms 113420 KB Output is correct
9 Execution timed out 2075 ms 92648 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 1696 ms 91320 KB Output is correct
3 Correct 1905 ms 122596 KB Output is correct
4 Correct 1685 ms 96180 KB Output is correct
5 Correct 1784 ms 97796 KB Output is correct
6 Correct 1761 ms 101312 KB Output is correct
7 Execution timed out 2080 ms 98788 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 7 ms 14412 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 1734 ms 91188 KB Output is correct
3 Correct 1877 ms 112508 KB Output is correct
4 Correct 1686 ms 91388 KB Output is correct
5 Correct 1884 ms 91608 KB Output is correct
6 Correct 1796 ms 94440 KB Output is correct
7 Correct 1936 ms 91780 KB Output is correct
8 Correct 1864 ms 113420 KB Output is correct
9 Execution timed out 2075 ms 92648 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 7 ms 14412 KB Output isn't correct
3 Halted 0 ms 0 KB -