oj.uz

답안 #1079830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079830 2024-08-29T02:17:25 Z _rain_ 악어의 지하 도시 (IOI11_crocodile) C++14
100 / 100
 338 ms 54576 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fixbug false

//... READ INPUT
const int INF = 1e9 ;
const int maxn = 1e5;
const int maxm = 1e6;
vector<pair<int,int>> g[maxn+2];
ll d[maxn+2][2];
bool vis[maxn+2];
#define ii pair<ll,int>
#define fi first
#define se second

int travel_plan(int n , int m , int R[][2] , int L[] , int k , int P[]){
    for (int i = 0; i < m; ++i) {
        g[R[i][0]].push_back({R[i][1] , L[i]});
        g[R[i][1]].push_back({R[i][0] , L[i]});
        if (fixbug){
            cout << R[i][0] << ' ' << R[i][1] << ' ' << L[i] << '\n';
        }
    }
    priority_queue<ii,vector<ii>,greater<ii>> q;
    for (int i = 0; i < n; ++i) d[i][0] = d[i][1] = INF;
    ll ans = d[0][0];
    for (int i = 0 ; i < k; ++i){
        d[P[i]][0] = d[P[i]][1] = 0;
        q.push({0 , P[i]});
    }
    while (q.size()){
        int u = q.top().second; ll cost = q.top().first;
        q.pop();
        if (vis[u]) continue;
        vis[u] = true;
        if (fixbug){
            cout << "(DEBUG)\n";
            cout << u << ' ' << cost << "\n";
        }

        for (auto & x : g[u]){
            int v = x.first , w = x.second;
            if (d[v][1] > cost + w){
                d[v][0] = d[v][1];
                d[v][1] = cost + w;
                q.push({d[v][0] , v});
            }
            else
                if (d[v][0] > cost + w) {
                d[v][0] = cost + w;
                q.push({d[v][0] , v});
            }
        }
    }
    if (fixbug){
        cout << ans << '\n';
        for (int i = 0; i < n; ++i) cout << d[i][0] << '\n';
    }
    return d[0][0];
}

Subtask #1
46.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 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct

Subtask #2
43.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 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6744 KB Output is correct
10 Correct 1 ms 6584 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct

Subtask #3
11.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 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 2 ms 6744 KB Output is correct
10 Correct 1 ms 6584 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 2 ms 6748 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 250 ms 46896 KB Output is correct
17 Correct 73 ms 15564 KB Output is correct
18 Correct 71 ms 16840 KB Output is correct
19 Correct 338 ms 54576 KB Output is correct
20 Correct 181 ms 38996 KB Output is correct
21 Correct 29 ms 11648 KB Output is correct
22 Correct 195 ms 35800 KB Output is correct