Submission #962851

#	Time	Username	Problem	Language	Result	Execution time	Memory
962851		vivkostov	Dreaming (IOI13_dreaming)	C++14	0 / 100	35 ms	12372 KiB

dreaming

#include<bits/stdc++.h>
#include "dreaming.h"
using namespace std;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
struct cell
{
    int to,cost;
};
int n,m,l;
int a1[100005],a2[100005],a3[100005],ma[100005],sma[100005],dul[100005],in[100005],costin[100005],used[100005],otg[100005];
vector<cell>v[100005];
void find_ma(int beg)
{
    used[beg]=1;
    int w;
    for(int i=0;i<(int)(v[beg].size());i++)
    {
        w=v[beg][i].to;
        if(!used[w])
        {
            find_ma(w);
            if(ma[beg]<ma[w]+v[beg][i].cost)
            {
                sma[beg]=ma[beg];
                ma[beg]=ma[w]+v[beg][i].cost;
                costin[beg]=v[beg][i].cost;
                in[beg]=w;
            }
            else if(sma[beg]<ma[w]+v[beg][i].cost)
            {
                sma[beg]=ma[w]+v[beg][i].cost;
            }
            if(sma[beg]<sma[w]+v[beg][i].cost)
            {
                //sma[beg]=sma[w]+v[beg][i].cost;
            }
        }
    }
}
void find_mid(int beg,int izm,int par)
{
    izm=max(izm,sma[beg]);
    if(izm>=ma[beg])
    {
        otg[beg]=min(izm,ma[par]);
        return;
    }
    find_mid(in[beg],izm+costin[beg],beg);
}
void fil(int beg)
{
    used[beg]=1;
    int w;
    for(int i=0;i<(int)(v[beg].size());i++)
    {
        w=v[beg][i].to;
        if(!used[w])
        {
            fil(w);
        }
    }
}
int travelTime(int n,int m,int l,int a1[],int a2[],int a3[])
//void read()
{
    //cin>>n>>m>>l;
    cell h;
    for(int i=1;i<=m;i++)
    {
        //cin>>a1[i]>>a2[i]>>a3[i];
        a1[i]++;
        a2[i]++;
        h.to=a1[i];
        h.cost=a3[i];
        v[a2[i]].push_back(h);
        h.to=a2[i];
        v[a1[i]].push_back(h);
    }
    for(int i=1;i<=n;i++)
    {
        if(!used[i])
        {
            find_ma(i);
        }
    }
    int aa=0;
    for(int i=1;i<=n;i++)
    {
        dul[i]=ma[i]+sma[i];
        if(aa<dul[i])
        {
            aa=dul[i];
        }
    }
    memset(used,0,sizeof(used));
    for(int i=1;i<=n;i++)
    {
        if(!used[i])
        {
            find_mid(i,0,0);
            fil(i);
        }
    }
    sort(otg+1,otg+n+1);
    if(m!=n-2)
    {
        aa=max(aa,2*l+otg[n-1]+otg[n-2]);
    }
    aa=max(aa,l+otg[n-1]+otg[n]);
    //cout<<aa<<endl;
    return aa;
}
/*int main()
{
    speed();
    read();
    return 0;
}
*/

• Subtask 1: 0 / 14
• Subtask 2: 0 / 10
• Subtask 3: 0 / 23
• Subtask 4: 0 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23