oj.uz

Submission #962890

# Submission time Handle Problem Language Result Execution time Memory
962890 2024-04-14T09:24:38 Z vivkostov Dreaming (IOI13_dreaming) C++14
0 / 100
 36 ms 11056 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],used[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;
            }
            else if(sma[beg]<ma[w]+v[beg][i].cost)
            {
                sma[beg]=ma[w]+v[beg][i].cost;
            }
        }
    }
}
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=a2[i];
        h.cost=a3[i];
        v[a1[i]].push_back(h);
        h.to=a1[i];
        v[a2[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++)
    {
        aa=max(aa,ma[i]+sma[i]);
    }
    return aa;
}
/*int main()
{
    speed();
    read();
    return 0;
}
*/

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 11056 KB Output is correct
2 Correct 29 ms 10772 KB Output is correct
3 Correct 21 ms 9816 KB Output is correct
4 Correct 5 ms 5468 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Incorrect 8 ms 5980 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 36 ms 11056 KB Output is correct
2 Correct 29 ms 10772 KB Output is correct
3 Correct 21 ms 9816 KB Output is correct
4 Correct 5 ms 5468 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Incorrect 8 ms 5980 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 6744 KB Output isn't correct
2 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 36 ms 11056 KB Output is correct
2 Correct 29 ms 10772 KB Output is correct
3 Correct 21 ms 9816 KB Output is correct
4 Correct 5 ms 5468 KB Output is correct
5 Correct 4 ms 4956 KB Output is correct
6 Incorrect 8 ms 5980 KB Output isn't correct
7 Halted 0 ms 0 KB -