oj.uz

Submission #336345

# Submission time Handle Problem Language Result Execution time Memory
336345 2020-12-15T05:20:13 Z sumit_kk10 Dreaming (IOI13_dreaming) C++14
0 / 100
 1000 ms 33048 KB 
#include <bits/stdc++.h>
#include<dreaming.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
vector<pair<long long int, long long int> > graph[N];
bool vis[N];
long long int mx = 0, node1;
vector<int> disconnected, connected;
 
void dfs(int source, long long int largest){
    vis[source] = 1;
    if(largest >= mx){
        mx = largest;
        node1 = source;
    }
    connected.push_back(source);
    for(auto k : graph[source])
        if(!vis[k.first])
            dfs(k.first, largest + k.second);
}
 
void dfs1(int source, long long int largest){
    vis[source] = 1;
    mx = max(mx, largest);
    for(auto k : graph[source])
        if(!vis[k.first])
            dfs1(k.first, largest + k.second);
}
 
int travelTime(int N, int M, int L, int A[], int B[], int T[]){
    for(int i = 0; i < M; ++i){
        long long int u = A[i], v = B[i], c = T[i];
        graph[u].push_back({v, c});
        graph[v].push_back({u, c});
    }
    for(int i = 0; i < N; ++i){
        if(!vis[i]){
            dfs1(i, 0);
            disconnected.push_back(i);
        }
    }
    for(int i = 0; i < N; ++i)
        vis[i] = 0;
    mx = 0;
    vector<int> nodes;
    for(auto k : disconnected){
        dfs(k, 0);
        int mn = mx, node = k;
        mx = 0;
        for(auto kk  : connected){
            for(auto kkk : connected)
                vis[kkk] = 0;
            dfs1(kk, 0);
            if(mx < mn){
                node = kk;
                mn = mx;
            }
            mx = 0;
        }
        connected.clear();
        nodes.push_back(node);
    }
    int u = nodes[0];
    for(int i = 1; i < nodes.size(); ++i){
        int v = nodes[i];
        graph[u].push_back({v, L});
        graph[v].push_back({u, L});
    }
    mx = 0;
    for(int i = 0; i < N; ++i)
        vis[i] = 0;
    dfs(0, 0);
    for(int i = 0; i < N; ++i)
        vis[i] = 0;
    dfs(node1, 0);
    return mx;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:68:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for(int i = 1; i < nodes.size(); ++i){
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 33048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 33048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 33048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 33048 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1033 ms 33048 KB Time limit exceeded
2 Halted 0 ms 0 KB -