Problem p02591 (C++) — buggy submission, verdict: Time Limit Exceeded

// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long
// long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm
// volatile("mov %%rsp, %%rbx\\nmov %%rax,
// %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax,
// %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const long long mod = 1000000007;
const long long inf = mod * mod;
const long long d2 = (mod + 1) / 2;
const double EPS = 1e-11;
const double INF = 1e+10;
const double PI = acos(-1.0);
const int C_SIZE = 11100000;
const int UF_SIZE = 3100000;
namespace {
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
inline long long Comb(int a, int b) {
  if (a < b || b < 0)
    return 0;
  return fact[a] * finv[b] % mod * finv[a - b] % mod;
}
void init_C(int n) {
  fact[0] = finv[0] = inv[1] = 1;
  for (int i = 2; i < n; i++) {
    inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
  }
  for (int i = 1; i < n; i++) {
    fact[i] = fact[i - 1] * i % mod;
    finv[i] = finv[i - 1] * inv[i] % mod;
  }
}
long long pw(long long a, long long b) {
  if (a < 0LL)
    return 0;
  if (b < 0LL)
    return 0;
  long long ret = 1;
  while (b) {
    if (b % 2)
      ret = ret * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return ret;
}
long long pw_mod(long long a, long long b, long long M) {
  if (a < 0LL)
    return 0;
  if (b < 0LL)
    return 0;
  long long ret = 1;
  while (b) {
    if (b % 2)
      ret = ret * a % M;
    a = a * a % M;
    b /= 2;
  }
  return ret;
}
int pw_mod_int(int a, int b, int M) {
  if (a < 0)
    return 0;
  if (b < 0)
    return 0;
  int ret = 1;
  while (b) {
    if (b % 2)
      ret = (long long)ret * a % M;
    a = (long long)a * a % M;
    b /= 2;
  }
  return ret;
}
int ABS(int a) { return max(a, -a); }
long long ABS(long long a) { return max(a, -a); }
double ABS(double a) { return max(a, -a); }
int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
int UF[UF_SIZE];
void init_UF(int n) {
  for (int i = 0; i < n; i++)
    UF[i] = -1;
}
int FIND(int a) {
  if (UF[a] < 0)
    return a;
  return UF[a] = FIND(UF[a]);
}
void UNION(int a, int b) {
  a = FIND(a);
  b = FIND(b);
  if (a == b)
    return;
  if (UF[a] > UF[b])
    swap(a, b);
  UF[a] += UF[b];
  UF[b] = a;
}
} // namespace
// ここから編集しろ
int p[1100000];
map<pair<int, int>, long long> M;
vector<int> del[20];
long long tab[20][1 << 18];
int main() {
  int a;
  scanf("%d", &a);
  int L = 1 << (a - 1);
  for (int i = 0; i < (1 << (a - 1)); i++) {
    scanf("%d", p + i);
    p[i]--;
  }
  long long ret = 0;
  for (int i = 0; i < L; i++) {
    for (int j = 0; j < a; j++) {
      for (int k = 0; k < del[j].size(); k++) {
        tab[j][del[j][k]] = 0;
      }
      del[j].clear();
      if (i & (1 << j))
        break;
    }
    vector<pair<pair<int, int>, long long>> v1;
    vector<pair<pair<int, int>, long long>> v2;

    long long cur1 = 1;
    for (int j = 0; j < a; j++) {
      int A = (L + i) >> j;
      long long cur2 = 1;
      for (int k = 0; k < a; k++) {
        int B = (L + p[i]) >> k;
        long long V1 = cur1;
        long long V2 = cur2;

        v1.push_back(make_pair(make_pair(j, B), V1 * V2 % mod));
        V1 = (V1 * A) % mod;
        V1 = (V1 + mod - V1 * (A / 2) % mod * A % mod) % mod;
        V2 = (V2 * B) % mod;
        V2 = (V2 + mod - V2 * (B / 2) % mod * B % mod) % mod;
        v2.push_back(make_pair(make_pair(j, B), V1 * V2 % mod));
        cur2 = cur2 * B % mod;
      }
      cur1 = cur1 * A % mod;
    }

    for (int j = 0; j < v1.size(); j++) {
      ret +=
          tab[v1[j].first.first][v1[j].first.second] % mod * v1[j].second % mod;
    }
    for (int j = 0; j < v2.size(); j++) {
      tab[v2[j].first.first][v2[j].first.second] += v2[j].second;
      del[v2[j].first.first].push_back(v2[j].first.second);
    }
  }
  ret %= mod;
  printf("%lld\\n", ret);
}

Error: TLE

Fixed submission:

// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long
// long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm
// volatile("mov %%rsp, %%rbx\\nmov %%rax,
// %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax,
// %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <deque>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const long long mod = 1000000007;
const long long inf = mod * mod;
const long long d2 = (mod + 1) / 2;
const double EPS = 1e-11;
const double INF = 1e+10;
const double PI = acos(-1.0);
const int C_SIZE = 11100000;
const int UF_SIZE = 3100000;
namespace {
long long fact[C_SIZE];
long long finv[C_SIZE];
long long inv[C_SIZE];
inline long long Comb(int a, int b) {
  if (a < b || b < 0)
    return 0;
  return fact[a] * finv[b] % mod * finv[a - b] % mod;
}
void init_C(int n) {
  fact[0] = finv[0] = inv[1] = 1;
  for (int i = 2; i < n; i++) {
    inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
  }
  for (int i = 1; i < n; i++) {
    fact[i] = fact[i - 1] * i % mod;
    finv[i] = finv[i - 1] * inv[i] % mod;
  }
}
long long pw(long long a, long long b) {
  if (a < 0LL)
    return 0;
  if (b < 0LL)
    return 0;
  long long ret = 1;
  while (b) {
    if (b % 2)
      ret = ret * a % mod;
    a = a * a % mod;
    b /= 2;
  }
  return ret;
}
long long pw_mod(long long a, long long b, long long M) {
  if (a < 0LL)
    return 0;
  if (b < 0LL)
    return 0;
  long long ret = 1;
  while (b) {
    if (b % 2)
      ret = ret * a % M;
    a = a * a % M;
    b /= 2;
  }
  return ret;
}
int pw_mod_int(int a, int b, int M) {
  if (a < 0)
    return 0;
  if (b < 0)
    return 0;
  int ret = 1;
  while (b) {
    if (b % 2)
      ret = (long long)ret * a % M;
    a = (long long)a * a % M;
    b /= 2;
  }
  return ret;
}
int ABS(int a) { return max(a, -a); }
long long ABS(long long a) { return max(a, -a); }
double ABS(double a) { return max(a, -a); }
int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
int UF[UF_SIZE];
void init_UF(int n) {
  for (int i = 0; i < n; i++)
    UF[i] = -1;
}
int FIND(int a) {
  if (UF[a] < 0)
    return a;
  return UF[a] = FIND(UF[a]);
}
void UNION(int a, int b) {
  a = FIND(a);
  b = FIND(b);
  if (a == b)
    return;
  if (UF[a] > UF[b])
    swap(a, b);
  UF[a] += UF[b];
  UF[b] = a;
}
} // namespace
// ここから編集しろ
int p[1100000];
map<pair<int, int>, long long> M;
int main() {
  int a;
  scanf("%d", &a);
  int L = 1 << (a - 1);
  for (int i = 0; i < (1 << (a - 1)); i++) {
    scanf("%d", p + i);
    p[i]--;
  }
  long long ret = 0;
  for (int i = 0; i < L; i++) {
    vector<pair<pair<int, int>, long long>> v1;
    vector<pair<pair<int, int>, long long>> v2;

    long long cur1 = 1;
    for (int j = 0; j < a; j++) {
      int A = (L + i) >> j;
      long long cur2 = 1;
      for (int k = 0; k < a; k++) {
        int B = (L + p[i]) >> k;
        long long V1 = cur1;
        long long V2 = cur2;

        v1.push_back(make_pair(make_pair(A, B), V1 * V2 % mod));
        V1 = (V1 * A) % mod;
        V1 = (V1 + mod - V1 * (A / 2) % mod * A % mod) % mod;
        V2 = (V2 * B) % mod;
        V2 = (V2 + mod - V2 * (B / 2) % mod * B % mod) % mod;
        v2.push_back(make_pair(make_pair(A, B), V1 * V2 % mod));
        cur2 = cur2 * B % mod;
      }
      cur1 = cur1 * A % mod;
    }

    for (int j = 0; j < v1.size(); j++) {
      ret += M[v1[j].first] % mod * v1[j].second % mod;
    }
    for (int j = 0; j < v2.size(); j++) {
      M[v2[j].first] += v2[j].second;
    }
  }
  ret %= mod;
  printf("%lld\\n", ret);
}