oj.uz

답안 #637126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637126 2022-08-31T15:50:22 Z ghostwriter 악어의 지하 도시 (IOI11_crocodile) C++14
89 / 100
 435 ms 63304 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
struct Vertex {
    int u, Min;
    Vertex() {}
    Vertex(int u, int Min) : u(u), Min(Min) {}
};
struct cmp {
    bool operator()(Vertex a, Vertex b) {
        return a.Min > b.Min;
    }
};
const int oo = 1e9 + 1;
const int NMAX = 1e5 + 1;
pi d[NMAX];
vpi adj[NMAX];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
    FOR(i, 0, N - 1) d[i] = {oo, oo};
    FOR(i, 0, M - 1) {
        int u = R[i][0], v = R[i][1], w = L[i];
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }
    priority_queue<Vertex, vector<Vertex>, cmp> pq;
    FOR(i, 0, K - 1) {
        int u = P[i];
        d[u] = {0, 0};
        pq.push(Vertex(u, 0));
    }
    WHILE(!pq.empty()) {
        Vertex cur = pq.top();
        pq.pop();
        int u = cur.u, Min = cur.Min;
        if (Min > d[u].nd) continue;
        if (u == 0) return Min;
        EACH(j, adj[u]) {
            int v = j.st, w = j.nd;
            if (d[v].nd > Min + w) {
                d[v].nd = Min + w;
                if (d[v].st > d[v].nd) swap(d[v].st, d[v].nd);
                pq.push(Vertex(v, d[v].nd));
            }
        }
    }
    return N;
}
/*
5 4 3
0 1 2
0 2 3
3 2 1
2 4 4
1
3
4
7
 
5 7 2
0 2 4
0 3 3
3 2 2
2 1 10
0 1 100
0 4 7
3 4 9
1
3
14
*/

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
crocodile.cpp:53:5: note: in expansion of macro 'FOR'
   53 |     FOR(i, 0, N - 1) d[i] = {oo, oo};
      |     ^~~
crocodile.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
crocodile.cpp:54:5: note: in expansion of macro 'FOR'
   54 |     FOR(i, 0, M - 1) {
      |     ^~~
crocodile.cpp:26:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
crocodile.cpp:60:5: note: in expansion of macro 'FOR'
   60 |     FOR(i, 0, K - 1) {
      |     ^~~
crocodile.cpp:28:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   28 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
crocodile.cpp:71:9: note: in expansion of macro 'EACH'
   71 |         EACH(j, adj[u]) {
      |         ^~~~

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 1 ms 2644 KB Output is correct
4 Correct 2 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 2676 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 1 ms 2644 KB Output is correct
4 Correct 2 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 2676 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 2680 KB Output is correct
12 Correct 6 ms 3180 KB Output is correct
13 Correct 4 ms 3200 KB Output is correct
14 Correct 2 ms 2632 KB Output is correct
15 Correct 2 ms 2676 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 1 ms 2644 KB Output is correct
4 Correct 2 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 2676 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 2680 KB Output is correct
12 Correct 6 ms 3180 KB Output is correct
13 Correct 4 ms 3200 KB Output is correct
14 Correct 2 ms 2632 KB Output is correct
15 Correct 2 ms 2676 KB Output is correct
16 Correct 384 ms 58332 KB Output is correct
17 Correct 77 ms 15016 KB Output is correct
18 Correct 84 ms 15900 KB Output is correct
19 Correct 435 ms 63304 KB Output is correct
20 Correct 271 ms 49596 KB Output is correct
21 Correct 36 ms 8004 KB Output is correct
22 Incorrect 286 ms 46336 KB Output isn't correct
23 Halted 0 ms 0 KB -