oj.uz

Submission #1086082

# Submission time Handle Problem Language Result Execution time Memory
1086082 2024-09-09T13:33:30 Z MrPavlito Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 2 ms 3416 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>


using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
int n;

vector<long long> dist(MAXN, inf);
int cnt[MAXN];
vector<vector<pii>> graf(MAXN);
set<pii> pq;

void dikstra()
{
    while(!pq.empty())
    {
        auto it = pq.begin();
        int u = it-> sc;
        int d = it-> fi;
        pq.erase(it);
        if(dist[u] != inf)continue;
        cnt[u]++;
        if(cnt[u] == 2)
        {
            dist[u] = d;
        for(auto x: graf[u])
        {

                pq.insert({dist[x.fi], x.fi});
        }
        }
    }
}


int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    n = N;
    for(int i=0; i<M; i++)
    {
        graf[R[i][0]].pb({R[i][1], L[i]});
        graf[R[i][1]].pb({R[i][0], L[i]});
    }
    for(int i = 0; i<K; i++)
    {
        for(auto x: graf[P[i]])
        {
            pq.insert(mp(x.sc, x.fi));
        }
        dist[P[i]] = 0;
    }
    //for(auto x: pq)cout << x.fi << " " << x.sc << endl;
    dikstra();
    return dist[0];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -