CSES - Aalto Competitive Programming 2024 - wk7 Homework - Results
Submission details
Task:Download Speed
Sender:htoik
Submission time:2024-10-24 14:13:05 +0300
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#20.00 sdetails
#30.01 sdetails
#40.00 sdetails
#50.00 sdetails
#60.24 sdetails
#70.24 sdetails
#8ACCEPTED0.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#120.00 sdetails

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:14:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   14 |     for(int i=0; i<m; i++){
      |                  ~^~
input/code.cpp:22:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   22 |     for(int i=1; i<=n; i++){
      |                  ~^~~
input/code.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   23 |         for(int j=1; j<=n; j++){
      |                      ~^~~
input/code.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   30 |     for(int k=1; k<=n; k++){
      |                  ~^~~
input/code.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   31 |         for(int...

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

ll adj[501][501];
ll d[501][501];
// map<ll, vector<pair<ll,ll>>> adj;

int main(){
    unsigned n, m;
    cin >> n >> m;

    for(int i=0; i<m; i++){
        ll a, b, c;
        cin >> a >> b >> c;
        adj[a][b] = c;
        adj[b][a] = c;
        // adj[b][a] = c;
    }

    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++){
            if(i == j) d[i][j] = LLONG_MAX;
            else if(adj[i][j]) d[i][j] = adj[i][j];
            else d[i][j] = 0;
        }
    }

    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                d[i][j] = max(d[i][j], min(d[i][k], d[k][j]));
            }
        }
    }

    cout << d[1][n] << endl;
}

Test details

Test 1

Verdict: ACCEPTED

input
4 3
1 2 5
2 3 3
3 4 6

correct output
3

user output
3

Test 2

Verdict:

input
4 5
1 2 1
1 3 1
2 3 1
2 4 1
...

correct output
2

user output
1

Test 3

Verdict:

input
4 5
1 2 1000000000
1 3 1000000000
2 3 1
2 4 1000000000
...

correct output
2000000000

user output
1000000000

Test 4

Verdict:

input
2 1
2 1 100

correct output
0

user output
100

Test 5

Verdict:

input
2 1000
1 2 1000000000
1 2 1000000000
1 2 1000000000
1 2 1000000000
...

correct output
1000000000000

user output
1000000000

Test 6

Verdict:

input
500 998
1 2 54
1 3 59
1 4 83
2 5 79
...

correct output
60

user output
54

Test 7

Verdict:

input
500 998
1 2 530873053
1 3 156306296
1 4 478040476
3 5 303609600
...

correct output
1093765123

user output
688173231

Test 8

Verdict: ACCEPTED

input
2 1
1 2 1

correct output
1

user output
1

Test 9

Verdict:

input
4 5
1 2 3
2 4 2
1 3 4
3 4 5
...

correct output
6

user output
4

Test 10

Verdict:

input
4 5
1 2 1
1 3 2
3 2 1
2 4 2
...

correct output
3

user output
1

Test 11

Verdict:

input
10 999
1 2 1000000000
1 2 1000000000
1 2 1000000000
1 2 1000000000
...

correct output
111000000000

user output
1000000000

Test 12

Verdict:

input
7 9
1 2 1
1 3 1
1 4 1
2 5 1
...

correct output
2

user output
1