oj.uz

Submission #680003

# Submission time Handle Problem Language Result Execution time Memory
680003 2023-01-09T18:50:37 Z tigar Dreaming (IOI13_dreaming) C++14
0 / 100
 47 ms 17028 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;
typedef long long ll;

vector<pair<ll, ll> >graff[100010];
ll dist[100010], dist2[100010], anc[100010];
bool check[100010], check2[100010];
vector<ll>LongestPaths;
ll v, d, dmx;

void dfs(int cvor)
{
    check[cvor]=true;
    if(dist[cvor]>d){v=cvor; d=dist[cvor];}
    for(int i=0; i<graff[cvor].size(); i++)
    {
        if(!check[graff[cvor][i].first])
        {
            dist[graff[cvor][i].first]=dist[cvor]+graff[cvor][i].second;
            dfs(graff[cvor][i].first);
        }
    }
}

void dfs2(int cvor)
{
    check2[cvor]=true;
    if(dist2[cvor]>d){v=cvor; d=dist2[cvor];}
    for(int i=0; i<graff[cvor].size(); i++)
    {
        if(!check2[graff[cvor][i].first])
        {
            dist2[graff[cvor][i].first]=dist2[cvor]+graff[cvor][i].second;
            anc[graff[cvor][i].first]=cvor;
            dfs2(graff[cvor][i].first);
        }
    }
}

int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
    for(int i=0; i<N; i++)anc[i]=-1;
    for(int i=0; i<M; i++)
    {
        graff[A[i]].push_back({B[i], T[i]});
        graff[B[i]].push_back({A[i], T[i]});
    }
    for(int i=0; i<N; i++)
    {
        if(!check[i])
        {
            v=i; dfs(i);
            d=0; int pp=v;
            dfs2(v);
            int predak=v;
            vector<int>putic;
            while(predak!=pp){putic.push_back(predak); predak=anc[predak];}
            putic.push_back(predak);
            ll rez=LONG_LONG_MAX;
            for(int j=0; j<putic.size(); j++)
            {
                //cout<<putic[j]<<" ";
                int bg=putic[j];
                rez=min(rez, max(dist2[bg], d-dist2[bg]));
            }
            LongestPaths.push_back(rez);
            dmx=max(d, dmx);
            d=0; v=0;
        }
    }
    sort(LongestPaths.begin(), LongestPaths.end());
    int lngt=LongestPaths.size()-1;
    return max(dmx, max(LongestPaths[lngt]+L+LongestPaths[lngt-1], LongestPaths[lngt-1]+LongestPaths[lngt-2]+2*L));
}

/*int main()
{
    int N, M, L;
    cin>>N>>M>>L;
    int A[100], B[100], T[100];
    for(int i=0; i<M; i++)cin>>A[i]>>B[i]>>T[i];
    cout<<travelTime(N, M, L, A, B, T);
}
/*12 8 2
0 8 4
8 2 2
2 7 4
5 11 3
5 1 7
1 3 1
1 9 5
10 6 3*/

Compilation message

dreaming.cpp:85:1: warning: "/*" within comment [-Wcomment]
   85 | /*12 8 2
      |  
dreaming.cpp: In function 'void dfs(int)':
dreaming.cpp:16:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i=0; i<graff[cvor].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'void dfs2(int)':
dreaming.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0; i<graff[cvor].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:61:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             for(int j=0; j<putic.size(); j++)
      |                          ~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 17028 KB Output is correct
2 Correct 47 ms 17000 KB Output is correct
3 Correct 31 ms 12124 KB Output is correct
4 Correct 7 ms 4948 KB Output is correct
5 Correct 6 ms 4072 KB Output is correct
6 Correct 12 ms 6228 KB Output is correct
7 Incorrect 2 ms 2664 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2664 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 17028 KB Output is correct
2 Correct 47 ms 17000 KB Output is correct
3 Correct 31 ms 12124 KB Output is correct
4 Correct 7 ms 4948 KB Output is correct
5 Correct 6 ms 4072 KB Output is correct
6 Correct 12 ms 6228 KB Output is correct
7 Incorrect 2 ms 2664 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 8544 KB Output is correct
2 Correct 25 ms 8392 KB Output is correct
3 Correct 22 ms 8356 KB Output is correct
4 Correct 24 ms 8264 KB Output is correct
5 Correct 22 ms 8328 KB Output is correct
6 Correct 24 ms 9064 KB Output is correct
7 Correct 23 ms 8552 KB Output is correct
8 Correct 23 ms 8260 KB Output is correct
9 Correct 22 ms 8136 KB Output is correct
10 Correct 23 ms 8484 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 8 ms 5708 KB Output is correct
13 Correct 9 ms 5868 KB Output is correct
14 Correct 9 ms 5708 KB Output is correct
15 Correct 8 ms 5704 KB Output is correct
16 Correct 8 ms 5580 KB Output is correct
17 Correct 8 ms 5068 KB Output is correct
18 Correct 8 ms 5996 KB Output is correct
19 Correct 8 ms 5580 KB Output is correct
20 Incorrect 1 ms 2644 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2664 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 2 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 17028 KB Output is correct
2 Correct 47 ms 17000 KB Output is correct
3 Correct 31 ms 12124 KB Output is correct
4 Correct 7 ms 4948 KB Output is correct
5 Correct 6 ms 4072 KB Output is correct
6 Correct 12 ms 6228 KB Output is correct
7 Incorrect 2 ms 2664 KB Output isn't correct
8 Halted 0 ms 0 KB -