oj.uz

Submission #207380

# Submission time Handle Problem Language Result Execution time Memory
207380 2020-03-07T12:11:30 Z robs Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 1432 ms 58832 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
#define debug(args...) //fprintf(stderr, args)
#define mk make_pair
using namespace std;
const int maxn = 2e5, INF = 1e9;
int dist[maxn],distMin[maxn],marcExit[maxn],contExit[maxn],resp,n;
vector<int> grafo[maxn];
vector<int> peso[maxn];
vector<int> casos[maxn];
set<pair<int, int> > fora;

void dijkstra()
{
	debug("dijkstra\n");
	debug("set foi!!\n");
	debug("criei os set ai\n");
	for(int x = 0; x < n; x++)	fora.insert( mk(dist[x], x));
	debug("inicializei dnv\n");
	while(!fora.empty())
	{
		int cur = fora.begin()->second;
		debug("	%d:\n",cur);
		fora.erase(fora.begin());
		for(int x = 0; x < grafo[cur].size(); x++)
		{
			int viz = grafo[cur][x];
			debug("		%d\n",viz);
			int p = peso[cur][x];
			if(dist[cur] + p < distMin[viz])
			{
				fora.erase( mk(dist[viz], viz));
				dist[viz] = distMin[viz];
				distMin[viz] = dist[cur] + p;
				fora.insert( mk(dist[viz], viz));
				continue;
			}
			if(dist[cur] + p < dist[viz])
			{
				fora.erase( mk(dist[viz], viz));
				dist[viz] = dist[cur] + p;
				fora.insert( mk(dist[viz], viz));
			}
		}
	}
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	debug("comeco\n");
	n = N;
	for(int x = 0; x < K; x++)	marcExit[P[x]] = 1;
	for(int x = 0; x < M; x++)
	{
		int i = R[x][0];
		int j = R[x][1];
		int p = L[x];
		grafo[i].push_back(j);
		grafo[j].push_back(i);
		peso[i].push_back(p);
		peso[j].push_back(p);
		if(marcExit[i] && marcExit[j])	continue;
		if(marcExit[i])	contExit[j]++;
		if(marcExit[j])	contExit[i]++;
	}
	debug("criou o grafo\n");
	for(int x = 0; x < N; x++)
	{
		if(marcExit[x])
		{
			distMin[x] = 0;
			dist[x] = 0;
		}
		else
		{
			distMin[x] = INF;
			dist[x] = INF;
		}
		if(contExit[x] >= 2)
		{
			int Min = INF;
			int Max = INF;
			for(int y = 0; y < grafo[x].size(); y++)
			{
				int viz = grafo[x][y];
				int p = peso[x][y];
				if(dist[viz] + p < Min)
				{
					Max = Min;
					Min = dist[viz] + p;
					continue;
				}
				if(dist[viz] + p < Max)	Max = dist[viz] + p;
			}
			dist[x] = Max;
		}
	}
	debug("terminei a entrada\n");
	dijkstra();
	debug("foi o dijkstra\n");
	int resp = dist[0];
	debug("resp = %d\n",resp);
	return resp;
}

Compilation message

crocodile.cpp: In function 'void dijkstra()':
crocodile.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int x = 0; x < grafo[cur].size(); x++)
                  ~~^~~~~~~~~~~~~~~~~~~
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:83:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int y = 0; y < grafo[x].size(); y++)
                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 13 ms 14456 KB Output is correct
3 Correct 14 ms 14456 KB Output is correct
4 Correct 15 ms 14584 KB Output is correct
5 Correct 15 ms 14584 KB Output is correct
6 Correct 15 ms 14584 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 14 ms 14584 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 13 ms 14456 KB Output is correct
3 Correct 14 ms 14456 KB Output is correct
4 Correct 15 ms 14584 KB Output is correct
5 Correct 15 ms 14584 KB Output is correct
6 Correct 15 ms 14584 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 14 ms 14584 KB Output is correct
9 Correct 16 ms 14588 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 19 ms 14840 KB Output is correct
13 Correct 18 ms 14816 KB Output is correct
14 Correct 14 ms 14456 KB Output is correct
15 Correct 14 ms 14560 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 13 ms 14456 KB Output is correct
3 Correct 14 ms 14456 KB Output is correct
4 Correct 15 ms 14584 KB Output is correct
5 Correct 15 ms 14584 KB Output is correct
6 Correct 15 ms 14584 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 14 ms 14584 KB Output is correct
9 Correct 16 ms 14588 KB Output is correct
10 Correct 16 ms 14456 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 19 ms 14840 KB Output is correct
13 Correct 18 ms 14816 KB Output is correct
14 Correct 14 ms 14456 KB Output is correct
15 Correct 14 ms 14560 KB Output is correct
16 Correct 897 ms 52088 KB Output is correct
17 Correct 181 ms 28536 KB Output is correct
18 Correct 253 ms 30384 KB Output is correct
19 Correct 1432 ms 58832 KB Output is correct
20 Correct 385 ms 49316 KB Output is correct
21 Correct 86 ms 19960 KB Output is correct
22 Correct 454 ms 45560 KB Output is correct