codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1137B.md (2481B)


      1 Source: https://codeforces.com/problemset/problem/1137/B
      2 
      3 B. Camp Schedule
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 512 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a schedule $s$, which can be represented as a binary string, in which the $i$-th symbol is '1' if students will write the contest in the $i$-th day and '0' if they will have a day off.
     22 
     23 At the last moment Gleb said that the camp will be the most productive if it runs with the schedule $t$ (which can be described in the same format as schedule $s$). Since the number of days in the current may be different from number of days in schedule $t$, Gleb required that the camp's schedule must be altered so that the number of occurrences of $t$ in it as a substring is maximum possible. At the same time, the number of contest days and days off shouldn't change, only their order may change.
     24 
     25 Could you rearrange the schedule in the best possible way?
     26 
     27 Input
     28 
     29 The first line contains string $s$ ($1 \leqslant |s| \leqslant 500\,000$), denoting the current project of the camp's schedule.
     30 
     31 The second line contains string $t$ ($1 \leqslant |t| \leqslant 500\,000$), denoting the optimal schedule according to Gleb.
     32 
     33 Strings $s$ and $t$ contain characters '0' and '1' only.
     34 
     35 Output
     36 
     37 In the only line print the schedule having the largest number of substrings equal to $t$. Printed schedule should consist of characters '0' and '1' only and the number of zeros should be equal to the number of zeros in $s$ and the number of ones should be equal to the number of ones in $s$.
     38 
     39 In case there multiple optimal schedules, print any of them.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 101101
     47 110
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 110110
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 10010110
     60 100011
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 01100011
     67 ```
     68 
     69 Input
     70 
     71 ```
     72 10
     73 11100
     74 ```
     75 
     76 Output
     77 
     78 ```
     79 01
     80 ```
     81 
     82 Note
     83 
     84 In the first example there are two occurrences, one starting from first position and one starting from fourth position.
     85 
     86 In the second example there is only one occurrence, which starts from third position. Note, that the answer is not unique. For example, if we move the first day (which is a day off) to the last position, the number of occurrences of $t$ wouldn't change.
     87 
     88 In the third example it's impossible to make even a single occurrence.