oj.uz

답안 #832881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832881 2023-08-21T16:13:48 Z jlallas384 악어의 지하 도시 (IOI11_crocodile) C++17
100 / 100
 532 ms 54224 KB 
#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
using ll = long long;

int change(vector<pair<ll,int>> o, vector<pair<ll,int>> n){
    return o != n;
}

int travel_plan(int n, int m, int r[][2], int L[], int k, int p[]){
    vector<int> lst(n);
    priority_queue<pair<ll,int>> pq;
    vector<vector<pair<ll,int>>> dist(n);
    for(int i = 0; i < k; i++){
        pq.emplace(0, p[i]);
        lst[p[i]] = 1;
        dist[p[i]].emplace_back(0, p[i]);
        dist[p[i]].emplace_back(0, p[i]);
    }
    vector<vector<pair<int,int>>> g(n);
    for(int i = 0; i < m; i++){
        g[r[i][0]].emplace_back(r[i][1], L[i]);
        g[r[i][1]].emplace_back(r[i][0], L[i]);
    }
    ll ans = 1e18;
    while(pq.size()){
        auto [d, v] = pq.top(); pq.pop();
        if(-d > dist[v].back().first) continue;
        if(v == 0) return dist[v].back().first;
        for(auto [u, w]: g[v]){
            if(dist[u].empty()){
                dist[u].emplace_back(-d + w, v);
            }else{
                int has = 0;
                vector<pair<ll,int>> o = dist[u];
                for(auto &[pd, pv]: dist[u]) if(pv == v){
                    has = 1;
                    if(pd > -d + w){
                        pd = -d + w;
                        sort(dist[u].begin(), dist[u].end());
                        if(dist[u].size() == 2){
                            if(change(o, dist[u])) pq.emplace(-dist[u].back().first, u);
                        }
                    }
                }
                if(!has){
                    dist[u].emplace_back(-d + w, v);
                    sort(dist[u].begin(), dist[u].end());
                    if(dist[u].size() == 3) dist[u].pop_back();
                    if(dist[u].size() == 2){
                        if(change(o, dist[u])) pq.emplace(-dist[u].back().first, u);
                    }
                }
            }
        }
    }
    return ans;
}

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 4 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 4 ms 852 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 476 ms 42912 KB Output is correct
17 Correct 88 ms 20896 KB Output is correct
18 Correct 94 ms 18320 KB Output is correct
19 Correct 532 ms 54224 KB Output is correct
20 Correct 322 ms 34952 KB Output is correct
21 Correct 40 ms 8104 KB Output is correct
22 Correct 333 ms 33736 KB Output is correct