oj.uz

답안 #756607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756607 2023-06-12T01:32:59 Z maomao90 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 464 ms 47656 KB 
    #include <bits/stdc++.h>
    #include "crocodile.h"
    using namespace std;
     
    #define REP(i, j, k) for (int i = j; i < k; i++)
    #define RREP(i, j, k) for (int i = j; i >= k; i--)
     
    template <class T>
    inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;}
    template <class T>
    inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;}
     
    typedef long long ll;
    typedef long double ld;
    #define FI first
    #define SE second
    typedef pair<int, int> ii;
    typedef pair<ll, ll> pll;
    #define ALL(x) x.begin(), x.end()
    #define SZ(x) (int) x.size()
    #define pb push_back
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<ii> vii;
    typedef tuple<int, int, int> iii;
    typedef vector<iii> viii;
     
    #ifndef DEBUG
    #define cerr if (0) cerr
    #endif
     
    const int INF = 1000000005;
    const ll LINF = 9000000000000000005;
    const int MAXN = 100005;
     
    int n, m, k;
    vii adj[MAXN];
    ll mnd[MAXN], smnd[MAXN];
    priority_queue<pll, vector<pll>, greater<pll>> pq;
     
    bool relax(int u, ll x) {
    	if (x < mnd[u]) {
    		smnd[u] = mnd[u];
    		mnd[u] = x;
    		return smnd[u] != LINF;
    	} else {
    		return mnto(smnd[u], x);
    	}
    }
     
    int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    	n = N; m = M; k = K;
    	REP (i, 0, m) {
    		adj[R[i][0]].pb({R[i][1], L[i]});
    		adj[R[i][1]].pb({R[i][0], L[i]});
    	}
    	REP (i, 0, n) {
    		mnd[i] = smnd[i] = LINF;
    	}
    	REP (i, 0, k) {
    		mnd[P[i]] = smnd[P[i]] = 0;
    		pq.push({0, P[i]});
    	}
    	while (!pq.empty()) {
    		auto [d, u] = pq.top(); pq.pop();
    		if (d != smnd[u]) {
    			continue;
    		}
    		for (auto [v, w] : adj[u]) {
    			if (relax(v, d + w)) {
    				pq.push({smnd[v], v});
    			}
    		}
    	}
    	assert(smnd[0] != LINF);
    	assert(smnd[0] < INF);
    	return smnd[0];
    }

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 5 ms 3000 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 3 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 3 ms 2900 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 5 ms 3000 KB Output is correct
13 Correct 4 ms 3028 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 367 ms 42500 KB Output is correct
17 Correct 85 ms 11176 KB Output is correct
18 Correct 92 ms 12600 KB Output is correct
19 Correct 464 ms 47656 KB Output is correct
20 Correct 245 ms 36596 KB Output is correct
21 Correct 36 ms 6500 KB Output is correct
22 Incorrect 245 ms 32084 KB Output isn't correct
23 Halted 0 ms 0 KB -