oj.uz

Submission #963498

# Submission time Handle Problem Language Result Execution time Memory
963498 2024-04-15T07:32:46 Z vivkostov Dreaming (IOI13_dreaming) C++14
0 / 100
 43 ms 12372 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,a1[100005],a2[100005],a3[100005],ma[100005],sma[100005],in[100005],incost[100005],st[100005],used[100005],otg[100005];
vector<cell>v[100005];
void make_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])
        {
            make_ma(w);
            if(ma[beg]<ma[w]+v[beg][i].cost)
            {
                sma[beg]=ma[beg];
                ma[beg]=ma[w]+v[beg][i].cost;
                in[beg]=w;
                incost[beg]=v[beg][i].cost;
            }
            else if(sma[beg]<ma[w]+v[beg][i].cost)
            {
                sma[beg]=ma[w]+v[beg][i].cost;
            }
        }
    }
}
int maa;
void find_top(int beg,int lead)
{
    if(maa<ma[beg]+sma[beg])
    {
        maa=ma[beg]+sma[beg];
        st[lead]=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_top(w,lead);
        }
    }
}
void find_otg(int beg,int izm,int lead)
{
    if(beg==0)return;
    izm=max(izm,sma[beg]);
    otg[lead]=min(otg[lead],max(izm,ma[beg]));
    find_otg(in[beg],izm+incost[beg],lead);
}
void fil(int beg)
{
    int w;
    used[beg]=1;
    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])
        {
            make_ma(i);
        }
    }
    int aa=0;
    for(int i=1;i<=n;i++)
    {
        aa=max(aa,sma[i]+ma[i]);
    }
    memset(used,0,sizeof(used));
    for(int i=1;i<=n;i++)
    {
        if(!used[i])
        {
            find_top(i,i);
            maa=0;
        }
    }
    memset(used,0,sizeof(used));
    for(int i=1;i<=n;i++)
    {
        if(!used[i])
        {
            otg[i]=1000000000;
            find_otg(i,0,i);
            fil(i);
        }
    }
    sort(otg+1,otg+n+1);
    if(n-2!=m)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 38 ms 12372 KB Output is correct
2 Correct 43 ms 12180 KB Output is correct
3 Correct 25 ms 11096 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 5 ms 5212 KB Output is correct
6 Incorrect 11 ms 6392 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 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12372 KB Output is correct
2 Correct 43 ms 12180 KB Output is correct
3 Correct 25 ms 11096 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 5 ms 5212 KB Output is correct
6 Incorrect 11 ms 6392 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8280 KB Output is correct
2 Correct 16 ms 8536 KB Output is correct
3 Correct 15 ms 8284 KB Output is correct
4 Correct 16 ms 8284 KB Output is correct
5 Correct 15 ms 8280 KB Output is correct
6 Correct 17 ms 8792 KB Output is correct
7 Correct 16 ms 8540 KB Output is correct
8 Correct 22 ms 8284 KB Output is correct
9 Correct 17 ms 8424 KB Output is correct
10 Correct 17 ms 8764 KB Output is correct
11 Correct 1 ms 4440 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 5832 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 4 ms 6492 KB Output is correct
19 Correct 5 ms 6064 KB Output is correct
20 Incorrect 1 ms 4440 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 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 12372 KB Output is correct
2 Correct 43 ms 12180 KB Output is correct
3 Correct 25 ms 11096 KB Output is correct
4 Correct 6 ms 5724 KB Output is correct
5 Correct 5 ms 5212 KB Output is correct
6 Incorrect 11 ms 6392 KB Output isn't correct
7 Halted 0 ms 0 KB -