Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-11 22:32:0024
2015-10-11 22:05:1824
2015-10-11 22:02:4224
2015-10-11 22:01:0824
2015-10-11 21:59:5524
2015-10-11 20:31:580
2015-10-11 20:26:4924
2015-10-11 20:05:0724
2015-10-11 20:04:1524
2015-10-11 20:03:0824
2015-10-11 19:55:4024
2015-10-11 19:54:3624
2015-10-11 19:52:2824
2015-10-11 19:50:0124
2015-10-11 19:48:5924
2015-10-11 19:48:0824
2015-10-11 19:47:0124
2015-10-11 19:46:1224
2015-10-11 19:37:040
2015-10-11 19:34:4424
2015-10-11 18:37:460
2015-10-08 23:15:1324
2015-10-08 23:07:210
2015-10-08 23:05:160
2015-10-08 23:01:540
Task:Lennot
Sender:tomivah
Submission time:2015-10-11 21:59:55
Language:C++
Status:READY
Score:24

Feedback

groupverdictscore
#1ACCEPTED24
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.07 / 1.001details
#3ACCEPTED0.06 / 1.001details
#4ACCEPTED0.06 / 1.001details
#5ACCEPTED0.06 / 1.001details
#6TIME LIMIT EXCEEDED-- / 1.002details
#7TIME LIMIT EXCEEDED-- / 1.002details
#8ACCEPTED0.06 / 1.002details
#9TIME LIMIT EXCEEDED-- / 1.002details
#10ACCEPTED0.06 / 1.002details
#11TIME LIMIT EXCEEDED-- / 1.003details
#12TIME LIMIT EXCEEDED-- / 1.003details
#13TIME LIMIT EXCEEDED-- / 1.003details
#14TIME LIMIT EXCEEDED-- / 1.003details
#15ACCEPTED0.20 / 1.003details
#16TIME LIMIT EXCEEDED-- / 1.003details
#17TIME LIMIT EXCEEDED-- / 1.003details

Compiler report

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, std::pair<long long unsigned int, long long unsigned int> >&, std::vector<std::vector<long long unsigned int*> >&)':
input/code.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for ( int j = 0; j < cities.at( city.first - 1 ).size(); ++j )
                     ^

Code

#include <iostream>
#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, std::pair< ull, ull > >& closed, std::vector< std::vector< ull* > >& cities )
{
	std::pair< ull, std::pair< ull, ull> > city( open.begin()->second, open.begin()->first );

	if ( city.first == cities.size() )
	{
		std::cout << city.second.first << "\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.first;

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

		if ( !closed.count( path[ 0 ] ) )
		{
			open.insert( std::pair< std::pair< ull, ull >, ull >( std::pair< ull, ull >( cost, city.second.second + 1 ), path[ 0 ] ) );
		}
		else if ( city.second.second % 2 == closed[ path[ 0 ] ].second % 2 && city.second.second < closed[ path[ 0 ] ].second + 1000)
		{
			open.insert( std::pair< std::pair< ull, ull >, ull >( std::pair< ull, ull >( cost, city.second.second + 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, std::pair< 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 details

Test 1

Group: 1

Verdict: ACCEPTED

input
10 20
2 1 3
7 6 4
1 6 7
1 6 1
...
view   save

correct output
8

view   save

user output
8

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
10 20
4 3 10
1 10 9
3 4 10
2 6 7
...
view   save

correct output
9

view   save

user output
9

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
10 20
5 7 4
6 1 1
7 3 8
8 4 2
...
view   save

correct output
8

view   save

user output
8

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
10 20
1 6 2
5 3 3
7 3 6
5 6 2
...
view   save

correct output
13

view   save

user output
13

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
10 20
10 8 5
2 4 7
9 4 7
9 4 1
...
view   save

correct output
4

view   save

user output
4

view   save

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
1000 2000
91 828 365044406
17 984 445675537
251 852 100987451
907 487 58830088
...
view   save

correct output
11893353673

view   save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
1000 2000
722 939 530579090
404 606 268877348
133 750 760086153
506 46 582310443
...
view   save

correct output
30248963445

view   save

user output
(empty)

Test 8

Group: 2

Verdict: ACCEPTED

input
1000 2000
340 237 43690066
217 141 453160975
744 202 639037814
605 926 404985542
...
view   save

correct output
3126797692

view   save

user output
3126797692

view   save

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
1000 2000
88 312 190442306
480 402 411574469
29 901 397491243
636 459 323246996
...
view   save

correct output
18416073173

view   save

user output
(empty)

Test 10

Group: 2

Verdict: ACCEPTED

input
1000 2000
333 228 718389176
796 286 323493090
743 43 751876815
128 554 175625940
...
view   save

correct output
6399349335

view   save

user output
6399349335

view   save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 200000
28264 92686 186865663
92570 33956 925976418
87377 71249 644757113
16701 81203 922125505
...
view   save

correct output
518249578675

view   save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 200000
95740 71482 846654568
44131 16806 670712211
3967 49254 424174139
39369 53007 830346557
...
view   save

correct output
920862321580

view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 200000
79947 25489 71554257
59184 25577 328436360
82945 73554 4942918
22380 92385 874250042
...
view   save

correct output
399407698440

view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 200000
31139 12960 580545990
27744 95556 747296719
46969 42578 840321561
5638 28960 513805324
...
view   save

correct output
165235287505

view   save

user output
(empty)

Test 15

Group: 3

Verdict: ACCEPTED

input
99993 199980
1 3 1
3 2 1
1 4 1
4 2 1
...
view   save

correct output
2

view   save

user output
2

view   save

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 149994
93867 98509 1755709
85029 99843 1347591
10305 35305 6447
75638 80585 1829972
...
view   save

correct output
1124960

view   save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 200000
70413 71496 49
15963 40963 18635
81291 89420 1850028
8848 33848 17316
...
view   save

correct output
110298

view   save

user output
(empty)