Submission #1171874

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171874		lopkus	Cheap flights (LMIO18_pigus_skrydziai)	C++20	12 / 100	3097 ms	327680 KiB

pigus_skrydziai

#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int n, m;
  std::cin >> n >> m;
  std::vector<std::vector<int>> g(n + 1, std::vector<int>(n + 1));
  for(int i = 1; i <= m; i++) {
    int u, v, c;
    std::cin >> u >> v >> c;
    g[u][v] = g[v][u] = c;
  }
  int ans = 0;
  for(int x = 1; x <= n; x++) {
    for(int y = x + 1; y <= n; y++) {
      for(int z = y + 1; z <= n; z++) {
        if(g[x][y] && g[y][z] && g[z][x]) {
          ans = std::max(ans, g[x][y] + g[y][z] + g[z][x]);
        }
      }
    }
  }
  for(int x = 1; x <= n; x++) {
    int sum = 0;
    for(int y = 1; y <= n; y++) {
      sum += g[x][y];
    }
    ans = std::max(ans, sum);
  }
  std::cout << ans;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 25
• Subtask 3: 0 / 16
• Subtask 4: 0 / 47