oj.uz

Submission #820248

# Submission time Handle Problem Language Result Execution time Memory
820248 2023-08-11T02:09:29 Z Mathandski Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 435 ms 89148 KB 
#include <bits/stdc++.h> 
using namespace std;
#define pb push_back 
#define is insert
#define lb lower_bound
#define ll long long
#define V vector
#define MS multiset
#define PL pair<ll, ll>
#define F first
#define S second
#define PQ priority_queue
#define f0r(i, begin, end) for (ll i = begin; i < end; i ++) 
#define For(i, end, begin) for (ll i = end - 1; i >= begin; i --) 
#define all(x) x.begin(), x.end()
#define INF 1000000000000000000
#define inf 1000000000
#define MOD 1000000007
#define len(x) (ll)x.size()
#define fileread(file) ifstream fin; fin.open((string)file + ".in"); ofstream fout; fout.open((string)file + ".out")
#define fastio ios_base::sync_with_stdio(0); fin.tie(nullptr)
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};

int travel_plan(int N, int M, int edges[][2], int w[], int K, int P[]) {
    V<PL> conn[100000];
    PL safedist[100000];

    f0r (i, 0, M) {
        ll a = edges[i][0], b = edges[i][1], c = w[i];
        conn[a].pb({b, c});
        conn[b].pb({a, c});
    }
    f0r (i, 0, N) {
        safedist[i] = {INF, INF};
    }

    using T = pair<ll, ll>;
	priority_queue<T, vector<T>, greater<T>> pq;

    f0r (i, 0, K) {
        ll x = P[i];
        safedist[x] = {0, 0};

        for (auto p : conn[x]) {
            ll a, dist; tie(a, dist) = p;
            if ((safedist[a].F > dist) && (safedist[a].S > dist)) {
                if(safedist[a].S != safedist[a].F) {
                    pq.push({safedist[a].F, a});
                }
                safedist[a].S = safedist[a].F;
                safedist[a].F = dist;
            }
            else if (safedist[a].S > dist) {
                safedist[a].S = dist;
                pq.push({dist, a});
            }
        }
    }

    while (pq.size()) {
		ll cdist;
		ll node;
		tie(cdist, node) = pq.top();
		pq.pop();
		if (cdist != safedist[node].S) continue;

		for (auto p : conn[node]) {
            ll a, dist; tie(a, dist) = p;
            dist += cdist;
            if ((safedist[a].F > dist) && (safedist[a].S > dist)) {
                if(safedist[a].S != safedist[a].F) {
                    pq.push({safedist[a].F, a});
                }
                safedist[a].S = safedist[a].F;
                safedist[a].F = dist;
            }
            else if (safedist[a].S > dist) {
                safedist[a].S = dist;
                pq.push({dist, a});
            }
        }
	}
    return safedist[0].S;
}

// int main () {
//     int N, M, K;
//     cin >> N >> M >> K;
//     int edges[M][2], w[M], P[K];
//     f0r (i, 0, M) {
//         int a, b, c; cin >> a >> b >> c;
//         edges[i][0] = a; edges[i][1] = b; w[i] = c;
//     }
//     f0r (i, 0, K) cin >> P[i];
//     cout << travel_plan(N, M, edges, w, K, P) << endl;
// }

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4152 KB Output is correct
4 Correct 3 ms 4284 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4288 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4152 KB Output is correct
4 Correct 3 ms 4284 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4288 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 5 ms 4564 KB Output is correct
10 Correct 3 ms 4148 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 5 ms 4952 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4152 KB Output is correct
4 Correct 3 ms 4284 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4180 KB Output is correct
7 Correct 2 ms 4288 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 5 ms 4564 KB Output is correct
10 Correct 3 ms 4148 KB Output is correct
11 Correct 4 ms 4308 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 5 ms 4952 KB Output is correct
14 Correct 3 ms 4180 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct
16 Correct 362 ms 83756 KB Output is correct
17 Correct 54 ms 17540 KB Output is correct
18 Correct 70 ms 20040 KB Output is correct
19 Correct 435 ms 89148 KB Output is correct
20 Correct 243 ms 69536 KB Output is correct
21 Correct 38 ms 10772 KB Output is correct
22 Correct 257 ms 65120 KB Output is correct