oj.uz

Submission #824266

# Submission time Handle Problem Language Result Execution time Memory
824266 2023-08-13T22:29:51 Z trangtranha28 Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 2 ms 3412 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <climits>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;

const int MAXN = 1e5 + 2;

int n, m;
int dis[MAXN] = {0}, dis2[MAXN] = {0};
bool check[MAXN] = {false};

vector <int> exits;
vector <pair <int, int> > adj[MAXN];

int Dijkstra() {
	// reset:
	memset(dis, 63, sizeof(dis));
	memset(dis2, 63, sizeof(dis2));
	
	// main:
	priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > pq;
	
	for(int i = 0; i < (int)(exits.size()); i++) {
    	dis[exits[i]] = 0;
		dis2[exits[i]] = 0;
		pq.push(make_pair(0, exits[i]));
	}
	
    while(pq.empty() == false) {
        int u = pq.top().second;
        pq.pop();
		
        if(check[u] == false) {
        	continue;
		}
		check[u] = true;
		
        for(int i = 0; i < (int)(adj[u].size()); i++) {
            int v = adj[u][i].first, w = adj[u][i].second;
            if(dis[v] > dis2[u] + w) {
                dis2[v] = dis[v];
				dis[v] = dis2[u] + w;
                pq.push(make_pair(dis2[v], v));
            } else if(dis2[v] > dis2[u] + w) {
            	dis2[v] = dis2[u] + w;
				pq.push(make_pair(dis2[v], v));
			}
        }
    }
    return dis2[0];
}

int travel_plan(int N, int M, int R[][2], int L[], int k, int p[]) {
    n = N, m = M;
    for(int i = 0; i < m; i++) {
        int a = R[i][0], b = R[i][1], c = L[i];
        adj[a].push_back(make_pair(b, c));
		adj[b].push_back(make_pair(a, c));
    }
    for(int i = 0; i < k; i++) {
    	exits.push_back(p[i]);
	}
    return Dijkstra();
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3412 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 3412 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 3412 KB Output isn't correct
2 Halted 0 ms 0 KB -