oj.uz

답안 #1057533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057533 2024-08-13T21:07:21 Z Zicrus Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 1048576 KB 
#include <bits/stdc++.h>
#include "walk.h"
using namespace std;

typedef long long ll;

ll n, m;
vector<vector<pair<ll, ll>>> ints; // y, nodeId
vector<pair<ll, pair<ll, ll>>> bridges;
ll cnt;

vector<vector<pair<ll, ll>>> adj;

ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
    n = x.size(); m = y.size();
    cnt = 0;
    ints = vector<vector<pair<ll, ll>>>(n);
    ints[s].push_back({0, cnt++});
    ints[g].push_back({0, cnt++});
    bridges = vector<pair<ll, pair<ll, ll>>>(m);
    for (int i = 0; i < m; i++) {
        bridges[i] = {y[i], {l[i], r[i]}};
    }
    sort(bridges.begin(), bridges.end());
    vector<vector<pair<ll, ll>>> it(m); // x, nodeId
    for (int j = 0; j < m; j++) {
        pair<ll, ll> p = bridges[j].second;
        for (int i = p.first; i <= p.second; i++) {
            if (bridges[j].first > h[i]) continue;
            it[j].push_back({x[i], cnt});
            ints[i].push_back({bridges[j].first, cnt++});
        }
    }

    adj = vector<vector<pair<ll, ll>>>(cnt); // dist, nodeId
    for (auto &e : ints) { // SIGNAL 11
        if (e.size() < 2) continue;
        for (int i = 0; i < e.size()-1; i++) {
            ll dist = e[i+1].first - e[i].first;
            adj[e[i].second].push_back({dist, e[i+1].second});
            adj[e[i+1].second].push_back({dist, e[i].second});
        }
    }
    for (auto &e : it) {
        for (int i = 0; i < e.size()-1; i++) {
            adj[e[i].second].push_back({e[i+1].first - e[i].first, e[i+1].second});
            adj[e[i+1].second].push_back({e[i+1].first - e[i].first, e[i].second});
        }
    }

    priority_queue<pair<ll, ll>> q;
    q.push({0, 0});
    vector<ll> dist(cnt, 1ll << 62ll);
    dist[0] = 0;
    vector<bool> vst(cnt);
    while (!q.empty()) {
        ll cur = q.top().second; q.pop();
        if (vst[cur]) continue;
        vst[cur] = true;
        for (auto &e : adj[cur]) {
            dist[e.second] = min(dist[e.second], dist[cur] + e.first);
            q.push({-dist[e.second], e.second});
        }
    }

    return dist[1] == 1ll << 62ll ? -1 : dist[1];
}

Compilation message

walk.cpp: In function 'll min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i = 0; i < e.size()-1; i++) {
      |                         ~~^~~~~~~~~~~~
walk.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int i = 0; i < e.size()-1; i++) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 0 ms 348 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 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 1 ms 432 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 484 ms 123216 KB Output is correct
4 Correct 494 ms 126288 KB Output is correct
5 Correct 230 ms 108604 KB Output is correct
6 Correct 661 ms 97036 KB Output is correct
7 Correct 212 ms 110124 KB Output is correct
8 Correct 626 ms 157580 KB Output is correct
9 Correct 256 ms 111444 KB Output is correct
10 Correct 649 ms 181580 KB Output is correct
11 Correct 231 ms 68436 KB Output is correct
12 Correct 93 ms 41416 KB Output is correct
13 Correct 536 ms 160592 KB Output is correct
14 Correct 2271 ms 39672 KB Output is correct
15 Correct 1120 ms 42064 KB Output is correct
16 Correct 119 ms 43092 KB Output is correct
17 Correct 118 ms 41672 KB Output is correct
18 Execution timed out 4017 ms 17384 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 22104 KB Output is correct
2 Correct 3002 ms 799408 KB Output is correct
3 Runtime error 782 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 22104 KB Output is correct
2 Correct 3002 ms 799408 KB Output is correct
3 Runtime error 782 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 0 ms 348 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 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 484 ms 123216 KB Output is correct
21 Correct 494 ms 126288 KB Output is correct
22 Correct 230 ms 108604 KB Output is correct
23 Correct 661 ms 97036 KB Output is correct
24 Correct 212 ms 110124 KB Output is correct
25 Correct 626 ms 157580 KB Output is correct
26 Correct 256 ms 111444 KB Output is correct
27 Correct 649 ms 181580 KB Output is correct
28 Correct 231 ms 68436 KB Output is correct
29 Correct 93 ms 41416 KB Output is correct
30 Correct 536 ms 160592 KB Output is correct
31 Correct 2271 ms 39672 KB Output is correct
32 Correct 1120 ms 42064 KB Output is correct
33 Correct 119 ms 43092 KB Output is correct
34 Correct 118 ms 41672 KB Output is correct
35 Execution timed out 4017 ms 17384 KB Time limit exceeded
36 Halted 0 ms 0 KB -