#include <bits/stdc++.h>
using namespace std;
const int mxN = 305;
long long G[mxN][mxN];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for(int i = 0;i < m;++i){
int u, v, w;
cin >> u >> v >> w;
G[u][v] = G[v][u] = w;
}
long long mx = 0;
for(int i = 1;i <= n;++i){
long long temp = 0;
for(int j = 1;j <= m;++j){
temp += G[i][j];
}
mx = max(mx, temp);
}
for(int i = 1;i <= n;++i){
for(int j = 1;j <= n;++j){
for(int k = 1;k <= n;++k){
if(G[i][j] && G[j][k] && G[i][k]){
mx = max(mx, G[i][j] + G[j][k] + G[i][k]);
}
}
}
}
cout << mx << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
460 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
20 ms |
1116 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
460 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
20 ms |
1116 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |