oj.uz

답안 #1096124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096124 2024-10-03T21:05:09 Z I_FloPPed21 악어의 지하 도시 (IOI11_crocodile) C++14
89 / 100
 332 ms 75452 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]=1e9+1;
    }
    priority_queue<coada,vector<coada>,compare>pq;
    for(int i=0;i<k;i++)
    {
        best[p[i]][0]=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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4960 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4960 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5464 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5208 KB Output is correct
12 Correct 4 ms 5724 KB Output is correct
13 Correct 4 ms 5724 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4960 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 5212 KB Output is correct
5 Correct 2 ms 5212 KB Output is correct
6 Correct 3 ms 5212 KB Output is correct
7 Correct 2 ms 5212 KB Output is correct
8 Correct 2 ms 5212 KB Output is correct
9 Correct 3 ms 5464 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 2 ms 5208 KB Output is correct
12 Correct 4 ms 5724 KB Output is correct
13 Correct 4 ms 5724 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 5212 KB Output is correct
16 Correct 259 ms 69196 KB Output is correct
17 Correct 49 ms 16720 KB Output is correct
18 Correct 59 ms 18984 KB Output is correct
19 Correct 332 ms 75452 KB Output is correct
20 Correct 181 ms 57424 KB Output is correct
21 Correct 24 ms 10576 KB Output is correct
22 Incorrect 195 ms 52240 KB Output isn't correct
23 Halted 0 ms 0 KB -