CSES - Datatähti 2016 alku - Results
Submission details
Task:Osajono
Sender:tomivah
Submission time:2015-10-08 17:39:53 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.06 s1details
#20.06 s1details
#30.05 s1details
#40.05 s1details
#50.06 s1details
#60.06 s2details
#70.06 s2details
#80.06 s2details
#90.05 s2details
#100.06 s2details
#110.05 s3details
#120.06 s3details
#130.05 s3details
#140.06 s3details
#150.06 s3details

Code

#include <iostream>
#include <string>
#include <sstream>
int main()
{
std::ios_base::sync_with_stdio( false );
unsigned long long bookCount;
std::cin >> bookCount;
std::cin.get();
unsigned long long* sequence1 = new unsigned long long[ bookCount ];
unsigned long long* sequence2 = new unsigned long long[ bookCount ];
unsigned long long* sequence3 = new unsigned long long[ bookCount ];
for ( unsigned long long i = 0; i < bookCount; ++i )
{
std::cin >> sequence1[ i ];
}
for ( unsigned long long j = 0; j < bookCount; ++j )
{
std::cin >> sequence2[ j ];
}
unsigned long long lowestUnread = 1;
bool* booksRead = new bool[ bookCount ];
for ( unsigned long long i = 0; i < bookCount; ++i )
{
booksRead[ i ] = false;
}
for ( unsigned long long i = 0; i < bookCount; ++i )
{
if ( lowestUnread != sequence1[ i ] && lowestUnread != sequence2[ i ] )
{
sequence3[ i ] = lowestUnread;
booksRead[ lowestUnread - 1 ] = true;
while ( lowestUnread < bookCount && booksRead[ lowestUnread - 1 ] )
{
lowestUnread++;
}
}
else
{
unsigned long long j = lowestUnread + 1;
bool mustFlip = true;
while ( j <= bookCount )
{
if ( j != sequence1[ i ] && j != sequence2[ i ] && !booksRead[ j - 1 ] )
{
sequence3[ i ] = j;
booksRead[ j - 1 ] = true;
if ( j == lowestUnread )
{
while ( booksRead[ lowestUnread - 1 ] )
{
lowestUnread++;
}
}
mustFlip = false;
break;
}
j++;
}
if ( mustFlip )
{
for ( unsigned long long k = 0; k < bookCount; ++k )
{
if ( lowestUnread != sequence1[ k ] && lowestUnread != sequence2[ k ] &&
sequence3[ k ] != sequence1[ i ] && sequence3[ k ] != sequence2[ i ] )
{
sequence3[ i ] = sequence3[ k ];
sequence3[ k ] = lowestUnread;
booksRead[ lowestUnread - 1 ] = true;
break;
}
}
}
}
}
for ( unsigned long long i = 0; i < bookCount; ++i )
{
if ( sequence3[ i ] == sequence1[ i ] || sequence3[ i ] == sequence2[ i ] )
{
for ( unsigned long long j = 0; j < bookCount; ++j )
{
if ( j != i && sequence3[ i ] != sequence1[ j ] && sequence3[ i ] != sequence2[ j ] &&
sequence3[ j ] != sequence1[ i ] && sequence3[ j ] != sequence2[ i ] )
{
unsigned long long temp = sequence3[ i ];
sequence3[ i ] = sequence3[ j ];
sequence3[ j ] = temp;
break;
}
}
}
}
for ( unsigned long long i = 0; i < bookCount; ++i )
{
std::cout << sequence3[ i ] << " ";
}
delete[] sequence1;
delete[] sequence2;
delete[] sequence3;
delete[] booksRead;
return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
BBBAABBBAAAABBAAAABAABAABBBBBB...

correct output
2554

user output
(empty)

Test 2

Group: 1

Verdict:

input
GDFVYWQCZAFGICSXOSWBZMGPDBSSVL...

correct output
299

user output
(empty)

Test 3

Group: 1

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAZAAAA...

correct output
4314

user output
(empty)

Test 4

Group: 1

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4231

user output
(empty)

Test 5

Group: 1

Verdict:

input
QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
5050

user output
(empty)

Test 6

Group: 2

Verdict:

input
BBABABBBABBAABBABBABAABAAABABA...

correct output
6253029

user output
(empty)

Test 7

Group: 2

Verdict:

input
RBKJMLDVQMKHYKCNDIVVKOMFUXTFMG...

correct output
485173

user output
(empty)

Test 8

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
12427725

user output
(empty)

Test 9

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
12467549

user output
(empty)

Test 10

Group: 2

Verdict:

input
QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
12502500

user output
(empty)

Test 11

Group: 3

Verdict:

input
BAAAAABABBABAABAABABABBBABBAAB...

correct output
2500051369

user output
(empty)

Test 12

Group: 3

Verdict:

input
ABBURXDRVXAYBPXXOQZNYHLWGUEEWR...

correct output
192407124

user output
(empty)

Test 13

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4998050400

user output
(empty)

Test 14

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
4998850144

user output
(empty)

Test 15

Group: 3

Verdict:

input
QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ...

correct output
5000050000

user output
(empty)