Lennot

input/code.cpp: In function 'bool search(std::set<std::pair<std::pair<long long unsigned int, long long unsigned int>, long long unsigned int> >&, std::map<long long unsigned int, long long unsigned int>&, std::vector<std::vector<long long unsigned int*> >&)':
input/code.cpp:23:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for ( int j = 0; j < cities.at( city.first - 1 ).size(); ++j )
                     ^

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>

#define ull unsigned long long

bool search( std::set< std::pair< std::pair< ull, ull>, ull > >& open, std::map< ull, ull >& closed, std::vector< std::vector< ull* > >& cities )
{
	std::pair< ull, ull > city( open.begin()->second, open.begin()->first.first );
	ull flights = open.begin()->first.second;

	if ( city.first == cities.size() )
	{
		std::cout << city.second << "\n";
		return true;
	}

	closed.insert( city );
	open.erase( open.begin() );

	for ( int j = 0; j < cities.at( city.first - 1 ).size(); ++j )
	{
		ull* path = cities.at( city.first - 1 ).at( j );
		ull cost = city.second;

		if ( flights % 2 == 0 )
		{
			cost += path[ 1 ];
		}

		if ( !closed.count( path[ 0 ] ) )
		{
			open.insert( std::pair< std::pair< ull, ull >, ull >( std::pair< ull, ull >( cost, flights + 1 ), path[ 0 ] ) );
		}
		else if ( cost <= closed[ path[ 0 ] ] * 1.5 + 10000000 )
		{
			open.insert( std::pair< std::pair< ull, ull >, ull >( std::pair< ull, ull >( cost, flights + 1 ), path[ 0 ] ) );
			closed.erase( path[ 0 ] );
		}
	}

	return false;
}

int main()
{
	std::ios_base::sync_with_stdio( false );

	ull cityCount, pathCount;
	std::cin >> cityCount >> pathCount;

	std::vector< std::vector< ull* > > cities;

	for ( ull i = 0; i < cityCount; ++i )
	{
		std::vector< ull* > vec;
		cities.push_back( vec );
	}

	for ( ull i = 0; i < pathCount; ++i )
	{
		ull from;
		ull* path = new ull[ 2 ];
		std::cin >> from >> path[ 0 ] >> path[ 1 ];
		cities.at( from - 1 ).push_back( path );
	}

	std::set< std::pair< std::pair< ull, ull>, ull > > open;
	open.insert( std::pair< std::pair< ull, ull>, ull >( std::pair< ull, ull >( 0, 0 ), 1 ) );
	std::map< ull, ull > closed;

	while ( !search( open, closed, cities ) )
	{

	}
	
	for ( ull i = 0; i < cityCount; ++i )
	{
		for ( ull j = 0; j < cities.at( i ).size(); ++j )
		{
			delete[] cities.at( i ).at( j );
		}
	}

	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED