Binary tree

input/code.cpp: In function 'int is_prime(int)':
input/code.cpp:50:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))
                   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

/****Author: Barish Namazov****/
#include <bits/stdc++.h>

using namespace std;

/***TEMPLATE***/
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

#define F first
#define S second
#define pb push_back

#define endl '\n'

const int max4 = 10004;
const int maxx = 100005;
const int max6 = 1000006;
const int lg5 = 17;

const int INF = 2 * 1000000007;
const long long INFLL = 4LL * 1000000000 * 1000000000;

/***************/

int powmod (int a, int b, int mod) {
    int res = 1; a %= mod;
    for (; b; b >>= 1) {
        if (b & 1) {
            res = 1LL * res * a % mod;
        }
        a = 1LL * a * a % mod;
    }
    return res;
}

int gcd (int a, int b) {
    while (b > 0) {
        int t = a % b;
        a = b, b = t;
    }
    return a;
}

int lcm (int a, int b) {
    return (a / gcd (a, b)) * b;
}

int is_prime (int n) {
    if (n <= 1 || n > 3 && (n % 2 == 0 || n % 3 == 0))
        return 0;
    for (int i = 5, t = 2; i * i <= n; i += t, t = 6 - t)
        if (n % i == 0)
            return 0;
    return 1;
}

/******Don't forget to use long long when needed!!******/

const int MOD = 1e9 + 7;

string conv(long long x) {
    string s = "";
    while (x > 0) {
        s += char(x % 2 + 48);
        x /= 2;
    }
    reverse(all(s));
    return s;
}

bool cmp(string a, string b) {
    return a.size() < b.size();
}

string arr[maxx];
int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base :: sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int n, m;
    cin >> n >> m;
    int res = powmod(2, n + n - 3, MOD);
    unordered_map <string, int> mp;
    for (int i = 1; i <= m; i++) {
        long long x; cin >> x;
        arr[i] = conv(x);
    }
    sort(arr + 1, arr + m + 1, cmp);
    vector <string> need;
    for (int i = 1; i <= m; i++) {
        string tmp = ""; int ok = 1;
        for (char j : arr[i]) {
            tmp += j;
            if (mp.count(tmp)) {
                ok = 0; break;
            }
        }
        if (ok == 1) {
            need.pb(arr[i]);
            mp[arr[i]] = 1;
        }
    }
    int lf = powmod(2, n - 2, MOD), rg = lf;
    for (string s : need) {
        int bad = powmod(2, n - s.size(), MOD);
        if (s[1] == '0') {
            lf = (lf - bad + MOD) % MOD;
        } else {
            rg = (rg - bad + MOD) % MOD;
        }
    }
    res = 1LL * lf * rg % MOD; res = 2LL * res % MOD;
    cout << res << endl;/*
    for (string s : need) {
        int bad = powmod(2, n - s.size(), MOD);
        if (s[1] == '0') {
            res = (res - 1LL * rg * bad + MOD) % MOD;
        } else {
            res = (res - 1LL * lf * bad + MOD) % MOD;
        }
    }
    cout << lf << " " << rg << endl;
    cout << res << endl;*/
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: ACCEPTED

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 1

Verdict: ACCEPTED

Test 22

Group: 1

Verdict: ACCEPTED

Test 23

Group: 1

Verdict: ACCEPTED

Test 24

Group: 1

Verdict: ACCEPTED

Test 25

Group: 1

Verdict: ACCEPTED

Test 26

Group: 1

Verdict: ACCEPTED

Test 27

Group: 1

Verdict: ACCEPTED

Test 28

Group: 1

Verdict: ACCEPTED

Test 29

Group: 1

Verdict: ACCEPTED

Test 30

Group: 1

Verdict: ACCEPTED

Test 31

Group: 1

Verdict: ACCEPTED

Test 32

Group: 1

Verdict: ACCEPTED

Test 33

Group: 1

Verdict: ACCEPTED

Test 34

Group: 1

Verdict: ACCEPTED

Test 35

Group: 1

Verdict: ACCEPTED

Test 36

Group: 2

Verdict: ACCEPTED

Test 37

Group: 2

Verdict: ACCEPTED

Test 38

Group: 2

Verdict: ACCEPTED

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 2

Verdict: ACCEPTED

Test 42

Group: 2

Verdict: ACCEPTED

Test 43

Group: 2

Verdict: ACCEPTED

Test 44

Group: 2

Verdict: ACCEPTED

Test 45

Group: 2

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED

Test 55

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 57

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 58

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 59

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 60

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 61

Group: 3

Verdict: ACCEPTED

Test 62

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 63

Group: 3

Verdict: ACCEPTED

Test 64

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 65

Group: 3

Verdict: ACCEPTED

Test 66

Group: 3

Verdict: ACCEPTED

Test 67

Group: 3

Verdict: ACCEPTED

Test 68

Group: 3

Verdict: ACCEPTED

Test 69

Group: 3

Verdict: ACCEPTED

Test 70

Group: 3

Verdict: ACCEPTED

Test 71

Group: 3

Verdict: ACCEPTED

Test 72

Group: 3

Verdict: ACCEPTED

Test 73

Group: 3

Verdict: ACCEPTED

Test 74

Group: 3

Verdict: ACCEPTED

Test 75

Group: 3

Verdict: ACCEPTED

Test 76

Group: 3

Verdict: ACCEPTED

Test 77

Group: 3

Verdict: ACCEPTED