oj.uz

Submission #1057711

# Submission time Handle Problem Language Result Execution time Memory
1057711 2024-08-14T03:57:27 Z DucNguyen2007 Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 271 ms 76484 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=1e5+5;
const ll inf=2e9;
struct duongdi
{
    int u;
    ll w;
    bool operator < (const duongdi &o)const
    {
        return w>o.w;
    }
};
pll d[maxN+1];
vector<duongdi> adj[maxN+1];
priority_queue<duongdi> pq;
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++)
    {
        d[i]={inf,inf};
    }
    for(int i=0;i<K;i++)
    {
        pq.push({P[i],0});
        d[P[i]]={0,0};
    }
    while(!pq.empty())
    {
        duongdi tmp=pq.top();
        pq.pop();
        int u=tmp.u;
        ll w=tmp.w;
        //cout<<u<<" "<<w<<'\n';
        if(d[u].fi<w)
        {
            continue;
        }
        for(auto i:adj[u])
        {
            int v=i.u;
            //cout<<1<<" "<<v<<" ";
            if(d[v].fi>d[u].fi+i.w)
            {
                d[v].fi=d[u].fi+i.w;
                if(d[v].se>d[u].fi+i.w)
                {
                    swap(d[v].se,d[v].fi);
                }
                if(d[v].fi<inf)
                {
                    pq.push({v,d[v].fi});
                }
            }
            //cout<<d[v].fi<<'\n';
        }
    }
    return d[0].fi;
}

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 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 6836 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6788 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 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 6836 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6788 KB Output is correct
9 Correct 2 ms 9304 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 2 ms 9308 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct

Subtask #3
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 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 6836 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6788 KB Output is correct
9 Correct 2 ms 9304 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6744 KB Output is correct
12 Correct 2 ms 9308 KB Output is correct
13 Correct 2 ms 9308 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 205 ms 70636 KB Output is correct
17 Correct 41 ms 18516 KB Output is correct
18 Correct 41 ms 20828 KB Output is correct
19 Correct 271 ms 76484 KB Output is correct
20 Correct 138 ms 59512 KB Output is correct
21 Correct 18 ms 14940 KB Output is correct
22 Incorrect 153 ms 55160 KB Output isn't correct
23 Halted 0 ms 0 KB -