Problem_Solving/Team.java at master · mohamedelkony/Problem_Solving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
import java.util.*;
import static java.lang.System.out;

public class Team {
    private static Scanner in;
    private final static boolean muiltTestCases = false;
    private static int[][][] mem = new int[1001][2][2];

    static void solve() {
        int zeros = in.nextInt();
        int ones = in.nextInt();
        /**
        if (zeros > ones + 1 || ones > zeros * 2 + 2) {
            out.println(-1);
            return;
        }
        */
        var s=new StringBuilder();
        int aones = 2, azeros = 1;
        while (ones >0 ||zeros>0) {
            if(ones==zeros)
            {
                if(aones>0)
                {
                    for(;ones>0;ones--)
                        s.append("10");
                    break;
                }
                if(azeros>0){
                    for(;ones>0;ones--)
                        s.append("01");
                    break;
                }
            }

            if (ones > zeros) {
                if (aones > 0&&ones>0) {
                    s.append(1);
                    ones--;
                    aones--;
                    azeros = 1;
                } else if (azeros > 0&&zeros>0) {
                    s.append(0);
                    zeros--;
                    azeros--;
                    aones = 2;
                }
                else
                {
                    out.println(-1);return;
                }
            }

            if (zeros > ones) {
                 if (azeros > 0&&zeros>0) {
                    s.append(0);
                    zeros--;
                    azeros--;
                    aones = 2;
                }
                else if (aones > 0&&ones>0) {
                    s.append(1);
                    ones--;
                    aones--;
                    azeros = 1;
                }
                else
                {
                    out.println(-1);return;
                }
            }
        }
        out.println(s);
    }

    public static void main(String[] str) {
        in = new Scanner(System.in);
        int n = 1;
        if (muiltTestCases)
            n = in.nextInt();
        while (n-- > 0)
            solve();
        in.close();
    }

    /**
     * reenterant | thread safe O(log(sqrt(n))
     **/
    @SuppressWarnings("unused")
    private static TreeSet<Integer> getDivisors(int n) {
        var st = new TreeSet<Integer>();
        for (int i = 1; i * i <= n; i++) {
            if (n % i == 0)
                st.add(i);
            if (n % (n / i) == 0)
                st.add(n / i);
        }
        return st;
    }

    // O(n(log(log(N)))
    @SuppressWarnings("unused")
    private static ArrayList<Integer> primesTill_N(int n) {
        var ans = new ArrayList<Integer>();
        var prime = new ArrayList<Integer>(n + 1);
        for (int i = 0; i < n + 1; i++)
            prime.add(1);

        for (int p = 2; p * p <= n; p++) {
            if (prime.get(p) == 1) {
                for (int i = p * p; i <= n; i += p)
                    prime.set(i, 0);
            }
        }

        for (int p = 2; p <= n; p++)
            if (prime.get(p) == 1)
                ans.add(p);
        return ans;
    }

    // O(sqrt(N))
    @SuppressWarnings("unused")
    private static TreeMap<Integer, Integer> getPrimeFactors(int n) {
        var ans = new TreeMap<Integer, Integer>();
        var primes = primesTill_N((int) (Math.sqrt(n) + 1));
        for (int p : primes) {
            while (n % p == 0) {
                ans.putIfAbsent(p, 0);
                ans.put(p, ans.get(p) + 1);
                n /= p;
            }
        }
        if (n > 2) {
            ans.putIfAbsent(n, 0);
            ans.put(n, ans.get(n) + 1);
        }
        return ans;
    }
}