CF378B.Semifinals

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Two semifinals have just been in the running tournament. Each semifinal had nn participants. There are nn participants advancing to the finals, they are chosen as follows: from each semifinal, we choose kk people ( 0<=2k<=n0<=2k<=n ) who showed the best result in their semifinals and all other places in the finals go to the people who haven't ranked in the top kk in their semifinal but got to the n2kn-2k of the best among the others.

The tournament organizers hasn't yet determined the kk value, so the participants want to know who else has any chance to get to the finals and who can go home.

输入格式

The first line contains a single integer nn ( 1<=n<=1051<=n<=10^{5} ) — the number of participants in each semifinal.

Each of the next nn lines contains two integers aia_{i} and bib_{i} ( 1<=ai,bi<=1091<=a_{i},b_{i}<=10^{9} ) — the results of the ii -th participant (the number of milliseconds he needs to cover the semifinals distance) of the first and second semifinals, correspondingly. All results are distinct. Sequences a1a_{1} , a2a_{2} , ..., ana_{n} and b1b_{1} , b2b_{2} , ..., bnb_{n} are sorted in ascending order, i.e. in the order the participants finished in the corresponding semifinal.

输出格式

Print two strings consisting of nn characters, each equals either "0" or "1". The first line should correspond to the participants of the first semifinal, the second line should correspond to the participants of the second semifinal. The ii -th character in the jj -th line should equal "1" if the ii -th participant of the jj -th semifinal has any chances to advance to the finals, otherwise it should equal a "0".

输入输出样例

  • 输入#1

    4
    9840 9920
    9860 9980
    9930 10020
    10040 10090
    

    输出#1

    1110
    1100
    
  • 输入#2

    4
    9900 9850
    9940 9930
    10000 10020
    10060 10110
    

    输出#2

    1100
    1100
    

说明/提示

Consider the first sample. Each semifinal has 4 participants. The results of the first semifinal are 9840, 9860, 9930, 10040. The results of the second semifinal are 9920, 9980, 10020, 10090.

  • If k=0k=0 , the finalists are determined by the time only, so players 9840, 9860, 9920 and 9930 advance to the finals.
  • If k=1k=1 , the winners from both semifinals move to the finals (with results 9840 and 9920), and the other places are determined by the time (these places go to the sportsmen who run the distance in 9860 and 9930 milliseconds).
  • If k=2k=2 , then first and second places advance from each seminfial, these are participants with results 9840, 9860, 9920 and 9980 milliseconds.
首页