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-10 21:47:540
2015-10-10 21:35:390
2015-10-10 21:21:5111
2015-10-10 20:33:2811
2015-10-10 20:18:490
2015-10-10 20:16:410
2015-10-10 20:13:470
2015-10-10 20:11:36
2015-10-10 18:33:4511
2015-10-10 15:50:3811
2015-10-10 15:41:240
2015-10-10 15:26:480
2015-10-10 14:57:0511
2015-10-10 14:40:300
Task:Bittipeli
Sender:tomivah
Submission time:2015-10-10 21:21:51
Language:C++
Status:READY
Score:11

Feedback

groupverdictscore
#1ACCEPTED11
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0
#4RUNTIME ERROR0

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 1.001details
#2ACCEPTED0.06 / 1.001details
#3ACCEPTED0.06 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.05 / 1.001details
#6ACCEPTED0.06 / 1.001details
#7ACCEPTED0.06 / 1.001details
#8ACCEPTED0.06 / 1.001details
#9ACCEPTED0.06 / 1.001details
#10ACCEPTED0.05 / 1.001details
#11ACCEPTED0.05 / 1.001details
#12ACCEPTED0.05 / 1.001details
#13ACCEPTED0.06 / 1.001details
#14ACCEPTED0.06 / 1.001details
#15ACCEPTED0.06 / 1.001details
#16ACCEPTED0.05 / 1.001details
#17ACCEPTED0.06 / 1.001details
#18ACCEPTED0.05 / 1.001details
#19ACCEPTED0.06 / 1.001details
#20ACCEPTED0.06 / 1.001details
#21ACCEPTED0.05 / 1.002details
#22ACCEPTED0.06 / 1.002details
#23ACCEPTED0.05 / 1.002details
#24ACCEPTED0.05 / 1.002details
#25ACCEPTED0.06 / 1.002details
#26ACCEPTED0.06 / 1.002details
#27ACCEPTED0.04 / 1.002details
#28ACCEPTED0.05 / 1.002details
#29ACCEPTED0.05 / 1.002details
#30ACCEPTED0.05 / 1.002details
#31ACCEPTED0.06 / 1.002details
#32ACCEPTED0.05 / 1.002details
#33ACCEPTED0.05 / 1.002details
#34ACCEPTED0.05 / 1.002details
#35ACCEPTED0.06 / 1.002details
#36TIME LIMIT EXCEEDED-- / 1.002details
#37TIME LIMIT EXCEEDED-- / 1.002details
#38TIME LIMIT EXCEEDED-- / 1.002details
#39ACCEPTED0.05 / 1.002details
#40ACCEPTED0.05 / 1.002details
#41ACCEPTED0.05 / 1.003details
#42ACCEPTED0.05 / 1.003details
#43ACCEPTED0.05 / 1.003details
#44ACCEPTED0.05 / 1.003details
#45ACCEPTED0.06 / 1.003details
#46ACCEPTED0.06 / 1.003details
#47ACCEPTED0.05 / 1.003details
#48ACCEPTED0.05 / 1.003details
#49ACCEPTED0.06 / 1.003details
#50ACCEPTED0.06 / 1.003details
#51ACCEPTED0.05 / 1.003details
#52ACCEPTED0.05 / 1.003details
#53ACCEPTED0.05 / 1.003details
#54ACCEPTED0.06 / 1.003details
#55ACCEPTED0.05 / 1.003details
#56TIME LIMIT EXCEEDED-- / 1.003details
#57TIME LIMIT EXCEEDED-- / 1.003details
#58TIME LIMIT EXCEEDED-- / 1.003details
#59ACCEPTED0.09 / 1.003details
#60ACCEPTED0.06 / 1.003details
#61ACCEPTED0.05 / 1.004details
#62ACCEPTED0.06 / 1.004details
#63ACCEPTED0.06 / 1.004details
#64ACCEPTED0.05 / 1.004details
#65ACCEPTED0.05 / 1.004details
#66ACCEPTED0.05 / 1.004details
#67ACCEPTED0.06 / 1.004details
#68ACCEPTED0.06 / 1.004details
#69ACCEPTED0.06 / 1.004details
#70ACCEPTED0.06 / 1.004details
#71ACCEPTED0.06 / 1.004details
#72ACCEPTED0.06 / 1.004details
#73ACCEPTED0.06 / 1.004details
#74ACCEPTED0.05 / 1.004details
#75ACCEPTED0.05 / 1.004details
#76RUNTIME ERROR0.16 / 1.004details
#77RUNTIME ERROR0.10 / 1.004details
#78RUNTIME ERROR0.10 / 1.004details
#79RUNTIME ERROR0.17 / 1.004details
#80RUNTIME ERROR0.10 / 1.004details

Compiler report

input/code.cpp: In function 'bool solve(std::vector<long long unsigned int>&, std::vector<long long unsigned int>&, long long unsigned int)':
input/code.cpp:26:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for ( int i = 0; i < moves.size(); ++i )
                      ^
input/code.cpp:64:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for ( int i = 0; i < moves.size(); ++i )
                       ^

Code

#include <iostream>
#include <string>
#include <vector>

bool solve( std::vector< unsigned long long >& segmentLengths, std::vector< unsigned long long >& moves, unsigned long long moveCount )
{
	if ( segmentLengths.size() == 1 )
	{
		if ( segmentLengths.front() == 1 )
		{
			return false;
		}

		if ( moves.size() > moveCount )
		{
			moves[ moveCount ] = 1;
		}
		else
		{
			moves.push_back( 1 );
		}

		moveCount++;
		std::cout << moveCount << "\n";

		for ( int i = 0; i < moves.size(); ++i )
		{
			std::cout << moves.at( i ) << " ";
		}

		std::cout << "\n";
		return true;
	}
	else
	{
		bool canSolve = true;

		for ( unsigned long long i = 0; i < segmentLengths.size(); ++i )
		{
			if ( segmentLengths[ i ] == 1 )
			{
				canSolve = false;
			}
		}

		if ( canSolve )
		{
			for ( unsigned long long i = 0; i < segmentLengths.size(); ++i )
			{
				if ( moves.size() > moveCount )
				{
					moves[ moveCount ] = 1;
				}
				else
				{
					moves.push_back( 1 );
				}

				moveCount++;
			}

			std::cout << moveCount << "\n";

			for ( int i = 0; i < moves.size(); ++i )
			{
				std::cout << moves.at( i ) << " ";
			}

			std::cout << "\n";
			return true;
		}

		int segment = 1;

		for ( unsigned long long i = 0; i < segmentLengths.size(); ++i )
		{
			if ( segmentLengths.at( i ) > 1 )
			{
				std::vector< unsigned long long > newSegments( segmentLengths );

				if ( i > 0 && i < segmentLengths.size() - 1 )
				{
					newSegments.at( i - 1 ) += newSegments.at( i + 1 );
					newSegments.erase( newSegments.begin() + i );
				}

				newSegments.erase( newSegments.begin() + i );

				if ( moves.size() > moveCount )
				{
					moves[ moveCount ] = segment;
				}
				else
				{
					moves.push_back( segment );
				}

				if ( solve( newSegments, moves, moveCount + 1 ) )
				{
					return true;
				}

				segment++;
			}
		}
	}

	return false;
}

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

	std::vector< unsigned long long > segmentLengths;
	std::string input;
	std::getline( std::cin, input );

	bool lastBit = 0;
	unsigned long long segmentLength = 1;

	for ( unsigned long long i = 0; i < input.length(); ++i )
	{
		if ( i > 0 )
		{
			if ( lastBit == ( input[ i ] == '1' ) )
			{
				segmentLength++;
			}
			else
			{
				segmentLengths.push_back( segmentLength );
				segmentLength = 1;
			}
		}
		
		lastBit = input[ i ] == '1';
	}

	segmentLengths.push_back( segmentLength );

	std::vector< unsigned long long > moves;

	if ( !solve( segmentLengths, moves, 0 ) )
	{
		std::cout << "QAQ\n";
	}
	
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

view   save

correct output
3
2 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

view   save

correct output
3
1 2 1 

view   save

user output
3
1 2 1 

view   save

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011

view   save

correct output
3
2 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

view   save

correct output
4
1 2 1 1 

view   save

user output
5
1 1 1 1 1 

view   save

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

view   save

correct output
4
2 2 2 1 

view   save

user output
5
1 1 1 1 1 

view   save

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

view   save

correct output
3
3 2 1 

view   save

user output
4
1 1 1 1 

view   save

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

view   save

correct output
3
2 2 1 

view   save

user output
4
1 1 1 1 

view   save

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 25

Group: 2

Verdict: ACCEPTED

input
0011111110

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

view   save

correct output
3
3 2 1 

view   save

user output
3
3 2 1 

view   save

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

view   save

correct output
2
2 1 

view   save

user output
3
1 1 1 

view   save

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 36

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001010101010...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 37

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100101010...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 38

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
31
1 20 20 20 20 20 20 20 20 20 2...
view   save

user output
(empty)

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...
view   save

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...
view   save

user output
28
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 1 2 1 

view   save

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 1 2 1 

view   save

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

view   save

correct output
2
2 1 

view   save

user output
2
2 1 

view   save

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

view   save

correct output
3
1 2 1 

view   save

user output
4
1 1 1 1 

view   save

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

view   save

correct output
3
1 1 1 

view   save

user output
3
1 1 1 

view   save

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

view   save

correct output
3
2 2 1 

view   save

user output
4
1 1 1 1 

view   save

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

view   save

correct output
3
2 1 1 

view   save

user output
3
2 1 1 

view   save

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

view   save

correct output
3
2 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 57

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 58

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
1501
1 1000 1000 1000 1000 1000 100...
view   save

user output
(empty)

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...
view   save

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...
view   save

correct output
1272
1 1 648 647 646 646 645 645 64...
view   save

user output
1690
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

view   save

correct output
QAQ

view   save

user output
QAQ

view   save

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

view   save

correct output
3
2 2 1 

view   save

user output
3
2 2 1 

view   save

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

view   save

correct output
3
2 1 1 

view   save

user output
3
1 2 1 

view   save

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

view   save

correct output
2
1 1 

view   save

user output
2
1 1 

view   save

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

view   save

correct output
4
1 1 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

view   save

correct output
2
2 1 

view   save

user output
3
1 1 1 

view   save

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

view   save

correct output
4
2 2 2 1 

view   save

user output
4
2 2 2 1 

view   save

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

view   save

correct output
3
2 1 1 

view   save

user output
4
1 1 1 1 

view   save

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

view   save

correct output
3
3 2 1 

view   save

user output
4
1 2 1 1 

view   save

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

view   save

correct output
2
2 1 

view   save

user output
3
1 1 1 

view   save

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

view   save

correct output
4
2 1 1 1 

view   save

user output
4
2 1 1 1 

view   save

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
4
1 2 1 1 

view   save

Test 76

Group: 4

Verdict: RUNTIME ERROR

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 77

Group: 4

Verdict: RUNTIME ERROR

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 78

Group: 4

Verdict: RUNTIME ERROR

input
110011001100110011001100110011...
view   save

correct output
30001
1 20000 20000 20000 20000 2000...
view   save

user output
(empty)

Test 79

Group: 4

Verdict: RUNTIME ERROR

input
010101010101010101010101010101...
view   save

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

user output
(empty)

Test 80

Group: 4

Verdict: RUNTIME ERROR

input
111000110000011000001101010010...
view   save

correct output
25011
1 12471 12470 12469 12468 1246...
view   save

user output
(empty)