oj.uz

답안 #1090116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090116 2024-09-17T18:04:00 Z LilPluton 경주 (Race) (IOI11_race) C++14
9 / 100
 3000 ms 16040 KB 
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
const int sz = 2e5 + 5;
int n, res;
vector<long long> dist(sz), dep(sz, 0);
vector<vector<pair<int, int>>> adj(sz);

int dij(int s, int need, int n) {
    vector<long long> dist(n, LLONG_MAX);
    vector<int> dep(n, INT_MAX);
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> q;
    
    dist[s] = 0;
    dep[s] = 0;
    q.push({0, s});
    
    while (!q.empty()) {
        int v = q.top().second;
        long long d_v = q.top().first;
        q.pop();
        
        if (d_v != dist[v]) {
            continue;
        }
        
        if (dist[v] == need) {
            return dep[v];
        }
        
        for (auto i : adj[v]) {
            int u = i.first;
            int weight = i.second;
            
            if (dist[u] > dist[v] + weight) {
                dist[u] = dist[v] + weight;
                dep[u] = dep[v] + 1;
                q.push({dist[u], u});
            }
        }
    }
    
    return INT_MAX;
}

int best_path(int N, int K, int H[][2], int L[]) {
    if (K == 1) {
        return 0;
    }
    
    for (int i = 0; i < N; ++i) {
        adj[H[i][0]].push_back({H[i][1], L[i]});
        adj[H[i][1]].push_back({H[i][0], L[i]});
    }
    
    int res = INT_MAX;
    
    for (int i = 0; i < N; ++i) {
        int path_length = dij(i, K, N);
        res = min(res, path_length);
    }
    
    return (res == INT_MAX ? -1 : res);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 3 ms 8292 KB Output is correct
3 Correct 4 ms 8124 KB Output is correct
4 Correct 3 ms 8284 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 4 ms 8144 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 4 ms 8304 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 5 ms 8284 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 4 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 3 ms 8292 KB Output is correct
3 Correct 4 ms 8124 KB Output is correct
4 Correct 3 ms 8284 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 4 ms 8144 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 4 ms 8304 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 5 ms 8284 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 4 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Incorrect 3 ms 8280 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 3 ms 8292 KB Output is correct
3 Correct 4 ms 8124 KB Output is correct
4 Correct 3 ms 8284 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 4 ms 8144 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 4 ms 8304 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 5 ms 8284 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 4 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Execution timed out 3028 ms 16040 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8280 KB Output is correct
2 Correct 3 ms 8292 KB Output is correct
3 Correct 4 ms 8124 KB Output is correct
4 Correct 3 ms 8284 KB Output is correct
5 Correct 4 ms 8284 KB Output is correct
6 Correct 4 ms 8144 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 4 ms 8304 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 5 ms 8284 KB Output is correct
12 Correct 4 ms 8284 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 4 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Incorrect 3 ms 8280 KB Output isn't correct
20 Halted 0 ms 0 KB -