oj.uz

답안 #968828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968828 2024-04-24T06:59:56 Z blackslex Cities (BOI16_cities) C++17
0 / 100
 860 ms 262144 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<ll, ll>;

int n, m, k, x, y;
ll z;

int main() {
    scanf("%d %d %d", &n, &k, &m);
    vector<int> c(k);
    for (auto &e: c) scanf("%d", &e);
    vector<vector<ll>> d(n + 5, vector<ll>(n + 5, 1e18));
    for (int i = 1; i <= n; i++) d[i][i] = 0;
    while (m--) scanf("%d %d %lld", &x, &y, &z), d[x][y] = min(d[x][y], z), d[y][x] = min(d[y][x], z);
    for (int l = 1; l <= n; l++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    ll ans = 1e18;
    for (int i = 1; i <= n; i++) {
        ll cur = 0;
        for (int t = 0; t < k; t++) ans += d[i][c[t]];
        ans = min(ans, cur);
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int msk = 0; msk < (1 << k); msk++) {
                ll cur = d[i][j];
                for (int t = 0; t < k; t++) {
                    if (msk & (1 << t)) cur += d[i][c[t]];
                    else cur += d[j][c[t]];
                }
                ans = min(ans, cur);
            }
        }
    }
    printf("%lld", ans);
}

Compilation message

cities.cpp: In function 'int main()':
cities.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d %d", &n, &k, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
cities.cpp:13:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for (auto &e: c) scanf("%d", &e);
      |                      ~~~~~^~~~~~~~~~
cities.cpp:16:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     while (m--) scanf("%d %d %lld", &x, &y, &z), d[x][y] = min(d[x][y], z), d[y][x] = min(d[y][x], z);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 860 ms 8372 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 26.0

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