oj.uz

Submission #1096122

# Submission time Handle Problem Language Result Execution time Memory
1096122 2024-10-03T21:03:11 Z I_FloPPed21 Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 350 ms 87912 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+1;
struct nod
{
    int unde;
    long long cost;
};

struct coada
{
    int unde;
    long long cost;
};

struct compare
{
    bool operator()(coada &x,coada &y)
    {
        return x.cost>y.cost;
    }
};
vector<nod>adj[N];
long long best[N][2];
int travel_plan(int n,int m,int r[][2],int l[],int k,int p[])
{
    for(int i=0;i<m;i++)
    {
        adj[r[i][0]].push_back({r[i][1],l[i]});
        adj[r[i][1]].push_back({r[i][0],l[i]});
    }


    for(int i=0;i<n;i++)
    {
        best[i][0]=best[i][1]=1e11;
    }
    priority_queue<coada,vector<coada>,compare>pq;
    for(int i=0;i<k;i++)
    {
        best[p[i]][0]=best[p[i]][1]=0;
        pq.push({p[i],0});
    }
    while(!pq.empty())
    {
        int nod=pq.top().unde;
        long long cost=pq.top().cost;
        pq.pop();
        if(cost!=best[nod][1])
            continue;
        for(auto u:adj[nod])
        {
            if(best[u.unde][0]>cost+u.cost)
            {
                best[u.unde][1]=best[u.unde][0];
                best[u.unde][0]=cost+u.cost;
                if(best[u.unde][1]<=1e9)
                pq.push({u.unde,best[u.unde][1]});
            }
            else
                if(best[u.unde][1]>cost+u.cost)
            {
                best[u.unde][1]=cost+u.cost;
                pq.push({u.unde,best[u.unde][1]});
            }
        }
    }
    return best[0][1];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 5152 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 3 ms 5168 KB Output is correct
5 Correct 3 ms 5160 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 5152 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 3 ms 5168 KB Output is correct
5 Correct 3 ms 5160 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 5 ms 5724 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 5156 KB Output is correct
12 Correct 5 ms 5724 KB Output is correct
13 Correct 5 ms 5980 KB Output is correct
14 Correct 3 ms 4968 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 5152 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 3 ms 5168 KB Output is correct
5 Correct 3 ms 5160 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 3 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 5 ms 5724 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 5156 KB Output is correct
12 Correct 5 ms 5724 KB Output is correct
13 Correct 5 ms 5980 KB Output is correct
14 Correct 3 ms 4968 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 285 ms 81544 KB Output is correct
17 Correct 50 ms 19584 KB Output is correct
18 Correct 63 ms 22096 KB Output is correct
19 Correct 350 ms 87912 KB Output is correct
20 Correct 198 ms 67416 KB Output is correct
21 Correct 26 ms 12036 KB Output is correct
22 Incorrect 199 ms 63256 KB Output isn't correct
23 Halted 0 ms 0 KB -