oj.uz

Submission #959927

# Submission time Handle Problem Language Result Execution time Memory
959927 2024-04-09T10:23:28 Z GrindMachine Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 422 ms 72892 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "crocodile.h"

vector<pii> adj[N];
vector<bool> spl(N);

int travel_plan(int n, int m, int R[][2], int L[], int k, int P[])
{
    rep(i,m){
        int u = R[i][0], v = R[i][1], w = L[i];
        adj[u].pb({v,w}), adj[v].pb({u,w});
    }

    vector<bool> vis(n);
    vector<int> cnt(n);
    priority_queue<pii,vector<pii>,greater<pii>> pq;

    rep(i,k){
        cnt[P[i]]++;
        pq.push({0,P[i]});
    }

    while(!pq.empty()){
        auto [cost,u] = pq.top();
        pq.pop();

        cnt[u]++;
        if(cnt[u] != 2) conts;

        if(u == 0){
            return cost; 
        }

        for(auto [v,w] : adj[u]){
            pq.push({cost+w,v});
        }
    }

    assert(0);
    return -1;
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7000 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 3 ms 7004 KB Output is correct
14 Correct 1 ms 6744 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 2 ms 6748 KB Output is correct
7 Correct 2 ms 6748 KB Output is correct
8 Correct 2 ms 6748 KB Output is correct
9 Correct 3 ms 7000 KB Output is correct
10 Correct 2 ms 6748 KB Output is correct
11 Correct 2 ms 6748 KB Output is correct
12 Correct 5 ms 7260 KB Output is correct
13 Correct 3 ms 7004 KB Output is correct
14 Correct 1 ms 6744 KB Output is correct
15 Correct 2 ms 6748 KB Output is correct
16 Correct 332 ms 62648 KB Output is correct
17 Correct 65 ms 11856 KB Output is correct
18 Correct 66 ms 18516 KB Output is correct
19 Correct 343 ms 72892 KB Output is correct
20 Correct 217 ms 54100 KB Output is correct
21 Correct 33 ms 10588 KB Output is correct
22 Correct 422 ms 48124 KB Output is correct