oj.uz

답안 #44035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44035 2018-03-29T12:02:40 Z wxh010910 Security Gate (JOI18_security_gate) C++17
100 / 100
 2065 ms 888392 KB 
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define Debug(...) fprintf(stderr, __VA_ARGS__)

typedef long long LL;
typedef long double LD;
typedef unsigned int uint;
typedef pair <int, int> pii;
typedef unsigned long long uLL;

template <typename T> inline void Read(T &x) {
  char c = getchar();
  bool f = false;
  for (x = 0; !isdigit(c); c = getchar()) {
    if (c == '-') {
      f = true;
    }
  }
  for (; isdigit(c); c = getchar()) {
    x = x * 10 + c - '0';
  }
  if (f) {
    x = -x;
  }
}

template <typename T> inline bool CheckMax(T &a, const T &b) {
  return a < b ? a = b, true : false;
}

template <typename T> inline bool CheckMin(T &a, const T &b) {
  return a > b ? a = b, true : false;
}

const int N = 305;
const int mod = 1e9 + 7;

int n, ans, a[N];
char s[N];

namespace CaseA {
  int f[N][N];

  int Main() {
    f[0][0] = 1;
    for (int i = 0; i < n; ++i) {
      if (a[i] >= 0) {
        for (int j = 0; j <= i; ++j) {
          f[i + 1][j + 1] = (f[i + 1][j + 1] + f[i][j]) % mod;
        }
      }
      if (a[i] <= 0) {
        for (int j = 1; j <= i; ++j) {
          f[i + 1][j - 1] = (f[i + 1][j - 1] + f[i][j]) % mod;
        }
      }
    }
    ans = (ans + f[n][0]) % mod;
    return 0;
  }
}

namespace CaseB {
  int h[N][N], f[N][N][N][2], g[N][N][N][2];

  inline void Init() {
    memset(f, 0, sizeof f);
    memset(g, 0, sizeof g);
    memset(h, 0, sizeof h);
    for (int x = 0; x < n >> 1; ++x) {
      f[x][0][0][!x] = 1;
      for (int i = 0; i < n; ++i) {
        if (a[i] >= 0) {
          for (int j = 0; j < x; ++j) {
            f[x][i + 1][j + 1][j + 1 == x] = (f[x][i + 1][j + 1][j + 1 == x] + f[x][i][j][0]) % mod;
            f[x][i + 1][j + 1][1] = (f[x][i + 1][j + 1][1] + f[x][i][j][1]) % mod;
          }
        }
        if (a[i] <= 0) {
          for (int j = 0; j < x; ++j) {
            f[x][i + 1][j][0] = (f[x][i + 1][j][0] + f[x][i][j + 1][0]) % mod;
            f[x][i + 1][j][1] = (f[x][i + 1][j][1] + f[x][i][j + 1][1]) % mod;
          }
        }
      }
    }
    for (int x = 0; x < n; ++x) {
      g[x][n][0][!x] = 1;
      for (int i = n - 1; ~i; --i) {
        if (a[i] >= 0) {
          for (int j = 0; j < n; ++j) {
            g[x][i][j][0] = (g[x][i][j][0] + g[x][i + 1][j + 1][0]) % mod;
          }
          g[x][i][x][1] = (g[x][i][x][1] + g[x][i + 1][x + 1][0]) % mod;
          for (int j = x + 1; j < min(n, x << 1); ++j) {
            g[x][i][j][1] = (g[x][i][j][1] + g[x][i + 1][j + 1][1]) % mod;
          }
        }
        if (a[i] <= 0) {
          for (int j = 0; j < n; ++j) {
            g[x][i][j + 1][0] = (g[x][i][j + 1][0] + g[x][i + 1][j][0]) % mod;
          }
          if (x) {
            g[x][i][x][1] = (g[x][i][x][1] + g[x][i + 1][x - 1][0]) % mod;
          }
          for (int j = x; j <= min(n, x << 1); ++j) {
            g[x][i][j + 1][1] = (g[x][i][j + 1][1] + g[x][i + 1][j][1]) % mod;
          }
        }
      }
    }
    h[n][0] = 1;
    for (int i = n - 1; ~i; --i) {
      if (a[i] >= 0) {
        for (int j = 0; j < n; ++j) {
          h[i][j] = (h[i][j] + h[i + 1][j + 1]) % mod;
        }
      }
      if (a[i] <= 0) {
        for (int j = 0; j < n; ++j) {
          h[i][j + 1] = (h[i][j + 1] + h[i + 1][j]) % mod;
        }
      }
    }
  }

  inline void Solve(int x, int y) {
    for (int i = 0; i < n; i += 2) {
      if (a[i] <= 0) {
        if (x >= y) {
          ans = (1LL * f[x][i][0][1] * h[i + 1][(y << 1) - 1] + ans) % mod;
        } else {
          ans = (1LL * f[x][i][0][1] * g[x + y][i + 1][(y << 1) - 1][1] + ans) % mod;
        }
      }
    }
  }

  inline void Solve() {
    for (int i = 0; i <= n >> 1; ++i) {
      for (int j = 1; i + j <= n >> 1; ++j) {
        Solve(i, j);
      }
    }
  }

  int Main() {
    for (int t = 0; t < 2; ++t) {
      Init(), Solve();
      reverse(a, a + n);
      for (int i = 0; i < n; ++i) {
        a[i] = -a[i];
      }
    }
    return 0;
  }
}

namespace CaseC {
  int f[N >> 1][N][N][2], g[N >> 1][N][N << 1][3];

  inline void Init(int t) {
    memset(f, 0, sizeof f);
    memset(g, 0, sizeof g);
    for (int x = 0; x < n >> 1; ++x) {
      f[x][0][0][!x] = 1;
      for (int i = 0; i < n; ++i) {
        if (a[i] >= 0) {
          for (int j = 0; j < x; ++j) {
            f[x][i + 1][j + 1][j + 1 == x] = (f[x][i + 1][j + 1][j + 1 == x] + f[x][i][j][0]) % mod;
            f[x][i + 1][j + 1][1] = (f[x][i + 1][j + 1][1] + f[x][i][j][1]) % mod;
          }
        }
        if (a[i] <= 0) {
          for (int j = 0; j < x; ++j) {
            f[x][i + 1][j][0] = (f[x][i + 1][j][0] + f[x][i][j + 1][0]) % mod;
            f[x][i + 1][j][1] = (f[x][i + 1][j][1] + f[x][i][j + 1][1]) % mod;
          }
        }
      }
    }
    for (int x = 0; x < n >> 1; ++x) {
      g[x][n][n][!x && !t] = 1;
      for (int i = n - 1; ~i; --i) {
        if (a[i] >= 0) {
          for (int j = 1; j < n; ++j) {
            g[x][i][j - 1 + n][0] = (g[x][i][j - 1 + n][0] + g[x][i + 1][j + n][0]) % mod;
          }
          for (int j = 0; j < n; ++j) {
            g[x][i][j - 1 + n][1 + (!j)] = (g[x][i][j - 1 + n][1 + (!j)] + g[x][i + 1][j + n][1]) % mod;
          }
          for (int j = -n + 1; j <= x << 1; ++j) {
            g[x][i][j - 1 + n][2] = (g[x][i][j - 1 + n][2] + g[x][i + 1][j + n][2]) % mod;
          }
        }
        if (a[i] <= 0) {
          for (int j = 0; j < n; ++j) {
            g[x][i][j + 1 + n][j + 1 == x + t] = (g[x][i][j + 1 + n][j + 1 == x + t] + g[x][i + 1][j + n][0]) % mod;
          }
          for (int j = 0; j < n; ++j) {
            g[x][i][j + 1 + n][1] = (g[x][i][j + 1 + n][1] + g[x][i + 1][j + n][1]) % mod;
          }
          for (int j = -n; j < x << 1; ++j) {
            g[x][i][j + 1 + n][2] = (g[x][i][j + 1 + n][2] + g[x][i + 1][j + n][2]) % mod;
          }
        }
      }
    }
  }

  inline void Solve(int x, int y) {
    for (int i = 0; i < n; i += 2) {
      if (a[i] <= 0) {
        ans = (1LL * f[x][i][0][1] * g[x + y][i + 1][(y << 1) - 1 + n][2] + ans) % mod;
      }
    }
  }

  inline void Solve() {
    for (int i = -(n >> 1) + 1; i < (n >> 1); ++i) {
      for (int j = max(0, -i); j + abs(i) <= n >> 1; ++j) {
        Solve(j, i);
      }
    }
  }

  int Main() {
    for (int t = 0; t < 2; ++t) {
      Init(t), Solve();
      reverse(a, a + n);
      for (int i = 0; i < n; ++i) {
        a[i] = -a[i];
      }
    }
    return 0;
  }
}

int main() {
#ifdef wxh010910
  freopen("d.in", "r", stdin);
#endif
  Read(n), scanf("%s", s);
  if (n & 1) {
    puts("0");
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    if (s[i] == '(') {
      a[i] = 1;
    } else if (s[i] == ')') {
      a[i] = -1;
    } else {
      a[i] = 0;
    }
  }
  CaseA::Main();
  CaseB::Main();
  CaseC::Main();
  printf("%d\n", ans);
#ifdef wxh010910
  Debug("My Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif
  return 0;
}

Compilation message

securitygate.cpp: In function 'int main()':
securitygate.cpp:249:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   Read(n), scanf("%s", s);
   ~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 817 ms 887672 KB Output is correct
2 Correct 816 ms 888044 KB Output is correct
3 Correct 3 ms 888044 KB Output is correct
4 Correct 782 ms 888044 KB Output is correct
5 Correct 778 ms 888044 KB Output is correct
6 Correct 779 ms 888044 KB Output is correct
7 Correct 776 ms 888044 KB Output is correct
8 Correct 807 ms 888044 KB Output is correct
9 Correct 812 ms 888104 KB Output is correct
10 Correct 816 ms 888104 KB Output is correct
11 Correct 817 ms 888104 KB Output is correct
12 Correct 858 ms 888104 KB Output is correct
13 Correct 891 ms 888104 KB Output is correct
14 Correct 782 ms 888104 KB Output is correct
15 Correct 810 ms 888104 KB Output is correct
16 Correct 812 ms 888104 KB Output is correct
17 Correct 833 ms 888152 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 817 ms 887672 KB Output is correct
2 Correct 816 ms 888044 KB Output is correct
3 Correct 3 ms 888044 KB Output is correct
4 Correct 782 ms 888044 KB Output is correct
5 Correct 778 ms 888044 KB Output is correct
6 Correct 779 ms 888044 KB Output is correct
7 Correct 776 ms 888044 KB Output is correct
8 Correct 807 ms 888044 KB Output is correct
9 Correct 812 ms 888104 KB Output is correct
10 Correct 816 ms 888104 KB Output is correct
11 Correct 817 ms 888104 KB Output is correct
12 Correct 858 ms 888104 KB Output is correct
13 Correct 891 ms 888104 KB Output is correct
14 Correct 782 ms 888104 KB Output is correct
15 Correct 810 ms 888104 KB Output is correct
16 Correct 812 ms 888104 KB Output is correct
17 Correct 833 ms 888152 KB Output is correct
18 Correct 788 ms 888240 KB Output is correct
19 Correct 809 ms 888240 KB Output is correct
20 Correct 870 ms 888240 KB Output is correct
21 Correct 797 ms 888240 KB Output is correct
22 Correct 873 ms 888240 KB Output is correct
23 Correct 904 ms 888240 KB Output is correct
24 Correct 829 ms 888240 KB Output is correct
25 Correct 815 ms 888240 KB Output is correct
26 Correct 791 ms 888240 KB Output is correct
27 Correct 795 ms 888240 KB Output is correct
28 Correct 794 ms 888240 KB Output is correct
29 Correct 829 ms 888240 KB Output is correct
30 Correct 838 ms 888240 KB Output is correct
31 Correct 834 ms 888240 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 817 ms 887672 KB Output is correct
2 Correct 816 ms 888044 KB Output is correct
3 Correct 3 ms 888044 KB Output is correct
4 Correct 782 ms 888044 KB Output is correct
5 Correct 778 ms 888044 KB Output is correct
6 Correct 779 ms 888044 KB Output is correct
7 Correct 776 ms 888044 KB Output is correct
8 Correct 807 ms 888044 KB Output is correct
9 Correct 812 ms 888104 KB Output is correct
10 Correct 816 ms 888104 KB Output is correct
11 Correct 817 ms 888104 KB Output is correct
12 Correct 858 ms 888104 KB Output is correct
13 Correct 891 ms 888104 KB Output is correct
14 Correct 782 ms 888104 KB Output is correct
15 Correct 810 ms 888104 KB Output is correct
16 Correct 812 ms 888104 KB Output is correct
17 Correct 833 ms 888152 KB Output is correct
18 Correct 788 ms 888240 KB Output is correct
19 Correct 809 ms 888240 KB Output is correct
20 Correct 870 ms 888240 KB Output is correct
21 Correct 797 ms 888240 KB Output is correct
22 Correct 873 ms 888240 KB Output is correct
23 Correct 904 ms 888240 KB Output is correct
24 Correct 829 ms 888240 KB Output is correct
25 Correct 815 ms 888240 KB Output is correct
26 Correct 791 ms 888240 KB Output is correct
27 Correct 795 ms 888240 KB Output is correct
28 Correct 794 ms 888240 KB Output is correct
29 Correct 829 ms 888240 KB Output is correct
30 Correct 838 ms 888240 KB Output is correct
31 Correct 834 ms 888240 KB Output is correct
32 Correct 779 ms 888240 KB Output is correct
33 Correct 786 ms 888240 KB Output is correct
34 Correct 789 ms 888240 KB Output is correct
35 Correct 809 ms 888240 KB Output is correct
36 Correct 823 ms 888240 KB Output is correct
37 Correct 816 ms 888240 KB Output is correct
38 Correct 840 ms 888240 KB Output is correct
39 Correct 786 ms 888240 KB Output is correct
40 Correct 810 ms 888240 KB Output is correct
41 Correct 803 ms 888240 KB Output is correct
42 Correct 812 ms 888240 KB Output is correct
43 Correct 822 ms 888240 KB Output is correct
44 Correct 820 ms 888240 KB Output is correct
45 Correct 812 ms 888240 KB Output is correct

Subtask #4
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 817 ms 887672 KB Output is correct
2 Correct 816 ms 888044 KB Output is correct
3 Correct 3 ms 888044 KB Output is correct
4 Correct 782 ms 888044 KB Output is correct
5 Correct 778 ms 888044 KB Output is correct
6 Correct 779 ms 888044 KB Output is correct
7 Correct 776 ms 888044 KB Output is correct
8 Correct 807 ms 888044 KB Output is correct
9 Correct 812 ms 888104 KB Output is correct
10 Correct 816 ms 888104 KB Output is correct
11 Correct 817 ms 888104 KB Output is correct
12 Correct 858 ms 888104 KB Output is correct
13 Correct 891 ms 888104 KB Output is correct
14 Correct 782 ms 888104 KB Output is correct
15 Correct 810 ms 888104 KB Output is correct
16 Correct 812 ms 888104 KB Output is correct
17 Correct 833 ms 888152 KB Output is correct
18 Correct 788 ms 888240 KB Output is correct
19 Correct 809 ms 888240 KB Output is correct
20 Correct 870 ms 888240 KB Output is correct
21 Correct 797 ms 888240 KB Output is correct
22 Correct 873 ms 888240 KB Output is correct
23 Correct 904 ms 888240 KB Output is correct
24 Correct 829 ms 888240 KB Output is correct
25 Correct 815 ms 888240 KB Output is correct
26 Correct 791 ms 888240 KB Output is correct
27 Correct 795 ms 888240 KB Output is correct
28 Correct 794 ms 888240 KB Output is correct
29 Correct 829 ms 888240 KB Output is correct
30 Correct 838 ms 888240 KB Output is correct
31 Correct 834 ms 888240 KB Output is correct
32 Correct 779 ms 888240 KB Output is correct
33 Correct 786 ms 888240 KB Output is correct
34 Correct 789 ms 888240 KB Output is correct
35 Correct 809 ms 888240 KB Output is correct
36 Correct 823 ms 888240 KB Output is correct
37 Correct 816 ms 888240 KB Output is correct
38 Correct 840 ms 888240 KB Output is correct
39 Correct 786 ms 888240 KB Output is correct
40 Correct 810 ms 888240 KB Output is correct
41 Correct 803 ms 888240 KB Output is correct
42 Correct 812 ms 888240 KB Output is correct
43 Correct 822 ms 888240 KB Output is correct
44 Correct 820 ms 888240 KB Output is correct
45 Correct 812 ms 888240 KB Output is correct
46 Correct 804 ms 888240 KB Output is correct
47 Correct 816 ms 888240 KB Output is correct
48 Correct 2 ms 888240 KB Output is correct
49 Correct 816 ms 888240 KB Output is correct
50 Correct 860 ms 888240 KB Output is correct
51 Correct 811 ms 888240 KB Output is correct
52 Correct 815 ms 888240 KB Output is correct
53 Correct 833 ms 888240 KB Output is correct
54 Correct 827 ms 888240 KB Output is correct
55 Correct 835 ms 888240 KB Output is correct
56 Correct 786 ms 888240 KB Output is correct
57 Correct 804 ms 888240 KB Output is correct
58 Correct 796 ms 888240 KB Output is correct
59 Correct 803 ms 888240 KB Output is correct
60 Correct 824 ms 888240 KB Output is correct
61 Correct 816 ms 888240 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 817 ms 887672 KB Output is correct
2 Correct 816 ms 888044 KB Output is correct
3 Correct 3 ms 888044 KB Output is correct
4 Correct 782 ms 888044 KB Output is correct
5 Correct 778 ms 888044 KB Output is correct
6 Correct 779 ms 888044 KB Output is correct
7 Correct 776 ms 888044 KB Output is correct
8 Correct 807 ms 888044 KB Output is correct
9 Correct 812 ms 888104 KB Output is correct
10 Correct 816 ms 888104 KB Output is correct
11 Correct 817 ms 888104 KB Output is correct
12 Correct 858 ms 888104 KB Output is correct
13 Correct 891 ms 888104 KB Output is correct
14 Correct 782 ms 888104 KB Output is correct
15 Correct 810 ms 888104 KB Output is correct
16 Correct 812 ms 888104 KB Output is correct
17 Correct 833 ms 888152 KB Output is correct
18 Correct 788 ms 888240 KB Output is correct
19 Correct 809 ms 888240 KB Output is correct
20 Correct 870 ms 888240 KB Output is correct
21 Correct 797 ms 888240 KB Output is correct
22 Correct 873 ms 888240 KB Output is correct
23 Correct 904 ms 888240 KB Output is correct
24 Correct 829 ms 888240 KB Output is correct
25 Correct 815 ms 888240 KB Output is correct
26 Correct 791 ms 888240 KB Output is correct
27 Correct 795 ms 888240 KB Output is correct
28 Correct 794 ms 888240 KB Output is correct
29 Correct 829 ms 888240 KB Output is correct
30 Correct 838 ms 888240 KB Output is correct
31 Correct 834 ms 888240 KB Output is correct
32 Correct 779 ms 888240 KB Output is correct
33 Correct 786 ms 888240 KB Output is correct
34 Correct 789 ms 888240 KB Output is correct
35 Correct 809 ms 888240 KB Output is correct
36 Correct 823 ms 888240 KB Output is correct
37 Correct 816 ms 888240 KB Output is correct
38 Correct 840 ms 888240 KB Output is correct
39 Correct 786 ms 888240 KB Output is correct
40 Correct 810 ms 888240 KB Output is correct
41 Correct 803 ms 888240 KB Output is correct
42 Correct 812 ms 888240 KB Output is correct
43 Correct 822 ms 888240 KB Output is correct
44 Correct 820 ms 888240 KB Output is correct
45 Correct 812 ms 888240 KB Output is correct
46 Correct 804 ms 888240 KB Output is correct
47 Correct 816 ms 888240 KB Output is correct
48 Correct 2 ms 888240 KB Output is correct
49 Correct 816 ms 888240 KB Output is correct
50 Correct 860 ms 888240 KB Output is correct
51 Correct 811 ms 888240 KB Output is correct
52 Correct 815 ms 888240 KB Output is correct
53 Correct 833 ms 888240 KB Output is correct
54 Correct 827 ms 888240 KB Output is correct
55 Correct 835 ms 888240 KB Output is correct
56 Correct 786 ms 888240 KB Output is correct
57 Correct 804 ms 888240 KB Output is correct
58 Correct 796 ms 888240 KB Output is correct
59 Correct 803 ms 888240 KB Output is correct
60 Correct 824 ms 888240 KB Output is correct
61 Correct 816 ms 888240 KB Output is correct
62 Correct 1347 ms 888252 KB Output is correct
63 Correct 1206 ms 888384 KB Output is correct
64 Correct 990 ms 888384 KB Output is correct
65 Correct 948 ms 888384 KB Output is correct
66 Correct 1926 ms 888384 KB Output is correct
67 Correct 1680 ms 888384 KB Output is correct
68 Correct 2065 ms 888384 KB Output is correct
69 Correct 939 ms 888384 KB Output is correct
70 Correct 997 ms 888384 KB Output is correct
71 Correct 862 ms 888384 KB Output is correct
72 Correct 913 ms 888384 KB Output is correct
73 Correct 1928 ms 888392 KB Output is correct
74 Correct 1577 ms 888392 KB Output is correct