oj.uz

답안 #876759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876759 2023-11-22T09:34:37 Z deadeye0 악어의 지하 도시 (IOI11_crocodile) C++17
0 / 100
 2 ms 6492 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define si second
#define ar array
#define pb push_back
typedef pair<ll,ll> pi;
typedef tuple<int,int,int> ti;  
typedef vector<int> vi;
template<typename T> bool chmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
const int MAXN = 100010;
const ll INF = 2e9;
int n, m;
ll d1[MAXN], d2[MAXN];
vector<vector<pi>> g;
priority_queue<pi, vector<pi>, greater<pi>> pq;
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) 
{
    n = N, m = M;
    g.resize(n);
    for (int i = 0; i < m; ++i) {
        int u = R[i][0], v = R[i][1];
        g[u].pb({v, L[i]});
        g[v].pb({u, L[i]});
        d1[i] = d2[i] = INF;
    }
    for (int i = 0; i < K; ++i)  {
        d1[P[i]] = 0;
        d2[P[i]] = 0;
        pq.push({0, P[i]});
    }   
    while (pq.size()) {
        auto [d, x] = pq.top(); pq.pop();
        if (d2[x] != d) continue;
        for (auto i: g[x]) {
            ll val = d + i.si;
            if (val < d2[i.fi]) {
                d2[i.fi] = val;
                if (d2[i.fi] < d1[i.fi]) swap(d2[i.fi], d1[i.fi]);
                if (d2[i.fi] < INF) pq.push({d2[i.fi], i.fi});
            }
        }
    }
    return d2[0];
}

Subtask #1
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Incorrect 2 ms 6492 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Incorrect 2 ms 6492 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Incorrect 2 ms 6492 KB Output isn't correct
9 Halted 0 ms 0 KB -