Binary tree

input/code.cpp: In function 'int main()':
input/code.cpp:70:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld%d", &n, &m);
    ~~~~~^~~~~~~~~~~~~~~~~~
input/code.cpp:73:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%lld", &a);
       ~~~~~^~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;

const long long INF = numeric_limits<long long>::max();
const long long MOD = 1e9 + 7;
const int MAXN = 60;

long long n;
vector<long long> forbidden, has_forbidden;

void add(long long a) {
   forbidden.push_back(a);
   for(; a > 1; a >>= 1LL) {
      has_forbidden.push_back(a);
   }
}

void make_set(vector<long long>& vec) {
   sort(vec.begin(), vec.end());
   vec.erase(unique(vec.begin(), vec.end()), vec.end());
}

bool has(const vector<long long>& vec, long long a) {
   return binary_search(vec.cbegin(), vec.cend(), a);
}

long long pw[MAXN + 10];

long long calc(long long S) {
   long long res = 0;

   queue<long long> q; q.push(S);
   auto it = forbidden.begin();
   auto jt = has_forbidden.begin();
   long long level = 1;

   while(!q.empty()) {
      long long u = q.front(); q.pop();

      while((1LL << level) <= u) level++;

      while(*it < u) {
         ++it;
      }
      while(*jt < u) {
         ++jt;
      }
      if(*it == u) { // u is forbidden node
         // ignore this node
      } else if(*jt != u) { // u doesn't have forbidden nodes in subtree
         res = (res + pw[n - level]) % MOD;
      } else {
         q.push(u << 1LL);
         q.push((u << 1LL) | 1LL);
      }
   }
   return res;
}

void init() {
   pw[0] = 1;
   for(int p = 1; p <= MAXN; p++) {
      pw[p] = pw[p-1] * 2LL % MOD;
   }
}

int main() {
   init();
   int m;
   scanf("%lld%d", &n, &m);
   for(int i = 0; i < m; i++) {
      long long a;
      scanf("%lld", &a);
      add(a);
   }
   forbidden.push_back(INF);
   has_forbidden.push_back(INF);
   make_set(forbidden);
   make_set(has_forbidden);

   long long res = calc(2) * 1LL * calc(3) % MOD;
   res = res*2 % MOD;
   printf("%lld\n", res);
}

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: ACCEPTED

Test 56

Group: 3

Verdict: ACCEPTED

Test 57

Group: 3

Verdict: ACCEPTED

Test 58

Group: 3

Verdict: ACCEPTED

Test 59

Group: 3

Verdict: ACCEPTED

Test 60

Group: 3

Verdict: ACCEPTED

Test 61

Group: 3

Verdict: ACCEPTED

Test 62

Group: 3

Verdict: ACCEPTED

Test 63

Group: 3

Verdict: ACCEPTED

Test 64

Group: 3

Verdict: ACCEPTED

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