oj.uz

Submission #708650

# Submission time Handle Problem Language Result Execution time Memory
708650 2023-03-12T06:34:09 Z ToroTN Factories (JOI14_factories) C++14
33 / 100
 8000 ms 334740 KB 
#include "factories.h"
#include<bits/stdc++.h>
using namespace std;
//#include "grader.cpp"
#define ll long long
#define pb push_back
#define X first
#define Y second
vector<pair<int,int> > v[500005];
int n,lv[500005],par[500005][25];
ll dis[500005][25],d[500005];
void dfs(int u,int p)
{
    for(int i=0;i<v[u].size();i++)
    {
        int node=v[u][i].X,cost=v[u][i].Y;
        if(node==p)continue;
        lv[node]=lv[u]+1;
        dis[node][0]=cost;
        d[node]=d[u]+cost;
        par[node][0]=u;
        dfs(node,u);
    }
}
int lca(int a,int b)
{
    if(lv[a]<lv[b])swap(a,b);
    for(int i=19;i>=0;i--)
    {
        if(lv[par[a][i]]>=lv[b])
        {
            a=par[a][i];
        }
    }
    if(a==b)return a;
    for(int i=19;i>=0;i--)
    {
        if(par[a][i]!=par[b][i])
        {
            a=par[a][i],b=par[b][i];
        }
    }
    return par[a][0];
}
ll lca_dis(int a,int b)
{
    return d[a]+d[b]-2*d[lca(a,b)];
}
int sz[500005],vis[500005],par_cen[500005];
ll opt[500005][25];
int dfs_sz(int u,int p)
{
    sz[u]=1;
    for(int i=0;i<v[u].size();i++)
    {
        int node=v[u][i].X;
        if(node==p||vis[node])continue;
        sz[u]+=dfs_sz(node,u);
    }
    return sz[u];
}
int find_cen(int u,int p,int size)
{
    for(int i=0;i<v[u].size();i++)
    {
        int node=v[u][i].X;
        if(node==p||vis[node])continue;
        if(sz[node]>size/2)return find_cen(node,u,size);
    }
    return u;
}
void centroid(int u,int p)
{
    dfs_sz(u,u);
    int cen=find_cen(u,u,sz[u]);
    vis[cen]=1;
    par_cen[cen]=p;
    for(int i=0;i<v[cen].size();i++)
    {
        ll node=v[cen][i].X;
        if(node==p||vis[node])continue;
        centroid(node,cen);
    }
}
ll mn[500005];
void Init(int N, int A[], int B[], int D[]) 
{
    n=N;
    for(int i=0;i<n-1;i++)
    {
        v[A[i]+1].pb({B[i]+1,D[i]});
        v[B[i]+1].pb({A[i]+1,D[i]});
    }
    par[1][0]=1;
    dfs(1,1);
    for(int i=1;i<=19;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dis[j][i]=dis[j][i-1]+dis[par[j][i-1]][i-1];
            par[j][i]=par[par[j][i-1]][i-1];
        }
    }
    dfs_sz(1,1);
    centroid(1,0);
    for(int i=1;i<=n;i++)
    {
        ll x=i,kk=0;
        while(1)
        {
            opt[i][kk]=lca_dis(x,i);
            ++kk;
            x=par_cen[x];
            if(x==0)break;
        }
    }
    for(int i=1;i<=n;i++)mn[i]=1e18;
}
void update(int num,int type)
{
    int u=num,kk=0;
    while(1)
    {
        if(type==0)
        {
            mn[u]=min(mn[u],opt[num][kk]);
        }else
        {
            mn[u]=1e18;
        }
        u=par_cen[u];
        ++kk;
        if(u==0)break;
    }
}
ll query(ll num)
{
    int u=num,kk=0;
    ll val=1e18;
    while(1)
    {
        val=min(val,opt[num][kk]+mn[u]);
        u=par_cen[u];
        ++kk;
        if(u==0)break;
    }
    return val;
}
long long Query(int S, int X[], int T, int Y[]) 
{
    for(int i=0;i<S;i++)
    {
        update(X[i]+1,0);
    }
    ll ans=1e18;
    for(int i=0;i<T;i++)
    {
        ans=min(ans,query(Y[i]+1));
    }
    for(int i=0;i<S;i++)
    {
        update(X[i]+1,1);
    }
    return ans;
}

Compilation message

factories.cpp: In function 'void dfs(int, int)':
factories.cpp:14:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(int i=0;i<v[u].size();i++)
      |                 ~^~~~~~~~~~~~
factories.cpp: In function 'int dfs_sz(int, int)':
factories.cpp:54:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=0;i<v[u].size();i++)
      |                 ~^~~~~~~~~~~~
factories.cpp: In function 'int find_cen(int, int, int)':
factories.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0;i<v[u].size();i++)
      |                 ~^~~~~~~~~~~~
factories.cpp: In function 'void centroid(int, int)':
factories.cpp:78:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i=0;i<v[cen].size();i++)
      |                 ~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12628 KB Output is correct
2 Correct 250 ms 22892 KB Output is correct
3 Correct 275 ms 22892 KB Output is correct
4 Correct 277 ms 23044 KB Output is correct
5 Correct 293 ms 23204 KB Output is correct
6 Correct 187 ms 22976 KB Output is correct
7 Correct 273 ms 23048 KB Output is correct
8 Correct 304 ms 23008 KB Output is correct
9 Correct 322 ms 23360 KB Output is correct
10 Correct 191 ms 22896 KB Output is correct
11 Correct 274 ms 23148 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12500 KB Output is correct
2 Correct 2661 ms 303892 KB Output is correct
3 Correct 6213 ms 306228 KB Output is correct
4 Correct 1048 ms 304464 KB Output is correct
5 Correct 7820 ms 334740 KB Output is correct
6 Correct 6123 ms 307764 KB Output is correct
7 Correct 1213 ms 83012 KB Output is correct
8 Correct 429 ms 83464 KB Output is correct
9 Correct 1442 ms 87176 KB Output is correct
10 Correct 1171 ms 84116 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12628 KB Output is correct
2 Correct 250 ms 22892 KB Output is correct
3 Correct 275 ms 22892 KB Output is correct
4 Correct 277 ms 23044 KB Output is correct
5 Correct 293 ms 23204 KB Output is correct
6 Correct 187 ms 22976 KB Output is correct
7 Correct 273 ms 23048 KB Output is correct
8 Correct 304 ms 23008 KB Output is correct
9 Correct 322 ms 23360 KB Output is correct
10 Correct 191 ms 22896 KB Output is correct
11 Correct 274 ms 23148 KB Output is correct
12 Correct 8 ms 12500 KB Output is correct
13 Correct 2661 ms 303892 KB Output is correct
14 Correct 6213 ms 306228 KB Output is correct
15 Correct 1048 ms 304464 KB Output is correct
16 Correct 7820 ms 334740 KB Output is correct
17 Correct 6123 ms 307764 KB Output is correct
18 Correct 1213 ms 83012 KB Output is correct
19 Correct 429 ms 83464 KB Output is correct
20 Correct 1442 ms 87176 KB Output is correct
21 Correct 1171 ms 84116 KB Output is correct
22 Correct 2975 ms 305796 KB Output is correct
23 Correct 3071 ms 308072 KB Output is correct
24 Correct 6896 ms 308400 KB Output is correct
25 Correct 6742 ms 311948 KB Output is correct
26 Correct 6413 ms 308528 KB Output is correct
27 Execution timed out 8063 ms 311264 KB Time limit exceeded
28 Halted 0 ms 0 KB -