Submission #961932

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
961932	2024-04-12T18:56:40 Z	Irate	Cheap flights (LMIO18_pigus_skrydziai)	C++17	12 / 100	12 ms	972 KB

pigus_skrydziai

#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 <= n;++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';
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	12 ms	860 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	8 ms	900 KB	Output is correct
12	Correct	3 ms	604 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	2 ms	468 KB	Output is correct
19	Correct	10 ms	972 KB	Output is correct
20	Correct	5 ms	892 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	12 ms	860 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	8 ms	900 KB	Output is correct
12	Correct	3 ms	604 KB	Output is correct
13	Correct	4 ms	860 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	2 ms	468 KB	Output is correct
19	Correct	10 ms	972 KB	Output is correct
20	Correct	5 ms	892 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Runtime error	1 ms	604 KB	Execution killed with signal 11
23	Halted	0 ms	0 KB	-

Subtask #3

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	600 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	600 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-