Download Speed

input/code.cpp: In function 'bool bfs(int, int)':
input/code.cpp:24:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |         for (auto [neighbor, speed] : adj[node]) {
      |                   ^

#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
 
using namespace std;
 
const int MAXN = 501;
vector<pair<int, int>> adj[MAXN]; // adjacency list to store connections: (neighbor, speed)
bool visited[MAXN];
 
bool bfs(int n, int minSpeed) {
    memset(visited, false, sizeof(visited));
    queue<int> q;
    q.push(1);  // Start from the server (node 1)
    visited[1] = true;
 
    while (!q.empty()) {
        int node = q.front();
        q.pop();
 
        if (node == n) return true; // Reached Kotivalo's computer
 
        for (auto [neighbor, speed] : adj[node]) {
            if (!visited[neighbor] && speed >= minSpeed) {
                visited[neighbor] = true;
                q.push(neighbor);
            }
        }
    }
    return false;
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
 
    int n, m;
    cin >> n >> m;
 
    int maxSpeed = 0;
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].emplace_back(b, c);
        adj[b].emplace_back(a, c); // Assuming the network connections are bidirectional
        maxSpeed = max(maxSpeed, c); // Track the maximum connection speed
    }
 
    // Binary search over the possible speeds
    int low = 1, high = maxSpeed, result = 0;
    while (low <= high) {
        int mid = (low + high) / 2;
        if (bfs(n, mid)) {
            result = mid;  // Found a valid path, try for a higher speed
            low = mid + 1;
        } else {
            high = mid - 1; // No valid path, try for a lower speed
        }
    }
 
    cout << result << "\n";
 
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER