problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03013 | Python | Time Limit Exceeded | div = 1000000007
n, m = map(int, input().split())
a = [int(input()) for i in range(m)]
f = [0] * (n + 1)
f[0] = 1
if 1 not in a:
f[1] = 1
for i in range(2, n + 1):
if i in a:
continue
f[i] = (f[i - 1] + f[i - 2]) % div
print(f[-1])
| div = 1000000007
n, m, *b = map(int, open(0).read().split())
a = set(b)
f = [0] * (n + 1)
f[0] = 1
if 1 not in a:
f[1] = 1
for i in range(2, n + 1):
if i in a:
continue
f[i] = (f[i - 1] + f[i - 2]) % div
print(f[-1])
| replace | 2 | 4 | 2 | 4 | TLE | |
p03013 | Python | Runtime Error | def Fib(n, memo={}):
if n < 2:
return 1
elif n in memo:
return memo[n]
else:
memo[n] = Fib(n - 1, memo) + Fib(n - 2, memo)
return memo[n]
def resolve():
N, M = [int(i) for i in input().split()]
aa = []
for _ in range(M):
aa.append(int(input()))
fib_l = list(Fib(i) for i in range(N))
ans = 1
now = 0
for a in aa:
if now == a:
ans = 0
break
tmp = a - now - 1
ans = ans * fib_l[tmp]
now = a + 1
else:
ans = ans * fib_l[N - now]
print(ans % (10**9 + 7))
resolve()
| def Fib(n, memo={}):
if n < 2:
return 1
elif n in memo:
return memo[n]
else:
memo[n] = Fib(n - 1, memo) + Fib(n - 2, memo)
return memo[n]
def resolve():
N, M = [int(i) for i in input().split()]
aa = []
for _ in range(M):
aa.append(int(input()))
fib_l = list(Fib(i) for i in range(N + 1))
ans = 1
now = 0
for a in aa:
if now == a:
ans = 0
break
tmp = a - now - 1
ans = ans * fib_l[tmp]
now = a + 1
else:
ans = ans * fib_l[N - now]
print(ans % (10**9 + 7))
resolve()
| replace | 15 | 16 | 15 | 16 | 0 | |
p03013 | Python | Time Limit Exceeded | N, M = map(int, input().split())
a = [int(input()) for i in range(M)]
MOD = 10**9 + 7
dp = [1]
if 1 in a:
dp.append(0)
else:
dp.append(1)
for ith_stair in range(2, N + 1):
if ith_stair in a:
dp.append(0)
else:
dp.append((dp[ith_stair - 1] + dp[ith_stair - 2]) % MOD)
print(dp[N] % MOD)
| N, M = map(int, input().split())
a = set([int(input()) for i in range(M)])
MOD = 10**9 + 7
dp = [1]
if 1 in a:
dp.append(0)
else:
dp.append(1)
for ith_stair in range(2, N + 1):
if ith_stair in a:
dp.append(0)
else:
dp.append((dp[ith_stair - 1] + dp[ith_stair - 2]) % MOD)
print(dp[N] % MOD)
| replace | 1 | 2 | 1 | 2 | TLE | |
p03013 | Python | Runtime Error | d = {}
def calc_step_combination(num):
if num == 0:
return 0
if num == 1 or num == 2:
return 1
if num in d:
return d[num]
res = calc_step_combination(num - 1) + calc_step_combination(num - 2)
d[num] = res
return res
def sol(n, a_list):
step_batch = []
batch_start = 0
for a in a_list:
step_batch.append(a - batch_start)
batch_start = a + 1
step_batch.append(n - batch_start + 1)
result = 1
for i, steps in enumerate(step_batch):
result *= calc_step_combination(steps)
print(result % 1000000007)
def main():
n, m = map(int, input().split())
a_list = []
for i in range(0, m):
a_list.append(int(input()))
sol(n, a_list)
main()
| import sys
sys.setrecursionlimit(110000)
d = {}
def calc_step_combination(num):
if num == 0:
return 0
if num == 1 or num == 2:
return 1
if num in d:
return d[num]
res = calc_step_combination(num - 1) + calc_step_combination(num - 2)
d[num] = res
return res
def sol(n, a_list):
step_batch = []
batch_start = 0
for a in a_list:
step_batch.append(a - batch_start)
batch_start = a + 1
step_batch.append(n - batch_start + 1)
result = 1
for i, steps in enumerate(step_batch):
result *= calc_step_combination(steps)
print(result % 1000000007)
def main():
n, m = map(int, input().split())
a_list = []
for i in range(0, m):
a_list.append(int(input()))
sol(n, a_list)
main()
| insert | 0 | 0 | 0 | 4 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
int n, m;
int a;
ll dp[mx];
bool dpflag[mx] = {true};
int main() {
cin >> n >> m;
for (int i = 0; i <= n; i++) {
dpflag[i] = true;
}
for (int i = 0; i < m; i++) {
cin >> a;
dpflag[a] = false;
}
dp[0] = 1;
if (dpflag[1]) {
dp[1] = 1;
}
for (int now = 0; now < n; now++) {
for (int next = now + 1; next <= n; next++) {
if (dpflag[next]) {
dp[next] = dp[now] + dp[now - 1];
dp[next] %= mod;
}
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
int n, m;
int a;
ll dp[mx];
bool dpflag[mx] = {true};
int main() {
cin >> n >> m;
for (int i = 0; i <= n; i++) {
dpflag[i] = true;
}
for (int i = 0; i < m; i++) {
cin >> a;
dpflag[a] = false;
}
dp[0] = 1;
if (dpflag[1]) {
dp[1] = 1;
}
for (int next = 1; next <= n; next++) {
if (dpflag[next + 1]) {
dp[next + 1] = dp[next] + dp[next - 1];
dp[next + 1] %= mod;
}
}
cout << dp[n] << endl;
return 0;
} | replace | 30 | 36 | 30 | 34 | TLE | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long patterns(int a) {
if (a == 0)
return 1;
else if (a == 1)
return 1;
else if (a == 2)
return 2;
else {
return 2 * patterns(a - 2) + patterns(a - 3);
}
}
int main() {
int n, m, i, skip = 1;
long long ans = 1;
cin >> n >> m;
vector<int> a(m);
for (i = 0; i < m; i++) {
cin >> a.at(i);
}
for (i = 1; i < m; i++) {
if (a.at(i - 1) + 1 == a.at(i)) {
ans = 0;
skip = 0;
break;
}
}
if (m == 0) {
ans = patterns(n);
skip = 0;
}
if (m == 1) {
ans = patterns(a.at(0) - 1) * patterns(n - a.at(0) - 1);
skip = 0;
}
if (skip) {
ans *= patterns(a.at(0) - 1);
for (i = 1; i < m; i++) {
ans *= patterns(a.at(i) - a.at(i - 1) - 2);
ans = ans % 1000000007;
}
ans *= patterns(n - a.at(m - 1) - 1);
}
cout << ans % 1000000007 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long patterns(int a) {
if (a == 0)
return 1;
else if (a == 1)
return 1;
else if (a == 2)
return 2;
else if (a % 2 == 0) {
return (patterns(a / 2) * patterns(a / 2) +
patterns(a / 2 - 1) * patterns(a / 2 - 1)) %
1000000007;
} else {
return (patterns(a / 2) * patterns(a / 2 + 1) +
patterns(a / 2 - 1) * patterns(a / 2)) %
1000000007;
}
}
int main() {
int n, m, i, skip = 1;
long long ans = 1;
cin >> n >> m;
vector<int> a(m);
for (i = 0; i < m; i++) {
cin >> a.at(i);
}
for (i = 1; i < m; i++) {
if (a.at(i - 1) + 1 == a.at(i)) {
ans = 0;
skip = 0;
break;
}
}
if (m == 0) {
ans = patterns(n);
skip = 0;
}
if (m == 1) {
ans = patterns(a.at(0) - 1) * patterns(n - a.at(0) - 1);
skip = 0;
}
if (skip) {
ans *= patterns(a.at(0) - 1);
for (i = 1; i < m; i++) {
ans *= patterns(a.at(i) - a.at(i - 1) - 2);
ans = ans % 1000000007;
}
ans *= patterns(n - a.at(m - 1) - 1);
}
cout << ans % 1000000007 << endl;
}
| replace | 10 | 12 | 10 | 18 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
ll N;
ll M;
cin >> N >> M;
vl vec(M);
rep(i, N + 1) {
ll a;
cin >> a;
vec.at(a) = 1;
}
ll dp[N + 1];
dp[0] = 1;
if (vec.at(1) == 1) {
dp[1] = 0;
} else if (vec.at(1) != 1) {
dp[1] = 1;
}
repl(i, 2, N + 1) {
if (vec.at(i)) {
dp[i] = 0;
continue;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
}
cout << dp[N] << endl;
}
| #include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
int main() {
ll N;
ll M;
cin >> N >> M;
vl vec(N + 1);
rep(i, M) {
ll a;
cin >> a;
vec.at(a) = 1;
}
ll dp[N + 1];
dp[0] = 1;
if (vec.at(1) == 1) {
dp[1] = 0;
} else if (vec.at(1) != 1) {
dp[1] = 1;
}
repl(i, 2, N + 1) {
if (vec.at(i)) {
dp[i] = 0;
continue;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
}
cout << dp[N] << endl;
}
| replace | 29 | 31 | 29 | 31 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 1)
|
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (int i = beg; end <= i; i--)
int64_t kRem = 1000000007;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> blocks(m);
for (auto &block : blocks) {
cin >> block;
}
vector<int64_t> scores(n + 1);
scores[0] = 1;
auto it = blocks.begin();
if (*it == 1) {
scores[1] = 0;
it++;
} else {
scores[1] = 1;
}
FOR_LE(i, 2, n) {
if (it != blocks.end() && *it == i) {
scores[i] = 0;
it++;
continue;
}
scores[i] = scores[i - 1] + scores[i - 2];
scores[i] %= kRem;
}
cout << scores[n] << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR_LT(i, beg, end) for (int i = beg; i < end; i++)
#define FOR_LE(i, beg, end) for (int i = beg; i <= end; i++)
#define FOR_DW(i, beg, end) for (int i = beg; end <= i; i--)
int64_t kRem = 1000000007;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> blocks(m);
for (auto &block : blocks) {
cin >> block;
}
vector<int64_t> scores(n + 1);
scores[0] = 1;
auto it = blocks.begin();
if (it != blocks.end() && *it == 1) {
scores[1] = 0;
it++;
} else {
scores[1] = 1;
}
FOR_LE(i, 2, n) {
if (it != blocks.end() && *it == i) {
scores[i] = 0;
it++;
continue;
}
scores[i] = scores[i - 1] + scores[i - 2];
scores[i] %= kRem;
}
cout << scores[n] << endl;
return 0;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
template <typename T, typename... Args>
auto vectors(std::size_t n, Args... args) {
return std::vector<decltype(vectors<T>(args...))>(n, vectors<T>(args...));
}
template <class T> inline bool chmin(T &a, const T &b) {
return (a > b) ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, const T &b) {
return (a < b) ? a = b, true : false;
}
template <class T> inline void chadd(T &a, const T &b) {
a += b, a %= MOD;
// TODO minus case
}
template <class T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
if (v.empty())
return s;
s << *v.begin();
for (auto iter = v.begin() + 1; iter != v.end(); ++iter)
if (std::is_fundamental<T>::value)
s << " " << *iter;
else
s << std::endl << *iter;
return s;
}
int main() {
// Input
int N, M;
std::cin >> N >> M;
std::vector<int> a(M);
for (int i = 0; i < M; ++i)
std::cin >> a[i];
// Main
std::vector<long long> f(1000000, 0);
f[0] = 0;
f[1] = 1;
f[2] = 1;
for (int i = 3; i <= N + 1; ++i) {
f[i] = f[i - 1] + f[i - 2];
f[i] %= MOD;
}
long long res = 1;
for (int i = 0; i < M; ++i) {
if (i == 0) {
int d = a[0];
assert(d >= 0);
res *= f[d];
res %= MOD;
continue;
}
if (a[i] == a[i - 1])
continue;
int d = a[i] - a[i - 1] - 1;
assert(d >= 0);
res *= f[d];
res %= MOD;
}
int d = N - a[M - 1];
assert(d >= 0);
res *= f[d];
res %= MOD;
// Output
std::cout << res << std::endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
template <typename T, typename... Args>
auto vectors(std::size_t n, Args... args) {
return std::vector<decltype(vectors<T>(args...))>(n, vectors<T>(args...));
}
template <class T> inline bool chmin(T &a, const T &b) {
return (a > b) ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, const T &b) {
return (a < b) ? a = b, true : false;
}
template <class T> inline void chadd(T &a, const T &b) {
a += b, a %= MOD;
// TODO minus case
}
template <class T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
if (v.empty())
return s;
s << *v.begin();
for (auto iter = v.begin() + 1; iter != v.end(); ++iter)
if (std::is_fundamental<T>::value)
s << " " << *iter;
else
s << std::endl << *iter;
return s;
}
int main() {
// Input
int N, M;
std::cin >> N >> M;
std::vector<int> a(M);
for (int i = 0; i < M; ++i)
std::cin >> a[i];
// Main
std::vector<long long> f(1000000, 0);
f[0] = 0;
f[1] = 1;
f[2] = 1;
for (int i = 3; i <= N + 1; ++i) {
f[i] = f[i - 1] + f[i - 2];
f[i] %= MOD;
}
long long res = 1;
for (int i = 0; i < M; ++i) {
if (i == 0) {
int d = a[0];
assert(d >= 0);
res *= f[d];
res %= MOD;
continue;
}
if (a[i] == a[i - 1])
continue;
int d = a[i] - a[i - 1] - 1;
assert(d >= 0);
res *= f[d];
res %= MOD;
}
int d;
if (M >= 1)
d = N - a[M - 1];
else
d = N + 1;
assert(d >= 0);
res *= f[d];
res %= MOD;
// Output
std::cout << res << std::endl;
return 0;
}
| replace | 79 | 80 | 79 | 84 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define moju (long long int)(1e9 + 7)
using namespace std;
int main() {
int n, m;
int i;
long long int c, ans = 1;
cin >> n >> m;
vector<long long int> a(m), b(n);
for (i = 0; i < m; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (i <= 1)
b[i] = i + (long long int)1;
else
b[i] = (b[i - 1] + b[i - 2]) % moju;
// cout << b[i] << endl;
}
// cout << endl;
for (i = 0; i <= m; i++) {
if (i == 0)
c = a[i] - 2;
else if (i == m)
c = n - a[i - 1] - 2;
else
c = a[i] - a[i - 1] - 3;
if (c < 0)
ans *= (c + 2);
else
ans = (ans * b[c]) % moju;
// cout << ans << endl;
// cout << b[c] << endl;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#define moju (long long int)(1e9 + 7)
using namespace std;
int main() {
int n, m;
int i;
long long int c, ans = 1;
cin >> n >> m;
if (m == 0) {
vector<long long int> b(n);
for (i = 0; i < n; i++) {
if (i <= 1)
b[i] = i + (long long int)1;
else
b[i] = (b[i - 1] + b[i - 2]) % moju;
// cout << b[i] << endl;
}
cout << b[n - 1] << endl;
return 0;
}
vector<long long int> a(m), b(n);
for (i = 0; i < m; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (i <= 1)
b[i] = i + (long long int)1;
else
b[i] = (b[i - 1] + b[i - 2]) % moju;
// cout << b[i] << endl;
}
// cout << endl;
for (i = 0; i <= m; i++) {
if (i == 0)
c = a[i] - 2;
else if (i == m)
c = n - a[i - 1] - 2;
else
c = a[i] - a[i - 1] - 3;
if (c < 0)
ans *= (c + 2);
else
ans = (ans * b[c]) % moju;
// cout << ans << endl;
// cout << b[c] << endl;
}
cout << ans << endl;
return 0;
} | insert | 9 | 9 | 9 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, M;
cin >> N >> M;
vector<ll> dp(1001);
unordered_map<int, int> dest{};
vector<ll> a(M);
REP(i, M) {
cin >> a[i];
dest[a[i]]++;
}
REP(i, dp.size()) dp[i] = 0;
dp[0] = 1;
for (int i = 0; i < N; i++) {
if (dest[i] != 0)
continue;
if (dest[i + 1] == 0) {
dp[i + 1] += dp[i];
dp[i + 1] %= MOD;
}
if (dest[i + 2] == 0) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
}
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
int main() {
int N, M;
cin >> N >> M;
vector<ll> dp(100110);
unordered_map<int, int> dest{};
vector<ll> a(M);
REP(i, M) {
cin >> a[i];
dest[a[i]]++;
}
REP(i, dp.size()) dp[i] = 0;
dp[0] = 1;
for (int i = 0; i < N; i++) {
if (dest[i] != 0)
continue;
if (dest[i + 1] == 0) {
dp[i + 1] += dp[i];
dp[i + 1] %= MOD;
}
if (dest[i + 2] == 0) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
}
}
cout << dp[N] << endl;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
std::vector<bool> stiustir;
std::vector<long long> recordstepstir;
int N = 0;
void search(int now) {
long long step = 0;
if (stiustir[now] == false) {
recordstepstir[now] = 0;
search(now - 1);
return;
}
if (now > 0 && now <= N - 2) {
step += recordstepstir[now + 2];
step += recordstepstir[now + 1];
recordstepstir[now] = step % 1000000007;
search(now - 1);
} else if (now == N - 1) {
recordstepstir[now] = 1;
search(now - 1);
return;
} else if (now == 0) {
step += recordstepstir[now + 2];
step += recordstepstir[now + 1];
recordstepstir[now] = step % 1000000007;
cout << (step % 1000000007);
return;
}
return;
}
int main(void) {
int i, j, k, M;
cin >> N >> M;
int a[M];
for (i = 0; i < M; i++) {
cin >> a[i];
}
for (i = 0; i < N; i++) {
stiustir.push_back(true);
recordstepstir.push_back(0);
}
recordstepstir.push_back(1);
stiustir.push_back(true);
for (i = 0; i < M; i++) {
stiustir[a[i]] = false;
}
search(N - 1);
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
std::vector<bool> stiustir;
std::vector<long long> recordstepstir;
int N = 0;
void search(int now) {
long long step = 0;
if (stiustir[now] == false) {
recordstepstir[now] = 0;
search(now - 1);
return;
}
if (now > 0 && now <= N - 2) {
step += recordstepstir[now + 2];
step += recordstepstir[now + 1];
recordstepstir[now] = step % 1000000007;
search(now - 1);
} else if (now == N - 1) {
recordstepstir[now] = 1;
search(now - 1);
return;
} else if (now == 0) {
step += recordstepstir[now + 2];
step += recordstepstir[now + 1];
recordstepstir[now] = step % 1000000007;
cout << (step % 1000000007);
return;
}
return;
}
int main(void) {
int i, j, k, M;
cin >> N >> M;
int a[M];
for (i = 0; i < M; i++) {
cin >> a[i];
}
for (i = 0; i < N; i++) {
stiustir.push_back(true);
recordstepstir.push_back(0);
}
recordstepstir.push_back(1);
stiustir.push_back(true);
for (i = 0; i < M; i++) {
stiustir[a[i]] = false;
}
if (N == 1) {
cout << 1;
return 0;
}
search(N - 1);
return 0;
} | insert | 49 | 49 | 49 | 53 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<ll> dp(n + 5, 0);
dp[0] = 1;
dp[1] = (a[0] == 1) ? 0 : 1;
for (int i = 2; i <= n; i++) {
dp[i] = max(dp[i], dp[i - 1] + dp[i - 2]) % MOD;
for (int j = 0; j < m; j++) {
if (i == a[j]) {
dp[i] = 0;
break;
}
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<ll> dp(n + 5, 0);
dp[0] = 1;
dp[1] = 1;
if (m != 0 and a[0] == 1) {
dp[1] = 0;
}
for (int i = 2; i <= n; i++) {
dp[i] = max(dp[i], dp[i - 1] + dp[i - 2]) % MOD;
for (int j = 0; j < m; j++) {
if (i == a[j]) {
dp[i] = 0;
break;
}
}
}
cout << dp[n] << endl;
return 0;
} | replace | 15 | 16 | 15 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) \
for (auto itr : x) { \
debug(itr); \
}
template <class T> inline void chmax(T &ans, T t) {
if (t > ans)
ans = t;
}
template <class T> inline void chmin(T &ans, T t) {
if (t < ans)
ans = t;
}
int main() {
ll n, m;
cin >> n >> m;
map<ll, bool> mp;
vector<ll> dp(n + 1, 0), a(m);
rep(i, m) {
cin >> a[i];
mp[a[i]] += 1;
}
dp[0] = 1;
for (int i = 0; i < n; ++i) {
if (mp[i]) {
continue;
}
if (!mp[i + 1]) {
dp[i + 1] += (dp[i]) % MOD;
dp[i + 1] %= MOD;
}
if (!mp[i + 2]) {
dp[i + 2] += (dp[i]) % MOD;
dp[i + 2] %= MOD;
}
}
cout << dp[n] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_r(i, n, m) for (int i = m; i < n; i++)
#define END cout << endl
#define MOD 1000000007
#define pb push_back
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<int>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) \
for (auto itr : x) { \
debug(itr); \
}
template <class T> inline void chmax(T &ans, T t) {
if (t > ans)
ans = t;
}
template <class T> inline void chmin(T &ans, T t) {
if (t < ans)
ans = t;
}
int main() {
ll n, m;
cin >> n >> m;
map<ll, bool> mp;
vector<ll> dp(n + 10, 0), a(m + 2);
rep(i, m) {
cin >> a[i];
mp[a[i]] += 1;
}
dp[0] = 1;
for (int i = 0; i < n; ++i) {
if (mp[i]) {
continue;
}
if (!mp[i + 1]) {
dp[i + 1] += (dp[i]) % MOD;
dp[i + 1] %= MOD;
}
if (!mp[i + 2]) {
dp[i + 2] += (dp[i]) % MOD;
dp[i + 2] %= MOD;
}
}
cout << dp[n] << endl;
}
| replace | 45 | 46 | 45 | 46 | -6 | munmap_chunk(): invalid pointer
|
p03013 | C++ | Runtime Error | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (int i = (int)(end - 1), i##_end = (int)(begin); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
#define each(x, a) for (auto &x : a)
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
using ll = long long;
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (int i = 0; i < (int)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
#ifdef LOCAL
inline void dump(void) { cerr << endl; }
template <class Head, class... Tail>
inline void dump(Head &&head, Tail &&...tail) {
cerr << head << " ";
dump(tail...);
}
#define debug(...) \
do { \
cerr << "[L." << __LINE__ << "]\t" << #__VA_ARGS__ << "="; \
dump(__VA_ARGS__); \
} while (0)
#else
#define dump(...)
#define debug(...)
#endif
template <class T> inline void Sort(T &a) { sort(a.begin(), a.end()); }
template <class T, class Compare> inline void Sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void rSort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T, class U> inline bool chmax(T &a, U b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
return (b < a) ? (a = b, true) : false;
}
template <class T> inline T max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
class in {
int n;
public:
in() { n = -1; }
in(int n_) : n(n_){};
template <class T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n >= 0);
vector<T> ret(n);
for (int i = 0; i < n; ++i)
cin >> ret[i];
return ret;
}
};
template <class T> void print(const T &a) { cout << a; }
int out() {
cout << '\n';
return 0;
}
template <class T> int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
template <std::uint_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(const u64 x = 0) noexcept : a(x % Mod) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
template <std::uint_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
ll dp[100001];
int main() {
int N = in();
int M = in();
vector<int> a = in(M);
set<int> st;
rep(i, M) { st.insert(a[i]); }
dp[0] = 1;
dp[1] = (a[0] != 1);
rep(i, N - 1) {
if (!st.count(i + 2))
dp[i + 2] = dp[i] + dp[i + 1];
dp[i + 2] %= mod;
}
ll ans = dp[N];
out(ans);
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (int i = (int)(end - 1), i##_end = (int)(begin); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
#define each(x, a) for (auto &x : a)
struct IoSetup {
IoSetup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
using ll = long long;
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (int i = 0; i < (int)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
#ifdef LOCAL
inline void dump(void) { cerr << endl; }
template <class Head, class... Tail>
inline void dump(Head &&head, Tail &&...tail) {
cerr << head << " ";
dump(tail...);
}
#define debug(...) \
do { \
cerr << "[L." << __LINE__ << "]\t" << #__VA_ARGS__ << "="; \
dump(__VA_ARGS__); \
} while (0)
#else
#define dump(...)
#define debug(...)
#endif
template <class T> inline void Sort(T &a) { sort(a.begin(), a.end()); }
template <class T, class Compare> inline void Sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void rSort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void Reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T, class U> inline bool chmax(T &a, U b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
return (b < a) ? (a = b, true) : false;
}
template <class T> inline T max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
class in {
int n;
public:
in() { n = -1; }
in(int n_) : n(n_){};
template <class T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n >= 0);
vector<T> ret(n);
for (int i = 0; i < n; ++i)
cin >> ret[i];
return ret;
}
};
template <class T> void print(const T &a) { cout << a; }
int out() {
cout << '\n';
return 0;
}
template <class T> int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
template <std::uint_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(const u64 x = 0) noexcept : a(x % Mod) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
template <std::uint_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
ll dp[100001];
int main() {
int N = in();
int M = in();
vector<int> a = in(M);
set<int> st;
rep(i, M) { st.insert(a[i]); }
dp[0] = 1;
if (M == 0) {
dp[1] = 1;
} else {
dp[1] = (a[0] != 1);
}
rep(i, N - 1) {
if (!st.count(i + 2))
dp[i + 2] = dp[i] + dp[i + 1];
dp[i + 2] %= mod;
}
ll ans = dp[N];
out(ans);
}
| replace | 217 | 218 | 217 | 222 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
int kMod = 1e9 + 7;
void print_all(const std::vector<int> &v) {
for (int x : v) {
std::cout << x << '\n';
}
}
int main() {
int n, m;
std::cin >> n >> m;
std::vector<bool> is_broken(n, false);
for (int i = 0; i < m; i++) {
int broken_index;
std::cin >> broken_index;
is_broken.at(broken_index - 1) = true;
}
std::vector<int> patterns(n, 0);
if (is_broken.at(0)) {
patterns.at(0) = 0;
} else {
patterns.at(0) = 1;
}
if (is_broken.at(1)) {
patterns.at(1) = 0;
} else {
patterns.at(1) = patterns.at(0) + 1;
}
for (int i = 2; i < n; i++) {
if (is_broken.at(i)) {
patterns.at(i) = 0;
} else {
patterns.at(i) = (patterns.at(i - 1) + patterns.at(i - 2)) % kMod;
}
}
std::cout << patterns.back() << '\n';
// print_all(patterns);
return 0;
}
| #include <iostream>
#include <vector>
int kMod = 1e9 + 7;
void print_all(const std::vector<int> &v) {
for (int x : v) {
std::cout << x << '\n';
}
}
int main() {
int n, m;
std::cin >> n >> m;
std::vector<bool> is_broken(n, false);
for (int i = 0; i < m; i++) {
int broken_index;
std::cin >> broken_index;
is_broken.at(broken_index - 1) = true;
}
std::vector<int> patterns(n, 0);
if (is_broken.at(0)) {
patterns.at(0) = 0;
} else {
patterns.at(0) = 1;
}
if (n <= 1) {
std::cout << patterns.at(0) << '\n';
return 0;
}
if (is_broken.at(1)) {
patterns.at(1) = 0;
} else {
patterns.at(1) = patterns.at(0) + 1;
}
for (int i = 2; i < n; i++) {
if (is_broken.at(i)) {
patterns.at(i) = 0;
} else {
patterns.at(i) = (patterns.at(i - 1) + patterns.at(i - 2)) % kMod;
}
}
std::cout << patterns.back() << '\n';
// print_all(patterns);
return 0;
}
| insert | 26 | 26 | 26 | 30 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int a[100010] = {};
REP(i, M) cin >> a[i];
ll dp[100100] = {};
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
REP(i, M) {
if (a[i] == 1) {
dp[1] = 0;
dp[2] = 1;
}
if (a[i] == 2) {
dp[2] = 0;
}
}
int O = 0;
REPP(i, 3, N + 1) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= 1000000007;
REPP(j, O, M) {
if (i == a[j]) {
dp[i] = 0;
O++;
}
}
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int a[100010] = {};
REP(i, M) cin >> a[i];
ll dp[100100] = {};
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
REP(i, M) {
if (a[i] == 1) {
dp[1] = 0;
dp[2] = 1;
}
if (a[i] == 2) {
dp[2] = 0;
}
}
int O = 0;
REPP(i, 3, N + 1) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= 1000000007;
REPP(j, O, M) {
if (i == a[j]) {
dp[i] = 0;
O++;
break;
}
}
}
cout << dp[N] << endl;
} | insert | 54 | 54 | 54 | 55 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
template <typename T> T chmax(T &a, const T &b) { return a = (a > b ? a : b); }
template <typename T> T chmin(T &a, const T &b) { return a = (a < b ? a : b); }
int main() {
int n, m;
cin >> n >> m;
vector<ll> dp(n + 1, 0);
vector<int> ng(n + 1);
rep(i, m) {
int a;
cin >> a;
ng[a] = 1;
}
dp[0] = 1;
rep(i, n) {
if (ng[i + 1] == 0)
(dp[i + 1] += dp[i]) %= MOD;
if (ng[i + 2] == 0)
(dp[i + 2] += dp[i]) %= MOD;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
template <typename T> T chmax(T &a, const T &b) { return a = (a > b ? a : b); }
template <typename T> T chmin(T &a, const T &b) { return a = (a < b ? a : b); }
int main() {
int n, m;
cin >> n >> m;
vector<ll> dp(n + 2, 0);
vector<int> ng(n + 2);
rep(i, m) {
int a;
cin >> a;
ng[a] = 1;
}
dp[0] = 1;
rep(i, n) {
if (ng[i + 1] == 0)
(dp[i + 1] += dp[i]) %= MOD;
if (ng[i + 2] == 0)
(dp[i + 2] += dp[i]) %= MOD;
}
cout << dp[n] << endl;
return 0;
} | replace | 28 | 30 | 28 | 30 | -6 | munmap_chunk(): invalid pointer
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, x, bk = 0;
cin >> N >> M;
vector<int> a(M), sum(N + 1);
sum[0] = 1;
sum[1] = 1;
for (int i = 0; i < M; i++) {
cin >> x;
a[i] = x;
}
if (M != 0) {
if (a[0] == 1) {
sum[1] = 0;
bk++;
}
}
for (int i = 2; i < N + 1; i++) {
if (i == a[bk]) {
sum[i] = 0;
bk++;
if (bk == M) {
bk--;
}
} else {
sum[i] = sum[i - 2] + sum[i - 1];
sum[i] %= 1000000007;
}
}
cout << sum[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, x, bk = 0;
cin >> N >> M;
vector<int> a(M), sum(N + 1);
sum[0] = 1;
sum[1] = 1;
for (int i = 0; i < M; i++) {
cin >> x;
a[i] = x;
}
if (M != 0) {
if (a[0] == 1) {
sum[1] = 0;
bk++;
}
}
for (int i = 2; i < N + 1; i++) {
if (M != 0) {
if (i == a[bk]) {
sum[i] = 0;
bk++;
if (bk == M) {
bk--;
}
} else {
sum[i] = sum[i - 2] + sum[i - 1];
sum[i] %= 1000000007;
}
} else {
sum[i] = sum[i - 2] + sum[i - 1];
sum[i] %= 1000000007;
}
}
cout << sum[N] << endl;
} | replace | 23 | 28 | 23 | 33 | 0 | |
p03013 | C++ | Runtime Error | // int a = stoi(c); 文字列をintへ
// 小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
// 途中の出力をそのまま残さない
// 数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
// 絶対値 abs()
// 入力は空白で切れる
// 大文字判定 isupper(文字) 小文字判定 islower(文字)
// do{}while(next_permutation(ALL(配列)))
// while(N)で回すとき、Nはコピーを作っておく
// 小文字に対応する文字コード：S[i] - 'a'
// 文字コード→小文字：(char)(数字+'a')
// グラフの距離:隣接行列で扱う
// 等価なものに変換する思考
// bool型 初期値はTrue
// 島渡りの問題：中間ノードに着目
// 配列はvector<>を使う：意味わからないエラーがなくなる。
// 背反な事象にちゃんとわける
// チェックリストはマップを使う
// 数が大きい時の比較はstring型で行う
// 全て0になったか調べたい->0になるたびにcntする
// またはかかつか
// 例外処理は最初にする
// x = p^m + q^n...の約数の個数:(n+1)*(m+1)....
// N!のどの素因数で何回割れるか
// ⇔1~Nまでの数がそれぞれどの素因数で何回割り切れるかの和
// パズルの問題->一般化して全探索
// 数が大きい時のせぐふぉはコードテストで試してみる
// スペルミスに注意
// stack<ll> s;
// s.push(要素);s.top();s.pop();
// queue<ll> q;
// q.push(要素);q.front();q.pop();
// 同じ作業繰り返す系の問題：収束先を見つける
// 関係性は隣接行列で記録
// 過半数：N/2.0で判定
// ある量からある量を引く系の問題：端から定義してやる
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// 円周率
const double PI = 3.14159265358979323846;
// 割るやつ
const ll MOD = (pow(10, 9) + 7);
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// a,bの最小公倍数
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
// 階乗計算
ll f(ll n) {
if (n == 0 || n == 1)
return 1;
else
return (n * f(n - 1)) % MOD;
}
// Nのd桁目の数
ll dignum(ll N, ll d) {
ll x = pow(10, d);
N %= x;
ll y = pow(10, d - 1);
N /= y;
return N;
}
// Nをdで何回割れるか
ll divcnt(ll N, ll d) {
ll ans = 0;
while (1) {
if (N % d == 0) {
ans++;
N /= d;
} else
break;
}
return ans;
}
// 素数判定
bool prime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
// フィボナッチ数列
vector<ll> memo(pow(10, 6) + 1);
ll fibo(ll n) {
if (n == 1)
return 1;
else if (n == 2)
return 1;
else if (memo[n] != 0)
return memo[n];
else
return memo[n] = fibo(n - 1) + f(n - 2);
}
int main() {
ll N, M;
cin >> N >> M;
vector<ll> a(M);
rep(i, M) cin >> a[i];
if (M >= 2) {
rep(i, M - 1) {
if (a[i] + 1 == a[i + 1]) {
cout << 0 << endl;
return 0;
}
}
}
vector<ll> dp(100001);
for (int i = 0; i <= 100000; i++) {
if (i == 0)
dp[i] = 1;
else if (i == 1)
dp[i] = 1;
else {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
}
ll ans = 1;
rep(i, M) {
if (i == 0) {
ans *= dp[a[i] - 1];
ans %= MOD;
} else {
ans *= dp[a[i] - a[i - 1] - 2];
ans %= MOD;
}
}
ans *= dp[N - a[M - 1] - 1];
cout << ans % MOD << endl;
} | // int a = stoi(c); 文字列をintへ
// 小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
// 途中の出力をそのまま残さない
// 数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
// 絶対値 abs()
// 入力は空白で切れる
// 大文字判定 isupper(文字) 小文字判定 islower(文字)
// do{}while(next_permutation(ALL(配列)))
// while(N)で回すとき、Nはコピーを作っておく
// 小文字に対応する文字コード：S[i] - 'a'
// 文字コード→小文字：(char)(数字+'a')
// グラフの距離:隣接行列で扱う
// 等価なものに変換する思考
// bool型 初期値はTrue
// 島渡りの問題：中間ノードに着目
// 配列はvector<>を使う：意味わからないエラーがなくなる。
// 背反な事象にちゃんとわける
// チェックリストはマップを使う
// 数が大きい時の比較はstring型で行う
// 全て0になったか調べたい->0になるたびにcntする
// またはかかつか
// 例外処理は最初にする
// x = p^m + q^n...の約数の個数:(n+1)*(m+1)....
// N!のどの素因数で何回割れるか
// ⇔1~Nまでの数がそれぞれどの素因数で何回割り切れるかの和
// パズルの問題->一般化して全探索
// 数が大きい時のせぐふぉはコードテストで試してみる
// スペルミスに注意
// stack<ll> s;
// s.push(要素);s.top();s.pop();
// queue<ll> q;
// q.push(要素);q.front();q.pop();
// 同じ作業繰り返す系の問題：収束先を見つける
// 関係性は隣接行列で記録
// 過半数：N/2.0で判定
// ある量からある量を引く系の問題：端から定義してやる
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
#define ALL(a) (a).begin(), (a).end()
#define ll long long int
using namespace std;
// 円周率
const double PI = 3.14159265358979323846;
// 割るやつ
const ll MOD = (pow(10, 9) + 7);
// K進数でのNの桁数
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// a,bの最小公倍数
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
// 階乗計算
ll f(ll n) {
if (n == 0 || n == 1)
return 1;
else
return (n * f(n - 1)) % MOD;
}
// Nのd桁目の数
ll dignum(ll N, ll d) {
ll x = pow(10, d);
N %= x;
ll y = pow(10, d - 1);
N /= y;
return N;
}
// Nをdで何回割れるか
ll divcnt(ll N, ll d) {
ll ans = 0;
while (1) {
if (N % d == 0) {
ans++;
N /= d;
} else
break;
}
return ans;
}
// 素数判定
bool prime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0)
return false;
}
return true;
}
// フィボナッチ数列
vector<ll> memo(pow(10, 6) + 1);
ll fibo(ll n) {
if (n == 1)
return 1;
else if (n == 2)
return 1;
else if (memo[n] != 0)
return memo[n];
else
return memo[n] = fibo(n - 1) + f(n - 2);
}
int main() {
ll N, M;
cin >> N >> M;
vector<ll> a(M);
rep(i, M) cin >> a[i];
if (M >= 2) {
rep(i, M - 1) {
if (a[i] + 1 == a[i + 1]) {
cout << 0 << endl;
return 0;
}
}
}
vector<ll> dp(100001);
for (int i = 0; i <= 100000; i++) {
if (i == 0)
dp[i] = 1;
else if (i == 1)
dp[i] = 1;
else {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
}
if (M == 0) {
cout << dp[N] << endl;
return 0;
}
ll ans = 1;
rep(i, M) {
if (i == 0) {
ans *= dp[a[i] - 1];
ans %= MOD;
} else {
ans *= dp[a[i] - a[i - 1] - 2];
ans %= MOD;
}
}
ans *= dp[N - a[M - 1] - 1];
cout << ans % MOD << endl;
} | insert | 162 | 162 | 162 | 167 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 1), bkn(n + 1, 1);
rep(i, m) {
int a;
cin >> a;
bkn[a] = 0;
}
dp[0] = 1;
dp[1] = bkn[1];
rep2(i, 2, n + 2) {
if (bkn[i]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 1), bkn(n + 1, 1);
rep(i, m) {
int a;
cin >> a;
bkn[a] = 0;
}
dp[0] = 1;
dp[1] = bkn[1];
rep2(i, 2, n + 1) {
if (bkn[i]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[n] << endl;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1LL << 60
int main() {
ll mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<ll> a(M), dp(N + 2);
REP(i, M) cin >> a[i];
dp[0] = 0;
dp[1] = 1;
int cur_a_idx = 0;
for (int i = 2; i <= N + 1; i++) {
if (i - 1 == a[cur_a_idx]) {
cur_a_idx++;
dp[i] = 0;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[N + 1] << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<long double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
#define INF 1LL << 60
int main() {
ll mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<ll> a(M), dp(N + 2);
REP(i, M) cin >> a[i];
dp[0] = 0;
dp[1] = 1;
int cur_a_idx = 0;
for (int i = 2; i <= N + 1; i++) {
if (cur_a_idx < M && i - 1 == a[cur_a_idx]) {
cur_a_idx++;
dp[i] = 0;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[N + 1] << endl;
return 0;
} | replace | 64 | 65 | 64 | 65 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(m), dp(n + 10, 0);
for (int i = 0; i < m; i++)
cin >> a[i]; // hole
dp[0] = 1;
int j = 0; // next hole
if (a[0] != 1) {
dp[1] = 1;
} else {
dp[1] = 0;
j++;
}
for (int i = 2; i <= n; i++) {
if (i != a[j]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
} else {
dp[i] = 0;
j++;
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<ll> dp(n + 1);
vector<int> a(n + 1);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
dp[0] = 1;
int j = 0; // next hole
if (a[0] != 1) {
dp[1] = 1;
} else {
dp[1] = 0;
j++;
}
for (int i = 2; i <= n; i++) {
if (i != a[j]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
} else {
dp[i] = 0;
j++;
}
}
cout << dp[n] << endl;
return 0;
} | replace | 8 | 11 | 8 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define m_p make_pair
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<bool> ok(m, false);
vector<ll> dp(n + 1, 0);
rep(i, m) {
ll a;
cin >> a;
ok[a] = true;
}
dp[0] = 1;
REP(i, 1, n + 1) {
if (ok[i])
continue;
if (i == 1)
dp[i] = dp[i - 1];
else
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define m_p make_pair
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<bool> ok(n + 1, false);
vector<ll> dp(n + 1, 0);
rep(i, m) {
ll a;
cin >> a;
ok[a] = true;
}
dp[0] = 1;
REP(i, 1, n + 1) {
if (ok[i])
continue;
if (i == 1)
dp[i] = dp[i - 1];
else
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
const int INF = 1001001001;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod){};
mint pow(ll y) const {
mint res(1);
mint a(x);
while (y > 0) {
if (y & 1)
res *= a;
a *= a;
y >>= 1;
}
return res;
}
mint inv() const { return pow(mod - 2); }
mint &operator+=(const mint a) noexcept {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) noexcept {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) noexcept {
(x *= a.x) %= mod;
return *this;
}
mint &operator/=(const mint a) noexcept { return (*this) *= a.inv(); }
mint operator+(const mint a) const noexcept {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const noexcept {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const noexcept {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const noexcept {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &stream, const mint &n) {
stream << n.x;
return stream;
};
struct comb {
vector<mint> fact, ifact;
comb(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) const noexcept {
if (k < 0 || n < k)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
mint dp[10005];
int main(void) {
ll n, m;
cin >> n >> m;
set<ll> a;
REP(i, m) {
ll b;
cin >> b;
a.insert(b);
};
dp[0] = 1;
REP(i, n) {
if (a.count(i + 1) == 0)
dp[i + 1] += dp[i];
if (a.count(i + 2) == 0)
dp[i + 2] += dp[i];
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, n, 0)
#define ALL(x) (x).begin(), (x).end()
#define ALLr(x) (x).rbegin(), (x).rend()
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
const int INF = 1001001001;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod){};
mint pow(ll y) const {
mint res(1);
mint a(x);
while (y > 0) {
if (y & 1)
res *= a;
a *= a;
y >>= 1;
}
return res;
}
mint inv() const { return pow(mod - 2); }
mint &operator+=(const mint a) noexcept {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) noexcept {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) noexcept {
(x *= a.x) %= mod;
return *this;
}
mint &operator/=(const mint a) noexcept { return (*this) *= a.inv(); }
mint operator+(const mint a) const noexcept {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const noexcept {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const noexcept {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const noexcept {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &stream, const mint &n) {
stream << n.x;
return stream;
};
struct comb {
vector<mint> fact, ifact;
comb(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) const noexcept {
if (k < 0 || n < k)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
mint dp[100005];
int main(void) {
ll n, m;
cin >> n >> m;
set<ll> a;
REP(i, m) {
ll b;
cin >> b;
a.insert(b);
};
dp[0] = 1;
REP(i, n) {
if (a.count(i + 1) == 0)
dp[i + 1] += dp[i];
if (a.count(i + 2) == 0)
dp[i + 2] += dp[i];
}
cout << dp[n] << endl;
return 0;
} | replace | 88 | 89 | 88 | 89 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
int n;
bool M[11111] = {};
ll dp[11111] = {};
ll cnt = 0;
int main() {
int m;
cin >> n >> m;
int a;
M[n + 1] = 1;
rep(i, m) {
cin >> a;
M[a] = 1;
}
dp[0] = 1;
dp[1] = !M[1];
rep(i, n - 1) {
if (!M[i + 2])
dp[i + 2] = dp[i] + dp[i + 1];
dp[i + 2] %= 1000000007;
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
int n;
bool M[101010] = {};
ll dp[101010] = {};
ll cnt = 0;
int main() {
int m;
cin >> n >> m;
int a;
M[n + 1] = 1;
rep(i, m) {
cin >> a;
M[a] = 1;
}
dp[0] = 1;
dp[1] = !M[1];
rep(i, n - 1) {
if (!M[i + 2])
dp[i + 2] = dp[i] + dp[i + 1];
dp[i + 2] %= 1000000007;
}
cout << dp[n] << endl;
return 0;
}
| replace | 7 | 9 | 7 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> oks(n + 1, true);
int a;
cin >> a;
oks[a] = false;
vector<int> dp(n + 1);
dp[0] = 1;
for (int now = 0; now < n; now++) {
for (int next = now + 1; next <= min(n, now + 2); next++) {
if (oks[next]) {
dp[next] += dp[now];
dp[next] %= mod;
}
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> oks(n + 1, true);
for (int i = 0; i < k; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int now = 0; now < n; now++) {
for (int next = now + 1; next <= min(n, now + 2); next++) {
if (oks[next]) {
dp[next] += dp[now];
dp[next] %= mod;
}
}
}
cout << dp[n] << endl;
} | replace | 9 | 12 | 9 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, j = 0;
cin >> n >> m;
vector<long> a(m);
vector<long> dp(n + 1);
for (int i = 0; i < m; i++)
cin >> a.at(i);
dp.at(0) = 1;
for (int i = 1; i <= n; i++) {
if (a.at(j) == i) {
j++;
if (j == m)
j--;
} else {
if (i != 1)
dp.at(i) += dp.at(i - 2);
dp.at(i) += dp.at(i - 1);
dp.at(i) = dp.at(i) % 1000000007;
};
};
cout << dp.at(n) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, j = 0;
cin >> n >> m;
vector<long> a(101000);
vector<long> dp(n + 1);
for (int i = 0; i < m; i++)
cin >> a.at(i);
dp.at(0) = 1;
for (int i = 1; i <= n; i++) {
if (a.at(j) == i) {
j++;
if (j == m)
j--;
} else {
if (i != 1)
dp.at(i) += dp.at(i - 2);
dp.at(i) += dp.at(i - 1);
dp.at(i) = dp.at(i) % 1000000007;
};
};
cout << dp.at(n) << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 1000000007
#define endl "\n"
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int bk[1000000], fr[1000000];
int32_t main() {
fastio();
int n, m;
cin >> n >> m;
int a[m];
f(i, 0, m) {
cin >> a[i];
bk[a[i]] = 1;
}
int fg = 0;
f(i, 1, n) {
if (a[i] == a[i - 1] + 1)
fg = 1;
}
if (fg == 1) {
cout << 0;
return 0;
}
fr[0] = 1;
for (int i = 0; i <= n - 1; i++) {
if (bk[i] == 1)
continue;
if (bk[i + 1] == 0)
fr[i + 1] = (fr[i + 1] + fr[i]) % mod;
if (bk[i + 2] == 0)
fr[i + 2] = (fr[i + 2] + fr[i]) % mod;
}
cout << fr[n];
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 1000000007
#define endl "\n"
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int bk[1000000], fr[1000000];
int32_t main() {
fastio();
int n, m;
cin >> n >> m;
int a[m];
f(i, 0, m) {
cin >> a[i];
bk[a[i]] = 1;
}
int fg = 0;
f(i, 1, m) {
if (a[i] == a[i - 1] + 1)
fg = 1;
}
if (fg == 1) {
cout << 0;
return 0;
}
fr[0] = 1;
for (int i = 0; i <= n - 1; i++) {
if (bk[i] == 1)
continue;
if (bk[i + 1] == 0)
fr[i + 1] = (fr[i + 1] + fr[i]) % mod;
if (bk[i + 2] == 0)
fr[i + 2] = (fr[i + 2] + fr[i]) % mod;
}
cout << fr[n];
} | replace | 27 | 28 | 27 | 28 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n, m, b[10001], s[10001], now = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < m; i++) {
if (b[i] + 1 == b[i + 1]) {
cout << "0" << endl;
return 0;
}
}
s[0] = 1;
if (b[now] == 1) {
s[1] = 0;
now++;
} else {
s[1] = 1;
}
if (b[now] == 2) {
s[2] = 0;
now++;
} else {
s[2] = s[1] + 1;
}
for (int i = 3; i <= n; i++) {
if (i == b[now]) {
now++;
s[i] = 0;
// cout << i <<"is 0" << endl;
continue;
}
s[i] = (s[i - 1] + s[i - 2]) % 1000000007;
if (s[i] / 1000000007 && s[i - 1] / 1000000007) {
s[i] %= 1000000007;
s[i - 1] %= 1000000007;
}
}
// for(int i=0;i<n;i++){
// cout << s[i] << " ";
// }
// cout << endl;
cout << s[n] % 1000000007 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n, m, b[200000], s[200002], now = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < m; i++) {
if (b[i] + 1 == b[i + 1]) {
cout << "0" << endl;
return 0;
}
}
s[0] = 1;
if (b[now] == 1) {
s[1] = 0;
now++;
} else {
s[1] = 1;
}
if (b[now] == 2) {
s[2] = 0;
now++;
} else {
s[2] = s[1] + 1;
}
for (int i = 3; i <= n; i++) {
if (i == b[now]) {
now++;
s[i] = 0;
// cout << i <<"is 0" << endl;
continue;
}
s[i] = (s[i - 1] + s[i - 2]) % 1000000007;
if (s[i] / 1000000007 && s[i - 1] / 1000000007) {
s[i] %= 1000000007;
s[i - 1] %= 1000000007;
}
}
// for(int i=0;i<n;i++){
// cout << s[i] << " ";
// }
// cout << endl;
cout << s[n] % 1000000007 << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
using int32 = __uint32_t;
void solve() {
int n, m;
cin >> n >> m;
vector<bool> vis(n + 1);
for (int i = 0; i < m; i++) {
int tp;
cin >> tp;
vis[tp] = true;
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 0; i <= n; i++) {
if (vis[i])
continue;
dp[i + 1] += dp[i];
dp[i + 2] += dp[i];
dp[i + 1] %= MOD;
dp[i + 2] %= MOD;
}
cout << dp[n];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 100010
const int MOD = 1000000007;
using int32 = __uint32_t;
void solve() {
int n, m;
cin >> n >> m;
vector<bool> vis(n + 1);
for (int i = 0; i < m; i++) {
int tp;
cin >> tp;
vis[tp] = true;
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 0; i <= n; i++) {
if (vis[i])
continue;
if (i + 1 <= n)
dp[i + 1] += dp[i];
if (i + 2 <= n)
dp[i + 2] += dp[i];
if (i + 1 <= n)
dp[i + 1] %= MOD;
if (i + 2 <= n)
dp[i + 2] %= MOD;
}
cout << dp[n];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
| replace | 32 | 36 | 32 | 42 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[110000];
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
rep(i, m - 1) {
if (a[i] + 1 == a[i + 1]) {
cout << 0 << endl;
return 0;
}
}
dp[0] = 1;
int no = 0;
rep(i, n) {
if (a[no] == i + 1) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
no++;
i++;
} else {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
dp[i + 1] += dp[i];
dp[i + 1] %= MOD;
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[110000];
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
rep(i, m - 1) {
if (a[i] + 1 == a[i + 1]) {
cout << 0 << endl;
return 0;
}
}
dp[0] = 1;
int no = 0;
rep(i, n) {
if (no < m && a[no] == i + 1) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
no++;
i++;
} else {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
dp[i + 1] += dp[i];
dp[i + 1] %= MOD;
}
}
cout << dp[n] << endl;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> forbidden(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
forbidden[a] = true;
}
long long mod = 1e9 + 7;
vector<long long> count(n, 0);
count[0] = 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= min(n, i + 2); j++) {
if (forbidden[j])
continue;
count[j] += count[i];
count[j] %= mod;
}
}
cout << count[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> forbidden(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
forbidden[a] = true;
}
long long mod = 1e9 + 7;
vector<long long> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= min(n, i + 2); j++) {
if (forbidden[j])
continue;
count[j] += count[i];
count[j] %= mod;
}
}
cout << count[n] << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N, 0);
for (int i = 0; i < M; i++) {
int A;
cin >> A;
a[A] = 1;
}
vector<int> dp(N);
dp[0] = 1;
if (a[1] != 0) {
dp[1] = 0;
} else {
dp[1] = 1;
}
for (int i = 2; i <= N; i++) {
if (a[i] == 1) {
dp[i] = 0;
} else {
dp[i] = dp[i - 1] + dp[i - 2];
}
dp[i] %= INFI;
if (dp[i] == 0 && dp[i - 1] == 0) {
cout << 0 << endl;
return 0;
}
}
cout << dp[N] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N, 0);
for (int i = 0; i < M; i++) {
int A;
cin >> A;
a[A] = 1;
}
vector<int> dp(N + 1);
dp[0] = 1;
if (a[1] != 0) {
dp[1] = 0;
} else {
dp[1] = 1;
}
for (int i = 2; i <= N; i++) {
if (a[i] == 1) {
dp[i] = 0;
} else {
dp[i] = dp[i - 1] + dp[i - 2];
}
dp[i] %= INFI;
if (dp[i] == 0 && dp[i - 1] == 0) {
cout << 0 << endl;
return 0;
}
}
cout << dp[N] << endl;
return 0;
}
| replace | 25 | 26 | 25 | 26 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repf(i, n) for (int i = 0; i <= n; i++)
const ll mod = 1000000000 + 7;
typedef pair<ll, ll> P;
ll N, M;
priority_queue<ll, vector<ll>, greater<ll>> A;
ll dp[100010];
int main() {
cin >> N >> M;
rep(i, M) {
ll a;
cin >> a;
A.push(a);
}
dp[0] = 1;
dp[1] = 1;
ll cur;
ll next = A.top();
for (int i = 1; i < N; i++) {
cur = next;
if (!(A.empty())) {
next = A.top();
if (i == next) {
dp[i] = 0;
dp[i + 1] = (dp[i] + dp[i - 1]) % mod;
A.pop();
continue;
}
if (cur + 1 == next) {
cout << 0 << endl;
}
}
dp[i + 1] = (dp[i] + dp[i - 1]) % mod;
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repf(i, n) for (int i = 0; i <= n; i++)
const ll mod = 1000000000 + 7;
typedef pair<ll, ll> P;
ll N, M;
priority_queue<ll, vector<ll>, greater<ll>> A;
ll dp[100010];
int main() {
cin >> N >> M;
rep(i, M) {
ll a;
cin >> a;
A.push(a);
}
dp[0] = 1;
dp[1] = 1;
ll cur;
ll next;
if (!(A.empty()))
next = A.top();
for (int i = 1; i < N; i++) {
cur = next;
if (!(A.empty())) {
next = A.top();
if (i == next) {
dp[i] = 0;
dp[i + 1] = (dp[i] + dp[i - 1]) % mod;
A.pop();
continue;
}
if (cur + 1 == next) {
cout << 0 << endl;
}
}
dp[i + 1] = (dp[i] + dp[i - 1]) % mod;
}
cout << dp[N] << endl;
} | replace | 23 | 24 | 23 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<bool> arr(n + 1, true);
int x;
for (int i = 0; i < m; i++) {
cin >> x;
arr[x] = false;
}
// if (arr[0] == false)
// {
// cout << 0;
// return 0;
// }
vector<int> dp(n + 1, 0);
if (arr[0])
dp[0] = 1;
if (arr[1] && arr[0])
dp[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= 2; j++) {
if (arr[i] && arr[i - j])
dp[i] += dp[i - j];
dp[i] %= mod;
}
}
// for (int i = 1; i <= n; i++)
// {
// cout << dp[i] << " ";
// // arr[x] = true;
// }
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<bool> arr(n + 1, true);
int x;
for (int i = 0; i < m; i++) {
cin >> x;
arr[x] = false;
}
// if (arr[0] == false)
// {
// cout << 0;
// return 0;
// }
vector<int> dp(n + 1, 0);
if (arr[0])
dp[0] = 1;
if (arr[1] && arr[0])
dp[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= 2; j++) {
if (arr[i] && arr[i - j])
dp[i] += dp[i - j];
dp[i] %= mod;
}
}
// for (int i = 1; i <= n; i++)
// {
// cout << dp[i] << " ";
// // arr[x] = true;
// }
cout << dp[n];
} | delete | 5 | 9 | 5 | 5 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i++)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) // 被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allsum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
int main() {
init();
inl(n, m);
n++;
vl a(n);
REP(i, m) {
inl(tmp);
a[tmp] = -1;
}
vector<mint> dp(n);
dp[0] = 1;
REP(i, n) {
if (i + 1 < n && a[i + 1] != -1)
dp[i + 1] += dp[i];
if (i + 1 < n && a[i + 2] != -1)
dp[i + 2] += dp[i];
}
// cout << "dp: "; REP(i,(signed)dp.size()) cout<<dp[i]<<" "; cout << endl;
// //----------cout----------//
out(dp[n - 1]);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define EACH(x, v) for (auto &x : v)
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define REFOR(i, a, b) for (ll i = (ll)b - 1; i >= (ll)a; i++)
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REREP(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const ll INF = 1LL << 60;
#define CLR(mat, f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a <= x && x <= b)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) // 被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
template <typename T> void in1(T &s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void in2(T &s, T &t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void in3(T &s, T &t, T &u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void in4(T &s, T &t, T &u, T &v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void in5(T &s, T &t, T &u, T &v, T &w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
template <typename T> void outv(T s) {
REP(i, s.size()) { cout << s[i] << " "; }
cout << endl;
}
template <typename T> void out1(T s) {
REP(i, s.size()) { in(s[i]); }
}
template <typename T> void out2(T s, T t) {
REP(i, s.size()) { in(s[i], t[i]); }
}
template <typename T> void out3(T s, T t, T u) {
REP(i, s.size()) { in(s[i], t[i], u[i]); }
}
template <typename T> void out4(T s, T t, T u, T v) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i]); }
}
template <typename T> void out5(T s, T t, T u, T v, T w) {
REP(i, s.size()) { in(s[i], t[i], u[i], v[i], w[i]); }
}
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T> T allsum(vector<T> a) {
T ans = T();
EACH(it, a) ans += it;
return ans;
}
ld dist(pair<ld, ld> a, pair<ld, ld> b) {
return sqrt(abs(a.fi - b.fi) * abs(a.fi - b.fi) +
abs(a.se - b.se) * abs(a.se - b.se));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
#define YES(n) ((n) ? "YES" : "NO")
#define Yes(n) ((n) ? "Yes" : "No")
#define yes(n) ((n) ? "yes" : "no")
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
class UnionFind {
public:
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> siz; // siz[i]:iのサイズ (例) siz[3] = 2 : 3のサイズが2
UnionFind(ll N) : par(N), siz(N, 1LL) { // 最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool unite(ll x, ll y) { // xとyの木を併合
x = root(x); // xの根をrx
y = root(y); // yの根をry
if (x == y)
return false; // xとyの根が同じ(=同じ木にある)時はそのまま
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] =
x; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
return true;
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
class Dag {
public:
vvl g;
vl inCnt;
vl sorted;
bool sortedF = false;
Dag(ll N) : g(N), inCnt(N) {}
void input(ll x, ll y) {
g[x].pb(y);
inCnt[y]++;
}
bool tpSort() {
vl tmp = inCnt;
deque<ll> dq;
vl ans;
REP(i, g.size()) if (tmp[i] == 0) dq.pb(i);
while (dq.size() != 0) {
ll v = dq.front();
dq.pop_front();
ans.pb(v);
EACH(it, g[v]) {
tmp[it]--;
if (tmp[it] == 0)
dq.pb(it);
}
}
sorted.swap(ans);
sortedF = true;
return sorted.size() == g.size();
}
ll longest() {
if (sortedF == false)
tpSort();
vl dp(g.size(), 0);
ll res = 0;
EACH(it1, sorted) {
EACH(it2, g[it1]) { chmax(dp[it2], dp[it1] + 1); }
chmax(res, dp[it1]);
}
return res;
}
};
int main() {
init();
inl(n, m);
n++;
vl a(n);
REP(i, m) {
inl(tmp);
a[tmp] = -1;
}
vector<mint> dp(n);
dp[0] = 1;
REP(i, n) {
if (i + 1 < n && a[i + 1] != -1)
dp[i + 1] += dp[i];
if (i + 2 < n && a[i + 2] != -1)
dp[i + 2] += dp[i];
}
// cout << "dp: "; REP(i,(signed)dp.size()) cout<<dp[i]<<" "; cout << endl;
// //----------cout----------//
out(dp[n - 1]);
return 0;
} | replace | 273 | 274 | 273 | 274 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 2);
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i <= 0; i--) {
if (broken[i] = 1) {
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
}
cout << dp[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 2);
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
}
cout << dp[0] << endl;
}
| replace | 18 | 20 | 18 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <unordered_set>
using namespace std;
const long long mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
unordered_set<int> a_i;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
a_i.insert(a);
}
long long s[10001] = {};
s[0] = 1;
for (int i = 1; i <= n; i++) {
if (a_i.find(i) != a_i.end())
s[i] = 0;
else {
if (i > 1) {
if (a_i.find(i - 1) != a_i.end())
s[i] = s[i - 2];
else
s[i] = s[i - 1] + s[i - 2];
} else
s[i] = s[i - 1];
}
s[i] = s[i] % mod;
}
cout << s[n] << endl;
return 0;
} | #include <iostream>
#include <unordered_set>
using namespace std;
const long long mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
unordered_set<int> a_i;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
a_i.insert(a);
}
long long s[100001] = {};
s[0] = 1;
for (int i = 1; i <= n; i++) {
if (a_i.find(i) != a_i.end())
s[i] = 0;
else {
if (i > 1) {
if (a_i.find(i - 1) != a_i.end())
s[i] = s[i - 2];
else
s[i] = s[i - 1] + s[i - 2];
} else
s[i] = s[i - 1];
}
s[i] = s[i] % mod;
}
cout << s[n] << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
int64_t mod64 = 1e9 + 7;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
T g = gcd(a, b);
return a / g * b;
}
bool check(vector<int> a, int index, int key) {
if (a[index] >= key)
return true;
else
return false;
}
int lower_bound(vector<int> a, int key) {
int left = -1, right = a.size();
while (right - left > 1) {
int mid = left + (left + right) / 2;
if (check(a, mid, key))
right = mid;
else
left = mid;
}
return right;
}
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int64_t> fib(N + 10);
fib[0] = 0;
fib[1] = 1;
for (int i = 2; i < fib.size(); i++) {
fib[i] = fib[i - 1] + fib[i - 2];
fib[i] %= mod64;
}
// error
for (int i = 0; i < M - 1; i++) {
if (a[i + 1] - a[i] == 1) {
cout << 0 << endl;
return 0;
}
}
if (a[M - 1] == N) {
cout << 0 << endl;
return 0;
}
int64_t state = 0;
int64_t ans = 1;
for (int i = 0; i < M; i++) {
ans *= fib[a[i] - state];
state = a[i] + 1;
ans %= mod64;
}
ans *= fib[N + 1 - state];
ans %= mod64;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
int64_t mod64 = 1e9 + 7;
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) {
T g = gcd(a, b);
return a / g * b;
}
bool check(vector<int> a, int index, int key) {
if (a[index] >= key)
return true;
else
return false;
}
int lower_bound(vector<int> a, int key) {
int left = -1, right = a.size();
while (right - left > 1) {
int mid = left + (left + right) / 2;
if (check(a, mid, key))
right = mid;
else
left = mid;
}
return right;
}
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int64_t> fib(N + 10);
fib[0] = 0;
fib[1] = 1;
for (int i = 2; i < fib.size(); i++) {
fib[i] = fib[i - 1] + fib[i - 2];
fib[i] %= mod64;
}
// error
for (int i = 0; i < M - 1; i++) {
if (a[i + 1] - a[i] == 1) {
cout << 0 << endl;
return 0;
}
}
if (M == 0) {
cout << fib[N + 1] << endl;
return 0;
}
int64_t state = 0;
int64_t ans = 1;
for (int i = 0; i < M; i++) {
ans *= fib[a[i] - state];
state = a[i] + 1;
ans %= mod64;
}
ans *= fib[N + 1 - state];
ans %= mod64;
cout << ans << endl;
return 0;
} | replace | 71 | 73 | 71 | 73 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m, false);
for (int i = 0; i < m; i++) {
int num;
cin >> num;
a[num] = true;
}
vector<int> dp(n + 2, 0);
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (a[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
// cout << dp[i] << endl;
}
cout << dp[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, false);
for (int i = 0; i < m; i++) {
int num;
cin >> num;
a[num] = true;
}
vector<int> dp(n + 2, 0);
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (a[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
// cout << dp[i] << endl;
}
cout << dp[0] << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using tl = TP<ll, ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
using vtl = V<tl>;
using vvtl = V<vtl>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpl = queue<pl>;
using stll = stack<ll>;
using stpl = stack<pl>;
using mapll = map<ll, ll>;
using setll = set<ll>;
using pqll = priority_queue<ll>;
#define int ll
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define sz size()
#define bgn begin()
#define en end()
#define asn assign
#define emp empty()
#define fr front()
#define bk back()
#define clr clear()
#define ins insert
#define ers erase
#define res resize
#define tp top()
#define p_q priority_queue
#define inv inverse()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, a) FOR((i), 0, (ll)(a)-1)
#define REP0(i, a) FOR((i), 0, (ll)(a))
#define REP1(i, a) FOR((i), 1, (ll)(a))
#define rREP(i, a) rFOR((i), 0, (ll)(a)-1)
#define rREP0(i, a) rFOR((i), 0, (ll)(a))
#define rREP1(i, a) rFOR((i), 1, (ll)(a))
#define ROR(v, i) for (auto &(i) : (v))
#define IOTA(a, n) iota((a).bgn, (a).en, (n))
#define SORT(a) sort((a).bgn, (a).en)
#define rSORT(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bgn, (a).en), (a).en)
#define PREVP(a) prev_permutation((a).bgn, (a).en)
#define NEXTP(a) next_permutation((a).bgn, (a).en)
#define BINS(a, b) binary_search((a).bgn, (a).en, (b))
#define LOWB(a, b) (lower_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define UPB(a, b) (upper_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define CNT(a, b) count((a).bgn, (a).en, b)
#define SUM(a) accumulate((a).bgn, (a).en, 0)
#define REV(a) reverse((a).bgn, (a).en)
#define REGS(a, b) regex_search((a), regex(b))
#define REGM(a, b) regex_match((a), regex(b))
#define yn(a) cout << ((a) ? "yes" : "no") << "\n";
#define Yn(a) cout << ((a) ? "Yes" : "No") << "\n";
#define YN(a) cout << ((a) ? "YES" : "NO") << "\n";
#define imp(a) cout << ((a) ? "possible" : "impossible") << "\n";
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << "\n";
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << "\n";
#define fs(a) cout << ((a) ? "second" : "first") << "\n";
#define Fs(a) cout << ((a) ? "Second" : "First") << "\n";
#define FS(a) cout << ((a) ? "SECOND" : "FIRST") << "\n";
#define sak cout << "\n";
#define sas cout << " ";
#define sat cout << "\t";
#define dbg(a) cerr << (#a) << ": " << (a) << "\n";
#define dbgs(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__);
#define c2l(a) ((ll)(a - 48))
#define a2l(a) ((ll)(a - 97))
#define A2l(a) ((ll)(a - 65))
#define l2c(a) ((char)(a + 48))
#define l2a(a) ((char)(a + 97))
#define l2A(a) ((char)(a + 65))
#define DigN2(a) ((llabs(a) == 0) ? (1) : ((ll)(log2(double(llabs(a)))) + 1))
#define DigN10(a) ((llabs(a) == 0) ? (1) : ((ll)(log10(double(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (double)(b))))) % 10)
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & (-(a)))
#define vin(v) \
ROR((v), (i)) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vllin2(a, b, N) \
vll(a)(N), (b)(N); \
REP(i, N) { cin >> (a)[i] >> (b)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define rdn(a, b) ((a) / (b))
#define rou(a, b) \
((((double(a) / double(b)) - ((a) / (b))) < 0.5) ? ((a) / (b)) \
: (((a) / (b)) + 1))
#define rup(a, b) ((((a) % (b)) == 0) ? ((a) / (b)) : (((a) / (b)) + 1))
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define powll(a, b) (ll)(pow((double)(a), (double)(b)))
#define Triangle(x1, y1, x2, y2, x3, y3) \
(((x1) - (x2)) * ((y1) - (y3)) - ((x1) - (x3)) * ((y1) - (y2)))
#define svll SumV<ll>
#define svvll SumV2<ll>
#define li(...) \
ll __VA_ARGS__; \
Input(__VA_ARGS__);
#define si(...) \
str __VA_ARGS__; \
Input(__VA_ARGS__);
#define vli(size, ...) \
vll __VA_ARGS__; \
vInput(size, __VA_ARGS__);
#define vsi(size, ...) \
vs __VA_ARGS__; \
vInput(size, __VA_ARGS__);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = 924844033;
// const ll MOD = 9007199254740881;
const ll INF = 1LL << 60; // 1.15e18
const double PI = acos(-1.0);
const vll DX = {0, -1, 0, 1, 0, -1, 1, 1, -1};
const vll DY = {0, 0, -1, 0, 1, -1, -1, 1, 1};
const str alp = "abcdefghijklmnopqrstuvwxyz";
const str ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
void Input() {}
template <class Var, class... Args> void Input(Var &var, Args &...args) {
cin >> var;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.res(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size, args...);
REP(i, size) vInputNum(i, args...);
}
template <class S, class T>
ostream &operator<<(ostream &out, const P<S, T> &p) {
return out << "[" << p.fi << ", " << p.se << "]";
}
template <class T> ostream &operator<<(ostream &out, V<T> &v) {
if (v.emp)
return out << "{}";
else {
auto itr = v.bgn;
out << "{" << *itr;
itr++;
while (itr != v.en) {
out << ", " << *itr;
itr++;
}
out << "}";
return out;
}
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &m) {
if (m.emp)
return out << "<[]>";
else {
auto itr = m.bgn;
out << "< [" << (itr->fi) << ": " << (itr->se);
itr++;
while (itr != m.en) {
out << "], [" << (itr->fi) << ": " << (itr->se);
itr++;
}
out << "] >";
return out;
}
}
template <class T> ostream &operator<<(ostream &out, const set<T> &s) {
if (s.emp)
return out << "<>";
else {
auto itr = s.bgn;
out << "<" << *itr;
itr++;
while (itr != s.en) {
out << ", " << *itr;
itr++;
}
out << ">";
return out;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head head, Body... body) {
cout << head << " ";
say(body...);
}
void sal() { cout << "\n"; }
template <class... Args> void sal(Args... args) {
say(args...);
cout << "\n";
}
void day() {}
template <class T> void day(T t) { cerr << t; }
template <class Head, class... Body> void day(Head head, Body... body) {
cerr << head << " ";
day(body...);
}
void dal() { cerr << "\n"; }
template <class... Args> void dal(Args... args) {
day(args...);
cerr << "\n";
}
void salv() {}
template <class T> void salv(V<T> v) {
if (v.emp)
sal();
else {
auto itr = v.bgn;
say(*itr);
itr++;
while (itr != v.en) {
sas;
say(*itr);
itr++;
}
sak;
}
}
template <class T, class... Args> void salv(V<T> v, Args... args) {
salv(v);
salv(args...);
}
void salv2() {}
template <class T> void salv2(V<V<T>> v) {
if (v.emp)
sal();
else {
ROR(v, i) salv(i);
}
}
template <class T, class... Args> void salv2(V<V<T>> v, Args... args) {
salv2(v);
salv2(args...);
}
template <class Monoid> struct Action {
public:
Monoid I;
function<Monoid(Monoid, Monoid)> A;
Action(Monoid I, function<Monoid(Monoid, Monoid)> A) : I(I), A(A) {}
Monoid operator()() { return I; }
Monoid operator()(Monoid x) { return x; }
Monoid operator()(Monoid l, Monoid r) { return A(l, r); }
template <class... Args> Monoid operator()(Monoid x, Args... args) {
Monoid tmp = operator()(args...);
return A(x, tmp);
}
};
template <class T> Action<T> ADD = Action<T>(0, [](T l, T r) { return l + r; });
template <>
Action<str> ADD<str> = Action<str>("", [](str l, str r) { return l + r; });
template <class T1, class T2>
Action<P<T1, T2>> ADD<P<T1, T2>> =
Action<P<T1, T2>>(mp(ADD<T1>.I, ADD<T2>.I), [](P<T1, T2> l, P<T1, T2> r) {
return mp(l.fi + r.fi, l.se + r.se);
});
template <class T> Action<T> MUL = Action<T>(1, [](T l, T r) { return l * r; });
template <class T> Action<T> OR = Action<T>(0, [](T l, T r) { return l | r; });
template <class T> Action<T> XOR = Action<T>(0, [](T l, T r) { return l ^ r; });
template <class T>
Action<T> AND = Action<T>(((ll)(1) << 63) - 1, [](T l, T r) { return l & r; });
template <>
Action<bool> AND<bool> =
Action<bool>(true, [](bool l, bool r) { return l & r; });
template <>
Action<ull> AND<ull> =
Action<ull>(((ull)(1) << 63) - 1, [](ull l, ull r) { return l & r; });
template <class T>
Action<T> MIN = Action<T>(INF, [](T l, T r) { return (l < r) ? l : r; });
template <class T>
Action<T> MAX = Action<T>(-INF, [](T l, T r) { return (l > r) ? l : r; });
template <class T>
Action<T> GCD = Action<T>(0, [](T l, T r) {
if (l < r) {
l ^= r;
r ^= l;
l ^= r;
}
return (r ? GCD<T>(r, l % r) : l);
});
template <class T>
Action<T> LCM = Action<T>(1, [](T l, T r) { return (l * r) / GCD<T>(l, r); });
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head head, Body... body) {
auto tmp = Min(body...);
return (head < tmp) ? head : tmp;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> auto Max(Head head, Body... body) {
auto tmp = Max(body...);
return (head > tmp) ? head : tmp;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll gcd(ll head) { return head; }
template <class... Body> ll gcd(ll head, Body... body) {
return gcd(head, gcd(body...));
}
ll lcm(ll head) { return head; }
template <class... Body> ll lcm(ll head, Body... body) {
return lcm(head, lcm(body...));
}
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UFT() {}
UFT(const UFT &uft) {}
UFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
struct pUFT {
public:
ll tsize;
ll now;
vll par;
vll rank;
vll mtime;
vvll sizepi;
vvll sizepv;
pUFT() {}
pUFT(const pUFT &puft) {}
pUFT(ll tsizeget) {
tsize = tsizeget;
now = 0;
par.asn(tsize, -1);
rank.asn(tsize, 0);
mtime.asn(tsize, INF);
sizepi.asn(tsize, {0});
sizepv.asn(tsize, {1});
}
ll root(ll x, ll t) { return (mtime[x] > t) ? x : root(par[x], t); }
bool same(ll x, ll y, ll t) { return root(x, t) == root(y, t); }
ll merge(ll x, ll y) {
now++;
x = root(x, now);
y = root(y, now);
if (x != y) {
if (rank[x] < rank[y]) {
par[y] += par[x];
sizepi[y].pb(now);
sizepv[y].pb(-par[y]);
par[x] = y;
mtime[x] = now;
} else {
par[x] += par[y];
sizepi[x].pb(now);
sizepv[x].pb(-par[x]);
par[y] = x;
mtime[y] = now;
if (rank[x] == rank[y])
rank[x]++;
}
}
return now;
}
ll size(ll x, ll t) {
x = root(x, t);
return sizepv[x][UPB(sizepi[x], t) - 1];
}
};
struct wUFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
vll dweight;
wUFT() {}
wUFT(const wUFT &wuft) {}
wUFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
dweight.asn(tsize, 0);
}
ll root(ll x) {
if (par[x] < 0)
return x;
else {
ll r = root(par[x]);
dweight[x] += dweight[par[x]];
return par[x] = r;
}
}
ll weight(ll x) {
root(x);
return dweight[x];
}
ll diff(ll x, ll y) { return weight(y) - weight(x); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y, ll w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
dweight[x] = -w;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
dweight[y] = w;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename valtype> class SegT {
public:
ll size;
vector<valtype> v;
valtype initv;
function<valtype(valtype x, valtype y)> calc;
SegT() {}
SegT(const SegT &segt) {}
SegT(ll sizeget, ll modeget = 0) {
sizeset(sizeget);
modeset(modeget);
init();
}
SegT(vector<valtype> cpyvec, ll modeget = 0) {
sizeset(cpyvec.sz);
modeset(modeget);
init();
copy(cpyvec);
}
SegT(ll sizeget, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(sizeget);
initv = initvget;
calc = calcget;
init();
}
SegT(vector<valtype> cpyvec, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(cpyvec.sz);
initv = initvget;
calc = calcget;
init();
copy(cpyvec);
}
void sizeset(ll rsize) {
size = DigN2(rsize);
if (rsize == Pow2(size - 1))
size--;
return;
}
void modeset(ll mode) {
switch (mode) {
case 0:
initv = 0;
calc = [](valtype x, valtype y) { return x + y; };
break;
case 1:
initv = INF;
calc = [](valtype x, valtype y) { return min(x, y); };
break;
case 2:
initv = -INF;
calc = [](valtype x, valtype y) { return max(x, y); };
break;
}
return;
}
void init() { v.asn(Pow2(size + 1) - 1, initv); }
void copy(vector<valtype> cpyvec) {
REP(i, min(cpyvec.sz, Pow2(size))) set(i, cpyvec[i]);
}
ll i2v(ll i) const {
if (i < 0 || i >= Pow2(size))
return -1;
return Pow2(size) + i - 1;
}
ll top(ll i) const {
if (i == 0)
return -1;
return (i - 1) / 2;
}
pl bot(ll i) const {
if (i + 1 >= Pow2(size))
return mp(-1, -1);
return mp(2 * i + 1, 2 * i + 2);
}
void set(ll i, valtype x) {
i = i2v(i);
v[i] = x;
while (i > 0) {
i = top(i);
v[i] = calc(v[bot(i).fi], v[bot(i).se]);
}
return;
}
void add(ll i, valtype x) {
set(i, v[i2v(i)] + x);
return;
}
valtype operator[](const ll &i) const { return v[i2v(i)]; }
// valtype que(ll a = 0, ll b = Pow2(size) - 1) {
valtype que(ll a, ll b) {
if (a == b)
return v[i2v(a)];
if (a > b)
return initv; // swap(a, b);
valtype ans = initv;
ll ai = i2v(a);
ll bi = i2v(b);
FOR(i, 1, size + 1) {
if (a > b)
break;
if (a % Pow2(i)) {
ans = calc(ans, v[ai]);
a += Pow2(i - 1);
ai = top(ai) + 1;
} else {
ai = top(ai);
}
if (a > b)
break;
if ((b + 1) % Pow2(i)) {
ans = calc(ans, v[bi]);
b -= Pow2(i - 1);
bi = top(bi) - 1;
} else {
bi = top(bi);
}
if (a > b)
break;
}
return ans;
}
valtype que(ll b) { return que(0, b); }
valtype que() { return que(0, Pow2(size) - 1); }
};
template <typename lentype> class Graph {
public:
ll size;
ll mode;
ll mapmode;
lentype zlen;
lentype ilen;
vector<map<ll, ll>> v2n;
vvll n2v;
vector<vector<lentype>> Edge;
vector<pair<lentype, ll>> Primresult;
Graph() {}
Graph(const Graph &graph) {}
Graph(ll sizeget = 0, ll mapmodeget = 0, ll modeget = 0, lentype zlenget = 0,
lentype ilenget = INF) {
size = sizeget;
mapmode = mapmodeget;
mode = modeget;
zlen = zlenget;
ilen = ilenget;
init();
}
void init() {
Edge.res(size);
v2n.res(size);
n2v.res(size);
Primresult.asn(size, mp(ilen, -1));
}
lentype lenplus(lentype l, lentype r) { return l + r; }
lentype lenequal(lentype l, lentype r) { return l == r; }
lentype lenlcr(lentype l, lentype r) { return l < r; }
ll addV(ll vs) {
size += vs;
init();
return size;
}
void caddE(ll x, ll y, lentype c) {
if (mapmode)
v2n[x][y] = Edge[x].sz;
Edge[x].pb(c);
n2v[x].pb(y);
}
void csetE(ll x, ll y, lentype c) {
if (mapmode)
Edge[x][v2n[x][y]] = c;
}
void cersE(ll x, ll y) {
if (mapmode) {
ll n = v2n[x][y];
Edge[x][n] = ilen;
n2v[x][n] = -1;
v2n[x].ers(y);
}
}
void addE(ll x, ll y, lentype c) {
caddE(x, y, c);
if (!mode)
caddE(y, x, c);
}
void setE(ll x, ll y, lentype c) {
csetE(x, y, c);
if (!mode)
csetE(y, x, c);
}
void ersE(ll x, ll y, lentype c) {
cersE(x, y, c);
if (!mode)
cersE(y, x, c);
}
lentype getE(ll x, ll y) {
if (mapmode) {
if (v2n[x].count(y)) {
return Edge[x][v2n[x][y]];
}
}
return ilen;
}
ll getVsz(ll x) { return Edge[x].sz; }
pair<lentype, ll> getV(ll x, ll n) {
if (n >= getVsz(x))
return mp(ilen, -1);
return mp(Edge[x][n], n2v[x][n]);
}
vector<pair<lentype, vll>> Dijk(ll x) {
vector<pair<lentype, vll>> result(size);
REP(i, size) {
result[i].fi = ilen;
result[i].se = {-1};
}
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
result[x].fi = zlen;
result[x].se = {-1};
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else if (lenequal(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].se.pb(now.se);
}
}
}
}
return result;
}
lentype Prim(ll x = 0) {
lentype ans = zlen;
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
Primresult[x] = mp(zlen, -1);
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
ans = lenplus(ans, Primresult[now.se].fi);
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(nowlv.fi, Primresult[nowlv.se].fi)) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
}
}
}
}
return ans;
}
};
/*template <class Type> class DP {
public:
vector<Type> v;
Type initv;
vll size, block;
DP() {}
DP(const DP &dp) {}
template<class... Args> DP(Args... args) {
block.asn(1, 1);
Initialize(args...);
}
void Initialize(Type initv_) {
initv = initv_;
v.asn(block.bk, initv);
}
template<class... Args> void Initialize(ll val, Args... args) {
size.pb(val);
block.pb(block.bk*val);
Initialize(args...);
}
};*/
pl Bezout(ll a, ll b) {
if (b != 0) {
pl xy;
xy = Bezout(b, a % b);
return mp(xy.se, xy.fi - ((a / b) * xy.se));
} else {
return mp(1, 0);
}
}
pl Bez(ll a, ll b, ll c) {
pl xy;
ll x, y, z, gc;
xy = Bezout(a, b);
gc = gcd(a, b);
if (c % gc != 0)
return mp(-1, -1);
x = xy.fi * (c / gc);
y = xy.se * (c / gc);
if (x < 0)
z = rup(-x, (b / gc));
if (x >= 0)
z = -x / (b / gc);
x += z * (b / gc);
y -= z * (a / gc);
return mp(x, y);
}
ll DigS10(ll n) {
ll ans = 0;
while (1) {
ans += n % 10;
n /= 10;
if (!n)
break;
}
return ans;
}
ll isP(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n) + 1) {
if (n % i == 0)
return 0;
}
return 1;
}
ll Tot(ll n) {
if (n <= 0)
return 0;
ll ans = n, x = 2;
while (x * x <= n) {
if (n % x == 0) {
ans -= ans / x;
while (n % x == 0)
n /= x;
}
x++;
}
if (n > 1)
ans -= ans / n;
return ans;
}
template <class T> struct Sum {
public:
V<T> v, s;
ll size;
Action<T> Add;
Sum(V<T> v, Action<T> Add = ADD<T>) : v(v), size(v.sz), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(size + 1, Add.I); }
void Calc() { REP(i, size) s[i + 1] = Add(s[i], v[i]); }
T operator()(ll x) { return operator()(0, x); }
T operator()(ll l, ll r) {
if (l < 0)
l = 0;
if (r >= size)
r = size - 1;
if (l > r)
return Add.I;
return s[r + 1] - s[l]; // for ADD
}
};
using sumll = Sum<ll>;
template <class T> struct Sum2 {
public:
V<V<T>> v, s;
ll RowSize, ColumnSize;
Action<T> Add;
Sum2(V<V<T>> v, Action<T> Add = ADD<T>)
: v(v), RowSize(v.sz), ColumnSize(v.sz ? v[0].sz : 0), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(RowSize + 1, V<T>(ColumnSize, Add.I)); }
void Calc() {
REP1(r, RowSize) {
REP1(c, ColumnSize) {
s[r][c] =
v[r - 1][c - 1] + operator()(r, c - 1) + operator()(r - 1, c) -
operator()(r - 1, c - 1);
}
}
}
T operator()(ll r, ll c) { return operator()(0, 0, r, c); }
T operator()(ll r1, ll c1, ll r2, ll c2) {
if (r1 < 0)
r1 = 0;
if (c1 < 0)
c1 = 0;
if (r2 >= RowSize)
r2 = RowSize - 1;
if (c2 >= ColumnSize)
c2 = ColumnSize - 1;
if (r1 > r2)
return Add.I;
if (c1 > c2)
return Add.I;
return s[r2 + 1][c2 + 1] - s[r2 + 1][c1] - s[r1][c2 + 1] + s[r1][c1];
}
};
using sum2ll = Sum2<ll>;
template <class T> struct Point2 {
public:
V<V<T>> v;
ll h, w;
Point2() : h(0), w(0) {}
Point2(ll h, ll w) : h(h), w(w) { asn(h, w); }
Point2(ll h, ll w, T val) : h(h), w(w) { asn(h, w, val); }
void assign(ll h, ll w) { v.asn(h, V<T>(w)); }
void assign(ll h, ll w, ll val) { v.asn(h, V<T>(w, val)); }
T &operator()(ll h, ll w) { return v[h][w]; }
T &operator()(pl p) { return v[p.fi][p.se]; }
};
template <class T> using P2 = Point2<T>;
template <ll Mod> struct Modll {
public:
ll v;
Modll() : v(0) {}
Modll(ll _v) { set(_v % Mod + Mod); }
Modll &set(ll _v) {
v = (_v < Mod) ? _v : (_v - Mod);
return *this;
}
Modll pow(ll n) const {
Modll x = *this, ans = 1;
while (n) {
if (n & 1)
ans *= x;
x *= x;
n >>= 1;
}
return ans;
}
Modll inverse() const { return (*this).pow(Mod - 2); }
Modll operator+(const Modll &m) const { return Modll().set(v + m.v); }
Modll operator-(const Modll &m) const { return Modll().set(Mod + v - m.v); }
Modll operator*(const Modll &m) const {
return Modll().set((ull(v) * m.v) % Mod);
}
Modll operator/(const Modll &m) const { return *this * m.inv; }
Modll &operator+=(const Modll &m) { return *this = *this + m; }
Modll &operator-=(const Modll &m) { return *this = *this - m; }
Modll &operator*=(const Modll &m) { return *this = *this * m; }
Modll &operator/=(const Modll &m) { return *this = *this / m; }
Modll operator-() const { return Modll(0) - *this; }
explicit operator bool() const { return v != 0; }
friend ostream &operator<<(ostream &out, const Modll &m) {
return out << m.v;
}
};
using mll = Modll<MOD>;
using vmll = V<mll>;
using vvmll = V<vmll>;
using vvvmll = V<vvmll>;
template <class T> T vmin(V<T> v) {
T tmp = MIN<T>.I;
ROR(v, i) emin(tmp, i);
return tmp;
}
template <class T, class... Args> T vmin(V<T> v, Args... args) {
T tmp = vmin(args...);
return min(vmin(v), tmp);
}
template <class T> T vmax(V<T> v) {
T tmp = MAX<T>.I;
ROR(v, i) emax(tmp, i);
return tmp;
}
template <class T, class... Args> T vmax(V<T> v, Args... args) {
T tmp = vmax(args...);
return max(vmax(v), tmp);
}
template <class T> T vgcd(V<T> v) {
T tmp = GCD<T>.I;
ROR(v, i) egcd(tmp, i);
return tmp;
}
template <class T, class... Args> T vgcd(V<T> v, Args... args) {
T tmp = vgcd(args...);
return gcd(vgcd(v), tmp);
}
template <class T> T vlcm(V<T> v) {
T tmp = LCM<T>.I;
ROR(v, i) elcm(tmp, i);
return tmp;
}
template <class T, class... Args> T vlcm(V<T> v, Args... args) {
T tmp = vlcm(args...);
return lcm(vlcm(v), tmp);
}
vmll MFactMemo(2, 1);
vmll MIFactMemo(2, 1);
mll mFact(ll n) {
if (MFactMemo.sz <= n) {
ll oldsize = MFactMemo.sz;
MFactMemo.res(n + 1, 1);
FOR(i, oldsize, n) MFactMemo[i] = MFactMemo[i - 1] * i;
}
return MFactMemo[n];
}
mll miFact(ll n) {
if (MIFactMemo.sz <= n) {
ll oldsize = MIFactMemo.sz;
MIFactMemo.res(n + 1, 1);
MIFactMemo.bk = mFact(n).inv;
rFOR(i, oldsize + 1, n) MIFactMemo[i - 1] = MIFactMemo[i] * i;
}
return MIFactMemo[n];
}
mll mComb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return mFact(n) * miFact(k) * miFact(n - k);
}
ll LIS(vll v, ll m = 0) {
if (v.sz > 0) {
ll ans = 0;
vll dp(v.sz, INF);
FOR(i, 0, v.sz - 1) { dp[m ? UPB(dp, v[i]) : LOWB(dp, v[i])] = v[i]; }
FOR(i, 0, v.sz - 1) {
if (dp[i] == INF)
break;
ans++;
}
return ans;
} else {
return 0;
}
}
void PCmprs(vll &v) {
if (v.sz == 0)
return;
vll vv(v);
IOTA(vv, 0);
sort(vv.bgn, vv.en, [&](ll v1, ll v2) { return v[v1] < v[v2]; });
IOTA(v, 0);
sort(v.bgn, v.en, [&](ll v1, ll v2) { return vv[v1] < vv[v2]; });
return;
}
ll BblCnt(vll v) {
PCmprs(v);
SegT<ll> b(v.sz, 0);
ll ans = 0;
REP(i, v.sz) {
ans += (i - b.que(0, v[i]));
b.add(v[i], 1);
}
return ans;
}
ll Bsrch(function<bool(ll x)> f, ll mi, ll ma) {
ll ng = mi - 1, ok = ma, mid;
while (ok - ng > 1) {
mid = (ng + ok) / 2;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T>
V<V<T>> MultiMatrix(V<V<T>> A, V<V<T>> B, Action<T> Mul = MUL<T>,
Action<T> Add = ADD<T>) {
V<V<T>> ans;
ll ii = A.sz;
if (!ii)
return ans;
ll jj = A[0].sz;
if (!jj)
return ans;
ll jj2 = B.sz;
if (!jj2)
return ans;
if (jj != jj2)
return ans;
ll kk = B[0].sz;
if (!kk)
return ans;
ans.asn(ii, V<T>(kk, 0));
REP(i, ii) {
REP(k, kk) {
REP(j, jj) { ans[i][k] = Add(ans[i][k], Mul(A[i][j], B[j][k])); }
}
}
return ans;
}
vvll CombMemo(1000, vll(1000, -1));
ll Comb(ll n, ll k) {
if ((n < 0) || (k < 0))
return 0;
if (CombMemo[n][k] == -1) {
if (n < k)
CombMemo[n][k] = 0;
else {
if (n == 0)
CombMemo[n][k] = 1;
else if (k == 0)
CombMemo[n][k] = 1;
else if (n == k)
CombMemo[n][k] = 1;
else
CombMemo[n][k] = Comb(n - 1, k - 1) + Comb(n - 1, k);
}
}
return CombMemo[n][k];
}
template <class T> map<T, ll> Dict(V<T> v) {
map<T, ll> m;
if (!v.sz)
return m;
SORT(v);
UNIQUE(v);
REP(i, v.sz) { m[v[i]] = i; }
return m;
}
template <class T> vll Cmprs(V<T> v) {
auto m = Dict(v);
vll ans(v.sz);
REP(i, v.sz) { ans[i] = m[v[i]]; }
return ans;
}
template <class T> auto vecn(T val) { return val; }
template <class... Args> auto vecn(ll val, Args... args) {
auto tmp = vecn(args...);
return V<decltype(tmp)>(val, tmp);
}
void Solve();
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
Solve();
}
void Solve() {
li(n, m);
vli(m, a);
vll d(n, 0), dp(n + 1, 0);
REP(i, n + 1) { d[i] = 0; }
REP(i, m) { d[a[i]] = 1; }
dp[0] = 1;
REP1(i, n) {
// cout << d[i] << " ";
if (d[i] == 0) {
if (i > 1) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
// cout << "!";
} else {
dp[i] = dp[i - 1];
}
}
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vvll = V<vll>;
using vvvll = V<vvll>;
using pl = P<ll, ll>;
using tl = TP<ll, ll, ll>;
using vpl = V<pl>;
using vvpl = V<vpl>;
using vtl = V<tl>;
using vvtl = V<vtl>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpl = queue<pl>;
using stll = stack<ll>;
using stpl = stack<pl>;
using mapll = map<ll, ll>;
using setll = set<ll>;
using pqll = priority_queue<ll>;
#define int ll
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define sz size()
#define bgn begin()
#define en end()
#define asn assign
#define emp empty()
#define fr front()
#define bk back()
#define clr clear()
#define ins insert
#define ers erase
#define res resize
#define tp top()
#define p_q priority_queue
#define inv inverse()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, a) FOR((i), 0, (ll)(a)-1)
#define REP0(i, a) FOR((i), 0, (ll)(a))
#define REP1(i, a) FOR((i), 1, (ll)(a))
#define rREP(i, a) rFOR((i), 0, (ll)(a)-1)
#define rREP0(i, a) rFOR((i), 0, (ll)(a))
#define rREP1(i, a) rFOR((i), 1, (ll)(a))
#define ROR(v, i) for (auto &(i) : (v))
#define IOTA(a, n) iota((a).bgn, (a).en, (n))
#define SORT(a) sort((a).bgn, (a).en)
#define rSORT(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bgn, (a).en), (a).en)
#define PREVP(a) prev_permutation((a).bgn, (a).en)
#define NEXTP(a) next_permutation((a).bgn, (a).en)
#define BINS(a, b) binary_search((a).bgn, (a).en, (b))
#define LOWB(a, b) (lower_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define UPB(a, b) (upper_bound((a).bgn, (a).en, (b)) - (a).bgn)
#define CNT(a, b) count((a).bgn, (a).en, b)
#define SUM(a) accumulate((a).bgn, (a).en, 0)
#define REV(a) reverse((a).bgn, (a).en)
#define REGS(a, b) regex_search((a), regex(b))
#define REGM(a, b) regex_match((a), regex(b))
#define yn(a) cout << ((a) ? "yes" : "no") << "\n";
#define Yn(a) cout << ((a) ? "Yes" : "No") << "\n";
#define YN(a) cout << ((a) ? "YES" : "NO") << "\n";
#define imp(a) cout << ((a) ? "possible" : "impossible") << "\n";
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << "\n";
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << "\n";
#define fs(a) cout << ((a) ? "second" : "first") << "\n";
#define Fs(a) cout << ((a) ? "Second" : "First") << "\n";
#define FS(a) cout << ((a) ? "SECOND" : "FIRST") << "\n";
#define sak cout << "\n";
#define sas cout << " ";
#define sat cout << "\t";
#define dbg(a) cerr << (#a) << ": " << (a) << "\n";
#define dbgs(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__);
#define c2l(a) ((ll)(a - 48))
#define a2l(a) ((ll)(a - 97))
#define A2l(a) ((ll)(a - 65))
#define l2c(a) ((char)(a + 48))
#define l2a(a) ((char)(a + 97))
#define l2A(a) ((char)(a + 65))
#define DigN2(a) ((llabs(a) == 0) ? (1) : ((ll)(log2(double(llabs(a)))) + 1))
#define DigN10(a) ((llabs(a) == 0) ? (1) : ((ll)(log10(double(llabs(a)))) + 1))
#define Dig2(a, b) (((a) >> (b)) & 1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (double)(b))))) % 10)
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & (-(a)))
#define vin(v) \
ROR((v), (i)) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vllin2(a, b, N) \
vll(a)(N), (b)(N); \
REP(i, N) { cin >> (a)[i] >> (b)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define rdn(a, b) ((a) / (b))
#define rou(a, b) \
((((double(a) / double(b)) - ((a) / (b))) < 0.5) ? ((a) / (b)) \
: (((a) / (b)) + 1))
#define rup(a, b) ((((a) % (b)) == 0) ? ((a) / (b)) : (((a) / (b)) + 1))
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define powll(a, b) (ll)(pow((double)(a), (double)(b)))
#define Triangle(x1, y1, x2, y2, x3, y3) \
(((x1) - (x2)) * ((y1) - (y3)) - ((x1) - (x3)) * ((y1) - (y2)))
#define svll SumV<ll>
#define svvll SumV2<ll>
#define li(...) \
ll __VA_ARGS__; \
Input(__VA_ARGS__);
#define si(...) \
str __VA_ARGS__; \
Input(__VA_ARGS__);
#define vli(size, ...) \
vll __VA_ARGS__; \
vInput(size, __VA_ARGS__);
#define vsi(size, ...) \
vs __VA_ARGS__; \
vInput(size, __VA_ARGS__);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = 924844033;
// const ll MOD = 9007199254740881;
const ll INF = 1LL << 60; // 1.15e18
const double PI = acos(-1.0);
const vll DX = {0, -1, 0, 1, 0, -1, 1, 1, -1};
const vll DY = {0, 0, -1, 0, 1, -1, -1, 1, 1};
const str alp = "abcdefghijklmnopqrstuvwxyz";
const str ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
void Input() {}
template <class Var, class... Args> void Input(Var &var, Args &...args) {
cin >> var;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.res(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size, args...);
REP(i, size) vInputNum(i, args...);
}
template <class S, class T>
ostream &operator<<(ostream &out, const P<S, T> &p) {
return out << "[" << p.fi << ", " << p.se << "]";
}
template <class T> ostream &operator<<(ostream &out, V<T> &v) {
if (v.emp)
return out << "{}";
else {
auto itr = v.bgn;
out << "{" << *itr;
itr++;
while (itr != v.en) {
out << ", " << *itr;
itr++;
}
out << "}";
return out;
}
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &m) {
if (m.emp)
return out << "<[]>";
else {
auto itr = m.bgn;
out << "< [" << (itr->fi) << ": " << (itr->se);
itr++;
while (itr != m.en) {
out << "], [" << (itr->fi) << ": " << (itr->se);
itr++;
}
out << "] >";
return out;
}
}
template <class T> ostream &operator<<(ostream &out, const set<T> &s) {
if (s.emp)
return out << "<>";
else {
auto itr = s.bgn;
out << "<" << *itr;
itr++;
while (itr != s.en) {
out << ", " << *itr;
itr++;
}
out << ">";
return out;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head head, Body... body) {
cout << head << " ";
say(body...);
}
void sal() { cout << "\n"; }
template <class... Args> void sal(Args... args) {
say(args...);
cout << "\n";
}
void day() {}
template <class T> void day(T t) { cerr << t; }
template <class Head, class... Body> void day(Head head, Body... body) {
cerr << head << " ";
day(body...);
}
void dal() { cerr << "\n"; }
template <class... Args> void dal(Args... args) {
day(args...);
cerr << "\n";
}
void salv() {}
template <class T> void salv(V<T> v) {
if (v.emp)
sal();
else {
auto itr = v.bgn;
say(*itr);
itr++;
while (itr != v.en) {
sas;
say(*itr);
itr++;
}
sak;
}
}
template <class T, class... Args> void salv(V<T> v, Args... args) {
salv(v);
salv(args...);
}
void salv2() {}
template <class T> void salv2(V<V<T>> v) {
if (v.emp)
sal();
else {
ROR(v, i) salv(i);
}
}
template <class T, class... Args> void salv2(V<V<T>> v, Args... args) {
salv2(v);
salv2(args...);
}
template <class Monoid> struct Action {
public:
Monoid I;
function<Monoid(Monoid, Monoid)> A;
Action(Monoid I, function<Monoid(Monoid, Monoid)> A) : I(I), A(A) {}
Monoid operator()() { return I; }
Monoid operator()(Monoid x) { return x; }
Monoid operator()(Monoid l, Monoid r) { return A(l, r); }
template <class... Args> Monoid operator()(Monoid x, Args... args) {
Monoid tmp = operator()(args...);
return A(x, tmp);
}
};
template <class T> Action<T> ADD = Action<T>(0, [](T l, T r) { return l + r; });
template <>
Action<str> ADD<str> = Action<str>("", [](str l, str r) { return l + r; });
template <class T1, class T2>
Action<P<T1, T2>> ADD<P<T1, T2>> =
Action<P<T1, T2>>(mp(ADD<T1>.I, ADD<T2>.I), [](P<T1, T2> l, P<T1, T2> r) {
return mp(l.fi + r.fi, l.se + r.se);
});
template <class T> Action<T> MUL = Action<T>(1, [](T l, T r) { return l * r; });
template <class T> Action<T> OR = Action<T>(0, [](T l, T r) { return l | r; });
template <class T> Action<T> XOR = Action<T>(0, [](T l, T r) { return l ^ r; });
template <class T>
Action<T> AND = Action<T>(((ll)(1) << 63) - 1, [](T l, T r) { return l & r; });
template <>
Action<bool> AND<bool> =
Action<bool>(true, [](bool l, bool r) { return l & r; });
template <>
Action<ull> AND<ull> =
Action<ull>(((ull)(1) << 63) - 1, [](ull l, ull r) { return l & r; });
template <class T>
Action<T> MIN = Action<T>(INF, [](T l, T r) { return (l < r) ? l : r; });
template <class T>
Action<T> MAX = Action<T>(-INF, [](T l, T r) { return (l > r) ? l : r; });
template <class T>
Action<T> GCD = Action<T>(0, [](T l, T r) {
if (l < r) {
l ^= r;
r ^= l;
l ^= r;
}
return (r ? GCD<T>(r, l % r) : l);
});
template <class T>
Action<T> LCM = Action<T>(1, [](T l, T r) { return (l * r) / GCD<T>(l, r); });
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head head, Body... body) {
auto tmp = Min(body...);
return (head < tmp) ? head : tmp;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> auto Max(Head head, Body... body) {
auto tmp = Max(body...);
return (head > tmp) ? head : tmp;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll gcd(ll head) { return head; }
template <class... Body> ll gcd(ll head, Body... body) {
return gcd(head, gcd(body...));
}
ll lcm(ll head) { return head; }
template <class... Body> ll lcm(ll head, Body... body) {
return lcm(head, lcm(body...));
}
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UFT() {}
UFT(const UFT &uft) {}
UFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
struct pUFT {
public:
ll tsize;
ll now;
vll par;
vll rank;
vll mtime;
vvll sizepi;
vvll sizepv;
pUFT() {}
pUFT(const pUFT &puft) {}
pUFT(ll tsizeget) {
tsize = tsizeget;
now = 0;
par.asn(tsize, -1);
rank.asn(tsize, 0);
mtime.asn(tsize, INF);
sizepi.asn(tsize, {0});
sizepv.asn(tsize, {1});
}
ll root(ll x, ll t) { return (mtime[x] > t) ? x : root(par[x], t); }
bool same(ll x, ll y, ll t) { return root(x, t) == root(y, t); }
ll merge(ll x, ll y) {
now++;
x = root(x, now);
y = root(y, now);
if (x != y) {
if (rank[x] < rank[y]) {
par[y] += par[x];
sizepi[y].pb(now);
sizepv[y].pb(-par[y]);
par[x] = y;
mtime[x] = now;
} else {
par[x] += par[y];
sizepi[x].pb(now);
sizepv[x].pb(-par[x]);
par[y] = x;
mtime[y] = now;
if (rank[x] == rank[y])
rank[x]++;
}
}
return now;
}
ll size(ll x, ll t) {
x = root(x, t);
return sizepv[x][UPB(sizepi[x], t) - 1];
}
};
struct wUFT {
public:
ll tsize;
ll mode;
vll par;
vll rank;
vll dweight;
wUFT() {}
wUFT(const wUFT &wuft) {}
wUFT(ll tsizeget, ll modeget = 0) {
tsize = tsizeget;
mode = modeget;
par.asn(tsize, -1);
if (!mode)
rank.res(tsize, 0);
dweight.asn(tsize, 0);
}
ll root(ll x) {
if (par[x] < 0)
return x;
else {
ll r = root(par[x]);
dweight[x] += dweight[par[x]];
return par[x] = r;
}
}
ll weight(ll x) {
root(x);
return dweight[x];
}
ll diff(ll x, ll y) { return weight(y) - weight(x); }
bool isRoot(ll x) { return x == root(x); }
bool same(ll x, ll y) { return root(x) == root(y); }
void merge(ll x, ll y, ll w) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] = x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
dweight[x] = -w;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
dweight[y] = w;
}
}
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename valtype> class SegT {
public:
ll size;
vector<valtype> v;
valtype initv;
function<valtype(valtype x, valtype y)> calc;
SegT() {}
SegT(const SegT &segt) {}
SegT(ll sizeget, ll modeget = 0) {
sizeset(sizeget);
modeset(modeget);
init();
}
SegT(vector<valtype> cpyvec, ll modeget = 0) {
sizeset(cpyvec.sz);
modeset(modeget);
init();
copy(cpyvec);
}
SegT(ll sizeget, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(sizeget);
initv = initvget;
calc = calcget;
init();
}
SegT(vector<valtype> cpyvec, valtype initvget,
function<valtype(valtype x, valtype y)> calcget) {
sizeset(cpyvec.sz);
initv = initvget;
calc = calcget;
init();
copy(cpyvec);
}
void sizeset(ll rsize) {
size = DigN2(rsize);
if (rsize == Pow2(size - 1))
size--;
return;
}
void modeset(ll mode) {
switch (mode) {
case 0:
initv = 0;
calc = [](valtype x, valtype y) { return x + y; };
break;
case 1:
initv = INF;
calc = [](valtype x, valtype y) { return min(x, y); };
break;
case 2:
initv = -INF;
calc = [](valtype x, valtype y) { return max(x, y); };
break;
}
return;
}
void init() { v.asn(Pow2(size + 1) - 1, initv); }
void copy(vector<valtype> cpyvec) {
REP(i, min(cpyvec.sz, Pow2(size))) set(i, cpyvec[i]);
}
ll i2v(ll i) const {
if (i < 0 || i >= Pow2(size))
return -1;
return Pow2(size) + i - 1;
}
ll top(ll i) const {
if (i == 0)
return -1;
return (i - 1) / 2;
}
pl bot(ll i) const {
if (i + 1 >= Pow2(size))
return mp(-1, -1);
return mp(2 * i + 1, 2 * i + 2);
}
void set(ll i, valtype x) {
i = i2v(i);
v[i] = x;
while (i > 0) {
i = top(i);
v[i] = calc(v[bot(i).fi], v[bot(i).se]);
}
return;
}
void add(ll i, valtype x) {
set(i, v[i2v(i)] + x);
return;
}
valtype operator[](const ll &i) const { return v[i2v(i)]; }
// valtype que(ll a = 0, ll b = Pow2(size) - 1) {
valtype que(ll a, ll b) {
if (a == b)
return v[i2v(a)];
if (a > b)
return initv; // swap(a, b);
valtype ans = initv;
ll ai = i2v(a);
ll bi = i2v(b);
FOR(i, 1, size + 1) {
if (a > b)
break;
if (a % Pow2(i)) {
ans = calc(ans, v[ai]);
a += Pow2(i - 1);
ai = top(ai) + 1;
} else {
ai = top(ai);
}
if (a > b)
break;
if ((b + 1) % Pow2(i)) {
ans = calc(ans, v[bi]);
b -= Pow2(i - 1);
bi = top(bi) - 1;
} else {
bi = top(bi);
}
if (a > b)
break;
}
return ans;
}
valtype que(ll b) { return que(0, b); }
valtype que() { return que(0, Pow2(size) - 1); }
};
template <typename lentype> class Graph {
public:
ll size;
ll mode;
ll mapmode;
lentype zlen;
lentype ilen;
vector<map<ll, ll>> v2n;
vvll n2v;
vector<vector<lentype>> Edge;
vector<pair<lentype, ll>> Primresult;
Graph() {}
Graph(const Graph &graph) {}
Graph(ll sizeget = 0, ll mapmodeget = 0, ll modeget = 0, lentype zlenget = 0,
lentype ilenget = INF) {
size = sizeget;
mapmode = mapmodeget;
mode = modeget;
zlen = zlenget;
ilen = ilenget;
init();
}
void init() {
Edge.res(size);
v2n.res(size);
n2v.res(size);
Primresult.asn(size, mp(ilen, -1));
}
lentype lenplus(lentype l, lentype r) { return l + r; }
lentype lenequal(lentype l, lentype r) { return l == r; }
lentype lenlcr(lentype l, lentype r) { return l < r; }
ll addV(ll vs) {
size += vs;
init();
return size;
}
void caddE(ll x, ll y, lentype c) {
if (mapmode)
v2n[x][y] = Edge[x].sz;
Edge[x].pb(c);
n2v[x].pb(y);
}
void csetE(ll x, ll y, lentype c) {
if (mapmode)
Edge[x][v2n[x][y]] = c;
}
void cersE(ll x, ll y) {
if (mapmode) {
ll n = v2n[x][y];
Edge[x][n] = ilen;
n2v[x][n] = -1;
v2n[x].ers(y);
}
}
void addE(ll x, ll y, lentype c) {
caddE(x, y, c);
if (!mode)
caddE(y, x, c);
}
void setE(ll x, ll y, lentype c) {
csetE(x, y, c);
if (!mode)
csetE(y, x, c);
}
void ersE(ll x, ll y, lentype c) {
cersE(x, y, c);
if (!mode)
cersE(y, x, c);
}
lentype getE(ll x, ll y) {
if (mapmode) {
if (v2n[x].count(y)) {
return Edge[x][v2n[x][y]];
}
}
return ilen;
}
ll getVsz(ll x) { return Edge[x].sz; }
pair<lentype, ll> getV(ll x, ll n) {
if (n >= getVsz(x))
return mp(ilen, -1);
return mp(Edge[x][n], n2v[x][n]);
}
vector<pair<lentype, vll>> Dijk(ll x) {
vector<pair<lentype, vll>> result(size);
REP(i, size) {
result[i].fi = ilen;
result[i].se = {-1};
}
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
result[x].fi = zlen;
result[x].se = {-1};
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].fi = lenplus(result[now.se].fi, nowlv.fi);
result[nowlv.se].se = {now.se};
Q.set(nowlv.se, mp(result[nowlv.se].fi, nowlv.se));
} else if (lenequal(lenplus(result[now.se].fi, nowlv.fi),
result[nowlv.se].fi)) {
result[nowlv.se].se.pb(now.se);
}
}
}
}
return result;
}
lentype Prim(ll x = 0) {
lentype ans = zlen;
vll stat(size, 0);
pair<lentype, ll> now;
pair<lentype, ll> nowlv;
SegT<pair<lentype, ll>> Q(size, mp(ilen, -1),
[](pair<lentype, ll> l, pair<lentype, ll> r) {
if (l.se == -1)
return r;
if (r.se == -1)
return l;
return l.fi < r.fi ? l : r;
});
Q.set(x, mp(zlen, x));
Primresult[x] = mp(zlen, -1);
while (Q.que(0, size - 1).se != -1) {
now = Q.que(0, size - 1);
Q.set(now.se, mp(ilen, -1));
stat[now.se] = 1;
ans = lenplus(ans, Primresult[now.se].fi);
REP(i, getVsz(now.se)) {
nowlv = getV(now.se, i);
if (stat[nowlv.se])
continue;
if (Q[nowlv.se].se == -1) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
} else {
if (lenlcr(nowlv.fi, Primresult[nowlv.se].fi)) {
Primresult[nowlv.se] = mp(nowlv.fi, now.se);
Q.set(nowlv.se, mp(Primresult[nowlv.se].fi, nowlv.se));
}
}
}
}
return ans;
}
};
/*template <class Type> class DP {
public:
vector<Type> v;
Type initv;
vll size, block;
DP() {}
DP(const DP &dp) {}
template<class... Args> DP(Args... args) {
block.asn(1, 1);
Initialize(args...);
}
void Initialize(Type initv_) {
initv = initv_;
v.asn(block.bk, initv);
}
template<class... Args> void Initialize(ll val, Args... args) {
size.pb(val);
block.pb(block.bk*val);
Initialize(args...);
}
};*/
pl Bezout(ll a, ll b) {
if (b != 0) {
pl xy;
xy = Bezout(b, a % b);
return mp(xy.se, xy.fi - ((a / b) * xy.se));
} else {
return mp(1, 0);
}
}
pl Bez(ll a, ll b, ll c) {
pl xy;
ll x, y, z, gc;
xy = Bezout(a, b);
gc = gcd(a, b);
if (c % gc != 0)
return mp(-1, -1);
x = xy.fi * (c / gc);
y = xy.se * (c / gc);
if (x < 0)
z = rup(-x, (b / gc));
if (x >= 0)
z = -x / (b / gc);
x += z * (b / gc);
y -= z * (a / gc);
return mp(x, y);
}
ll DigS10(ll n) {
ll ans = 0;
while (1) {
ans += n % 10;
n /= 10;
if (!n)
break;
}
return ans;
}
ll isP(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n) + 1) {
if (n % i == 0)
return 0;
}
return 1;
}
ll Tot(ll n) {
if (n <= 0)
return 0;
ll ans = n, x = 2;
while (x * x <= n) {
if (n % x == 0) {
ans -= ans / x;
while (n % x == 0)
n /= x;
}
x++;
}
if (n > 1)
ans -= ans / n;
return ans;
}
template <class T> struct Sum {
public:
V<T> v, s;
ll size;
Action<T> Add;
Sum(V<T> v, Action<T> Add = ADD<T>) : v(v), size(v.sz), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(size + 1, Add.I); }
void Calc() { REP(i, size) s[i + 1] = Add(s[i], v[i]); }
T operator()(ll x) { return operator()(0, x); }
T operator()(ll l, ll r) {
if (l < 0)
l = 0;
if (r >= size)
r = size - 1;
if (l > r)
return Add.I;
return s[r + 1] - s[l]; // for ADD
}
};
using sumll = Sum<ll>;
template <class T> struct Sum2 {
public:
V<V<T>> v, s;
ll RowSize, ColumnSize;
Action<T> Add;
Sum2(V<V<T>> v, Action<T> Add = ADD<T>)
: v(v), RowSize(v.sz), ColumnSize(v.sz ? v[0].sz : 0), Add(Add) {
Init();
Calc();
}
void Init() { s.asn(RowSize + 1, V<T>(ColumnSize, Add.I)); }
void Calc() {
REP1(r, RowSize) {
REP1(c, ColumnSize) {
s[r][c] =
v[r - 1][c - 1] + operator()(r, c - 1) + operator()(r - 1, c) -
operator()(r - 1, c - 1);
}
}
}
T operator()(ll r, ll c) { return operator()(0, 0, r, c); }
T operator()(ll r1, ll c1, ll r2, ll c2) {
if (r1 < 0)
r1 = 0;
if (c1 < 0)
c1 = 0;
if (r2 >= RowSize)
r2 = RowSize - 1;
if (c2 >= ColumnSize)
c2 = ColumnSize - 1;
if (r1 > r2)
return Add.I;
if (c1 > c2)
return Add.I;
return s[r2 + 1][c2 + 1] - s[r2 + 1][c1] - s[r1][c2 + 1] + s[r1][c1];
}
};
using sum2ll = Sum2<ll>;
template <class T> struct Point2 {
public:
V<V<T>> v;
ll h, w;
Point2() : h(0), w(0) {}
Point2(ll h, ll w) : h(h), w(w) { asn(h, w); }
Point2(ll h, ll w, T val) : h(h), w(w) { asn(h, w, val); }
void assign(ll h, ll w) { v.asn(h, V<T>(w)); }
void assign(ll h, ll w, ll val) { v.asn(h, V<T>(w, val)); }
T &operator()(ll h, ll w) { return v[h][w]; }
T &operator()(pl p) { return v[p.fi][p.se]; }
};
template <class T> using P2 = Point2<T>;
template <ll Mod> struct Modll {
public:
ll v;
Modll() : v(0) {}
Modll(ll _v) { set(_v % Mod + Mod); }
Modll &set(ll _v) {
v = (_v < Mod) ? _v : (_v - Mod);
return *this;
}
Modll pow(ll n) const {
Modll x = *this, ans = 1;
while (n) {
if (n & 1)
ans *= x;
x *= x;
n >>= 1;
}
return ans;
}
Modll inverse() const { return (*this).pow(Mod - 2); }
Modll operator+(const Modll &m) const { return Modll().set(v + m.v); }
Modll operator-(const Modll &m) const { return Modll().set(Mod + v - m.v); }
Modll operator*(const Modll &m) const {
return Modll().set((ull(v) * m.v) % Mod);
}
Modll operator/(const Modll &m) const { return *this * m.inv; }
Modll &operator+=(const Modll &m) { return *this = *this + m; }
Modll &operator-=(const Modll &m) { return *this = *this - m; }
Modll &operator*=(const Modll &m) { return *this = *this * m; }
Modll &operator/=(const Modll &m) { return *this = *this / m; }
Modll operator-() const { return Modll(0) - *this; }
explicit operator bool() const { return v != 0; }
friend ostream &operator<<(ostream &out, const Modll &m) {
return out << m.v;
}
};
using mll = Modll<MOD>;
using vmll = V<mll>;
using vvmll = V<vmll>;
using vvvmll = V<vvmll>;
template <class T> T vmin(V<T> v) {
T tmp = MIN<T>.I;
ROR(v, i) emin(tmp, i);
return tmp;
}
template <class T, class... Args> T vmin(V<T> v, Args... args) {
T tmp = vmin(args...);
return min(vmin(v), tmp);
}
template <class T> T vmax(V<T> v) {
T tmp = MAX<T>.I;
ROR(v, i) emax(tmp, i);
return tmp;
}
template <class T, class... Args> T vmax(V<T> v, Args... args) {
T tmp = vmax(args...);
return max(vmax(v), tmp);
}
template <class T> T vgcd(V<T> v) {
T tmp = GCD<T>.I;
ROR(v, i) egcd(tmp, i);
return tmp;
}
template <class T, class... Args> T vgcd(V<T> v, Args... args) {
T tmp = vgcd(args...);
return gcd(vgcd(v), tmp);
}
template <class T> T vlcm(V<T> v) {
T tmp = LCM<T>.I;
ROR(v, i) elcm(tmp, i);
return tmp;
}
template <class T, class... Args> T vlcm(V<T> v, Args... args) {
T tmp = vlcm(args...);
return lcm(vlcm(v), tmp);
}
vmll MFactMemo(2, 1);
vmll MIFactMemo(2, 1);
mll mFact(ll n) {
if (MFactMemo.sz <= n) {
ll oldsize = MFactMemo.sz;
MFactMemo.res(n + 1, 1);
FOR(i, oldsize, n) MFactMemo[i] = MFactMemo[i - 1] * i;
}
return MFactMemo[n];
}
mll miFact(ll n) {
if (MIFactMemo.sz <= n) {
ll oldsize = MIFactMemo.sz;
MIFactMemo.res(n + 1, 1);
MIFactMemo.bk = mFact(n).inv;
rFOR(i, oldsize + 1, n) MIFactMemo[i - 1] = MIFactMemo[i] * i;
}
return MIFactMemo[n];
}
mll mComb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return mFact(n) * miFact(k) * miFact(n - k);
}
ll LIS(vll v, ll m = 0) {
if (v.sz > 0) {
ll ans = 0;
vll dp(v.sz, INF);
FOR(i, 0, v.sz - 1) { dp[m ? UPB(dp, v[i]) : LOWB(dp, v[i])] = v[i]; }
FOR(i, 0, v.sz - 1) {
if (dp[i] == INF)
break;
ans++;
}
return ans;
} else {
return 0;
}
}
void PCmprs(vll &v) {
if (v.sz == 0)
return;
vll vv(v);
IOTA(vv, 0);
sort(vv.bgn, vv.en, [&](ll v1, ll v2) { return v[v1] < v[v2]; });
IOTA(v, 0);
sort(v.bgn, v.en, [&](ll v1, ll v2) { return vv[v1] < vv[v2]; });
return;
}
ll BblCnt(vll v) {
PCmprs(v);
SegT<ll> b(v.sz, 0);
ll ans = 0;
REP(i, v.sz) {
ans += (i - b.que(0, v[i]));
b.add(v[i], 1);
}
return ans;
}
ll Bsrch(function<bool(ll x)> f, ll mi, ll ma) {
ll ng = mi - 1, ok = ma, mid;
while (ok - ng > 1) {
mid = (ng + ok) / 2;
(f(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T>
V<V<T>> MultiMatrix(V<V<T>> A, V<V<T>> B, Action<T> Mul = MUL<T>,
Action<T> Add = ADD<T>) {
V<V<T>> ans;
ll ii = A.sz;
if (!ii)
return ans;
ll jj = A[0].sz;
if (!jj)
return ans;
ll jj2 = B.sz;
if (!jj2)
return ans;
if (jj != jj2)
return ans;
ll kk = B[0].sz;
if (!kk)
return ans;
ans.asn(ii, V<T>(kk, 0));
REP(i, ii) {
REP(k, kk) {
REP(j, jj) { ans[i][k] = Add(ans[i][k], Mul(A[i][j], B[j][k])); }
}
}
return ans;
}
vvll CombMemo(1000, vll(1000, -1));
ll Comb(ll n, ll k) {
if ((n < 0) || (k < 0))
return 0;
if (CombMemo[n][k] == -1) {
if (n < k)
CombMemo[n][k] = 0;
else {
if (n == 0)
CombMemo[n][k] = 1;
else if (k == 0)
CombMemo[n][k] = 1;
else if (n == k)
CombMemo[n][k] = 1;
else
CombMemo[n][k] = Comb(n - 1, k - 1) + Comb(n - 1, k);
}
}
return CombMemo[n][k];
}
template <class T> map<T, ll> Dict(V<T> v) {
map<T, ll> m;
if (!v.sz)
return m;
SORT(v);
UNIQUE(v);
REP(i, v.sz) { m[v[i]] = i; }
return m;
}
template <class T> vll Cmprs(V<T> v) {
auto m = Dict(v);
vll ans(v.sz);
REP(i, v.sz) { ans[i] = m[v[i]]; }
return ans;
}
template <class T> auto vecn(T val) { return val; }
template <class... Args> auto vecn(ll val, Args... args) {
auto tmp = vecn(args...);
return V<decltype(tmp)>(val, tmp);
}
void Solve();
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20) << fixed;
Solve();
}
void Solve() {
li(n, m);
vli(m, a);
vll d(n + 10, 0), dp(n + 10, 0);
REP(i, n + 1) { d[i] = 0; }
REP(i, m) { d[a[i]] = 1; }
dp[0] = 1;
REP1(i, n) {
// cout << d[i] << " ";
if (d[i] == 0) {
if (i > 1) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
// cout << "!";
} else {
dp[i] = dp[i - 1];
}
}
}
cout << dp[n];
}
| replace | 1,263 | 1,264 | 1,263 | 1,264 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7, MAX = 1e5;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < m; i++) {
dp[a[i]] = -1;
}
if (a[0] != 1)
dp[1] = 1;
for (int i = 2; i <= n; i++) {
if (dp[i] == -1)
continue;
if (dp[i - 1] >= 0)
dp[i] += dp[i - 1];
dp[i] %= MOD;
if (dp[i - 2] >= 0)
dp[i] += dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7, MAX = 1e5;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < m; i++) {
dp[a[i]] = -1;
}
if (!a.empty())
if (a[0] != 1)
dp[1] = 1;
if (a.empty())
dp[1] = 1;
for (int i = 2; i <= n; i++) {
if (dp[i] == -1)
continue;
if (dp[i - 1] >= 0)
dp[i] += dp[i - 1];
dp[i] %= MOD;
if (dp[i - 2] >= 0)
dp[i] += dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | replace | 17 | 18 | 17 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 2);
dp.assign(N + 1, 0);
vector<ll> m(M);
for (int i = 0; i < M; ++i)
cin >> m[i];
int idx = 0;
dp[0] = 1;
dp[1] = 1;
if (m[idx] == 1) {
dp[1] = 0;
idx++;
}
for (int i = 2; i < N + 1; ++i) {
if (m[idx] == i) {
idx++;
dp[i] = 0;
continue;
}
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 2);
dp.assign(N + 1, 0);
vector<ll> m(M + 1);
for (int i = 0; i < M; ++i)
cin >> m[i];
int idx = 0;
dp[0] = 1;
dp[1] = 1;
if (m[idx] == 1) {
dp[1] = 0;
idx++;
}
for (int i = 2; i < N + 1; ++i) {
if (m[idx] == i) {
idx++;
dp[i] = 0;
continue;
}
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
cout << dp[N] << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vec(name, num) vector<ll> name((num), 0);
#define op(i) cout << (i) << endl;
#define ip(i) cin >> (i);
#define opN cout << "No" << endl;
#define opY cout << "Yes" << endl;
#define opP cout << "Possible" << endl;
#define opI cout << "Impossible" << endl;
#define mat(name, fnum, snum) \
; \
vector<vector<ll>> name((fnum), vector<ll>((snum), 0));
#define matC(name, fnum, snum) \
; \
vector<vector<char>> name((fnum), vector<char>((snum), 0));
#define debugP \
int debug_point; \
cin >> debug_point;
#define FI first
#define SE second
const ll MOD = 1e9 + 7;
template <typename T> void putv(vector<T> &V) {
// cout << "The elements in the vector are: " << endl;
for (auto x : V)
cout << x << " ";
cout << endl;
}
ll pow_mod(ll fi, ll se, ll mod) {
if (se == 0) {
return 1;
}
if (se % 2) {
return pow_mod(fi, se - 1, mod) * fi % mod;
}
ll t = pow_mod(fi, se / 2, mod);
return t * t % mod;
}
template <class T> vector<T> getv(ll n) {
vector<T> Vector_temp;
rep(i, n) {
T input;
cin >> input;
Vector_temp.emplace_back(input);
}
return Vector_temp;
}
ll gcd(ll c, ll b) {
while (1) {
if (c % b != 0) {
ll tmp = b;
b = c % b;
c = tmp;
} else {
return b;
}
}
}
vector<pair<int, int>> Dir = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
/* <3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3*/
ll dp[100002];
int main() {
ll n, m;
cin >> n >> m;
vec(a, m);
rep(i, m) {
cin >> a[i];
dp[a[i]] = -1;
}
dp[0] = 1;
rep(i, n + 1) {
if (dp[i] >= 0) {
if (dp[i + 1] >= 0) {
dp[i + 1] += dp[i];
dp[i + 1] %= MOD;
}
if (dp[i + 2] >= 0) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
}
}
}
op(dp[n]);
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vec(name, num) vector<ll> name((num), 0);
#define op(i) cout << (i) << endl;
#define ip(i) cin >> (i);
#define opN cout << "No" << endl;
#define opY cout << "Yes" << endl;
#define opP cout << "Possible" << endl;
#define opI cout << "Impossible" << endl;
#define mat(name, fnum, snum) \
; \
vector<vector<ll>> name((fnum), vector<ll>((snum), 0));
#define matC(name, fnum, snum) \
; \
vector<vector<char>> name((fnum), vector<char>((snum), 0));
#define debugP \
int debug_point; \
cin >> debug_point;
#define FI first
#define SE second
const ll MOD = 1e9 + 7;
template <typename T> void putv(vector<T> &V) {
// cout << "The elements in the vector are: " << endl;
for (auto x : V)
cout << x << " ";
cout << endl;
}
ll pow_mod(ll fi, ll se, ll mod) {
if (se == 0) {
return 1;
}
if (se % 2) {
return pow_mod(fi, se - 1, mod) * fi % mod;
}
ll t = pow_mod(fi, se / 2, mod);
return t * t % mod;
}
template <class T> vector<T> getv(ll n) {
vector<T> Vector_temp;
rep(i, n) {
T input;
cin >> input;
Vector_temp.emplace_back(input);
}
return Vector_temp;
}
ll gcd(ll c, ll b) {
while (1) {
if (c % b != 0) {
ll tmp = b;
b = c % b;
c = tmp;
} else {
return b;
}
}
}
vector<pair<int, int>> Dir = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
/* <3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3*/
vec(dp, 100003);
int main() {
ll n, m;
cin >> n >> m;
vec(a, m);
rep(i, m) {
cin >> a[i];
dp[a[i]] = -1;
}
dp[0] = 1;
rep(i, n + 1) {
if (dp[i] >= 0) {
if (dp[i + 1] >= 0) {
dp[i + 1] += dp[i];
dp[i + 1] %= MOD;
}
if (dp[i + 2] >= 0) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD;
}
}
}
op(dp[n]);
return 0;
}
| replace | 73 | 74 | 73 | 74 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
vector<ll> dp(100010, 0);
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M);
for (int i = 0; i < M; i++) {
scanf("%d", &A[i]);
}
dp[0] = 1;
int j = 0;
for (int i = 1; i <= N; i++) {
if (i == A[j]) {
dp[i] = 0;
j++;
continue;
}
dp[i] += dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] %= mod;
}
cout << dp[N] % mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
vector<ll> dp(100010, 0);
int main() {
int N, M;
cin >> N >> M;
vector<int> A(100010);
for (int i = 0; i < M; i++) {
scanf("%d", &A[i]);
}
dp[0] = 1;
int j = 0;
for (int i = 1; i <= N; i++) {
if (i == A[j]) {
dp[i] = 0;
j++;
continue;
}
dp[i] += dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] %= mod;
}
cout << dp[N] % mod << endl;
return 0;
} | replace | 27 | 28 | 27 | 28 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int mod = 1000000007;
bool square(ll a) {
ll n = (ll)sqrt(a);
return a == n * n;
}
int digitsum(ll N, int a); // a進数におけるNの各桁の和、計算量はloga(N)
ll mpow(ll x, ll n);
ll inv_mod(ll a) { return mpow(a, mod - 2); }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }; // xとyの最大公約数
int lcm(int x, int y) { return x * y / gcd(x, y); } // xとyの最小公倍数
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
REP(i, M) cin >> a[i];
vector<int> dp(N + 1);
dp[0] = 1;
if (a[0] == 1) {
dp[1] = 0;
a.erase(a.begin());
} else
dp[1] = 1;
for (int i = 0; i < N - 1; i++) {
if (a.empty())
a.push_back(INT_MAX);
if (i + 2 == a[0]) {
dp[i + 2] = 0;
a.erase(a.begin());
} else
dp[i + 2] = (dp[i + 1] + dp[i]) % mod;
}
cout << dp[N] << endl;
}
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll mpow(ll x, ll n) { // x^n(mod division)
// ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
/*
class Fuctorical{//階乗とその逆元を求めて計算に利用するクラス
private:
vector<ll> fac;
public:
Fuctorical(ll N){
fac.push_back(1);
for(int i=0;i<N;i++) fac.push_back(fac[i]*(i+1)%mod);
}
ll fact(ll a){return fac[a];}
ll ifact(ll a){return inv_mod(fac[a]);}
ll cmb(ll a,ll b){
if(a==0&&b==0) return 1;
if(a<b||a<0) return 0;
ll tmp =ifact(a-b)*ifact(b)%mod;
return tmp*fac[a]%mod;
}
};
*/
/*
class UnionFind{//UnionFind木
private:
vector<int> Parent;
public:
UnionFind(int N){
for(int i=0;i<N;i++) Parent.push_back(-1);
}
int root(int A){
if(Parent[A]<0) return A;
return Parent[A]=root(Parent[A]);
}
int size(int A){
return -Parent[root(A)];
}
bool connect(int A,int B){
A=root(A);
B=root(B);
if(A==B) return false;
if(size(A)<size(B)) swap(A,B);
Parent[A]-=Parent[B];
Parent[B]=A;
}
};
*/ | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int mod = 1000000007;
bool square(ll a) {
ll n = (ll)sqrt(a);
return a == n * n;
}
int digitsum(ll N, int a); // a進数におけるNの各桁の和、計算量はloga(N)
ll mpow(ll x, ll n);
ll inv_mod(ll a) { return mpow(a, mod - 2); }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }; // xとyの最大公約数
int lcm(int x, int y) { return x * y / gcd(x, y); } // xとyの最小公倍数
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
if (M > 0)
REP(i, M) cin >> a[i];
else
a.push_back(INT_MAX);
vector<int> dp(N + 1);
dp[0] = 1;
if (a[0] == 1) {
dp[1] = 0;
a.erase(a.begin());
} else
dp[1] = 1;
for (int i = 0; i < N - 1; i++) {
if (a.empty())
a.push_back(INT_MAX);
if (i + 2 == a[0]) {
dp[i + 2] = 0;
a.erase(a.begin());
} else
dp[i + 2] = (dp[i + 1] + dp[i]) % mod;
}
cout << dp[N] << endl;
}
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll mpow(ll x, ll n) { // x^n(mod division)
// ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
/*
class Fuctorical{//階乗とその逆元を求めて計算に利用するクラス
private:
vector<ll> fac;
public:
Fuctorical(ll N){
fac.push_back(1);
for(int i=0;i<N;i++) fac.push_back(fac[i]*(i+1)%mod);
}
ll fact(ll a){return fac[a];}
ll ifact(ll a){return inv_mod(fac[a]);}
ll cmb(ll a,ll b){
if(a==0&&b==0) return 1;
if(a<b||a<0) return 0;
ll tmp =ifact(a-b)*ifact(b)%mod;
return tmp*fac[a]%mod;
}
};
*/
/*
class UnionFind{//UnionFind木
private:
vector<int> Parent;
public:
UnionFind(int N){
for(int i=0;i<N;i++) Parent.push_back(-1);
}
int root(int A){
if(Parent[A]<0) return A;
return Parent[A]=root(Parent[A]);
}
int size(int A){
return -Parent[root(A)];
}
bool connect(int A,int B){
A=root(A);
B=root(B);
if(A==B) return false;
if(size(A)<size(B)) swap(A,B);
Parent[A]-=Parent[B];
Parent[B]=A;
}
};
*/ | replace | 22 | 23 | 22 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define INF 100000000
using namespace std;
int main() {
int64_t N, M, step2down = 1, step1down = 1, brokepoint = 0;
cin >> N >> M;
vector<int64_t> A(M);
vector<int64_t> mem(100001, 0);
for (int i = 0; i < M; i++) {
cin >> A[i];
if (i > 0) {
if (A[i] - A[i - 1] == 1) {
cout << 0 << endl;
return 0;
}
}
}
if (A[0] == 1) {
mem[1] = 0;
brokepoint++;
} else
mem[1] = 1;
mem[0] = 1;
for (int i = 1; i < N; i++) {
if (A[brokepoint] == i + 1) {
mem[i + 1] = 0;
if (brokepoint < M - 1)
brokepoint++;
} else
mem[i + 1] = mem[i] + mem[i - 1];
mem[i + 1] %= 1000000007;
}
cout << mem[N] << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define INF 100000000
using namespace std;
int main() {
int64_t N, M, step2down = 1, step1down = 1, brokepoint = 0;
cin >> N >> M;
vector<int64_t> A(100000);
vector<int64_t> mem(100001, 0);
for (int i = 0; i < M; i++) {
cin >> A[i];
if (i > 0) {
if (A[i] - A[i - 1] == 1) {
cout << 0 << endl;
return 0;
}
}
}
if (A[0] == 1) {
mem[1] = 0;
brokepoint++;
} else
mem[1] = 1;
mem[0] = 1;
for (int i = 1; i < N; i++) {
if (A[brokepoint] == i + 1) {
mem[i + 1] = 0;
if (brokepoint < M - 1)
brokepoint++;
} else
mem[i + 1] = mem[i] + mem[i - 1];
mem[i + 1] %= 1000000007;
}
cout << mem[N] << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline T divrup(T a, T b) {
if (a % b)
return a / b + 1;
else
return a / b;
}
#define dbg_v1(i, V) \
do { \
cout << "-v1----\n"; \
rep(i, V.size()) cout << " " << i << "\t:" << V[i] << endl; \
cout << endl; \
} while (0)
#define dbg_v2(i, k, V) \
do { \
cout << "-v2----\n"; \
rep(i, V.size()) { \
rep(k, V[0].size()) cout << " " << V[i][k]; \
cout << endl; \
} \
} while (0)
// C++14 (GCC 5.4.1)
int main() {
int N, M;
cin >> N >> M;
bool is = false;
if (M <= 0) {
M = 1;
is = true;
}
vector<int> A(M);
if (is) {
A[0] = -1;
} else {
rep(i, M) cin >> A.at(i);
}
//-----------------------------------
int acnt = 0;
vector<ll> HOW(N + 1);
HOW.at(0) = 1;
if (A.at(acnt) == 1) {
HOW.at(1) = 0;
acnt++;
} else {
HOW.at(1) = 1;
}
repd(i, 2, N + 1) { // 2toN
if (A.at(acnt) == i) {
HOW.at(i) = 0;
while (acnt < M && A.at(acnt) <= i)
acnt++;
if (acnt >= M)
acnt = 0;
} else {
HOW.at(i) = (HOW.at(i - 1) + HOW.at(i - 2)) % mod;
}
}
cout << HOW[N] << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline T divrup(T a, T b) {
if (a % b)
return a / b + 1;
else
return a / b;
}
#define dbg_v1(i, V) \
do { \
cout << "-v1----\n"; \
rep(i, V.size()) cout << " " << i << "\t:" << V[i] << endl; \
cout << endl; \
} while (0)
#define dbg_v2(i, k, V) \
do { \
cout << "-v2----\n"; \
rep(i, V.size()) { \
rep(k, V[0].size()) cout << " " << V[i][k]; \
cout << endl; \
} \
} while (0)
// C++14 (GCC 5.4.1)
int main() {
int N, M;
cin >> N >> M;
bool is = false;
if (M <= 0) {
M = 1;
is = true;
}
vector<int> A(M);
if (is) {
A[0] = -1;
} else {
rep(i, M) cin >> A.at(i);
}
A.push_back(INT_MAX);
//-----------------------------------
int acnt = 0;
vector<ll> HOW(N + 1);
HOW.at(0) = 1;
if (A.at(acnt) == 1) {
HOW.at(1) = 0;
acnt++;
} else {
HOW.at(1) = 1;
}
repd(i, 2, N + 1) { // 2toN
if (A.at(acnt) == i) {
HOW.at(i) = 0;
while (acnt < M && A.at(acnt) <= i)
acnt++;
if (acnt >= M)
acnt = 0;
} else {
HOW.at(i) = (HOW.at(i - 1) + HOW.at(i - 2)) % mod;
}
}
cout << HOW[N] << endl;
return (0);
} | insert | 64 | 64 | 64 | 65 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int mx4[] = {0, 1, 0, -1};
const int my4[] = {1, 0, -1, 0};
const int mx8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int my8[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll dp[100010];
int main() {
int n, m;
cin >> n >> m;
vi a(m);
rep(i, m) cin >> a[i];
dp[0] = 1;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i == a[cnt]) {
cnt++;
continue;
}
if (i == 1)
dp[i] = 1;
else
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD;
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int mx4[] = {0, 1, 0, -1};
const int my4[] = {1, 0, -1, 0};
const int mx8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int my8[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll dp[100010];
int main() {
int n, m;
cin >> n >> m;
vi a(m);
rep(i, m) cin >> a[i];
dp[0] = 1;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (cnt < m && i == a[cnt]) {
cnt++;
continue;
}
if (i == 1)
dp[i] = 1;
else
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD;
}
cout << dp[n] << endl;
return 0;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll memo[100001];
ll fract(ll num) {
if (num == 1 || num == 0)
return 1;
if (memo[num] == -1)
memo[num] = (num * fract(num - 1)) % 1000000007;
return memo[num];
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main(void) {
int n, m;
cin >> n >> m;
vector<int> as;
for (int i = 0; i < 100001; i++) {
memo[i] = -1;
}
// cout << "koko" << endl;
for (int i = 0; i < m; i++) {
int t;
cin >> t;
as.push_back(t);
}
for (int i = 1; i < m; i++) {
if (as[i] - 1 == as[i - 1]) {
cout << 0 << endl;
return 0;
}
}
// cout << "koko0" << endl;
int start = 0;
ll ccnt = 1;
for (int i = 0; i < m + 1; i++) {
int sub = i < m ? as[i] - start - 1 : n - start;
start = as[i] + 1;
// cout << "sub:" << sub << endl;
ll sum = 1;
if (sub % 2 == 0) {
// sum += 1;
for (int j = 1; j <= sub / 2; j++) {
sum +=
fract(sub - j) * modinv(fract(j) * fract(sub - j * 2), 1000000007);
sum %= 1000000007;
}
// cout << "koko1:" << sum << endl;
} else {
// sum += 1;
for (int j = 1; j <= (sub - 1) / 2; j++) {
sum +=
fract(sub - j) * modinv(fract(j) * fract(sub - j * 2), 1000000007);
sum %= 1000000007;
}
// cout << "koko2:" << sum << endl;
}
// cout << sum << endl;
ccnt = (ccnt * sum) % 1000000007;
}
cout << ccnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll memo[100001];
ll fract(ll num) {
if (num == 1 || num == 0)
return 1;
if (memo[num] == -1)
memo[num] = (num * fract(num - 1)) % 1000000007;
return memo[num];
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main(void) {
int n, m;
cin >> n >> m;
vector<int> as;
for (int i = 0; i < 100001; i++) {
memo[i] = -1;
}
// cout << "koko" << endl;
for (int i = 0; i < m; i++) {
int t;
cin >> t;
as.push_back(t);
}
for (int i = 1; i < m; i++) {
if (as[i] - 1 == as[i - 1]) {
cout << 0 << endl;
return 0;
}
}
// cout << "koko0" << endl;
int start = 0;
ll ccnt = 1;
for (int i = 0; i < m + 1; i++) {
int sub;
if (m != 0) {
sub = i < m ? as[i] - start - 1 : n - start;
start = as[i] + 1;
} else
sub = n;
// cout << "sub:" << sub << endl;
ll sum = 1;
if (sub % 2 == 0) {
// sum += 1;
for (int j = 1; j <= sub / 2; j++) {
sum +=
fract(sub - j) * modinv(fract(j) * fract(sub - j * 2), 1000000007);
sum %= 1000000007;
}
// cout << "koko1:" << sum << endl;
} else {
// sum += 1;
for (int j = 1; j <= (sub - 1) / 2; j++) {
sum +=
fract(sub - j) * modinv(fract(j) * fract(sub - j * 2), 1000000007);
sum %= 1000000007;
}
// cout << "koko2:" << sum << endl;
}
// cout << sum << endl;
ccnt = (ccnt * sum) % 1000000007;
}
cout << ccnt << endl;
return 0;
} | replace | 59 | 61 | 59 | 65 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
// 各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
// クラスを作るときは、Parentの値を全て-1にする。
// 以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
int n, m;
cin >> n >> m;
bool hole[100010] = {};
int a;
REP(i, m) {
cin >> a;
hole[a] = true;
}
long long dp[100010] = {};
dp[0] = 1;
REPP(i, 100010) {
if (hole[i]) {
continue;
} else {
if (i >= 2) {
dp[i] = mod(dp[i - 1] + dp[i - 2]);
} else { // iが1以上の時
dp[i] = dp[i - 1];
}
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
// 各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
// クラスを作るときは、Parentの値を全て-1にする。
// 以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
int n, m;
cin >> n >> m;
bool hole[100010] = {};
int a;
REP(i, m) {
cin >> a;
hole[a] = true;
}
long long dp[100010] = {};
dp[0] = 1;
REPP(i, 100005) {
if (hole[i]) {
continue;
} else {
if (i >= 2) {
dp[i] = mod(dp[i - 1] + dp[i - 2]);
} else { // iが1以上の時
dp[i] = dp[i - 1];
}
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 98 | 99 | 98 | 99 | TLE | |
p03013 | C++ | Time Limit Exceeded | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int> v(N + 2, 0);
v[0] = 0;
v[1] = 1;
for (int i = 2; i <= N + 1; i++) {
if (find(a.begin(), a.end(), i - 1) != a.end())
continue;
else {
v[i] = (v[i - 1] + v[i - 2]) % 1000000007;
}
}
cout << v[N + 1] << endl;
} | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int> v(N + 2, 0);
v[0] = 0;
v[1] = 1;
for (int i = 2; i <= N + 1; i++) {
if (binary_search(a.begin(), a.end(), i - 1))
continue;
else {
v[i] = (v[i - 1] + v[i - 2]) % 1000000007;
}
}
cout << v[N + 1] << endl;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define N 100001
#define rep(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 1), op(m);
dp[0] = 1;
for (int &i : op)
cin >> i;
int ind = 0;
for (int i = 1; i <= n; i++) {
if (i == op[ind]) {
ind++;
dp[i] = 0;
} else {
dp[i] = dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] = dp[i] % hell;
}
}
cout << dp[n] << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define N 100001
#define rep(i, a, b) for (int i = a; i < b; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 1), op(m);
dp[0] = 1;
for (int &i : op)
cin >> i;
int ind = 0;
for (int i = 1; i <= n; i++) {
if (ind < m && i == op[ind]) {
ind++;
dp[i] = 0;
} else {
dp[i] = dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] = dp[i] % hell;
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int twx = 1000000007;
long long n, m, a, dp[10010];
bool pan[10010];
int main() {
scanf("%lld %lld", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%lld", &a);
pan[a] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++)
if (!pan[i])
if (i == 1)
dp[i] = dp[0];
else
dp[i] = ((dp[i] + dp[i - 1]) % twx + dp[i - 2]) % twx;
printf("%d\n", dp[n]);
} | #include <bits/stdc++.h>
using namespace std;
const int twx = 1000000007;
long long n, m, a, dp[100010];
bool pan[100010];
int main() {
scanf("%lld %lld", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%lld", &a);
pan[a] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++)
if (!pan[i])
if (i == 1)
dp[i] = dp[0];
else
dp[i] = ((dp[i] + dp[i - 1]) % twx + dp[i - 2]) % twx;
printf("%d\n", dp[n]);
} | replace | 3 | 5 | 3 | 5 | 0 | |
p03013 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n >> m;
vector<ll> aa(m);
for (i = 0; i < m; i++)
cin >> aa[i];
vector<ll> dp(n);
dp[0] = 1;
for (i = 1, a = 0; i <= n; i++) {
if (a < m)
if (aa[a] == i) {
a++;
continue;
}
dp[i] = dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] %= 1000000007;
}
cout << dp[n] << endl;
return 0;
}
| // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n >> m;
vector<ll> aa(m);
for (i = 0; i < m; i++)
cin >> aa[i];
vector<ll> dp(n + 1);
dp[0] = 1;
for (i = 1, a = 0; i <= n; i++) {
if (a < m)
if (aa[a] == i) {
a++;
continue;
}
dp[i] = dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] %= 1000000007;
}
cout << dp[n] << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
template <int mod = MOD> class modint {
private:
int mMOD = mod, mVal;
public:
constexpr modint(int v = 0) noexcept : mVal(v % mMOD) {
if (mVal < 0)
mVal += mMOD;
}
constexpr int getMOD() { return mMOD; }
constexpr modint operator-() const noexcept { return mVal ? mMOD - mVal : 0; }
constexpr modint operator+(const modint &r) const noexcept {
return modint(*this) += r;
}
constexpr modint operator-(const modint &r) const noexcept {
return modint(*this) -= r;
}
constexpr modint operator*(const modint &r) const noexcept {
return modint(*this) *= r;
}
modint operator/(const modint &r) const noexcept {
return modint(*this) /= r;
}
constexpr modint &operator+=(const modint &r) noexcept {
mVal += r.mVal;
if (mVal > mMOD)
mVal -= mMOD;
return *this;
}
constexpr modint &operator-=(const modint &r) noexcept {
mVal -= r.mVal;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr modint &operator*=(const modint &r) noexcept {
mVal = mVal * r.mVal % mMOD;
return *this;
}
modint &operator/=(const modint &r) noexcept {
int a = r.mVal, b = mMOD, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
mVal = mVal * u % mMOD;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr bool operator==(const modint &r) const noexcept {
return this->mVal == r.mVal;
}
constexpr bool operator!=(const modint &r) const noexcept {
return this->mVal != r.mVal;
}
constexpr bool operator>(const modint &r) const noexcept {
return this->mVal > r.mVal;
}
constexpr bool operator<(const modint &r) const noexcept {
return this->mVal < r.mVal;
}
constexpr bool operator>=(const modint &r) const noexcept {
return this->mVal >= r.mVal;
}
constexpr bool operator<=(const modint &r) const noexcept {
return this->mVal <= r.mVal;
}
friend ostream &operator<<(ostream &os, const modint &x) noexcept {
return os << x.mVal;
}
friend istream &operator>>(istream &is, modint &x) noexcept {
return is >> x.mVal;
}
constexpr operator int() const noexcept { return mVal; }
constexpr modint operator+(const int &r) const noexcept {
return modint(*this) += r;
}
constexpr modint operator-(const int &r) const noexcept {
return modint(*this) -= r;
}
constexpr modint operator*(const int &r) const noexcept {
return modint(*this) *= r;
}
modint operator/(const int &r) const noexcept { return modint(*this) /= r; }
constexpr modint &operator+=(const int &r) noexcept {
mVal += r;
if (mVal > mMOD)
mVal -= mMOD;
return *this;
}
constexpr modint &operator-=(const int &r) noexcept {
mVal -= r;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr modint &operator*=(const int &r) noexcept {
mVal = mVal * r % mMOD;
return *this;
}
modint &operator/=(const int &r) noexcept {
int a = r, b = mMOD, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
mVal = mVal * u % mMOD;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr bool operator==(const int &r) const noexcept {
return this->mVal == r;
}
constexpr bool operator!=(const int &r) const noexcept {
return this->mVal != r;
}
constexpr bool operator>(const int &r) const noexcept {
return this->mVal > r;
}
constexpr bool operator<(const int &r) const noexcept {
return this->mVal < r;
}
constexpr bool operator>=(const int &r) const noexcept {
return this->mVal >= r;
}
constexpr bool operator<=(const int &r) const noexcept {
return this->mVal <= r;
}
};
using mint = modint<MOD>; // MODを入力
constexpr mint modpow(const mint &a, int n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
mint modconv(mint n, mint r) noexcept {
if (n < r)
return 0;
else {
mint res = 1;
for (int i = 0; i < r; i++) {
res *= n - i;
}
for (int i = 0; i < r; i++) {
res /= r - i;
}
return res;
}
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
mint n, m;
cin >> n >> m;
vector<mint> a(m);
vector<bool> f(m + 1ll, false);
REP(i, m) {
cin >> a[i];
f[a[i]] = true;
}
vector<mint> dp(n + 1ll);
dp[0] = dp[1] = 1;
FOR(now, 2, n + 1ll) {
FOR(prev, now - 2, now) {
if (!f[prev]) {
dp[now] += dp[prev];
}
}
}
cout << dp[n] << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)(b - 1); i >= (int)(a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
template <int mod = MOD> class modint {
private:
int mMOD = mod, mVal;
public:
constexpr modint(int v = 0) noexcept : mVal(v % mMOD) {
if (mVal < 0)
mVal += mMOD;
}
constexpr int getMOD() { return mMOD; }
constexpr modint operator-() const noexcept { return mVal ? mMOD - mVal : 0; }
constexpr modint operator+(const modint &r) const noexcept {
return modint(*this) += r;
}
constexpr modint operator-(const modint &r) const noexcept {
return modint(*this) -= r;
}
constexpr modint operator*(const modint &r) const noexcept {
return modint(*this) *= r;
}
modint operator/(const modint &r) const noexcept {
return modint(*this) /= r;
}
constexpr modint &operator+=(const modint &r) noexcept {
mVal += r.mVal;
if (mVal > mMOD)
mVal -= mMOD;
return *this;
}
constexpr modint &operator-=(const modint &r) noexcept {
mVal -= r.mVal;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr modint &operator*=(const modint &r) noexcept {
mVal = mVal * r.mVal % mMOD;
return *this;
}
modint &operator/=(const modint &r) noexcept {
int a = r.mVal, b = mMOD, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
mVal = mVal * u % mMOD;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr bool operator==(const modint &r) const noexcept {
return this->mVal == r.mVal;
}
constexpr bool operator!=(const modint &r) const noexcept {
return this->mVal != r.mVal;
}
constexpr bool operator>(const modint &r) const noexcept {
return this->mVal > r.mVal;
}
constexpr bool operator<(const modint &r) const noexcept {
return this->mVal < r.mVal;
}
constexpr bool operator>=(const modint &r) const noexcept {
return this->mVal >= r.mVal;
}
constexpr bool operator<=(const modint &r) const noexcept {
return this->mVal <= r.mVal;
}
friend ostream &operator<<(ostream &os, const modint &x) noexcept {
return os << x.mVal;
}
friend istream &operator>>(istream &is, modint &x) noexcept {
return is >> x.mVal;
}
constexpr operator int() const noexcept { return mVal; }
constexpr modint operator+(const int &r) const noexcept {
return modint(*this) += r;
}
constexpr modint operator-(const int &r) const noexcept {
return modint(*this) -= r;
}
constexpr modint operator*(const int &r) const noexcept {
return modint(*this) *= r;
}
modint operator/(const int &r) const noexcept { return modint(*this) /= r; }
constexpr modint &operator+=(const int &r) noexcept {
mVal += r;
if (mVal > mMOD)
mVal -= mMOD;
return *this;
}
constexpr modint &operator-=(const int &r) noexcept {
mVal -= r;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr modint &operator*=(const int &r) noexcept {
mVal = mVal * r % mMOD;
return *this;
}
modint &operator/=(const int &r) noexcept {
int a = r, b = mMOD, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
mVal = mVal * u % mMOD;
if (mVal < 0)
mVal += mMOD;
return *this;
}
constexpr bool operator==(const int &r) const noexcept {
return this->mVal == r;
}
constexpr bool operator!=(const int &r) const noexcept {
return this->mVal != r;
}
constexpr bool operator>(const int &r) const noexcept {
return this->mVal > r;
}
constexpr bool operator<(const int &r) const noexcept {
return this->mVal < r;
}
constexpr bool operator>=(const int &r) const noexcept {
return this->mVal >= r;
}
constexpr bool operator<=(const int &r) const noexcept {
return this->mVal <= r;
}
};
using mint = modint<MOD>; // MODを入力
constexpr mint modpow(const mint &a, int n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
mint modconv(mint n, mint r) noexcept {
if (n < r)
return 0;
else {
mint res = 1;
for (int i = 0; i < r; i++) {
res *= n - i;
}
for (int i = 0; i < r; i++) {
res /= r - i;
}
return res;
}
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cout.precision(20);
mint n, m;
cin >> n >> m;
vector<mint> a(m);
vector<bool> f(n, false);
REP(i, m) {
cin >> a[i];
f[a[i]] = true;
}
vector<mint> dp(n + 1ll);
dp[0] = dp[1] = 1;
FOR(now, 2, n + 1ll) {
FOR(prev, now - 2, now) {
if (!f[prev]) {
dp[now] += dp[prev];
}
}
}
cout << dp[n] << endl;
return 0;
} | replace | 229 | 230 | 229 | 230 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(m);
rep(i, m) { cin >> a[i]; }
vector<ll> dp(n + 1);
dp[0] = 1;
int itr = 0;
if (a[0] == 1) {
dp[1] = 0;
itr++;
} else {
dp[1] = 1;
}
for (int i = 2; i <= n; ++i) {
if (itr < m && i == a[itr]) {
dp[i] = 0;
itr++;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[n] << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(m);
rep(i, m) { cin >> a[i]; }
vector<ll> dp(n + 1);
dp[0] = 1;
int itr = 0;
if (m > 0 && a[0] == 1) {
dp[1] = 0;
itr++;
} else {
dp[1] = 1;
}
for (int i = 2; i <= n; ++i) {
if (itr < m && i == a[itr]) {
dp[i] = 0;
itr++;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[n] << endl;
} | replace | 32 | 33 | 32 | 33 | 0 | |
p03013 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<vector<P>> Graph;
#include <cstdint>
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
u64 a;
public:
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 val() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr bool operator==(const modint rhs) const noexcept {
return modint(*this).value() == rhs.value();
}
modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
using mint = modint<MOD>;
typedef vector<mint> vec;
typedef vector<vector<mint>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n + 10, 0);
REP(i, m) {
int x;
cin >> x;
a[x]++;
}
vec dp(n + 1, 0);
dp[0] = 1;
REP(i, n) {
if (a[i + 1] == 0)
dp[i + 1] += dp[i];
if (a[i + 2] == 0)
dp[i + 2] += dp[i];
}
cout << dp[n].val() << endl;
return 0;
} | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<vector<P>> Graph;
#include <cstdint>
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
u64 a;
public:
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 val() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr bool operator==(const modint rhs) const noexcept {
return modint(*this).value() == rhs.value();
}
modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
using mint = modint<MOD>;
typedef vector<mint> vec;
typedef vector<vector<mint>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n + 10, 0);
REP(i, m) {
int x;
cin >> x;
a[x]++;
}
vec dp(n + 10, 0);
dp[0] = 1;
REP(i, n) {
if (a[i + 1] == 0)
dp[i + 1] += dp[i];
if (a[i + 2] == 0)
dp[i + 2] += dp[i];
}
cout << dp[n].val() << endl;
return 0;
} | replace | 121 | 122 | 121 | 122 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int dp[100000] = {};
long long cnt(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != 0)
return dp[n];
else
return (cnt(n - 1) + cnt(n - 2)) % 1000000007;
}
int main() {
long long n, m;
long long a[100010] = {};
cin >> n >> m;
a[0] = -1;
a[m + 1] = n + 1;
for (long long i = 1; i <= m; i++) {
cin >> a[i];
}
long long ans = 1;
long long f = 1;
for (long long i = 0; i <= m; i++) {
if (a[i + 1] - a[i] == 1)
f = 0;
else
ans = (ans * cnt(a[i + 1] - a[i] - 2)) % 1000000007;
}
cout << ans * f << endl;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int dp[100000] = {};
long long cnt(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != 0)
return dp[n];
else
return dp[n] = (cnt(n - 1) + cnt(n - 2)) % 1000000007;
}
int main() {
long long n, m;
long long a[100010] = {};
cin >> n >> m;
a[0] = -1;
a[m + 1] = n + 1;
for (long long i = 1; i <= m; i++) {
cin >> a[i];
}
long long ans = 1;
long long f = 1;
for (long long i = 0; i <= m; i++) {
if (a[i + 1] - a[i] == 1)
f = 0;
else
ans = (ans * cnt(a[i + 1] - a[i] - 2)) % 1000000007;
}
cout << ans * f << endl;
} | replace | 22 | 23 | 22 | 23 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = k; i < n; i++)
#define REPEACH(itr, k) for (auto itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
typedef pair<double, int> P;
int main() {
int n, m;
cin >> n >> m;
int broken;
int now = 0;
vector<ll> v(n + 1);
v[0] = 1;
v[1] = 1;
v[2] = 2;
for (int i = 3; i <= n + 1; i++) {
v[i] = (v[i - 1] % MOD) + (v[i - 2] % MOD);
}
ll ans = 1;
REP(i, m) {
cin >> broken;
if (now == broken) {
cout << 0 << endl;
return 0;
}
ans *= v[broken - 1 - now];
ans %= MOD;
now = broken + 1;
}
ans *= v[n - now];
cout << ans % MOD << endl;
}
| #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = k; i < n; i++)
#define REPEACH(itr, k) for (auto itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
typedef pair<double, int> P;
int main() {
int n, m;
cin >> n >> m;
int broken;
int now = 0;
vector<ll> v(n + 1);
v[0] = 1;
v[1] = 1;
v[2] = 2;
for (int i = 3; i < n + 1; i++) {
v[i] = (v[i - 1] % MOD) + (v[i - 2] % MOD);
}
ll ans = 1;
REP(i, m) {
cin >> broken;
if (now == broken) {
cout << 0 << endl;
return 0;
}
ans *= v[broken - 1 - now];
ans %= MOD;
now = broken + 1;
}
ans *= v[n - now];
cout << ans % MOD << endl;
}
| replace | 23 | 24 | 23 | 24 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define Rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define RRep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define pb push_back
#define eb emplace_back
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
int INF = 1e9 + 7;
vector<int> dx = {-1, 0, 1, 0};
vector<int> dy = {0, -1, 0, 1};
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
vector<int> dp(n + 1, 0);
dp[0] = 1;
int j = 0;
rep(i, n) {
if (i + 1 == a[j]) {
dp[i + 1] = 0;
j++;
} else if (i == 0) {
dp[i + 1] = dp[i];
} else {
dp[i + 1] = dp[i] + dp[i - 1];
dp[i + 1] %= INF;
}
}
cout << dp[n] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define Rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define RRep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define pb push_back
#define eb emplace_back
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
int INF = 1e9 + 7;
vector<int> dx = {-1, 0, 1, 0};
vector<int> dy = {0, -1, 0, 1};
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
vector<int> dp(n + 1, 0);
dp[0] = 1;
int j = 0;
rep(i, n) {
if (j < m && i + 1 == a[j]) {
dp[i + 1] = 0;
j++;
} else if (i == 0) {
dp[i + 1] = dp[i];
} else {
dp[i + 1] = dp[i] + dp[i - 1];
dp[i + 1] %= INF;
}
}
cout << dp[n] << endl;
}
| replace | 80 | 81 | 80 | 81 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, m, tmp, a[10009], dp[10009];
cin >> n >> m;
for (int i = 0; i <= n; i++) {
a[i] = 0;
dp[i] = 0;
}
for (int i = 0; i < m; i++) {
cin >> tmp;
a[tmp] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++) {
if (a[i] == 1) {
dp[i] = 0;
} else {
if (i == 1) {
dp[i] = dp[i - 1] % MOD;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
}
}
cout << dp[n] << endl;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, m, tmp, a[100009], dp[100009];
cin >> n >> m;
for (int i = 0; i <= n; i++) {
a[i] = 0;
dp[i] = 0;
}
for (int i = 0; i < m; i++) {
cin >> tmp;
a[tmp] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++) {
if (a[i] == 1) {
dp[i] = 0;
} else {
if (i == 1) {
dp[i] = dp[i - 1] % MOD;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
}
}
cout << dp[n] << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; // 無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { // 線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) {
cin >> a[i];
if (i != 0) {
}
}
vector<ll> cnt(n + 1, 0);
cnt[0] = 1;
int c = 0;
rep(i, n + 1) {
cnt[i] %= MOD;
if (a[c] == i) {
c++;
continue;
}
if (i + 1 <= n) {
cnt[i + 1] += cnt[i];
}
if (i + 2 <= n) {
cnt[i + 2] += cnt[i];
}
}
cout << cnt[n] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
while (right - left > 1) {
if (a[md] <= key) {
right = md;
} else {
left = md;
}
md = (right + left) / 2;
}
if (left == -1)
return -1; // 無い場合
return right;
}
vector<ll> prime;
void Prime(ll n) { // 線形篩,素数列挙
vector<ll> p(n, 0);
p[0] = 1;
p[1] = 1;
for (ll i = 2; i < n; i++) {
if (p[i] == 0) {
prime.push_back(i);
p[i] = i;
}
ll k = prime.size();
for (ll j = 0; j < k && i * prime[j] < n && prime[j] <= p[i]; j++) {
p[i * prime[j]] = prime[j];
}
}
}
#define MOD ((ll)1e+9 + 7)
// cout<<fixed<<setprecision(10);
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) {
cin >> a[i];
if (i != 0) {
}
}
vector<ll> cnt(n + 1, 0);
cnt[0] = 1;
int c = 0;
rep(i, n + 1) {
cnt[i] %= MOD;
if (c < m && a[c] == i) {
c++;
continue;
}
if (i + 1 <= n) {
cnt[i + 1] += cnt[i];
}
if (i + 2 <= n) {
cnt[i + 2] += cnt[i];
}
}
cout << cnt[n] << endl;
return 0;
}
| replace | 65 | 66 | 65 | 66 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<modint> fibo(n + 1);
fibo[1] = 1;
fibo[2] = 1;
for (int i = 3; i <= n; i++) {
fibo[i] = fibo[i - 1] + fibo[i - 2];
}
modint sum(fibo[a[0]]);
for (int i = 1; i < m; i++) {
const int t = a[i] - a[i - 1] - 1;
if (t == 0) {
cout << 0 << endl;
return;
}
sum *= fibo[t];
}
sum *= fibo[n - a[m - 1]];
cout << sum << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<modint> fibo(n + 1);
fibo[1] = 1;
fibo[2] = 1;
for (int i = 3; i <= n; i++) {
fibo[i] = fibo[i - 1] + fibo[i - 2];
}
if (m == 0) {
cout << fibo[n] + fibo[n - 1] << endl;
return;
}
modint sum(fibo[a[0]]);
for (int i = 1; i < m; i++) {
const int t = a[i] - a[i - 1] - 1;
if (t == 0) {
cout << 0 << endl;
return;
}
sum *= fibo[t];
}
sum *= fibo[n - a[m - 1]];
cout << sum << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
solve();
return 0;
}
| insert | 104 | 104 | 104 | 109 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define inf 1000000000000000007
#define eps 0.00000001
#define pi 3.141592653589793
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vii vector<int>
#define vpl vector<pll>
#define vll vector<ll>
#define sti stack<int>
#define stll stack<ll>
#define mseti multiset<ll>
#define msetd multiset<ll, greater<ll>>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define stp setprecision(20) // use fixed before stp
#define endl '\n'
int main() {
FAST
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ll n, m;
cin >> n >> m;
ll ans[n + 1];
for (ll i = 0; i <= n; i++) {
ans[i] = 1;
}
ll x;
for (ll i = 0; i < m; i++) {
cin >> x;
ans[x] = 0;
}
for (ll i = 2; i <= n; i++) {
ans[i] *= (ans[i - 1] + ans[i - 2]);
ans[i] %= mod;
}
cout << ans[n];
} | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define inf 1000000000000000007
#define eps 0.00000001
#define pi 3.141592653589793
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vii vector<int>
#define vpl vector<pll>
#define vll vector<ll>
#define sti stack<int>
#define stll stack<ll>
#define mseti multiset<ll>
#define msetd multiset<ll, greater<ll>>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define stp setprecision(20) // use fixed before stp
#define endl '\n'
int main() {
FAST ll n, m;
cin >> n >> m;
ll ans[n + 1];
for (ll i = 0; i <= n; i++) {
ans[i] = 1;
}
ll x;
for (ll i = 0; i < m; i++) {
cin >> x;
ans[x] = 0;
}
for (ll i = 2; i <= n; i++) {
ans[i] *= (ans[i - 1] + ans[i - 2]);
ans[i] %= mod;
}
cout << ans[n];
} | replace | 31 | 37 | 31 | 32 | -11 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
// ここから編集する
class Solve {
public:
void input() {}
void solve() {
input();
int N, M;
cin >> N >> M;
set<int> kiken;
rep(i, 0, M) {
int tmp;
cin >> tmp;
kiken.insert(tmp);
}
vector<ll> dp(N + 1);
dp[0] = 1;
for (int i = 0; i < N; ++i) {
if (!kiken.count(i)) {
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
}
ll ans = dp[N];
cout << ans << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
// ここから編集する
class Solve {
public:
void input() {}
void solve() {
input();
int N, M;
cin >> N >> M;
set<int> kiken;
rep(i, 0, M) {
int tmp;
cin >> tmp;
kiken.insert(tmp);
}
vector<ll> dp(N + 2);
dp[0] = 1;
for (int i = 0; i < N; ++i) {
if (!kiken.count(i)) {
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
}
ll ans = dp[N];
cout << ans << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| replace | 73 | 74 | 73 | 74 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int p = 1000000007;
ll f(ll x) {
if (x == 0) {
return 1;
}
if (x == 1) {
return 1;
}
ll a = 1, b = 1, c = 0;
rep(i, x - 1) {
c = (a + b) % p;
a = b;
b = c;
}
return c;
}
int main() {
ll n, m, ans = 1;
cin >> n >> m;
vector<ll> v(m);
rep(i, m) {
cin >> v[i];
if (i != 0) {
if (v[i] == v[i - 1] + 1) {
ans = 0;
break;
}
}
}
if (ans == 0) {
cout << 0 << endl;
} else {
if (v[0] != 1) {
ans *= f(v[0] - 1) % p;
ans %= p;
}
for (int i = 0; i < m - 1; i++) {
ans *= f(v[i + 1] - v[i] - 2) % p;
ans %= p;
}
ans *= f(n - 1 - v[m - 1]) % p;
ans %= p;
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int p = 1000000007;
ll f(ll x) {
if (x == 0) {
return 1;
}
if (x == 1) {
return 1;
}
ll a = 1, b = 1, c = 0;
rep(i, x - 1) {
c = (a + b) % p;
a = b;
b = c;
}
return c;
}
int main() {
ll n, m, ans = 1;
cin >> n >> m;
vector<ll> v(m);
rep(i, m) {
cin >> v[i];
if (i != 0) {
if (v[i] == v[i - 1] + 1) {
ans = 0;
break;
}
}
}
if (m == 0) {
cout << f(n);
} else if (ans == 0) {
cout << 0 << endl;
} else {
if (v[0] != 1) {
ans *= f(v[0] - 1) % p;
ans %= p;
}
for (int i = 0; i < m - 1; i++) {
ans *= f(v[i + 1] - v[i] - 2) % p;
ans %= p;
}
ans *= f(n - 1 - v[m - 1]) % p;
ans %= p;
cout << ans << endl;
}
}
| replace | 34 | 35 | 34 | 37 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;k++){
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
// }
// }
// }
// }
// ll calc_digit(ll N) {
// ll res = 0;
// while (N) {
// ++res;
// N /= 10;
// }
// return res;
// }
// ll sum_digit(ll N) {
// ll res = 0;
// while (N) {
// res += N % 10;
// N /= 10;
// }
// return res;
// }
bool b[10000];
int main() {
ll n, m;
cin >> n >> m;
ll a[n + 1];
a[0] = 1;
for (int i = 0; i < m; i++) {
ll x;
cin >> x;
b[x] = true;
}
if (!b[1]) {
a[1] = 1;
} else {
a[1] = 0;
}
for (int i = 2; i <= n; i++) {
a[i] = 0;
if (!b[i]) {
if (!b[i - 1]) {
a[i] += a[i - 1];
}
if (!b[i - 2]) {
a[i] += a[i - 2];
}
}
a[i] %= MOD;
}
cout << a[n];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;k++){
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
// }
// }
// }
// }
// ll calc_digit(ll N) {
// ll res = 0;
// while (N) {
// ++res;
// N /= 10;
// }
// return res;
// }
// ll sum_digit(ll N) {
// ll res = 0;
// while (N) {
// res += N % 10;
// N /= 10;
// }
// return res;
// }
bool b[100000];
int main() {
ll n, m;
cin >> n >> m;
ll a[n + 1];
a[0] = 1;
for (int i = 0; i < m; i++) {
ll x;
cin >> x;
b[x] = true;
}
if (!b[1]) {
a[1] = 1;
} else {
a[1] = 0;
}
for (int i = 2; i <= n; i++) {
a[i] = 0;
if (!b[i]) {
if (!b[i - 1]) {
a[i] += a[i - 1];
}
if (!b[i - 2]) {
a[i] += a[i - 2];
}
}
a[i] %= MOD;
}
cout << a[n];
}
| replace | 41 | 42 | 41 | 42 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
using ll = long long;
/*
string -> int : stoi(S);
int -> string : to_string(N);
Sのn文字以降をm文字取り出す : S.substr(n,m)
int: -2,147,483,648 ～ 2,147,483,647 (2×10^9)
ll: -9,223,372,036,854,775,808 ~ 9,223,372,036,854,775,807 (9×10^18)
*/
int main() {
ll n, m, count = 0, ans = 0;
cin >> n;
cin >> m;
vector<ll> a(m);
rep(i, m) { cin >> a[i]; }
vector<ll> s(n + 1);
s[0] = 1;
int l = 0;
rep2(i, n) {
if (a[l] == i) {
s[i] = 0;
l++;
} else if (i == 1)
s[1] = 1;
else
s[i] = (s[i - 1] + s[i - 2]) % 1000000007;
}
cout << s[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
using ll = long long;
/*
string -> int : stoi(S);
int -> string : to_string(N);
Sのn文字以降をm文字取り出す : S.substr(n,m)
int: -2,147,483,648 ～ 2,147,483,647 (2×10^9)
ll: -9,223,372,036,854,775,808 ~ 9,223,372,036,854,775,807 (9×10^18)
*/
int main() {
ll n, m, count = 0, ans = 0;
cin >> n;
cin >> m;
vector<ll> a(m);
rep(i, m) { cin >> a[i]; }
vector<ll> s(n + 1);
s[0] = 1;
int l = 0;
rep2(i, n) {
if (m != 0 && a[l] == i) {
s[i] = 0;
l++;
} else if (i == 1)
s[1] = 1;
else
s[i] = (s[i - 1] + s[i - 2]) % 1000000007;
}
cout << s[n] << endl;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(M);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
if (broken[i]) {
a[i] = 0;
} else {
a[i] = (a[i + 1] + a[i + 2]) % 1000000007;
}
}
int ans = a[0];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(N + 1);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
if (broken[i]) {
a[i] = 0;
} else {
a[i] = (a[i + 1] + a[i + 2]) % 1000000007;
}
}
int ans = a[0];
cout << ans << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> oks(M, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int next = now + 1; next <= min(now + 2, N); next++) {
if (oks[next] == true) {
dp[next] += dp[now];
dp[next] %= 1000000007;
}
}
}
cout << dp[N] << endl;
return 0;
} | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int next = now + 1; next <= min(now + 2, N); next++) {
if (oks[next] == true) {
dp[next] += dp[now];
dp[next] %= 1000000007;
}
}
}
cout << dp[N] << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
// dp[i] : i段目にたどりつくまでの移動法の総数
vector<int> dp(n + 1);
dp[0] = 1;
int j = 0;
rep(i, n + 1) {
if (i < 1)
continue;
if (a[j] == i) {
j++;
continue;
}
dp[i] = dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] %= mod;
}
// rep(i,n+1) cout << i << ":" << dp[i] << endl;
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
// dp[i] : i段目にたどりつくまでの移動法の総数
vector<int> dp(n + 1);
dp[0] = 1;
int j = 0;
rep(i, n + 1) {
if (i < 1)
continue;
if (j < m) {
if (a[j] == i) {
j++;
continue;
}
}
dp[i] = dp[i - 1];
if (i > 1)
dp[i] += dp[i - 2];
dp[i] %= mod;
}
// rep(i,n+1) cout << i << ":" << dp[i] << endl;
cout << dp[n] << endl;
return 0;
}
| replace | 19 | 22 | 19 | 24 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MOD = 1e9 + 7;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
set<int> st;
rep(i, m) st.insert(a[i]);
vector<int> dp(n + 1);
dp[0] = 1;
rep(i, n) {
rep(j, 2) {
int add = j + 1;
if (st.count(i + add))
continue;
(dp[i + add] += dp[i]) %= MOD;
}
}
printf("%d\n", dp[n]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MOD = 1e9 + 7;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
set<int> st;
rep(i, m) st.insert(a[i]);
vector<int> dp(n + 1);
dp[0] = 1;
rep(i, n) {
rep(j, 2) {
int add = j + 1;
if (i + add > n)
continue;
if (st.count(i + add))
continue;
(dp[i + add] += dp[i]) %= MOD;
}
}
printf("%d\n", dp[n]);
return 0;
}
| insert | 20 | 20 | 20 | 22 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
int64_t mod = 1e9 + 7;
cin >> N >> M;
vector<int64_t> a(M);
for (int64_t i = 0; i < M; i++) {
cin >> a.at(i);
}
vector<int64_t> ans(N + 1, 0);
ans.at(0) = 1;
vector<bool> flag(N + 1, true);
for (int64_t i = 0; i < M; i++) {
flag.at(a.at(i)) = false;
}
if (a.at(0) != 1) {
ans.at(1) = 1;
}
for (int64_t i = 2; i <= N; i++) {
if (!flag.at(i)) {
continue;
}
ans.at(i) = ans.at(i - 1) + ans.at(i - 2);
ans.at(i) %= mod;
}
cout << ans.at(N) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
int64_t mod = 1e9 + 7;
cin >> N >> M;
vector<int64_t> a(M);
for (int64_t i = 0; i < M; i++) {
cin >> a.at(i);
}
vector<int64_t> ans(N + 1, 0);
ans.at(0) = 1;
vector<bool> flag(N + 1, true);
for (int64_t i = 0; i < M; i++) {
flag.at(a.at(i)) = false;
}
if (M > 0) {
if (a.at(0) != 1) {
ans.at(1) = 1;
}
} else {
ans.at(1) = 1;
}
for (int64_t i = 2; i <= N; i++) {
if (!flag.at(i)) {
continue;
}
ans.at(i) = ans.at(i - 1) + ans.at(i - 2);
ans.at(i) %= mod;
}
cout << ans.at(N) << endl;
return 0;
}
| replace | 17 | 18 | 17 | 22 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define uni(q) unique(all(q)), q.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n, m;
cin >> n >> m;
vl a(m);
rep(i, m) cin >> a[i];
reverse(all(a));
vl dp(n + 1, -1);
if (!a.empty() && a.back() - 1 == 0) {
dp[0] = 0;
a.pop_back();
}
if (!a.empty() && a.back() - 1 == 1) {
dp[1] = 0;
a.pop_back();
}
if (dp[0] != 0)
dp[0] = 1;
if (dp[1] != 0)
dp[1] = dp[0] + 1;
rep(i, n - 2) {
if (!a.empty() && a.back() - 1 != i + 2) {
dp[i + 2] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] %= MOD;
} else {
dp[i + 2] = 0;
a.pop_back();
}
}
// rep(i,n) cout << dp[i] << " ";
cout << dp[n - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
#define uni(q) unique(all(q)), q.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n, m;
cin >> n >> m;
vl a(m);
rep(i, m) cin >> a[i];
reverse(all(a));
vl dp(n + 1, -1);
if (!a.empty() && a.back() - 1 == 0) {
dp[0] = 0;
a.pop_back();
}
if (!a.empty() && a.back() - 1 == 1) {
dp[1] = 0;
a.pop_back();
}
if (dp[0] != 0)
dp[0] = 1;
if (dp[1] != 0)
dp[1] = dp[0] + 1;
rep(i, n - 2) {
if (a.empty() || a.back() - 1 != i + 2) {
dp[i + 2] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] %= MOD;
} else {
dp[i + 2] = 0;
a.pop_back();
}
}
// rep(i,n) cout << dp[i] << " ";
cout << dp[n - 1] << endl;
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
}
cout << dp[0] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
}
cout << dp[0] << endl;
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll sum = 0;
int main() {
ll N, M;
ll waru = 1000000007;
cin >> N >> M;
vector<ll> a(N + 1, 0);
ll m = 0;
for (ll i = 0; i < M; i++) {
cin >> m;
a[m] = -1;
}
// vector<vector<ll > > dp(N, vector<ll >(N + 1, -1));
a[0] = 1;
for (ll i = 0; i < N; i++) {
if (a[i] == -1) {
continue;
}
if (a[i + 1] != -1) {
a[i + 1] += a[i];
a[i + 1] %= waru;
}
if (a[i + 2] != -1) {
a[i + 2] += a[i];
a[i + 2] %= waru;
}
}
cout << a[N] << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll sum = 0;
int main() {
ll N, M;
ll waru = 1000000007;
cin >> N >> M;
vector<ll> a(N + 2, 0);
ll m = 0;
for (ll i = 0; i < M; i++) {
cin >> m;
a[m] = -1;
}
// vector<vector<ll > > dp(N, vector<ll >(N + 1, -1));
a[0] = 1;
for (ll i = 0; i < N; i++) {
if (a[i] == -1) {
continue;
}
if (a[i + 1] != -1) {
a[i + 1] += a[i];
a[i + 1] %= waru;
}
if (a[i + 2] != -1) {
a[i + 2] += a[i];
a[i + 2] %= waru;
}
}
cout << a[N] << endl;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(m);
for (long long i = 0; i < m; i++) {
cin >> a[i];
}
vector<long long> sum(2 * n);
sum[0] = 0;
sum[1] = sum[2] = 1;
for (long long i = 3; i < 2 * n; i++) {
sum[i] = (sum[i - 1] + sum[i - 2]) % mod;
}
long long ans = sum[a[0]] % mod;
// cout << ans << endl;
for (long long i = 1; i < m; i++) {
ans = (ans * sum[a[i] - a[i - 1] - 1]) % mod;
}
ans = (ans * (sum[n - a[m - 1]])) % mod;
cout << ans % mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(m);
for (long long i = 0; i < m; i++) {
cin >> a[i];
}
vector<long long> sum(2 * n);
sum[0] = 0;
sum[1] = sum[2] = 1;
for (long long i = 3; i < 2 * n; i++) {
sum[i] = (sum[i - 1] + sum[i - 2]) % mod;
}
if (m == 0) {
cout << sum[n + 1] << endl;
return 0;
}
long long ans = sum[a[0]] % mod;
// cout << ans << endl;
for (long long i = 1; i < m; i++) {
ans = (ans * sum[a[i] - a[i - 1] - 1]) % mod;
}
ans = (ans * (sum[n - a[m - 1]])) % mod;
cout << ans % mod << endl;
return 0;
} | insert | 28 | 28 | 28 | 32 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int N, M;
cin >> N >> M;
VI broken(N + 1); // 壊れているブロックのbool表
REP(i, M) {
int a = 0;
cin >> a;
broken[a] = 1;
}
VI dp(N + 1);
dp[N] = 1;
dp[N + 1] = 0;
REP(i, N) {
if (broken[N - i - 1])
continue;
dp[N - i - 1] = (dp[N - i] + dp[N - i + 1]) % MOD;
}
cout << dp[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int N, M;
cin >> N >> M;
VI broken(N + 1); // 壊れているブロックのbool表
REP(i, M) {
int a = 0;
cin >> a;
broken[a] = 1;
}
VI dp(N + 10);
dp[N] = 1;
dp[N + 1] = 0;
REP(i, N) {
if (broken[N - i - 1])
continue;
dp[N - i - 1] = (dp[N - i] + dp[N - i + 1]) % MOD;
}
cout << dp[0] << endl;
return 0;
}
| replace | 55 | 56 | 55 | 56 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
ll inf = LLONG_MAX;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
int main() {
ll n, m, p = 1000000007;
cin >> n >> m;
vll a(m);
for (ll i = 0; i < m; i++)
cin >> a[i];
vll dp(n + 1);
dp[0] = 1;
ll check_next = 0;
if (a[0] == 1) {
dp[1] = 0;
check_next++;
} else
dp[1] = 1;
for (ll i = 2; i <= n; i++) {
ll is_broken = 0;
for (ll j = check_next; j < m; j++) {
if (i == a[j]) {
is_broken = 1;
check_next = j + 1;
break;
}
if (i < a[j]) {
check_next = j;
break;
}
}
if (is_broken == 0)
dp[i] = (dp[i - 2] + dp[i - 1]) % p;
else
dp[i] = 0;
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
ll inf = LLONG_MAX;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
int main() {
ll n, m, p = 1000000007;
cin >> n >> m;
vll a(m);
for (ll i = 0; i < m; i++)
cin >> a[i];
vll dp(n + 1);
dp[0] = 1;
ll check_next = 0;
if (m > 0 && a[0] == 1) {
dp[1] = 0;
check_next++;
} else
dp[1] = 1;
for (ll i = 2; i <= n; i++) {
ll is_broken = 0;
for (ll j = check_next; j < m; j++) {
if (i == a[j]) {
is_broken = 1;
check_next = j + 1;
break;
}
if (i < a[j]) {
check_next = j;
break;
}
}
if (is_broken == 0)
dp[i] = (dp[i - 2] + dp[i - 1]) % p;
else
dp[i] = 0;
}
cout << dp[n] << endl;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, m, temp;
cin >> n >> m;
vector<bool> broken(m);
vector<ll> dp(n + 1);
for (int i = 0; i < m; i++) {
cin >> temp;
broken[temp] = true;
}
dp[0] = 1;
if (!broken[1])
dp[1] = 1;
for (int i = 2; i <= n; i++) {
if (!broken[i]) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, m, temp;
cin >> n >> m;
vector<bool> broken(n + 1);
vector<ll> dp(n + 1);
for (int i = 0; i < m; i++) {
cin >> temp;
broken[temp] = true;
}
dp[0] = 1;
if (!broken[1])
dp[1] = 1;
for (int i = 2; i <= n; i++) {
if (!broken[i]) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int mod = 1e9 + 7;
ll dp[100005];
ll f(int i) {
if (i < 0)
return 0;
if (dp[i] == -1)
return 0;
if (dp[i] != 0)
return dp[i];
return dp[i] = (f(i - 1) + f(i - 2)) % mod;
}
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
ll ans = f(n);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int mod = 1e9 + 7;
ll dp[100005];
ll f(int i) {
if (i < 0)
return 0;
if (dp[i] == -1)
return 0;
if (dp[i] != 0)
return dp[i];
return dp[i] = (f(i - 1) + f(i - 2)) % mod;
}
int main() {
int n, m;
cin >> n >> m;
rep(i, m) {
int a;
cin >> a;
dp[a] = -1;
}
dp[0] = 1;
// ll ans = f(n);
rep(i, n) {
if (dp[i] == -1)
continue;
if (dp[i + 1] != -1)
dp[i + 1] = (dp[i + 1] + dp[i]) % mod;
if (dp[i + 2] != -1)
dp[i + 2] = (dp[i + 2] + dp[i]) % mod;
}
cout << dp[n] << endl;
return 0;
}
| replace | 30 | 32 | 30 | 40 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
ll mod = 1000000007;
int main(void) {
cin >> n >> m;
ll dp[10005] = {};
rep(i, m) {
int tmp;
cin >> tmp;
dp[tmp] = -1;
}
dp[0] = 1;
rep(i, n) {
if (dp[i] != -1) {
if (dp[i + 2] != -1) {
dp[i + 2] += dp[i];
dp[i + 2] %= mod;
}
if (dp[i + 1] != -1) {
dp[i + 1] += dp[i];
dp[i + 1] %= mod;
}
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
ll mod = 1000000007;
int main(void) {
cin >> n >> m;
ll dp[100005] = {};
rep(i, m) {
int tmp;
cin >> tmp;
dp[tmp] = -1;
}
dp[0] = 1;
rep(i, n) {
if (dp[i] != -1) {
if (dp[i + 2] != -1) {
dp[i + 2] += dp[i];
dp[i + 2] %= mod;
}
if (dp[i + 1] != -1) {
dp[i + 1] += dp[i];
dp[i + 1] %= mod;
}
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
unordered_set<ll> a;
REP(i, m) {
ll _a;
cin >> _a;
a.insert(_a);
}
vll d(n + 1, 1);
if (a.find(1) != a.end())
d[1] = 0;
rep(i, 2, n + 2) {
if (a.find(i) != a.end())
d[i] = 0;
else
d[i] = (d[i - 1] + d[i - 2]) % MOD;
}
cout << d[n] << '\n';
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
unordered_set<ll> a;
REP(i, m) {
ll _a;
cin >> _a;
a.insert(_a);
}
vll d(n + 1, 1);
if (a.find(1) != a.end())
d[1] = 0;
rep(i, 2, n + 1) {
if (a.find(i) != a.end())
d[i] = 0;
else
d[i] = (d[i - 1] + d[i - 2]) % MOD;
}
cout << d[n] << '\n';
return 0;
}
| replace | 62 | 63 | 62 | 63 | 0 | |
p03013 | C++ | Runtime Error |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{ ";
REP(i, vec.size()) { os << vec[i] << " "; }
os << "}";
return os;
}
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N, M;
cin >> N >> M;
vi a(M);
REP(i, M) cin >> a[i];
ll dp[N + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 1;
int j = 0;
REP(i, N + 1) {
if (a[j] == i) {
++j;
continue;
}
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
cout << dp[N] << endl;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll MOD = 1e9 + 7;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{ ";
REP(i, vec.size()) { os << vec[i] << " "; }
os << "}";
return os;
}
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N, M;
cin >> N >> M;
vi a(M);
REP(i, M) cin >> a[i];
ll dp[N + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 1;
int j = 0;
REP(i, N + 1) {
if (j < M)
if (a[j] == i) {
++j;
continue;
}
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
cout << dp[N] << endl;
}
| replace | 64 | 68 | 64 | 69 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++) // repマクロ
#define leng(n) (int)(log10(n) + 1) // 桁数leng
#define INF 9223372036854775807 // 巨大数INF
using namespace std;
int f(int n) {
if (n == 0)
return 1;
if (n == 1)
return 1;
return f(n - 1) + f(n - 2);
}
signed main() {
int N, M;
cin >> N >> M;
vector<int> a(M + 2);
a[0] = -1;
rep(i, M) cin >> a[i + 1];
a[M + 1] = N + 1;
int ans = 1;
rep(i, M + 1) {
if (a[i] + 1 == a[i + 1]) {
ans = 0;
break;
}
int d = a[i + 1] - a[i] - 2;
ans = (ans * f(d)) % 1000000007;
}
cout << ans % 1000000007 << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++) // repマクロ
#define leng(n) (int)(log10(n) + 1) // 桁数leng
#define INF 9223372036854775807 // 巨大数INF
using namespace std;
int f(int n) {
vector<int> vec(n + 3);
vec[0] = 1;
vec[1] = 1;
rep(i, n) vec[i + 2] = (vec[i] + vec[i + 1]) % 1000000007;
return vec[n];
}
signed main() {
int N, M;
cin >> N >> M;
vector<int> a(M + 2);
a[0] = -1;
rep(i, M) cin >> a[i + 1];
a[M + 1] = N + 1;
int ans = 1;
rep(i, M + 1) {
if (a[i] + 1 == a[i + 1]) {
ans = 0;
break;
}
int d = a[i + 1] - a[i] - 2;
ans = (ans * f(d)) % 1000000007;
}
cout << ans % 1000000007 << endl;
}
| replace | 8 | 13 | 8 | 13 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 10);
vector<bool> s(m, true);
vector<long long> dp(n + 10, 0);
for (int i = 0; i < m; i++) {
cin >> a[i];
s[a[i]] = false;
}
dp[0] = 1;
if (s[1]) {
dp[1] = 1;
} else {
dp[1] = 0;
}
for (int i = 1; i < n + 1; i++) {
if (s[i + 1]) {
dp[i + 1] = dp[i] + dp[i - 1];
dp[i + 1] %= (1000000000 + 7);
} else {
dp[i + 1] = 0;
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<bool> s(n + 10, true);
vector<long long> dp(n + 10, 0);
for (int i = 0; i < m; i++) {
cin >> a[i];
s[a[i]] = false;
}
dp[0] = 1;
if (s[1]) {
dp[1] = 1;
} else {
dp[1] = 0;
}
for (int i = 1; i < n + 1; i++) {
if (s[i + 1]) {
dp[i + 1] = dp[i] + dp[i - 1];
dp[i + 1] %= (1000000000 + 7);
} else {
dp[i + 1] = 0;
}
}
cout << dp[n] << endl;
}
| replace | 7 | 9 | 7 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<int> aa(M);
for (int k = 0; k < M; k++) {
cin >> aa[k];
}
vector<int> ans(N + 1);
ans[0] = 1;
for (int k = 1, l = 0; k <= N; k++) {
if (aa[l] == k) {
l++;
continue;
}
if (k > 0) {
ans[k] += ans[k - 1];
}
if (k > 1) {
ans[k] += ans[k - 2];
}
ans[k] %= mod;
}
cout << ans[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<int> aa(M);
for (int k = 0; k < M; k++) {
cin >> aa[k];
}
vector<int> ans(N + 1);
ans[0] = 1;
for (int k = 1, l = 0; k <= N; k++) {
if (l < M && aa[l] == k) {
l++;
continue;
}
if (k > 0) {
ans[k] += ans[k - 1];
}
if (k > 1) {
ans[k] += ans[k - 2];
}
ans[k] %= mod;
}
cout << ans[N] << endl;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void add(long long &n, long long m) {
n += m;
if (n >= mod) {
n -= mod;
}
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> dp(n + 1);
int br[100009] = {0};
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
br[x] = 1;
}
dp[0] = 1;
for (int i = 0; i <= n; ++i) {
if (br[i] == 1)
dp[i] = 0;
for (int j : {1, 2}) {
add(dp[i + j], dp[i]);
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void add(long long &n, long long m) {
n += m;
if (n >= mod) {
n -= mod;
}
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> dp(n + 1);
int br[100009] = {0};
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
br[x] = 1;
}
dp[0] = 1;
for (int i = 0; i <= n; ++i) {
if (br[i] == 1)
dp[i] = 0;
for (int j : {1, 2}) {
if (i + j <= n)
add(dp[i + j], dp[i]);
}
}
cout << dp[n] << endl;
}
| replace | 24 | 25 | 24 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
vector<ll> B(N + 1);
rep(i, 0, M) cin >> A[i];
B[0] = 1;
ll a = 0;
rep(i, 1, N + 1) {
if (i == A[a]) {
B[i] = 0;
a++;
} else {
if (i == 1)
B[i] = 1;
else
B[i] = (B[i - 1] % 1000000007 + B[i - 2] % 1000000007) % 1000000007;
}
}
cout << B[N];
} | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
vector<ll> B(N + 1);
rep(i, 0, M) cin >> A[i];
B[0] = 1;
ll a = 0;
if (M == 0)
A.push_back(-1);
rep(i, 1, N + 1) {
if (i == A[a]) {
B[i] = 0;
a++;
} else {
if (i == 1)
B[i] = 1;
else
B[i] = (B[i - 1] % 1000000007 + B[i - 2] % 1000000007) % 1000000007;
}
}
cout << B[N];
} | insert | 17 | 17 | 17 | 19 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
using ull = unsigned long long;
constexpr auto mod = 1000000007;
constexpr auto INF = ULLONG_MAX;
using namespace std;
template <typename T> inline void dump(const T &x) {
cout << "[" << x << "]" << endl;
}
template <typename T> inline void dump(const vector<T> &x) {
for (const auto v : x) {
cout << v << " ";
}
cout << endl;
}
template <typename T> inline void sort_asc(vector<T> &x) {
std::sort(x.begin(), x.end());
}
template <typename T> inline void sort_desc(vector<T> &x) {
std::sort(x.begin(), x.end(), greater<T>());
}
template <typename T> inline T max_value(vector<T> &x) {
return *max_element(x.begin(), x.end());
}
template <typename T> inline T min_value(vector<T> &x) {
return *min_element(x.begin(), x.end());
}
template <typename T> inline T sum_value(vector<T> &x) {
return accumulate(x.begin(), x.end(), 0ULL);
}
int main() {
// std::cout << std::fixed << std::setprecision(10);
ull n, m;
cin >> n >> m;
vector<ull> a;
each(i, m) {
ull tmp;
cin >> tmp;
a.push(tmp);
}
vector<ull> dp(n + 1, 0); // N個と、何も選んでない状態の +1
// f(n) = f(n-1) + f(n-2)
// d[i] i段目に行到達する方法は何通りあるか？
ull index = 0;
for (ull i = 1; i <= n; i++) {
if (i == a[index]) {
dp[i] = 0;
index++;
} else {
if (i == 1) {
dp[1] = 1; // 1段目は 1 の1通り
} else if (i == 2) {
if (dp[1] == 0) {
dp[2] = 1; // 1段目が壊れてる場合は2段目は 2 の1通り
} else {
dp[2] = 2; // 2段目は 1+1 と 2 の2通り
}
} else {
dp[i] = (dp[i - 1] % mod) + (dp[i - 2] % mod);
}
}
}
cout << dp[n] % mod << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define push emplace_back
#define each(i, x) for (auto i = 0; i < x; i++)
using ull = unsigned long long;
constexpr auto mod = 1000000007;
constexpr auto INF = ULLONG_MAX;
using namespace std;
template <typename T> inline void dump(const T &x) {
cout << "[" << x << "]" << endl;
}
template <typename T> inline void dump(const vector<T> &x) {
for (const auto v : x) {
cout << v << " ";
}
cout << endl;
}
template <typename T> inline void sort_asc(vector<T> &x) {
std::sort(x.begin(), x.end());
}
template <typename T> inline void sort_desc(vector<T> &x) {
std::sort(x.begin(), x.end(), greater<T>());
}
template <typename T> inline T max_value(vector<T> &x) {
return *max_element(x.begin(), x.end());
}
template <typename T> inline T min_value(vector<T> &x) {
return *min_element(x.begin(), x.end());
}
template <typename T> inline T sum_value(vector<T> &x) {
return accumulate(x.begin(), x.end(), 0ULL);
}
int main() {
// std::cout << std::fixed << std::setprecision(10);
ull n, m;
cin >> n >> m;
vector<ull> a;
each(i, m) {
ull tmp;
cin >> tmp;
a.push(tmp);
}
vector<ull> dp(n + 1, 0); // N個と、何も選んでない状態の +1
// f(n) = f(n-1) + f(n-2)
// d[i] i段目に行到達する方法は何通りあるか？
ull index = 0;
for (ull i = 1; i <= n; i++) {
if ((index < a.size()) && (i == a[index])) {
dp[i] = 0;
index++;
} else {
if (i == 1) {
dp[1] = 1; // 1段目は 1 の1通り
} else if (i == 2) {
if (dp[1] == 0) {
dp[2] = 1; // 1段目が壊れてる場合は2段目は 2 の1通り
} else {
dp[2] = 2; // 2段目は 1+1 と 2 の2通り
}
} else {
dp[i] = (dp[i - 1] % mod) + (dp[i - 2] % mod);
}
}
}
cout << dp[n] % mod << endl;
return 0;
}
| replace | 68 | 69 | 68 | 69 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long num = 1e9 + 7;
cin >> n >> m;
vector<long long> fib(n);
vector<bool> is_not_breaked(n, true);
vector<int> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i];
is_not_breaked[a[i]] = false;
}
if (is_not_breaked[0])
fib[0] = 1;
else
fib[0] = 0;
if (is_not_breaked[1])
fib[1] = 1;
else
fib[1] = 0;
for (int i = 2; i <= n; ++i) {
if (is_not_breaked[i]) {
fib[i] = fib[i - 1] + fib[i - 2];
fib[i] %= num;
} else {
fib[i] = 0;
}
}
cout << fib[n] % num << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long num = 1e9 + 7;
cin >> n >> m;
vector<long long> fib(n + 1);
vector<bool> is_not_breaked(n, true);
vector<int> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i];
is_not_breaked[a[i]] = false;
}
if (is_not_breaked[0])
fib[0] = 1;
else
fib[0] = 0;
if (is_not_breaked[1])
fib[1] = 1;
else
fib[1] = 0;
for (int i = 2; i <= n; ++i) {
if (is_not_breaked[i]) {
fib[i] = fib[i - 1] + fib[i - 2];
fib[i] %= num;
} else {
fib[i] = 0;
}
}
cout << fib[n] % num << endl;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T condition) {
if (condition)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T condition) {
if (condition)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
constexpr double eps = 1e-10;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
void _main() {
constexpr ll MOD = 1'000'000'007;
int N, M;
cin >> N >> M;
v(bool) broken(M + 1);
rep(i, 0, M) {
int a;
cin >> a;
broken[a] = true;
}
vi dp(N + 2);
dp[N] = 1;
rrep(i, N - 1, 0) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % MOD;
}
cout << dp[0] << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using unit = unsigned;
using ull = unsigned long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T condition) {
if (condition)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T condition) {
if (condition)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> T gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
constexpr double eps = 1e-10;
constexpr int inf = INT_MAX / 2;
constexpr ll infl = 1LL << 60;
void _main() {
constexpr ll MOD = 1'000'000'007;
int N, M;
cin >> N >> M;
v(bool) broken(N + 1);
rep(i, 0, M) {
int a;
cin >> a;
broken[a] = true;
}
vi dp(N + 2);
dp[N] = 1;
rrep(i, N - 1, 0) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % MOD;
}
cout << dp[0] << endl;
} | replace | 83 | 84 | 83 | 84 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[100005] = {0};
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
queue<int> out;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
out.push(a);
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if (out.front() == i) {
while (out.front() == i)
out.pop();
continue;
}
dp[i + 1] += dp[i];
dp[i + 1] %= mod;
dp[i + 2] += dp[i];
dp[i + 2] %= mod;
}
cout << dp[n] << endl;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[100005] = {0};
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
queue<int> out;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
out.push(a);
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if (!out.empty()) {
if (out.front() == i) {
while (out.front() == i && !out.empty())
out.pop();
continue;
}
}
dp[i + 1] += dp[i];
dp[i + 1] %= mod;
dp[i + 2] += dp[i];
dp[i + 2] %= mod;
}
cout << dp[n] << endl;
}
| replace | 20 | 24 | 20 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define ll long long int
using namespace std;
int main() {
int n, m, denger_id;
vector<int> a;
vector<ll> step;
cin >> n >> m;
a.resize(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
step.resize(n + 100);
for (int i = 0; i < n + 1; i++) {
step[i] = 0;
}
step[0] = 1;
denger_id = 0;
if (a[denger_id] == 1) {
step[1] = 0;
denger_id++;
} else {
step[1] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (i == a[denger_id]) {
denger_id++;
} else {
step[i] = (step[i - 1] + step[i - 2]) % 1000000007;
}
}
cout << step[n] % 1000000007 << endl;
return 0;
} | #include <iostream>
#include <vector>
#define ll long long int
using namespace std;
int main() {
int n, m, denger_id;
vector<int> a;
vector<ll> step;
cin >> n >> m;
a.resize(m + 100);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
step.resize(n + 100);
for (int i = 0; i < n + 1; i++) {
step[i] = 0;
}
step[0] = 1;
denger_id = 0;
if (a[denger_id] == 1) {
step[1] = 0;
denger_id++;
} else {
step[1] = 1;
}
for (int i = 2; i < n + 1; i++) {
if (i == a[denger_id]) {
denger_id++;
} else {
step[i] = (step[i - 1] + step[i - 2]) % 1000000007;
}
}
cout << step[n] % 1000000007 << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i++) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
}
cout << dp[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 1] + dp[i + 2]) % mod;
}
cout << dp[0] << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | -11 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using MIte = multimap<vector<long>, int>::iterator;
const long long mod_const = 1000000007;
// i段目までの行き方
long long Pattern(int i, const vector<int> &vA) {
if (i == 0) {
return 1;
} else if (i == 1) {
return 1;
} else {
long long a = 0;
long long b = 0;
if (vA[i - 2] == 0)
a = 1;
if (vA[i - 1] == 0)
b = 1;
return ((a * Pattern(i - 2, vA) + b * Pattern(i - 1, vA)) % mod_const);
}
}
int main() {
int N, M;
cin >> N >> M;
vector<int> vA(N + 1, 0);
for (int i = 0; i != M; ++i) {
int w = 0;
cin >> w;
vA[w] = 1;
if (w >= 1) {
if (vA[w - 1] == 1) {
cout << "0" << endl;
return 0;
}
}
}
vector<long long> vPattern(N + 1, 0);
vPattern[0] = 1;
vPattern[1] = 1;
int i = 2;
while (1) {
long long a = 0;
long long b = 0;
if (vA[i - 2] == 0)
a = 1;
if (vA[i - 1] == 0)
b = 1;
if (vA[i] == 0) {
vPattern[i] = (a * vPattern[i - 2] + b * vPattern[i - 1]) % mod_const;
} else {
vPattern[i] = 0;
}
i++;
if (i == N + 1) {
break;
}
}
cout << vPattern[N] << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using MIte = multimap<vector<long>, int>::iterator;
const long long mod_const = 1000000007;
// i段目までの行き方
long long Pattern(int i, const vector<int> &vA) {
if (i == 0) {
return 1;
} else if (i == 1) {
return 1;
} else {
long long a = 0;
long long b = 0;
if (vA[i - 2] == 0)
a = 1;
if (vA[i - 1] == 0)
b = 1;
return ((a * Pattern(i - 2, vA) + b * Pattern(i - 1, vA)) % mod_const);
}
}
int main() {
int N, M;
cin >> N >> M;
vector<int> vA(N + 1, 0);
for (int i = 0; i != M; ++i) {
int w = 0;
cin >> w;
vA[w] = 1;
if (w >= 1) {
if (vA[w - 1] == 1) {
cout << "0" << endl;
return 0;
}
}
}
vector<long long> vPattern(N + 1, 0);
vPattern[0] = 1;
vPattern[1] = 1;
int i = 2;
if (N >= 2) {
while (1) {
long long a = 0;
long long b = 0;
if (vA[i - 2] == 0)
a = 1;
if (vA[i - 1] == 0)
b = 1;
if (vA[i] == 0) {
vPattern[i] = (a * vPattern[i - 2] + b * vPattern[i - 1]) % mod_const;
} else {
vPattern[i] = 0;
}
i++;
if (i == N + 1) {
break;
}
}
}
cout << vPattern[N] << endl;
return 0;
} | replace | 61 | 76 | 61 | 78 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll n, m, a, dp[100010];
string s[2010];
bool ju[2010];
ll pow(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
return pow(x, y - 1) * x % mod;
} else {
ll yyy = pow(x, y / 2);
return yyy * yyy % mod;
}
}
ll div(ll x) { return pow(x, mod - 2); }
int main(void) {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a;
ju[a] = true;
}
dp[0] = 1;
if (!ju[1]) {
dp[1] = 1;
}
for (int i = 2; i <= n; i++) {
if (!ju[i]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[n] << endl;
int www;
cin >> www;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll n, m, a, dp[100010];
string s[2010];
bool ju[100010];
ll pow(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2) {
return pow(x, y - 1) * x % mod;
} else {
ll yyy = pow(x, y / 2);
return yyy * yyy % mod;
}
}
ll div(ll x) { return pow(x, mod - 2); }
int main(void) {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a;
ju[a] = true;
}
dp[0] = 1;
if (!ju[1]) {
dp[1] = 1;
}
for (int i = 2; i <= n; i++) {
if (!ju[i]) {
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
}
cout << dp[n] << endl;
int www;
cin >> www;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), rend()
#define PB pushback
#define SORT(c) sort((c).begin(), (c).end())
const LL INF = 1LL << 60;
// priority_queue<int> p;
int i, j, k, tmp, ans, cnt, N, M;
string s;
// scanf("%d",&N);
// printf("%d", ans);
// cout << << endl;
int main(void) {
vector<LL> A;
vector<int> a;
cnt = 0;
scanf("%d %d", &N, &M);
REP(i, M) {
scanf("%d", &tmp);
a.push_back(tmp);
}
REP(i, N + 1) { A.push_back(0); }
tmp = 0;
A.at(0) = 1;
if (a.at(cnt) != 1) {
A.at(1) = 1;
} else {
cnt++;
}
for (int i = 2; i < N + 1; i++) {
if (a.size() > cnt && i == a.at(cnt)) {
cnt++;
A.at(i) = 0;
} else {
A.at(i) = (A.at(i - 1) + A.at(i - 2)) % 1000000007LL;
if (A.at(i) == 0) {
printf("0\n");
return 0;
}
}
}
printf("%lld", A.at(N) % 1000000007);
return 0;
} | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), rend()
#define PB pushback
#define SORT(c) sort((c).begin(), (c).end())
const LL INF = 1LL << 60;
// priority_queue<int> p;
int i, j, k, tmp, ans, cnt, N, M;
string s;
// scanf("%d",&N);
// printf("%d", ans);
// cout << << endl;
int main(void) {
vector<LL> A;
vector<int> a;
cnt = 0;
scanf("%d %d", &N, &M);
if (M == 0) {
a.push_back(0);
}
REP(i, M) {
scanf("%d", &tmp);
a.push_back(tmp);
}
REP(i, N + 1) { A.push_back(0); }
tmp = 0;
A.at(0) = 1;
if (a.at(cnt) != 1) {
A.at(1) = 1;
} else {
cnt++;
}
for (int i = 2; i < N + 1; i++) {
if (a.size() > cnt && i == a.at(cnt)) {
cnt++;
A.at(i) = 0;
} else {
A.at(i) = (A.at(i - 1) + A.at(i - 2)) % 1000000007LL;
if (A.at(i) == 0) {
printf("0\n");
return 0;
}
}
}
printf("%lld", A.at(N) % 1000000007);
return 0;
} | insert | 45 | 45 | 45 | 48 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.