oj.uz

답안 #770003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770003 2023-06-30T16:19:57 Z raysh07 철도 요금 (JOI16_ho_t3) C++17
100 / 100
 110 ms 28996 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int n, m, q;
const int N = 2e5 + 69;
pair <int, int> uv[N], d[N];
int ok[N];
vector <pair<int, int>> adj[N];
int add[N];

bool better (pair<int, int> a, pair<int, int> b){
    if (a.f != b.f) return b.f < a.f;
    else return b.s > a.s;
}

void Solve() 
{
    cin >> n >> m >> q;
    
    for (int i = 1; i <= m; i++){
        cin >> uv[i].first >> uv[i].second;
        ok[i] = q + 1;
    }
    
    for (int i = 1; i <= q; i++){
        int x; cin >> x;
        ok[x] = i;
    }
    
    for (int i = 1; i <= m; i++){
      //  cout << ok[i] << " \n"[i == m];
        adj[uv[i].first].push_back({uv[i].second, ok[i]});
        adj[uv[i].second].push_back({uv[i].first, ok[i]});
    }
    
    d[1] = {0, q + 1};
    for (int i = 2; i <= n; i++){
        d[i] = {INF, 0};
    }
    priority_queue <pair<pair<int, int> , int>> pq;
    pq.push({{0, q + 1}, 1});
    
    while (!pq.empty()){
        auto pi = pq.top();
        pq.pop();
        
        int u = pi.second;
        int ds = -pi.first.first;
        int tm = pi.first.second;
        
     //   cout << "TM " << tm << "\n";
        
        for (auto [v, w] : adj[u]){
            if (better(d[v], make_pair(ds + 1, min(tm, w)))){
                d[v] = make_pair(ds + 1, min(tm, w));
                pq.push({{-d[v].first, d[v].second}, v});
            }
        }
    }
    
    for (int i = 1; i <= n; i++){
        add[d[i].second]++;
    }
    
    for (int i = 1; i <= q; i++){
        add[i] += add[i - 1];
        cout << add[i] << "\n";
    }
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 4 ms 5332 KB Output is correct
4 Correct 2 ms 5036 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 5032 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 4 ms 5332 KB Output is correct
4 Correct 2 ms 5036 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 5032 KB Output is correct
9 Correct 83 ms 25496 KB Output is correct
10 Correct 88 ms 25508 KB Output is correct
11 Correct 64 ms 23580 KB Output is correct
12 Correct 88 ms 23644 KB Output is correct
13 Correct 64 ms 23872 KB Output is correct
14 Correct 61 ms 23628 KB Output is correct
15 Correct 36 ms 16748 KB Output is correct
16 Correct 31 ms 15444 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 25608 KB Output is correct
2 Correct 80 ms 25516 KB Output is correct
3 Correct 85 ms 23188 KB Output is correct
4 Correct 64 ms 23588 KB Output is correct
5 Correct 59 ms 23540 KB Output is correct
6 Correct 60 ms 23628 KB Output is correct
7 Correct 31 ms 15460 KB Output is correct
8 Correct 32 ms 15292 KB Output is correct
9 Correct 41 ms 15584 KB Output is correct
10 Correct 35 ms 17708 KB Output is correct
11 Correct 75 ms 23884 KB Output is correct
12 Correct 69 ms 22988 KB Output is correct
13 Correct 68 ms 22584 KB Output is correct
14 Correct 80 ms 24268 KB Output is correct
15 Correct 70 ms 23088 KB Output is correct
16 Correct 72 ms 22444 KB Output is correct
17 Correct 66 ms 22732 KB Output is correct
18 Correct 43 ms 17292 KB Output is correct
19 Correct 97 ms 28084 KB Output is correct
20 Correct 65 ms 22824 KB Output is correct
21 Correct 39 ms 16284 KB Output is correct
22 Correct 37 ms 16156 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 4 ms 5332 KB Output is correct
4 Correct 2 ms 5036 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5028 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 5032 KB Output is correct
9 Correct 83 ms 25496 KB Output is correct
10 Correct 88 ms 25508 KB Output is correct
11 Correct 64 ms 23580 KB Output is correct
12 Correct 88 ms 23644 KB Output is correct
13 Correct 64 ms 23872 KB Output is correct
14 Correct 61 ms 23628 KB Output is correct
15 Correct 36 ms 16748 KB Output is correct
16 Correct 31 ms 15444 KB Output is correct
17 Correct 81 ms 25608 KB Output is correct
18 Correct 80 ms 25516 KB Output is correct
19 Correct 85 ms 23188 KB Output is correct
20 Correct 64 ms 23588 KB Output is correct
21 Correct 59 ms 23540 KB Output is correct
22 Correct 60 ms 23628 KB Output is correct
23 Correct 31 ms 15460 KB Output is correct
24 Correct 32 ms 15292 KB Output is correct
25 Correct 41 ms 15584 KB Output is correct
26 Correct 35 ms 17708 KB Output is correct
27 Correct 75 ms 23884 KB Output is correct
28 Correct 69 ms 22988 KB Output is correct
29 Correct 68 ms 22584 KB Output is correct
30 Correct 80 ms 24268 KB Output is correct
31 Correct 70 ms 23088 KB Output is correct
32 Correct 72 ms 22444 KB Output is correct
33 Correct 66 ms 22732 KB Output is correct
34 Correct 43 ms 17292 KB Output is correct
35 Correct 97 ms 28084 KB Output is correct
36 Correct 65 ms 22824 KB Output is correct
37 Correct 39 ms 16284 KB Output is correct
38 Correct 37 ms 16156 KB Output is correct
39 Correct 106 ms 28996 KB Output is correct
40 Correct 110 ms 28996 KB Output is correct
41 Correct 73 ms 24912 KB Output is correct
42 Correct 90 ms 27564 KB Output is correct
43 Correct 87 ms 27596 KB Output is correct
44 Correct 86 ms 27568 KB Output is correct
45 Correct 86 ms 27544 KB Output is correct
46 Correct 53 ms 18160 KB Output is correct
47 Correct 43 ms 17424 KB Output is correct
48 Correct 57 ms 17308 KB Output is correct
49 Correct 44 ms 16604 KB Output is correct
50 Correct 45 ms 18140 KB Output is correct
51 Correct 46 ms 17360 KB Output is correct
52 Correct 59 ms 19272 KB Output is correct
53 Correct 43 ms 16432 KB Output is correct
54 Correct 43 ms 18176 KB Output is correct