oj.uz

Submission #962860

# Submission time Handle Problem Language Result Execution time Memory
962860 2024-04-14T09:05:47 Z vivkostov Dreaming (IOI13_dreaming) C++14
0 / 100
 48 ms 12484 KB 
#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],in[100005],costin[100005],used[100005],otg[100005],up[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;
            }
        }
    }
}
void make_up(int beg,int par,int cos)
{
    used[beg]=1;
    int w;
    if(in[par]!=beg)
    {
        up[beg]=ma[par]+cos;
    }
    up[beg]=max(up[beg],max(sma[par],up[par]))+cos;
    for(int i=0;i<(int)(v[beg].size());i++)
    {
        w=v[beg][i].to;
        if(!used[w])
        {
            make_up(w,beg,v[beg][i].cost);
        }
    }
}
void find_otg(int beg,int lead)
{
    used[beg]=1;
    int w;
    for(int i=0;i<(int)(v[beg].size());i++)
    {
        w=v[beg][i].to;
        if(!used[w])
        {
            find_otg(w,lead);
        }
    }
    //cout<<beg<<" "<<ma[beg]<<" "<<sma[beg]<<" "<<up[beg]<<endl;
    if(!otg[lead])otg[lead]=max(max(ma[beg],sma[beg]),up[beg]);
    else otg[lead]=min(otg[lead],max(max(ma[beg],sma[beg]),up[beg]));
}
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++)
    {
        if(aa<ma[i]+sma[i])
        {
            aa=ma[i]+sma[i];
        }
    }
    memset(used,0,sizeof(used));
    for(int i=1;i<=n;i++)
    {
        if(!used[i])
        {
            make_up(i,0,0);
        }
    }
    memset(used,0,sizeof(used));
    for(int i=1;i<=n;i++)
    {
        if(!used[i])
        {
            find_otg(i,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.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12368 KB Output is correct
2 Correct 35 ms 12484 KB Output is correct
3 Correct 25 ms 10936 KB Output is correct
4 Correct 6 ms 5980 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Incorrect 10 ms 6648 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12368 KB Output is correct
2 Correct 35 ms 12484 KB Output is correct
3 Correct 25 ms 10936 KB Output is correct
4 Correct 6 ms 5980 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Incorrect 10 ms 6648 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8280 KB Output is correct
2 Correct 20 ms 8284 KB Output is correct
3 Correct 16 ms 8284 KB Output is correct
4 Correct 16 ms 8284 KB Output is correct
5 Correct 16 ms 8284 KB Output is correct
6 Correct 20 ms 8588 KB Output is correct
7 Correct 17 ms 8540 KB Output is correct
8 Correct 16 ms 8284 KB Output is correct
9 Correct 15 ms 8280 KB Output is correct
10 Correct 16 ms 8444 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 4 ms 6236 KB Output is correct
13 Correct 4 ms 6236 KB Output is correct
14 Correct 4 ms 6236 KB Output is correct
15 Correct 4 ms 6236 KB Output is correct
16 Correct 4 ms 5976 KB Output is correct
17 Correct 3 ms 5396 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 4 ms 5980 KB Output is correct
20 Incorrect 1 ms 4788 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 12368 KB Output is correct
2 Correct 35 ms 12484 KB Output is correct
3 Correct 25 ms 10936 KB Output is correct
4 Correct 6 ms 5980 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Incorrect 10 ms 6648 KB Output isn't correct
7 Halted 0 ms 0 KB -