National Olympiad in Informatics, China, 1999

Day 1, Problem 1 - 01 Sequence

Given 7 positive integers N, A₀, B₀, L₀, A₁, B₁, L₁, determine a 01 sequence S = s₁ s₂ … s_i … s_N, such that:

1. s_i = 0 or s_i = 1 for 1 ≤ i ≤ N;
2. For any of S's length L₀ consecutive subsequence s_j s_j+1 … s_j+L0-1, the number of 0's must be between A₀ and B₀, inclusive.
3. For any of S's length L₁ consecutive subsequence s_j s_j+1 … s_j+L1-1, the number of 1's must be between A₁ and B₁, inclusive.

For example, if N = 6, A₀ = 1, B₀ = 2, L₀ = 3, A₁ = 1, B₁ = 1, L₁ = 2, then a sequence that satisfies the above conditions is S = 010101.

Input Format

The input will consist of one line with 7 space-separated positive integers, the values N, A₀, B₀, L₀, A₁, B₁, L₁ (3 ≤ N ≤ 1000, 1 ≤ A₀ ≤ B₀ ≤ L₀ ≤ N, 1 ≤ A₁ ≤ B₁ ≤ L₁ ≤ N).

Output Format

The output should consist of one line. If there does not exist a 01 sequence satisfying the above conditions, the output the integer -1. Otherwise, output any 01 sequence that satisfies the conditions.

Sample Input

6 1 2 3 1 1 2

Sample Output

010101

All Submissions
Best Solutions

Point Value: 20 (partial)
Time Limit: 1.00s
Memory Limit: 16M
Added: May 04, 2014

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)