oj.uz

답안 #1113821

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113821 2024-11-17T14:00:29 Z Aviansh Relay Marathon (NOI20_relaymarathon) C++17
5 / 100
 6000 ms 1048576 KB 
#include <bits/stdc++.h>

using namespace std;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,k;
    cin >> n >> m >> k;
    int dist[n][n];
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            dist[i][j]=1e9;
        }
        dist[i][i]=0;
    }
    for(int i = 0;i<m;i++){
        int u,v,w;
        cin >> u >> v >> w;
        u--;v--;
        dist[u][v]=w;
        dist[v][u]=w;
    }
    for(int k = 0;k<n;k++){
        for(int i = 0;i<n;i++){
            for(int j = 0;j<n;j++){
                dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
            }
        }
    }
    int spec[k];
    for(int i = 0;i<k;i++){
        cin >> spec[i];
        spec[i]--;
    }
    vector<pair<int,int>>d[k];
    for(int i = 0;i<k;i++){
        for(int j = i+1;j<k;j++){
            d[i].push_back({dist[spec[i]][spec[j]],j});
        }
        sort(d[i].begin(),d[i].end());
    }
    int ans = 2e9;
    for(int i = 0;i<k;i++){
        for(int j = i+1;j<k;j++){
            for(int l = 0;l<k;l++){
                if(i==l||j==l){
                    continue;
                }
                for(pair<int,int>p : d[l]){
                    if(p.second==i||p.second==j)
                        continue;
                    ans=min(ans,dist[spec[i]][spec[j]]+p.first);
                }
            }
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 ms 480 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 ms 480 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 99 ms 1360 KB Output is correct
32 Correct 104 ms 1360 KB Output is correct
33 Correct 96 ms 1360 KB Output is correct
34 Correct 111 ms 1360 KB Output is correct
35 Correct 96 ms 1360 KB Output is correct
36 Correct 2393 ms 1728 KB Output is correct
37 Execution timed out 6056 ms 2632 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 893 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 58.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 3 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 ms 480 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 336 KB Output is correct
31 Correct 99 ms 1360 KB Output is correct
32 Correct 104 ms 1360 KB Output is correct
33 Correct 96 ms 1360 KB Output is correct
34 Correct 111 ms 1360 KB Output is correct
35 Correct 96 ms 1360 KB Output is correct
36 Correct 2393 ms 1728 KB Output is correct
37 Execution timed out 6056 ms 2632 KB Time limit exceeded
38 Halted 0 ms 0 KB -