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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03011 | Python | Runtime Error | p, q, r = map(int, input().split())
sorted_list = sorted(list[p, q, r])
ans = sorted_list[0] + sorted_list[1]
print(ans)
| p, q, r = map(int, input().split())
sorted_list = sorted([p, q, r])
ans = sorted_list[0] + sorted_list[1]
print(ans)
| replace | 1 | 2 | 1 | 2 | TypeError: 'types.GenericAlias' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s382927375.py", line 2, in <module>
sorted_list = sorted(list[p, q, r])
TypeError: 'types.GenericAlias' object is not iterable
|
p03011 | Python | Runtime Error | # coding: utf-8
p, q, r = [int(x) for x in input().rstrip().split(" ")]
s = []
s[0] = p + q
s[1] = q + r
s[2] = r + p
print(min(s))
| # coding: utf-8
p, q, r = [int(x) for x in input().rstrip().split(" ")]
s = [0, 0, 0]
s[0] = p + q
s[1] = q + r
s[2] = r + p
print(min(s))
| replace | 4 | 5 | 4 | 5 | IndexError: list assignment index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s517518252.py", line 6, in <module>
s[0] = p + q
IndexError: list assignment index out of range
|
p03011 | Python | Runtime Error | A = [int(input()) for i in range(3)]
ans = sum(A) - max(A)
print(ans)
| A = list(map(int, input().split()))
ans = sum(A) - max(A)
print(ans)
| replace | 0 | 2 | 0 | 1 | ValueError: invalid literal for int() with base 10: '1 3 4' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s647136581.py", line 1, in <module>
A = [int(input()) for i in range(3)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s647136581.py", line 1, in <listcomp>
A = [int(input()) for i in range(3)]
ValueError: invalid literal for int() with base 10: '1 3 4'
|
p03011 | Python | Runtime Error | p = list(map(int, input().split()))
print(p[0] + p[1] + [2] - max(p))
| p = list(map(int, input().split()))
print(p[0] + p[1] + p[2] - max(p))
| replace | 1 | 2 | 1 | 2 | TypeError: unsupported operand type(s) for +: 'int' and 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03011/Python/s411748384.py", line 2, in <module>
print(p[0] + p[1] + [2] - max(p))
TypeError: unsupported operand type(s) for +: 'int' and 'list'
|
p03011 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
vector<int> a(2);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
vector<int> a(3);
cin >> a.at(0) >> a.at(1) >> a.at(2);
sort(a.begin(), a.end());
cout << a.at(0) + a.at(1) << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03011 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define sz size
#define f first
#define s second
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p, q, r;
cin >> p >> q >> r;
int sum = 0;
sum += min(min((p + q), (p + r)), (r + q));
cout << sum;
return 0;
}
| #pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); ++i)
#define pb push_back
#define sz size
#define f first
#define s second
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int p, q, r;
cin >> p >> q >> r;
int sum = 0;
sum += min(min((p + q), (p + r)), (r + q));
cout << sum;
return 0;
}
| replace | 16 | 18 | 16 | 18 | 0 | |
p03011 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r;
while (true) {
cin >> p >> q >> r;
cout << p + q + r - max({p, q, r}) << endl;
}
}
| #include <algorithm>
#include <assert.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int p, q, r;
cin >> p >> q >> r;
cout << p + q + r - max({p, q, r}) << endl;
}
| replace | 8 | 12 | 8 | 10 | TLE | |
p03011 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int P, Q, R;
int min;
while (scanf("%d %d %d", &P, &Q, &R)) {
min = P + Q;
if (P + R < min)
min = P + R;
if (Q + R < min)
min = Q + R;
printf("%d\n", min);
}
return 0;
} | #include <stdio.h>
int main() {
int P, Q, R, min, i;
for (i = 0; i < 100; i++) {
if (scanf("%d %d %d", &P, &Q, &R) != 3)
break;
min = P + Q;
if (P + R < min)
min = P + R;
if (Q + R < min)
min = Q + R;
printf("%d\n", min);
}
return 0;
} | replace | 3 | 6 | 3 | 7 | TLE | |
p03011 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (i = 0; i < n; ++i)
#define REP(i, k, n) for (i = k; i < n; ++i)
#define REPR(i, k, n) for (i = k; i >= n; --i)
#define WATCH(x) cout << (#x) << " is " << (x) << endl
#define PB push_back
#define N 300101
#define SZ 3001
#define LB lower_bound
#define M 1000000007
#define UB upper_bound
#define MP make_pair
#define LD long double
#define F first
#define S second
typedef vector<long long int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (auto i = c.begin(); i != c.end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c),x) != (c).end()
#define flash \
ios_base::sync_with_stdio(false); \
cin.tie(NULL), cout.tie(NULL);
int main() {
flash
#ifndef ONLINE_JUDGE
freopen("inp", "r", stdin);
#else
// online submission
#endif
ll p, q, r;
cin >> p >> q >> r;
ll max = p + q;
if (max > q + r) {
max = q + r;
}
if (max > r + p) {
max = r + p;
}
cout << max << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (i = 0; i < n; ++i)
#define REP(i, k, n) for (i = k; i < n; ++i)
#define REPR(i, k, n) for (i = k; i >= n; --i)
#define WATCH(x) cout << (#x) << " is " << (x) << endl
#define PB push_back
#define N 300101
#define SZ 3001
#define LB lower_bound
#define M 1000000007
#define UB upper_bound
#define MP make_pair
#define LD long double
#define F first
#define S second
typedef vector<long long int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (auto i = c.begin(); i != c.end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c),x) != (c).end()
#define flash \
ios_base::sync_with_stdio(false); \
cin.tie(NULL), cout.tie(NULL);
int main() {
ll p, q, r;
cin >> p >> q >> r;
ll max = p + q;
if (max > q + r) {
max = q + r;
}
if (max > r + p) {
max = r + p;
}
cout << max << endl;
}
| delete | 34 | 40 | 34 | 34 | 0 | |
p03011 | C++ | Runtime Error | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, sizeof(a))
#define all(x) x.begin(), x.end()
#define itit(it, a) for (auto it = (a).begin(); it != (a).end(); it++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, a, b) for (ll i = a; i > b; i--)
#define reprr(i, a, b) for (ll i = a; i >= b; i--)
#define pi 3.14159265358979323846264338327950288419716939937510582097494459230
ll max3(ll x, ll y, ll z) { return max(max(x, y), z); }
ll min3(ll x, ll y, ll z) { return min(min(x, y), z); }
const ll M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int &a, int b) {
a += b;
if (a >= mod) {
a -= mod;
}
}
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
ll power(ll x, ll n) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = ((x % mod) * (x % mod)) % mod;
n = n / 2;
}
return result;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a[3];
rep(i, 0, 3) cin >> a[i];
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
}
/* The judge is never wrong! Your code is buggy
Look for:
* * Read the problem carefully.
* * Don't forget to sort(), mod, ll!!!!
* * Initial value = +/- infinity instead of zero!!!
* * an easier and alternate approach
* * read the problem statement carefully
* * if concept is correct and still WA, try with a different implementation
* * special cases (n=1?)
* * if you have no idea just guess the appropriate well-known algorithm instead
of doing nothing :/
*/ | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, sizeof(a))
#define all(x) x.begin(), x.end()
#define itit(it, a) for (auto it = (a).begin(); it != (a).end(); it++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, a, b) for (ll i = a; i > b; i--)
#define reprr(i, a, b) for (ll i = a; i >= b; i--)
#define pi 3.14159265358979323846264338327950288419716939937510582097494459230
ll max3(ll x, ll y, ll z) { return max(max(x, y), z); }
ll min3(ll x, ll y, ll z) { return min(min(x, y), z); }
const ll M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int &a, int b) {
a += b;
if (a >= mod) {
a -= mod;
}
}
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
ll power(ll x, ll n) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = ((x % mod) * (x % mod)) % mod;
n = n / 2;
}
return result;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a[3];
rep(i, 0, 3) cin >> a[i];
sort(a, a + 3);
cout << a[0] + a[1];
return 0;
}
/* The judge is never wrong! Your code is buggy
Look for:
* * Read the problem carefully.
* * Don't forget to sort(), mod, ll!!!!
* * Initial value = +/- infinity instead of zero!!!
* * an easier and alternate approach
* * read the problem statement carefully
* * if concept is correct and still WA, try with a different implementation
* * special cases (n=1?)
* * if you have no idea just guess the appropriate well-known algorithm instead
of doing nothing :/
*/ | replace | 66 | 68 | 66 | 68 | 0 | |
p03011 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int p, q, r, a;
cin >> p >> q >> r;
a = min(p + q, q + r);
a = min(a, p + r);
cout << a << endl;
return 1;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int p, q, r, a;
cin >> p >> q >> r;
a = min(p + q, q + r);
a = min(a, p + r);
cout << a << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 1 | |
p03011 | C++ | Runtime Error | // Created by code_sm
//
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> pseudo_set;
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int, int>
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define extract_word(s) \
stringstream str(s); \
while (str >> word)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define SET(s) cout << fixed << setprecision(s)
#define chotu 1000000007
#define set0(a) memset(a, 0, sizeof(a))
#define endl "\n"
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define lower_string(s) transform(all(s), s.begin(), ::tolower())
#define upper_string(s) transform(all(s), s.begin(), ::toupper())
#define size(s) s.size()
template <class T> bool umin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool umax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
template <typename T, typename U> bool compare(T x, U y) {
return (abs(x - y) <= 1e-9);
}
void solve() {
fastio int p, q, r;
cin >> p >> q >> r;
int x = p + q;
int y = q + r;
int z = p + r;
cout << min(x, min(y, z));
}
int main() {
// code
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio int t;
t = 1;
while (t--) {
solve();
cout << endl;
}
}
| // Created by code_sm
//
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> pseudo_set;
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int, int>
#define pb push_back
#define pf push_front
#define pii pair<int, int>
#define extract_word(s) \
stringstream str(s); \
while (str >> word)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define SET(s) cout << fixed << setprecision(s)
#define chotu 1000000007
#define set0(a) memset(a, 0, sizeof(a))
#define endl "\n"
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define lower_string(s) transform(all(s), s.begin(), ::tolower())
#define upper_string(s) transform(all(s), s.begin(), ::toupper())
#define size(s) s.size()
template <class T> bool umin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T> bool umax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
template <typename T, typename U> bool compare(T x, U y) {
return (abs(x - y) <= 1e-9);
}
void solve() {
fastio int p, q, r;
cin >> p >> q >> r;
int x = p + q;
int y = q + r;
int z = p + r;
cout << min(x, min(y, z));
}
int main() {
// code
fastio int t;
t = 1;
while (t--) {
solve();
cout << endl;
}
}
| replace | 50 | 54 | 50 | 51 | 0 | |
p03011 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> fl;
for (int i = 0; i < 3; i++) {
cin >> fl.at(i);
}
sort(fl.begin(), fl.end());
cout << fl.at(0) + fl.at(1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> fl(3);
for (int i = 0; i < 3; i++) {
cin >> fl.at(i);
}
sort(fl.begin(), fl.end());
cout << fl.at(0) + fl.at(1) << endl;
} | replace | 3 | 4 | 3 | 4 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03011 | C++ | Runtime Error | // https://atcoder.jp/contests/abc129/tasks/abc129_a
#include <bits/stdc++.h>
#define debugi(x) cerr << "x -> " << x << endl;
#define For(i, n) for (__typeof(i) i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve() {
int i;
vector<int> flight_times(3, INT_MAX);
For(i, 3) { cin >> flight_times[i]; }
sort(all(flight_times));
cout << flight_times[0] + flight_times[1] << endl;
}
int main() {
_;
ull testcases = 1LL;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cin >> testcases;
while (testcases--)
solve();
return 0;
} | // https://atcoder.jp/contests/abc129/tasks/abc129_a
#include <bits/stdc++.h>
#define debugi(x) cerr << "x -> " << x << endl;
#define For(i, n) for (__typeof(i) i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define _ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
void solve() {
int i;
vector<int> flight_times(3, INT_MAX);
For(i, 3) { cin >> flight_times[i]; }
sort(all(flight_times));
cout << flight_times[0] + flight_times[1] << endl;
}
int main() {
_;
ull testcases = 1LL;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// cin >> testcases;
while (testcases--)
solve();
return 0;
} | replace | 23 | 27 | 23 | 27 | 0 | |
p03012 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s1 += w[i];
}
s2 = 0;
for (int i = t + 1; t < n; i++) {
s2 += w[i];
}
m = min(m, abs(s1 - s2));
}
printf("%d\n", m);
return 0;
} | #include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
int n;
int w[101];
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int m = INT_MAX;
int s1, s2;
for (int t = 1; t < n; t++) {
s1 = 0;
for (int i = 1; i <= t; i++) {
s1 += w[i];
}
s2 = 0;
for (int i = t + 1; i <= n; i++) {
s2 += w[i];
}
m = min(m, abs(s1 - s2));
}
printf("%d\n", m);
return 0;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n, 0), s(n, 0);
for (int i = 1; i < n + 1; ++i) {
cin >> w[i];
s[i] = s[i - 1] + w[i];
}
int mn = 1e9;
for (int i = 1; i < n; ++i) {
mn = min(mn, abs(s[n] - 2 * s[i]));
}
cout << mn << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> w(n + 1, 0), s(n + 1, 0);
for (int i = 1; i < n + 1; ++i) {
cin >> w[i];
s[i] = s[i - 1] + w[i];
}
int mn = 1e9;
for (int i = 1; i < n; ++i) {
mn = min(mn, abs(s[n] - 2 * s[i]));
}
cout << mn << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p03012 | C++ | Runtime Error |
#include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> w(n);
FOR(i, 0, n) cin >> w[i];
int ans = mod, ss = 0;
w[n] = 0;
FOR(i, 0, n) ss += w[i];
FOR(i, 0, n + 1) {
int s = 0;
FOR(j, 0, i) { s += w[j]; }
int t = abs(ss - s - s);
ans = min(ans, t);
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define FORQ(i, b, e) for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b)-1; i >= (e); --i)
#define REP(x, n) for (int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int, int>
#define pll pair<LL, LL>
const double pi = 3.14159265358979323846264;
const int mod = 1000000007;
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// std::cout << std::fixed;
// std::cout << std::setprecision(12);
// std::cout << std::defaultfloat;
int n;
cin >> n;
vector<int> w(n + 1, 0);
FOR(i, 0, n) cin >> w[i];
int ans = mod, ss = 0;
w[n] = 0;
FOR(i, 0, n) ss += w[i];
FOR(i, 0, n + 1) {
int s = 0;
FOR(j, 0, i) { s += w[j]; }
int t = abs(ss - s - s);
ans = min(ans, t);
}
cout << ans << endl;
return 0;
}
| replace | 50 | 51 | 50 | 51 | 0 | |
p03012 | C++ | Runtime Error | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I8888888888888888 _________ ,8888888888888b
// __________`Y88888888888888P"""""""""""baaa,__
// ,888888888888888,
// ,adP"""""""""""9888888888P""^ ^""Y8888888888888888I
// ,a8"^ ,d888P"888P^ ^"Y8888888888P'
// ,a8^ ,d8888' ^Y8888888P'
// a88' ,d8888P' I88P"^
// ,d88' d88888P' "b,
// ,d88' d888888' `b,
// ,d88' d888888I `b,
// d88I ,8888888' ___ `b,
// ,888' d8888888 ,d88888b, ____ `b,
// d888 ,8888888I d88888888b, ,d8888b, `b
// ,8888 I8888888I d8888888888I ,88888888b 8, I8888
// 88888888b d88888888888' 8888888888b 8I d8886
// 888888888 Y888888888P' Y8888888888, ,8b 88888b
// I88888888b `Y8888888^ `Y888888888I d88, Y88888b
// `888888888b, `""""^ `Y8888888P' d888I `888888b
// 88888888888b, `Y8888P^ d88888
// Y888888b ,8888888888888ba,_ _______ `""^ ,d888888
// I8888888b, ,888888888888888888ba,_ d88888888b ,ad8888888I
// `888888888b, I8888888888888888888888b, ^"Y888P"^ ____.,ad88888888888I
// 88888888888b,`888888888888888888888888b, "" ad888888888888888888888'
// 8888888888888698888888888888888888888888b_,ad88ba,_,d88888888888888888888888
// 88888888888888888888888888888888888888888b,`"""^
// d8888888888888888888888888I
// 8888888888888888888888888888888888888888888baaad888888888888888888888888888'
// Y8888888888888888888888888888888888888888888888888888888888888888888888888P
// I888888888888888888888888888888888888888888888P^ ^Y8888888888888888888888'
// `Y88888888888888888P88888888888888888888888888' ^88888888888888888888I
// `Y8888888888888888 `8888888888888888888888888 8888888888888888888P'
// `Y888888888888888 `888888888888888888888888, ,888888888888888888P'
// `Y88888888888888b `88888888888888888888888I I888888888888888888'
// "Y8888888888888b `8888888888888888888888I I88888888888888888'
// "Y88888888888P `888888888888888888888b d8888888888888888'
// ^""""""""^ `Y88888888888888888888, 888888888888888P'
// "8888888888888888888b, Y888888888888P^
// `Y888888888888888888b `Y8888888P"^
// "Y8888888888888888P `""""^
// `"YY88888888888P'
// ^""""""""'
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define vl vector<long long>
#define vpii vector<pii>
#define vpipii vector<pipii>
#define vb vector<bool>
#define pb push_back
#define pob pop_back
#define gcd __gcd
#define mp make_pair
#define pii pair<int, int>
#define pipii pair<int, pii>
#define pll pair<long long, long long>
#define pld pair<long double, long double>
#define mod 1000000007
#define mod2 998244353
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repp(i, a, b) for (ll i = a; i < b; i++)
#define reppr(i, a, b) for (ll i = a - 1; i >= b; i--)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define ff first
#define ss second
#define pc putchar_unlocked
#define gc getchar_unlocked
#define inf 1000000000000
#define infn -9223372036854775807
#define pi 3.14159265358979323846
#define eps 0.0000000001
#define sp << " " <<
#define len(s) s.size()
#define setprecision0 cout << fixed << setprecision(0);
#define setprecision10 cout << fixed << setprecision(10);
#define all(n) n.begin(), n.end()
#define SORT(v) sort(all(v))
void solve();
signed main() {
fast;
if (1) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int t = 1;
// cin >> t;
while (t--)
solve();
}
void solve() {
int n, sum = 0;
cin >> n;
int a[n];
rep(i, n) cin >> a[i], sum += a[i];
int ans = sum, l = 0, r = sum;
rep(i, n) {
int curr = a[i];
l += curr;
r -= curr;
i++;
while (i != n && curr == a[i])
i++, l += curr, r -= curr;
ans = min(ans, abs(l - r));
if (i == n)
break;
i--;
}
cout << ans;
} | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I8888888888888888 _________ ,8888888888888b
// __________`Y88888888888888P"""""""""""baaa,__
// ,888888888888888,
// ,adP"""""""""""9888888888P""^ ^""Y8888888888888888I
// ,a8"^ ,d888P"888P^ ^"Y8888888888P'
// ,a8^ ,d8888' ^Y8888888P'
// a88' ,d8888P' I88P"^
// ,d88' d88888P' "b,
// ,d88' d888888' `b,
// ,d88' d888888I `b,
// d88I ,8888888' ___ `b,
// ,888' d8888888 ,d88888b, ____ `b,
// d888 ,8888888I d88888888b, ,d8888b, `b
// ,8888 I8888888I d8888888888I ,88888888b 8, I8888
// 88888888b d88888888888' 8888888888b 8I d8886
// 888888888 Y888888888P' Y8888888888, ,8b 88888b
// I88888888b `Y8888888^ `Y888888888I d88, Y88888b
// `888888888b, `""""^ `Y8888888P' d888I `888888b
// 88888888888b, `Y8888P^ d88888
// Y888888b ,8888888888888ba,_ _______ `""^ ,d888888
// I8888888b, ,888888888888888888ba,_ d88888888b ,ad8888888I
// `888888888b, I8888888888888888888888b, ^"Y888P"^ ____.,ad88888888888I
// 88888888888b,`888888888888888888888888b, "" ad888888888888888888888'
// 8888888888888698888888888888888888888888b_,ad88ba,_,d88888888888888888888888
// 88888888888888888888888888888888888888888b,`"""^
// d8888888888888888888888888I
// 8888888888888888888888888888888888888888888baaad888888888888888888888888888'
// Y8888888888888888888888888888888888888888888888888888888888888888888888888P
// I888888888888888888888888888888888888888888888P^ ^Y8888888888888888888888'
// `Y88888888888888888P88888888888888888888888888' ^88888888888888888888I
// `Y8888888888888888 `8888888888888888888888888 8888888888888888888P'
// `Y888888888888888 `888888888888888888888888, ,888888888888888888P'
// `Y88888888888888b `88888888888888888888888I I888888888888888888'
// "Y8888888888888b `8888888888888888888888I I88888888888888888'
// "Y88888888888P `888888888888888888888b d8888888888888888'
// ^""""""""^ `Y88888888888888888888, 888888888888888P'
// "8888888888888888888b, Y888888888888P^
// `Y888888888888888888b `Y8888888P"^
// "Y8888888888888888P `""""^
// `"YY88888888888P'
// ^""""""""'
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define vl vector<long long>
#define vpii vector<pii>
#define vpipii vector<pipii>
#define vb vector<bool>
#define pb push_back
#define pob pop_back
#define gcd __gcd
#define mp make_pair
#define pii pair<int, int>
#define pipii pair<int, pii>
#define pll pair<long long, long long>
#define pld pair<long double, long double>
#define mod 1000000007
#define mod2 998244353
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repp(i, a, b) for (ll i = a; i < b; i++)
#define reppr(i, a, b) for (ll i = a - 1; i >= b; i--)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define ff first
#define ss second
#define pc putchar_unlocked
#define gc getchar_unlocked
#define inf 1000000000000
#define infn -9223372036854775807
#define pi 3.14159265358979323846
#define eps 0.0000000001
#define sp << " " <<
#define len(s) s.size()
#define setprecision0 cout << fixed << setprecision(0);
#define setprecision10 cout << fixed << setprecision(10);
#define all(n) n.begin(), n.end()
#define SORT(v) sort(all(v))
void solve();
signed main() {
fast;
if (0) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int t = 1;
// cin >> t;
while (t--)
solve();
}
void solve() {
int n, sum = 0;
cin >> n;
int a[n];
rep(i, n) cin >> a[i], sum += a[i];
int ans = sum, l = 0, r = sum;
rep(i, n) {
int curr = a[i];
l += curr;
r -= curr;
i++;
while (i != n && curr == a[i])
i++, l += curr, r -= curr;
ans = min(ans, abs(l - r));
if (i == n)
break;
i--;
}
cout << ans;
} | replace | 97 | 98 | 97 | 98 | 0 | |
p03012 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<int> accum(n + 1); // 累積和
vector<int> w(n);
accum[0] = 0;
rep(i, n) cin >> w.at(i);
for (int i = 1; i < n + 1; i++) {
accum.at(i) = accum.at(i - 1) + w.at(i);
}
int ans = 1e9;
rep(i, n) { ans = min(ans, abs(accum.at(n) - 2 * accum.at(i))); }
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<int> accum(n + 1); // 累積和
vector<int> w(n);
accum[0] = 0;
rep(i, n) cin >> w.at(i);
for (int i = 1; i < n + 1; i++) {
accum.at(i) = accum.at(i - 1) + w.at(i - 1);
}
int ans = 1e9;
rep(i, n) { ans = min(ans, abs(accum.at(n) - 2 * accum.at(i))); }
cout << ans << endl;
} | replace | 24 | 25 | 24 | 25 | -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 3)
|
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 1; i <= N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) {
r += W.at(j);
}
ans = min(ans, abs(l - r));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++) {
cin >> W.at(i);
}
int ans = 1e9;
for (int i = 1; i < N; i++) {
int l = 0, r = 0;
for (int j = 0; j < i; j++) {
l += W.at(j);
}
for (int j = i; j < N; j++) {
r += W.at(j);
}
ans = min(ans, abs(l - r));
}
cout << ans << endl;
}
| replace | 6 | 7 | 6 | 7 | -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 3)
|
p03012 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
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 MOD = 1000000007;
const int INF = 1 << 30;
// const ll INF = (ll)1e18 + 1;
int main() {
int N;
cin >> N;
vector<int> W(N);
rep(i, N) cin >> W[i];
vector<int> s(N + 1, 0);
rep(i, N + 1) s[i + 1] = s[i] + W[i];
ll ans = INF;
for (int t = 0; t < N; ++t) {
ll s1 = s[t + 1];
ll s2 = s[N] - s[t + 1];
chmin(ans, abs(s1 - s2));
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
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 MOD = 1000000007;
const int INF = 1 << 30;
// const ll INF = (ll)1e18 + 1;
int main() {
int N;
cin >> N;
vector<int> W(N);
rep(i, N) cin >> W[i];
vector<int> s(N + 1, 0);
rep(i, N) s[i + 1] = s[i] + W[i];
ll ans = INF;
for (int t = 0; t < N; ++t) {
ll s1 = s[t + 1];
ll s2 = s[N] - s[t + 1];
chmin(ans, abs(s1 - s2));
}
cout << ans << endl;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p03012 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int absolute(int a);
int main() {
int N, i, ans = 10010;
cin >> N;
vector<int> W(N), sum(N);
for (i = 0; i < N; i++)
cin >> W[i];
sum[0] = W[0];
for (i = 0; i < N; i++)
sum[i + 1] = sum[i] + W[i + 1];
for (i = 0; i < N; i++) {
if (ans > absolute(2 * sum[i] - sum[N - 1]))
ans = absolute(2 * sum[i] - sum[N - 1]);
}
cout << ans << endl;
}
int absolute(int a) {
if (a < 0)
return -a;
else
return a;
} | #include <iostream>
#include <vector>
using namespace std;
int absolute(int a);
int main() {
int N, i, ans = 10010;
cin >> N;
vector<int> W(N), sum(N);
for (i = 0; i < N; i++)
cin >> W[i];
sum[0] = W[0];
for (i = 0; i < N - 1; i++)
sum[i + 1] = sum[i] + W[i + 1];
for (i = 0; i < N; i++) {
if (ans > absolute(2 * sum[i] - sum[N - 1]))
ans = absolute(2 * sum[i] - sum[N - 1]);
}
cout << ans << endl;
}
int absolute(int a) {
if (a < 0)
return -a;
else
return a;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03012 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<int> ts;
ts.push_back(0);
int w;
for (int i = 1; i <= N; ++i) {
cin >> w;
ts[i] = ts[i - 1] + w;
}
int ans = 1000000;
for (int t = 1; t < N; ++t) {
int s1 = ts[t];
int s2 = ts[N] - ts[t];
chmin(ans, abs(s1 - s2));
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<int> ts(N + 1);
ts[0] = 0;
int w;
for (int i = 1; i <= N; ++i) {
cin >> w;
ts[i] = ts[i - 1] + w;
}
int ans = 1000000;
for (int t = 1; t < N; ++t) {
int s1 = ts[t];
int s2 = ts[N] - ts[t];
chmin(ans, abs(s1 - s2));
}
cout << ans << endl;
return 0;
} | replace | 15 | 17 | 15 | 17 | 0 | |
p03012 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
int now, n, k;
int main() {
int ans = 999999999;
cin >> n;
vector<int> a(n), csum(n + 1, 0);
REP(i, n) cin >> a[i];
REP(i, n + 1) csum[i + 1] = csum[i] + a[i];
REP(i, n - 1) ans = min(ans, abs(csum[n] - csum[i + 1] - csum[i + 1]));
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
int now, n, k;
int main() {
int ans = 999999999;
cin >> n;
vector<int> a(n), csum(n + 1, 0);
REP(i, n) cin >> a[i];
REP(i, n) csum[i + 1] = csum[i] + a[i];
REP(i, n - 1) ans = min(ans, abs(csum[n] - csum[i + 1] - csum[i + 1]));
cout << ans << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MODNum 1000000007
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
int N, ans;
scanf("%d", &N);
vector<int> W(N);
int Sum = 0;
REP(int, i, 0, N) {
scanf("%lld", &W.at(i));
Sum += W.at(i);
}
ans = INT_MAX;
int Sum2 = Sum;
REP(int, i, 0, N) {
Sum2 -= W.at(i);
int Sum1 = Sum - Sum2;
int Diff = abs(Sum1 - Sum2);
ans = min(ans, Diff);
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define MODNum 1000000007
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
int N, ans;
scanf("%d", &N);
vector<int> W(N);
int Sum = 0;
REP(int, i, 0, N) {
scanf("%d", &W.at(i));
Sum += W.at(i);
}
ans = INT_MAX;
int Sum2 = Sum;
REP(int, i, 0, N) {
Sum2 -= W.at(i);
int Sum1 = Sum - Sum2;
int Diff = abs(Sum1 - Sum2);
ans = min(ans, Diff);
}
printf("%d\n", ans);
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03012 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sum = 0, keep = 0, a, b;
cin >> n;
vector<int> w(n), x(n - 1);
for (i = 0; i < n; i++) {
cin >> w.at(i);
sum += w.at(i);
}
for (i = 0; i < n; i++) {
keep += w.at(i);
x.at(i) = abs(sum - 2 * keep);
}
sort(x.begin(), x.end());
cout << x.at(0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, sum = 0, keep = 0, a, b;
cin >> n;
vector<int> w(n), x(n);
for (i = 0; i < n; i++) {
cin >> w.at(i);
sum += w.at(i);
}
for (i = 0; i < n; i++) {
keep += w.at(i);
x.at(i) = abs(sum - 2 * keep);
}
sort(x.begin(), x.end());
cout << x.at(0) << endl;
}
| replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p03012 | Python | Runtime Error | N = input()
W = list(map(int, input().split()))
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
| N = int(input())
W = list(map(int, input().split()))
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
| replace | 0 | 1 | 0 | 1 | TypeError: 'str' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03012/Python/s648426101.py", line 3, in <module>
print(min([abs(sum(W[:i]) - sum(W[i:])) for i in range(N)]))
TypeError: 'str' object cannot be interpreted as an integer
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n, m, a;
cin >> n >> m;
vector<bool> br(m);
vector<ll> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> a;
br[a] = true;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if (i + 1 <= n && !br[i + 1])
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
if (i + 2 <= n && !br[i + 2])
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = (1e+9) + 7;
int main() {
int n, m, a;
cin >> n >> m;
vector<bool> br(n + 1, false);
vector<ll> dp(n + 1, 0);
for (int i = 0; i < m; i++) {
cin >> a;
br[a] = true;
}
dp[0] = 1;
for (int i = 0; i < n; i++) {
if (i + 1 <= n && !br[i + 1])
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
if (i + 2 <= n && !br[i + 2])
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
cout << dp[n] << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD ((ll)1e9 + 7)
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; i++) {
cin >> a[i];
}
vector<ll> dan(N + 1);
dan[0] = 1;
int j = 0;
for (int i = 1; i < N + 1; i++) {
if (i == a[j]) {
if (dan[i - 1] == 0) {
cout << 0;
return 0;
} else {
dan[i] = 0;
}
if (j < M - 1) {
j++;
}
} else {
if (i == 1) {
dan[i] = dan[i - 1];
} else {
dan[i] = dan[i - 1] + dan[i - 2];
}
}
dan[i] %= MOD;
}
cout << dan[N];
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define MOD ((ll)1e9 + 7)
int main() {
int N, M;
cin >> N >> M;
vector<int> a(100001, 0);
if (M != 0) {
for (int i = 0; i < M; i++) {
cin >> a[i];
}
}
vector<ll> dan(N + 1);
dan[0] = 1;
int j = 0;
for (int i = 1; i < N + 1; i++) {
if (i == a[j]) {
if (dan[i - 1] == 0) {
cout << 0;
return 0;
} else {
dan[i] = 0;
}
if (j < M - 1) {
j++;
}
} else {
if (i == 1) {
dan[i] = dan[i - 1];
} else {
dan[i] = dan[i - 1] + dan[i - 2];
}
}
dan[i] %= MOD;
}
cout << dan[N];
return 0;
} | replace | 28 | 31 | 28 | 33 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long int> dp(N + 1);
dp[0] = 1;
for (int now = 0; now < N; now++) {
for (int next = now + 1; now < min(N, now + 2); next++) {
if (oks[next]) {
dp[next] += dp[now];
dp[next] %= mod;
}
}
}
cout << dp[N] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> oks(N + 1, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<long long 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;
return 0;
} | replace | 20 | 21 | 20 | 21 | -11 | |
p03013 | C++ | Runtime Error | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
const ll MAX_N = 1e5;
ll N, M;
ll a[MAX_N + 1] = {0};
ll dp[MAX_N + 1]; // メモ化テーブル
ll n_div = 1e9 + 7;
// i番目以降の品物から重さの総和がj以下になるように選ぶ
void rec(ll i) {
if (i == 0)
dp[i] = 1;
else if (a[i] == 1)
dp[i] = 0;
else if (a[i] == 0 & i == 1)
dp[i] = 1;
else
dp[i] = dp[i - 2] + dp[i - 1];
dp[i] %= n_div;
return;
}
int main() {
// 入力
cin >> N >> M;
for (ll i = 0; i < N; ++i) {
ll tmp;
cin >> tmp;
a[tmp] = 1;
}
// 解法
// DP
memset(dp, -1, sizeof(dp));
REP(i, N + 1) rec(i);
// 出力
// REP(i,N+1)printf("%lld\n", dp[i]);
cout << dp[N] << endl;
}
| /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
const ll MAX_N = 1e5;
ll N, M;
ll a[MAX_N + 1] = {0};
ll dp[MAX_N + 1]; // メモ化テーブル
ll n_div = 1e9 + 7;
// i番目以降の品物から重さの総和がj以下になるように選ぶ
void rec(ll i) {
if (i == 0)
dp[i] = 1;
else if (a[i] == 1)
dp[i] = 0;
else if (a[i] == 0 & i == 1)
dp[i] = 1;
else
dp[i] = dp[i - 2] + dp[i - 1];
dp[i] %= n_div;
return;
}
int main() {
// 入力
cin >> N >> M;
for (ll i = 0; i < M; ++i) {
ll tmp;
cin >> tmp;
a[tmp] = 1;
}
// 解法
// DP
memset(dp, -1, sizeof(dp));
REP(i, N + 1) rec(i);
// 出力
// REP(i,N+1)printf("%lld\n", dp[i]);
cout << dp[N] << endl;
}
| replace | 116 | 117 | 116 | 117 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a;
int box;
int sum = 0;
int pre_1 = 1;
int pre_2 = 1;
int cnt = 0;
int i;
for (i = 0; i < m; i++) {
cin >> box;
a.push_back(box);
// cout << a[i] << endl;
}
for (i = 0; i <= n; i++) {
// cout << "i = " << i << endl;
if (i == 0 || i == 1) {
// 階段1が穴だった時
if (a[cnt] == i) {
sum = 1;
pre_1 = 0;
if (cnt < m)
cnt++;
} else {
sum = 1;
pre_1 = 1;
}
} else {
if (a[cnt] == i) {
if (pre_1 == 0) {
sum = 0;
break;
}
// sum = 0;
pre_2 = pre_1;
pre_1 = 0;
if (cnt < m)
cnt++;
// cout << "i = " << i << endl;
} else {
sum = (pre_1 + pre_2) % 1000000007;
pre_2 = pre_1;
pre_1 = sum;
}
}
// cout << "sum = " << sum << endl;
}
cout << sum << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a;
int box;
int sum = 0;
int pre_1 = 1;
int pre_2 = 1;
int cnt = 0;
int i;
if (m != 0) {
for (i = 0; i < m; i++) {
cin >> box;
a.push_back(box);
// cout << a[i] << endl;
}
} else {
a.push_back(-1);
}
for (i = 0; i <= n; i++) {
// cout << "i = " << i << endl;
if (i == 0 || i == 1) {
// 階段1が穴だった時
if (a[cnt] == i) {
sum = 1;
pre_1 = 0;
if (cnt < m)
cnt++;
} else {
sum = 1;
pre_1 = 1;
}
} else {
if (a[cnt] == i) {
if (pre_1 == 0) {
sum = 0;
break;
}
// sum = 0;
pre_2 = pre_1;
pre_1 = 0;
if (cnt < m)
cnt++;
// cout << "i = " << i << endl;
} else {
sum = (pre_1 + pre_2) % 1000000007;
pre_2 = pre_1;
pre_1 = sum;
}
}
// cout << "sum = " << sum << endl;
}
cout << sum << endl;
} | replace | 20 | 24 | 20 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n, m;
cin >> n >> m;
vector<bool> ok(n + 1, true);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
ok[a] = false;
}
vector<ll> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
if (ok[i + 1]) {
dp[i + 1] += dp[i];
dp[i + 1] %= MOD_LL;
}
if (ok[i + 2]) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD_LL;
}
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9) + 7;
int main(void) {
int n, m;
cin >> n >> m;
vector<bool> ok(n + 1, true);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
ok[a] = false;
}
vector<ll> dp(100005);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
if (ok[i + 1]) {
dp[i + 1] += dp[i];
dp[i + 1] %= MOD_LL;
}
if (ok[i + 2]) {
dp[i + 2] += dp[i];
dp[i + 2] %= MOD_LL;
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> b(N + 1, true);
for (int i = 0; i < M + 1; i++) {
int a;
cin >> a;
b.at(a) = false;
}
vector<int> dp(N + 1, 0);
dp.at(0) = 1;
int mod = 1000000007;
if (b.at(1))
dp.at(1) = 1;
for (int i = 2; i < N + 1; i++) {
if (b.at(i))
dp.at(i) = (dp.at(i - 1) + dp.at(i - 2)) % mod;
}
cout << dp.at(N) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<bool> b(N + 1, true);
for (int i = 0; i < M + 1; i++) {
int a;
cin >> a;
b.at(a) = false;
}
vector<int> dp(N + 1, 0);
dp.at(0) = 1;
int mod = 1000000007;
if (b.at(1))
dp.at(1) = 1;
for (int i = 2; i < N + 1; i++) {
if (b.at(i))
dp.at(i) = (dp.at(i - 1) + dp.at(i - 2));
dp.at(i) %= mod;
}
cout << dp.at(N) << endl;
} | replace | 21 | 22 | 21 | 23 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
class mod {
public:
mod() { m_n = 0; }
mod(ll n) {
if (n >= 0)
m_n = n % MOD;
else
m_n = n % MOD + MOD;
}
friend bool operator==(const mod &a, const mod &b) { return a.m_n == b.m_n; }
friend bool operator!=(const mod &a, const mod &b) { return !(a == b); }
friend mod operator+(const mod &a, const mod &b) {
return (a.m_n + b.m_n) % MOD;
}
friend mod &operator+=(mod &a, const mod &b) { return a = a + b; }
friend mod operator-(const mod &a) { return -a.m_n; }
friend mod operator-(const mod &a, const mod &b) {
return (a.m_n + (-b.m_n)) % MOD;
}
friend mod &operator-=(mod &a, const mod &b) { return a = a - b; }
friend mod operator*(const mod &a, const mod &b) {
return (a.m_n * b.m_n) % MOD;
}
friend mod &operator*=(mod &a, const mod &b) { return a = a * b; }
friend mod mod_pow(const mod &n, ll r) {
if (r == 0) {
return 1;
} else if (r < 0) {
return mod_pow(n, (MOD - 2) * (-r));
} else if (r % 2 == 0) {
mod tmp = mod_pow(n, r / 2);
return tmp * tmp;
} else {
return n * mod_pow(n, r - 1);
}
}
friend mod operator/(const mod &a, const mod &b) {
return a * mod_pow(b, -1);
}
friend mod &operator/=(mod &a, const mod &b) { return a = a / b; }
friend ostream &operator<<(ostream &os, const mod &n) {
os << n.m_n;
return os;
}
friend istream &operator>>(istream &is, mod &n) {
ll tmp;
is >> tmp;
n = mod(tmp);
return is;
}
private:
ll m_n;
};
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> A(M);
for (int m = 0; m < M; ++m)
cin >> A[m];
vector<mod> DP(N + 1);
DP[0] = 1;
int mTmp = 0;
for (int n = 1; n <= N; ++n) {
if (A[mTmp] == n) {
DP[n] = 0;
++mTmp;
} else {
DP[n] = DP[n - 1];
if (n >= 2)
DP[n] += DP[n - 2];
}
}
cout << DP[N] << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
class mod {
public:
mod() { m_n = 0; }
mod(ll n) {
if (n >= 0)
m_n = n % MOD;
else
m_n = n % MOD + MOD;
}
friend bool operator==(const mod &a, const mod &b) { return a.m_n == b.m_n; }
friend bool operator!=(const mod &a, const mod &b) { return !(a == b); }
friend mod operator+(const mod &a, const mod &b) {
return (a.m_n + b.m_n) % MOD;
}
friend mod &operator+=(mod &a, const mod &b) { return a = a + b; }
friend mod operator-(const mod &a) { return -a.m_n; }
friend mod operator-(const mod &a, const mod &b) {
return (a.m_n + (-b.m_n)) % MOD;
}
friend mod &operator-=(mod &a, const mod &b) { return a = a - b; }
friend mod operator*(const mod &a, const mod &b) {
return (a.m_n * b.m_n) % MOD;
}
friend mod &operator*=(mod &a, const mod &b) { return a = a * b; }
friend mod mod_pow(const mod &n, ll r) {
if (r == 0) {
return 1;
} else if (r < 0) {
return mod_pow(n, (MOD - 2) * (-r));
} else if (r % 2 == 0) {
mod tmp = mod_pow(n, r / 2);
return tmp * tmp;
} else {
return n * mod_pow(n, r - 1);
}
}
friend mod operator/(const mod &a, const mod &b) {
return a * mod_pow(b, -1);
}
friend mod &operator/=(mod &a, const mod &b) { return a = a / b; }
friend ostream &operator<<(ostream &os, const mod &n) {
os << n.m_n;
return os;
}
friend istream &operator>>(istream &is, mod &n) {
ll tmp;
is >> tmp;
n = mod(tmp);
return is;
}
private:
ll m_n;
};
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> A(M + 1);
for (int m = 0; m < M; ++m)
cin >> A[m];
vector<mod> DP(N + 1);
DP[0] = 1;
int mTmp = 0;
for (int n = 1; n <= N; ++n) {
if (A[mTmp] == n) {
DP[n] = 0;
++mTmp;
} else {
DP[n] = DP[n - 1];
if (n >= 2)
DP[n] += DP[n - 2];
}
}
cout << DP[N] << endl;
return 0;
}
| replace | 82 | 83 | 82 | 83 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
long long step[100010] = {};
// i段目までの数
step[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == 1) {
if (M > 0) {
if (a[0] != 1) {
step[i] = step[0];
}
} else {
step[i] = step[0];
}
} else if (find(a.begin(), a.end(), i) == a.end()) {
step[i] = (step[i - 1] + step[i - 2]) % MOD;
}
}
cout << step[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> a(M);
for (int i = 0; i < M; i++)
cin >> a[i];
long long step[100010] = {};
// i段目までの数
step[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == 1) {
if (M > 0) {
if (a[0] != 1) {
step[i] = step[0];
}
} else {
step[i] = step[0];
}
} else if (binary_search(a.begin(), a.end(), i) == false) {
step[i] = (step[i - 1] + step[i - 2]) % MOD;
}
}
cout << step[N] << endl;
} | replace | 24 | 25 | 24 | 25 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1, false);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
broken[a] = true;
}
vector<long long> count(n + 1, 0LL);
count[0] = 1LL;
count[1] = broken[1] ? 0LL : 1LL;
for (int i = 2; i <= n; --i) {
if (broken[i]) {
count[i] = 0;
} else {
count[i] = (count[i - 1] + count[i - 2]) % 1000000007;
}
}
cout << count[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<bool> broken(n + 1, false);
for (int i = 0; i < m; ++i) {
int a;
cin >> a;
broken[a] = true;
}
vector<long long> count(n + 1, 0LL);
count[0] = 1LL;
count[1] = broken[1] ? 0LL : 1LL;
for (int i = 2; i <= n; ++i) {
if (broken[i]) {
count[i] = 0;
} else {
count[i] = (count[i - 1] + count[i - 2]) % 1000000007;
}
}
cout << count[n] << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | -11 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
vector<int> memof(100100, 0);
int f(int N) {
if (N == 0)
return 1;
if (N == 1)
return 1;
if (memof.at(N) > 0)
return memof.at(N);
int r = (f(N - 2) + f(N - 1)) % MOD;
memof.at(N) = r;
return r;
}
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
int a0 = -1;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ans *= f(a - a0 - 2);
ans %= MOD;
a0 = a;
}
ans *= f(N - a0 - 1);
ans %= MOD;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = pow(10, 9) + 7;
// const int MOD = 998244353;
// const int MOD = ;
int mod(int A, int M) { return (A % M + M) % M; }
const int INF = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
vector<int> memof(100100, 0);
int f(int N) {
if (N < 0)
return 0;
if (N == 0)
return 1;
if (N == 1)
return 1;
if (memof.at(N) > 0)
return memof.at(N);
int r = (f(N - 2) + f(N - 1)) % MOD;
memof.at(N) = r;
return r;
}
signed main() {
int N, M;
cin >> N >> M;
int ans = 1;
int a0 = -1;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ans *= f(a - a0 - 2);
ans %= MOD;
a0 = a;
}
ans *= f(N - a0 - 1);
ans %= MOD;
cout << ans << endl;
} | insert | 28 | 28 | 28 | 30 | 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); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int mod2 = 998244353;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<int> dp(n + 1);
rep(i, m) cin >> a[i];
int j = 0;
dp[0] = 1;
if (a[0] == 1)
j++;
else
dp[1] = 1;
FOR(i, 2, n + 1) {
if (i == a[j]) {
j++;
continue;
}
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int mod2 = 998244353;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m + 1);
vector<int> dp(n + 1);
rep(i, m) cin >> a[i];
int j = 0;
dp[0] = 1;
if (a[0] == 1)
j++;
else
dp[1] = 1;
FOR(i, 2, n + 1) {
if (i == a[j]) {
j++;
continue;
}
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
}
cout << dp[n] << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
#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 repR(i, n) for (int i = n; i >= 0; i--)
#define P pair<int, int>
#define sz(x) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<int>
#define COUT(x) cout << (x) << endl
#define MA map<int, int>
#define SE set<int>
#define PQ priority_queue
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
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;
}
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
const long long MOD = 1000000007;
const long long INF = 1LL << 50;
// pair -> vector<pair<int,int>>
// AandB.push_back(make_pair(a[i],b[i]))
int dp[10010];
bool ok[10010];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
VE a(m);
rep(i, m) cin >> a[i];
rep(i, m) { ok[a[i]] = true; }
dp[0] = 1;
dp[1] = 1;
FORR(i, 2, n) {
if (!ok[i - 1])
dp[i] += dp[i - 1];
if (!ok[i - 2])
dp[i] += dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
#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 repR(i, n) for (int i = n; i >= 0; i--)
#define P pair<int, int>
#define sz(x) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<int>
#define COUT(x) cout << (x) << endl
#define MA map<int, int>
#define SE set<int>
#define PQ priority_queue
#define COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
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;
}
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
const long long MOD = 1000000007;
const long long INF = 1LL << 50;
// pair -> vector<pair<int,int>>
// AandB.push_back(make_pair(a[i],b[i]))
int dp[100010];
bool ok[100010];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
VE a(m);
rep(i, m) cin >> a[i];
rep(i, m) { ok[a[i]] = true; }
dp[0] = 1;
dp[1] = 1;
FORR(i, 2, n) {
if (!ok[i - 1])
dp[i] += dp[i - 1];
if (!ok[i - 2])
dp[i] += dp[i - 2];
dp[i] %= MOD;
}
cout << dp[n] << endl;
return 0;
} | replace | 97 | 99 | 97 | 99 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t) {
return 1;
}
mint a = pow(t >> 1);
a *= a;
if (t & 1) {
a *= *this;
}
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n, m;
cin >> n >> m;
vector<bool> as(m, false);
rep(i, m) {
int a;
cin >> a;
as[a] = true;
};
vector<mint> dp(n + 2, 0);
dp[0] = 1;
rep(i, n) {
if (!as[i + 1]) {
dp[i + 1] += dp[i];
}
if (!as[i + 2]) {
dp[i + 2] += dp[i];
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % 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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t) {
return 1;
}
mint a = pow(t >> 1);
a *= a;
if (t & 1) {
a *= *this;
}
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int main() {
int n, m;
cin >> n >> m;
vector<bool> as(n, false);
rep(i, m) {
int a;
cin >> a;
as[a] = true;
};
vector<mint> dp(n + 2, 0);
dp[0] = 1;
rep(i, n) {
if (!as[i + 1]) {
dp[i + 1] += dp[i];
}
if (!as[i + 2]) {
dp[i + 2] += dp[i];
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 53 | 54 | 53 | 54 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (int(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (int(i) = 1; (i) < (n); ++(i))
#define rrep1(i, n) for (int(i) = (n)-1; (i) >= 1; --(i))
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define ll long long
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define yes cout << "yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define no cout << "no" << endl;
#define all(x) (x).begin(), (x).end()
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
int main() {
ll n, m, cnt = 0;
cin >> n >> m;
vector<ll> dp(n + 1, 0), a(m);
rep0(i, m) cin >> a[i];
dp[0] = 1;
if (a[cnt] == 1) {
dp[1] = 0;
++cnt;
} else {
dp[1] = 1;
}
nfor(i, 2, n + 1) {
if (a[cnt] == i) {
dp[i] = 0;
++cnt;
} 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;
#define rep0(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define rrep0(i, n) for (int(i) = (n)-1; (i) >= 0; --(i))
#define rep1(i, n) for (int(i) = 1; (i) < (n); ++(i))
#define rrep1(i, n) for (int(i) = (n)-1; (i) >= 1; --(i))
#define nfor(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define ll long long
#define mod (1000000007)
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define yes cout << "yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define no cout << "no" << endl;
#define all(x) (x).begin(), (x).end()
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
int main() {
ll n, m, cnt = 0;
cin >> n >> m;
vector<ll> dp(n + 1, 0), a(m + 1, 0);
rep0(i, m) cin >> a[i];
dp[0] = 1;
if (a[cnt] == 1) {
dp[1] = 0;
++cnt;
} else {
dp[1] = 1;
}
nfor(i, 2, n + 1) {
if (a[cnt] == i) {
dp[i] = 0;
++cnt;
} else {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= mod;
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e+9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; ++i)
cin >> a[i];
sort(a.begin(), a.end());
vector<long long> dp(N + 1);
dp[0] = 1;
int idx;
if (a[0] == 1) {
dp[1] = 0;
idx = 1;
} else {
dp[1] = 1;
idx = 0;
}
for (int i = 2; i <= N; ++i) {
if (idx < M and i == a[idx]) {
dp[i] = 0;
++idx;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
}
cout << dp[N] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e+9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (int i = 0; i < M; ++i)
cin >> a[i];
sort(a.begin(), a.end());
vector<long long> dp(N + 1);
dp[0] = 1;
int idx;
if (M > 0 and a[0] == 1) {
dp[1] = 0;
idx = 1;
} else {
dp[1] = 1;
idx = 0;
}
for (int i = 2; i <= N; ++i) {
if (idx < M and i == a[idx]) {
dp[i] = 0;
++idx;
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
}
}
cout << dp[N] << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#include <iostream>
#include <vector>
using namespace std;
// 重複順列
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start,
const ll range_end) {
if (i == size) {
// ここで所望の作業を行う
for (ll itr : buf) {
cout << itr;
}
} else {
for (ll j = range_start; j <= range_end; ++j) {
buf[i] = j;
permutation(i + 1, size, range_start, range_end);
}
}
}
int main(void) {
ll n, m, a;
ll mod = pow(10, 9) + 7;
cin >> n >> m;
vector<ll> A(n + 1);
A[0] = 1;
RAP(i, n) {
cin >> a;
A[a] = -1;
}
for (ll i = 1; i <= n; i++) {
if (A[i] == -1) {
continue;
}
if (i == 1) {
A[i] = A[i - 1];
continue;
}
if (A[i - 1] == -1 && A[i - 2] == -1) {
break;
} else if (A[i - 1] == -1) {
A[i] = A[i - 2];
} else if (A[i - 2] == -1) {
A[i] = A[i - 1];
} else {
A[i] = (A[i - 1] + A[i - 2]) % mod;
}
}
cout << A[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define RAP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#include <iostream>
#include <vector>
using namespace std;
// 重複順列
vector<ll> buf;
void permutation(ll i, const ll size, const ll range_start,
const ll range_end) {
if (i == size) {
// ここで所望の作業を行う
for (ll itr : buf) {
cout << itr;
}
} else {
for (ll j = range_start; j <= range_end; ++j) {
buf[i] = j;
permutation(i + 1, size, range_start, range_end);
}
}
}
int main(void) {
ll n, m, a;
ll mod = pow(10, 9) + 7;
cin >> n >> m;
vector<ll> A(n + 1);
A[0] = 1;
RAP(i, m) {
cin >> a;
A[a] = -1;
}
for (ll i = 1; i <= n; i++) {
if (A[i] == -1) {
continue;
}
if (i == 1) {
A[i] = A[i - 1];
continue;
}
if (A[i - 1] == -1 && A[i - 2] == -1) {
break;
} else if (A[i - 1] == -1) {
A[i] = A[i - 2];
} else if (A[i - 2] == -1) {
A[i] = A[i - 1];
} else {
A[i] = (A[i - 1] + A[i - 2]) % mod;
}
}
cout << A[n] << endl;
return 0;
}
| replace | 32 | 33 | 32 | 33 | 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 = 1e9 + 7;
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 = 1e9 + 7;
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 | 17 | 18 | 17 | 18 | -11 | |
p03013 | C++ | Runtime Error | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> a(M), dp(N + 1, 0);
for (auto &i : a)
cin >> i;
dp[N] = 1;
if (a.back() != N - 1)
dp[N - 1] = 1;
for (int n = N - 2; n >= 0; n--) {
if (!binary_search(a.begin(), a.end(), n)) {
dp[n] = (dp[n + 1] + dp[n + 2]) % 1000000007;
}
}
cout << dp[0] << endl;
return 0;
}
| using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> a(M), dp(N + 1, 0);
for (auto &i : a)
cin >> i;
dp[N] = 1;
if (a.empty() || a.back() != N - 1)
dp[N - 1] = 1;
for (int n = N - 2; n >= 0; n--) {
if (!binary_search(a.begin(), a.end(), n)) {
dp[n] = (dp[n + 1] + dp[n + 2]) % 1000000007;
}
}
cout << dp[0] << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i, n) \
; \
for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define f(i, a, b) for (int i = a; i < b; i++)
#define pri(a) printf("%.14lf\n", a);
#define MOD 1000000007
bool is_int_lround(double x) { return std::lround(x) == x; }
ll keta(ll x) {
ll n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll conbi(int n, int m) {
cin >> n >> m;
vector<ll> a(100);
a[0] = 1;
for (int i = 0; i < 14; i++) {
a[i + 1] = a[i] * (i + 1);
}
return a[n] / (a[m] * a[n - m]);
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1; // 繰り返し二乗法
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll kaijo(ll x) {
ll z = 1;
while (x > 0) {
z *= x;
z %= MOD;
x--;
}
return z;
}
ll yakusu_num(ll n) {
vl yakusu(n + 1, 1);
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
yakusu[i]++;
}
}
if (n != 1)
yakusu[n]++;
ll num = 1;
for (ll i = 0; i <= n; i++) {
num *= yakusu[i];
}
return num;
}
// cout<<""<<endl;
int main() {
ll N, M;
cin >> N >> M;
vl a(M);
rep(i, M) cin >> a[i];
vl b(M + 1);
b[0] = a[0] - 1;
b[M] = N - a[M - 1] - 1;
f(i, 1, M) b[i] = a[i] - a[i - 1] - 2; // 段差の数
sort(all(b));
if (b[0] < 0)
cout << 0 << endl;
else {
vl dp(N + 10); // MOD
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
f(i, 1, N) { dp[i + 2] = (dp[i + 1] % MOD + dp[i] % MOD) % MOD; }
ll ans = 1;
rep(i, M + 1) {
ans *= dp[b[i]];
ans %= MOD;
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i, n) \
; \
for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define f(i, a, b) for (int i = a; i < b; i++)
#define pri(a) printf("%.14lf\n", a);
#define MOD 1000000007
bool is_int_lround(double x) { return std::lround(x) == x; }
ll keta(ll x) {
ll n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll conbi(int n, int m) {
cin >> n >> m;
vector<ll> a(100);
a[0] = 1;
for (int i = 0; i < 14; i++) {
a[i + 1] = a[i] * (i + 1);
}
return a[n] / (a[m] * a[n - m]);
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1; // 繰り返し二乗法
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll kaijo(ll x) {
ll z = 1;
while (x > 0) {
z *= x;
z %= MOD;
x--;
}
return z;
}
ll yakusu_num(ll n) {
vl yakusu(n + 1, 1);
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
n /= i;
yakusu[i]++;
}
}
if (n != 1)
yakusu[n]++;
ll num = 1;
for (ll i = 0; i <= n; i++) {
num *= yakusu[i];
}
return num;
}
// cout<<""<<endl;
int main() {
ll N, M;
cin >> N >> M;
vl a(M);
rep(i, M) cin >> a[i];
vl b(M + 1);
if (M >= 1) {
b[0] = a[0] - 1;
b[M] = N - a[M - 1] - 1;
f(i, 1, M) b[i] = a[i] - a[i - 1] - 2;
} else
b[0] = N; // 段差の数
sort(all(b));
if (b[0] < 0)
cout << 0 << endl;
else {
vl dp(N + 10); // MOD
dp[0] = 1;
dp[1] = 1;
dp[2] = 2;
f(i, 1, N) { dp[i + 2] = (dp[i + 1] % MOD + dp[i] % MOD) % MOD; }
ll ans = 1;
rep(i, M + 1) {
ans *= dp[b[i]];
ans %= MOD;
}
cout << ans << endl;
}
}
| replace | 91 | 94 | 91 | 97 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(k, a, b) for (int k = (a); k < (b); k++)
#define FORE(k, a, b) for (int k = (a); k <= (b); k++)
#define REP(k, a) for (int k = 0; k < (a); k++)
#define ALL(c) (c).begin(), (c).end()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define RANGE(lb, x, ub) ((lb) <= (x) && (x) < (ub))
#define dump(x) cerr << #x << ": " << (x) << endl;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
const int INF = 1000000000;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dp[10005];
int main(void) {
int n, m;
cin >> n >> m;
set<int> as;
REP(i, m) {
int k;
cin >> k;
as.insert(k);
}
dp[0] = 1;
int mod = INF + 7;
FOR(i, 1, n + 1) {
if (EXIST(as, i))
continue;
if (!EXIST(as, i - 1))
dp[i] += dp[i - 1];
if (i >= 2 && !EXIST(as, i - 2))
dp[i] += dp[i - 2];
dp[i] = dp[i] % mod;
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(k, a, b) for (int k = (a); k < (b); k++)
#define FORE(k, a, b) for (int k = (a); k <= (b); k++)
#define REP(k, a) for (int k = 0; k < (a); k++)
#define ALL(c) (c).begin(), (c).end()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define RANGE(lb, x, ub) ((lb) <= (x) && (x) < (ub))
#define dump(x) cerr << #x << ": " << (x) << endl;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
const int INF = 1000000000;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dp[100005];
int main(void) {
int n, m;
cin >> n >> m;
set<int> as;
REP(i, m) {
int k;
cin >> k;
as.insert(k);
}
dp[0] = 1;
int mod = INF + 7;
FOR(i, 1, n + 1) {
if (EXIST(as, i))
continue;
if (!EXIST(as, i - 1))
dp[i] += dp[i - 1];
if (i >= 2 && !EXIST(as, i - 2))
dp[i] += dp[i - 2];
dp[i] = dp[i] % mod;
}
cout << dp[n] << endl;
return 0;
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<bool> ban(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ban[a] = true;
}
vector<ll> dp(N + 1, 0);
dp[0] = 1;
for (int i = 0; i < N; i++) {
if (ban[i])
continue;
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
cout << dp[N] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<bool> ban(N + 1);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
ban[a] = true;
}
vector<ll> dp(N + 2, 0);
dp[0] = 1;
for (int i = 0; i < N; i++) {
if (ban[i])
continue;
dp[i + 1] = (dp[i + 1] + dp[i]) % MOD;
dp[i + 2] = (dp[i + 2] + dp[i]) % MOD;
}
cout << dp[N] << '\n';
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll> dp;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m, 0);
for (ll i = 0; i < m; i++) {
cin >> a[i];
}
dp.resize(n + 5, 0);
dp[0] = 1;
int j = 0;
for (ll i = 1; i <= n; i++) {
if (a[j] == i) {
if (j != m - 1)
j++;
if (i != n)
continue;
else
break;
}
if (i == 1)
dp[i] = dp[i - 1];
if (i > 1)
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
// cout << "i: " << i << endl;
// cout << "dp: " << dp[i] << endl;
}
cout << dp[n] % mod << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll> dp;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m + 5, 0);
for (ll i = 0; i < m; i++) {
cin >> a[i];
}
dp.resize(n + 5, 0);
dp[0] = 1;
int j = 0;
for (ll i = 1; i <= n; i++) {
if (a[j] == i) {
if (j != m - 1)
j++;
if (i != n)
continue;
else
break;
}
if (i == 1)
dp[i] = dp[i - 1];
if (i > 1)
dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
// cout << "i: " << i << endl;
// cout << "dp: " << dp[i] << endl;
}
cout << dp[n] % mod << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long int
const LL MOD = pow(10, 9) + 7;
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, 0);
dp[0] = 1;
dp[1] = 1;
int k = 0;
if (a[k] == 1) {
dp[1] = 0;
k++;
}
for (int i = 2; i <= n; ++i) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
if (!a.empty() && i == a[k]) {
dp[i] = 0;
k++;
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define LL long int
const LL MOD = pow(10, 9) + 7;
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, 0);
dp[0] = 1;
dp[1] = 1;
int k = 0;
if (!a.empty() && a[k] == 1) {
dp[1] = 0;
k++;
}
for (int i = 2; i <= n; ++i) {
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
if (!a.empty() && i == a[k]) {
dp[i] = 0;
k++;
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using Graph = vector<vector<ll>>;
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;
}
// 0 false, 1 true
// stringの数字をint型にしてアスキーコードになったら -48する
// 切り上げ ceil(a)
int main() {
ll n, m;
cin >> n >> m;
vector<ll> vec(m);
rep(i, m) { cin >> vec.at(i); }
vector<ll> dp(n + 1);
dp.at(0) = 1;
ll tmp = 0;
rep(i, n + 1) {
if (i == 1) {
if (vec.at(tmp) == 1) {
tmp++;
continue;
} else {
dp.at(1) = 1;
continue;
}
}
if (tmp < m && i == vec.at(tmp)) {
tmp++;
continue;
}
if (i >= 2) {
dp.at(i) = dp.at(i - 1) % MOD + dp.at(i - 2) % MOD;
dp.at(i) = dp.at(i) % MOD;
}
}
cout << dp.at(n) << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using Graph = vector<vector<ll>>;
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;
}
// 0 false, 1 true
// stringの数字をint型にしてアスキーコードになったら -48する
// 切り上げ ceil(a)
int main() {
ll n, m;
cin >> n >> m;
vector<ll> vec(m);
rep(i, m) { cin >> vec.at(i); }
vector<ll> dp(n + 1);
dp.at(0) = 1;
ll tmp = 0;
rep(i, n + 1) {
if (i == 1) {
if (tmp < m && vec.at(tmp) == 1) {
tmp++;
continue;
} else {
dp.at(1) = 1;
continue;
}
}
if (tmp < m && i == vec.at(tmp)) {
tmp++;
continue;
}
if (i >= 2) {
dp.at(i) = dp.at(i - 1) % MOD + dp.at(i - 2) % MOD;
dp.at(i) = dp.at(i) % MOD;
}
}
cout << dp.at(n) << endl;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
ll sub(ll n) {
if (n <= 0) {
return -1;
} else {
vector<ll> list(n + 1);
rep(i, n + 1) {
if (i == 0) {
list.at(i) = 0;
} else if (i == 1) {
list.at(i) = 1;
} else {
list.at(i) = (list.at(i - 1) + list.at(i - 2)) % MOD;
}
}
return list.at(n);
}
}
ll ans(vector<ll> v, ll m) {
ll ans = 1;
for (ll i = 0; i < m; i++) {
if (i == 0) {
ans *= sub(v.at(i));
ans %= MOD;
} else {
ans *= sub(v.at(i) - v.at(i - 1) - 1);
ans %= MOD;
}
if (ans < 0) {
ans = 0;
}
}
return ans;
}
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
rep(i, M) { cin >> A.at(i); }
ll ANS = ans(A, M);
ANS *= sub(N - A.at(M - 1));
cout << ANS % 1000000007 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
ll sub(ll n) {
if (n <= 0) {
return -1;
} else {
vector<ll> list(n + 1);
rep(i, n + 1) {
if (i == 0) {
list.at(i) = 0;
} else if (i == 1) {
list.at(i) = 1;
} else {
list.at(i) = (list.at(i - 1) + list.at(i - 2)) % MOD;
}
}
return list.at(n);
}
}
ll ans(vector<ll> v, ll m) {
ll ans = 1;
for (ll i = 0; i < m; i++) {
if (i == 0) {
ans *= sub(v.at(i));
ans %= MOD;
} else {
ans *= sub(v.at(i) - v.at(i - 1) - 1);
ans %= MOD;
}
if (ans < 0) {
ans = 0;
}
}
return ans;
}
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
rep(i, M) { cin >> A.at(i); }
ll ANS = ans(A, M);
if (M != 0) {
ANS *= sub(N - A.at(M - 1));
} else {
ANS *= sub(N + 1);
}
cout << ANS % 1000000007 << endl;
} | replace | 47 | 48 | 47 | 52 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int N;
long long dp[100050];
int main() {
cout << fixed << setprecision(10);
int N, M;
cin >> N >> M;
vector<int> a(M);
rep(i, M) cin >> a[i];
rep(i, 100010) dp[i] = 0;
rep(i, M) dp[a[i]] = -1;
dp[0] = 1;
if (a[0] != 1 || M == 0) {
dp[1] = 1;
} else {
dp[1] = 0;
}
for (int i = 2; i < N + 1; i++) {
if (dp[i] != -1) {
dp[i] = dp[i - 2] + dp[i - 1];
} else {
dp[i] = 0;
}
dp[i] = dp[i] % P;
}
cout << dp[N] % P << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int N;
long long dp[100050];
int main() {
cout << fixed << setprecision(10);
int N, M;
cin >> N >> M;
vector<int> a(M);
rep(i, M) cin >> a[i];
rep(i, 100010) dp[i] = 0;
rep(i, M) dp[a[i]] = -1;
dp[0] = 1;
if (M == 0 || a[0] != 1) {
dp[1] = 1;
} else {
dp[1] = 0;
}
for (int i = 2; i < N + 1; i++) {
if (dp[i] != -1) {
dp[i] = dp[i - 2] + dp[i - 1];
} else {
dp[i] = 0;
}
dp[i] = dp[i] % P;
}
cout << dp[N] % P << endl;
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll mod = pow(10, 9) + 7;
ll n, m;
cin >> n >> m;
vector<ll> ng(m);
vector<ll> dp(n + 1);
for (int i = 0; i < m; i++) {
cin >> ng[i];
}
sort(ng.begin(), ng.end());
ll now = 0;
// cout << 0 << endl;
if (n >= 1)
dp[1] = 1;
if (n >= 2)
dp[2] = 2;
// cout << 2 << endl;
if (n >= 1 && m >= 1) {
if (ng[now] == 1) {
dp[1] = 0;
if (n >= 2)
dp[2] = 1;
now++;
}
}
// cout << 3 << endl;
if (n >= 2 && m >= 2) {
if (ng[now] == 2) {
dp[2] = 0;
now++;
}
}
// cout << 1 << endl;
for (int i = 3; i < n + 1; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= mod;
while (i >= ng[now]) {
if (ng[now] == i)
dp[i] = 0;
now++;
}
}
cout << dp[n] % mod << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll mod = pow(10, 9) + 7;
ll n, m;
cin >> n >> m;
vector<ll> ng(m);
vector<ll> dp(n + 1);
for (int i = 0; i < m; i++) {
cin >> ng[i];
}
sort(ng.begin(), ng.end());
ll now = 0;
// cout << 0 << endl;
if (n >= 1)
dp[1] = 1;
if (n >= 2)
dp[2] = 2;
// cout << 2 << endl;
if (n >= 1 && m >= 1) {
if (ng[now] == 1) {
dp[1] = 0;
if (n >= 2)
dp[2] = 1;
now++;
}
}
// cout << 3 << endl;
if (n >= 2 && m >= 2) {
if (ng[now] == 2) {
dp[2] = 0;
now++;
}
}
// cout << 1 << endl;
for (int i = 3; i < n + 1; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= mod;
if (m > now) {
while (i >= ng[now]) {
if (ng[now] == i)
dp[i] = 0;
now++;
}
}
}
cout << dp[n] % mod << endl;
} | replace | 47 | 51 | 47 | 53 | 0 | |
p03013 | C++ | Runtime Error | #include <cstdio>
int main() {
int n, m, a[10005], in;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
a[i] = -1;
for (int i = 1; i <= m; i++) {
scanf("%d", &in);
a[in] = 0;
}
if (a[1] != 0)
a[1] = 1;
if (a[2] != 0)
a[2] = 1 + a[1];
for (int i = 3; i <= n; i++)
if (a[i] == -1)
a[i] = (a[i - 2] + a[i - 1]) % 1000000007;
printf("%d", a[n]);
return 0;
} | #include <cstdio>
int main() {
int n, m, a[100005], in;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
a[i] = -1;
for (int i = 1; i <= m; i++) {
scanf("%d", &in);
a[in] = 0;
}
if (a[1] != 0)
a[1] = 1;
if (a[2] != 0)
a[2] = 1 + a[1];
for (int i = 3; i <= n; i++)
if (a[i] == -1)
a[i] = (a[i - 2] + a[i - 1]) % 1000000007;
printf("%d", a[n]);
return 0;
} | replace | 3 | 4 | 3 | 4 | 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 REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char *argv[]) {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> a(M);
rep(i, M) cin >> a[i];
vector<ll> ans(N + 1, 0);
for (int i = 0, j = 0; i < N + 1; ++i) {
if (i == a[j]) {
j++;
} else {
if (i == 0 || i == 1)
ans[i] = 1;
else
ans[i] = (ans[i - 1] + ans[i - 2]) % MOD;
}
}
cout << ans[N] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typedef long long ll;
const int INF = 1000000000;
const int MOD = 1000000007;
int main(int argc, char *argv[]) {
// cin.tie(0);
// ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> a(M);
rep(i, M) cin >> a[i];
vector<ll> ans(N + 1, 0);
for (int i = 0, j = 0; i < N + 1; ++i) {
if (j < M && i == a[j]) {
j++;
} else {
if (i == 0 || i == 1)
ans[i] = 1;
else
ans[i] = (ans[i - 1] + ans[i - 2]) % MOD;
}
}
cout << ans[N] << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read_s() {
string s = "";
char c = getchar();
while (c < '!' || c > '~') {
c = getchar();
}
while (c >= '!' && c <= '~') {
s += c;
c = getchar();
}
return s;
}
int mod = 1e9 + 7;
int dp[100001];
int fib(int n) {
if (n == 0)
return 0;
if (n == 1)
return 1;
if (dp[n] != 0) {
return dp[n];
}
return dp[n] = (fib(n - 1) + fib(n - 2)) % mod;
}
void Main() {
int N = read(), M = read();
int_fast64_t ans = 1;
vector<int> V(M + 1);
V[0] = read();
int temp, last = V[0];
for (int i = 1; i < M; i++) {
temp = read();
V[i] = temp - last - 1;
last = temp;
}
V[M] = N - last;
for (auto v : V) {
ans *= fib(v);
ans %= mod;
}
printf("%lld\n", ans);
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int_fast64_t read() {
int_fast64_t x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline string read_s() {
string s = "";
char c = getchar();
while (c < '!' || c > '~') {
c = getchar();
}
while (c >= '!' && c <= '~') {
s += c;
c = getchar();
}
return s;
}
int mod = 1e9 + 7;
int dp[100001];
int fib(int n) {
if (n == 0)
return 0;
if (n == 1)
return 1;
if (dp[n] != 0) {
return dp[n];
}
return dp[n] = (fib(n - 1) + fib(n - 2)) % mod;
}
void Main() {
int N = read(), M = read();
int_fast64_t ans = 1;
if (M == 0) {
printf("%d\n", fib(N + 1));
return;
}
vector<int> V(M + 1);
V[0] = read();
int temp, last = V[0];
for (int i = 1; i < M; i++) {
temp = read();
V[i] = temp - last - 1;
last = temp;
}
V[M] = N - last;
for (auto v : V) {
ans *= fib(v);
ans %= mod;
}
printf("%lld\n", ans);
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Main();
return 0;
} | insert | 41 | 41 | 41 | 45 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n + 1, 0);
vector<int> flg(n, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
flg[i] = (flg[i - 1] + flg[i - 2]) % mod;
}
cout << flg[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 1E9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<int> A(n + 1, 0);
vector<int> flg(n + 1, 0);
for (int i = 1; i <= m; i++) {
int x;
cin >> x;
A[x] = 1;
}
flg[0] = 1;
for (int i = 1; i <= n; i++) {
if (!A[i])
flg[i] = (flg[i - 1] + flg[i - 2]) % mod;
}
cout << flg[n] << endl;
} | replace | 9 | 10 | 9 | 10 | -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 ll = long long;
using namespace std;
ll INF = 1000000000000000;
ll mod = 1000000007;
ll i, j, k, l;
int main() {
ll n, m;
cin >> n >> m; // m個は壊れている
vector<ll> a(m), step(n + 1), dp(n + 1, 0);
// a:崩壊 step:階段の状態 dp:i段目に到達するまでの行き方
for (i = 0; i < m; i++) {
cin >> a[i];
}
for (i = 1; i < m; i++) { // 連続で崩壊していたら渡れない
if (a[n] == a[n - 1] + 1) {
cout << 0 << endl;
return 0;
}
}
for (i = 0; i < m; i++) {
step[a[i]] = 1; // 崩壊なら1 渡れるなら0
}
dp[0] = 1;
dp[1] = 1;
for (i = 2; i <= n; i++) { // 崩壊しているところを通らないようなfibo
if (!step[i - 1]) {
dp[i] += dp[i - 1];
dp[i] %= mod;
}
if (!step[i - 2]) {
dp[i] += dp[i - 2];
dp[i] %= mod;
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll INF = 1000000000000000;
ll mod = 1000000007;
ll i, j, k, l;
int main() {
ll n, m;
cin >> n >> m; // m個は壊れている
vector<ll> a(m), step(n + 1), dp(n + 1, 0);
// a:崩壊 step:階段の状態 dp:i段目に到達するまでの行き方
for (i = 0; i < m; i++) {
cin >> a[i];
}
for (i = 1; i < m; i++) { // 連続で崩壊していたら渡れない
if (a[i] == a[i - 1] + 1) {
cout << 0 << endl;
return 0;
}
}
for (i = 0; i < m; i++) {
step[a[i]] = 1; // 崩壊なら1 渡れるなら0
}
dp[0] = 1;
dp[1] = 1;
for (i = 2; i <= n; i++) { // 崩壊しているところを通らないようなfibo
if (!step[i - 1]) {
dp[i] += dp[i - 1];
dp[i] %= mod;
}
if (!step[i - 2]) {
dp[i] += dp[i - 2];
dp[i] %= mod;
}
}
cout << dp[n] << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for (int i = 0; i < M; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<long long> d(N);
d[0] = 1;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j <= min(i + 2, N); j++) {
if (a[j]) {
d[j] += d[i];
d[j] %= mod;
}
}
}
cout << d[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<bool> a(N + 1, true);
for (int i = 0; i < M; i++) {
int x;
cin >> x;
a[x] = false;
}
vector<long long> d(N + 1);
d[0] = 1;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j <= min(i + 2, N); j++) {
if (a[j]) {
d[j] += d[i];
d[j] %= mod;
}
}
}
cout << d[N] << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbgmap(mp) \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cout << i->first << ":" << i->second << endl; \
}
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
Vec way(n + 1, 0);
Vec brk(m + 1, 0);
rep(i, m) {
ll tmp;
cin >> tmp;
brk[tmp] = 1;
}
ll ans = 0;
way[0] = 1;
if (brk[1] == 1) {
way[1] = 0;
} else {
way[1] = 1;
}
REP(i, 2, n + 1) {
if (brk[i] == 1) {
way[i] = 0;
} else {
way[i] = way[i - 1] + way[i - 2];
way[i] %= MOD;
}
}
ans = way[n];
// dbg(way);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, n)
const int INF = 1e9;
const int MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define ALL(v) v.begin(), v.end()
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbgmap(mp) \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cout << i->first << ":" << i->second << endl; \
}
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
Vec way(n + 1, 0);
Vec brk(100005, 0);
rep(i, m) {
ll tmp;
cin >> tmp;
brk[tmp] = 1;
}
ll ans = 0;
way[0] = 1;
if (brk[1] == 1) {
way[1] = 0;
} else {
way[1] = 1;
}
REP(i, 2, n + 1) {
if (brk[i] == 1) {
way[i] = 0;
} else {
way[i] = way[i - 1] + way[i - 2];
way[i] %= MOD;
}
}
ans = way[n];
// dbg(way);
cout << ans << endl;
return 0;
}
| replace | 63 | 64 | 63 | 64 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
const int64_t l = 1000000007;
int64_t n, m;
cin >> n >> m;
queue<int64_t> a;
int64_t aa;
for (int64_t i = 0; i < m; i++) {
cin >> aa;
a.push(aa);
}
vector<int64_t> p(n + 1, 1);
p.at(0) = 1;
p.at(1) = 1;
p.at(2) = 2;
for (int i = 0; i < m; i++) {
p.at(a.front()) = 0;
a.pop();
}
for (int64_t i = 0; i < n - 1; i++) {
if (p.at(i + 2) != 0) {
p.at(i + 2) = (p.at(i + 1) + p.at(i)) % l;
}
}
cout << p.at(n) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
const int64_t l = 1000000007;
int64_t n, m;
cin >> n >> m;
queue<int64_t> a;
int64_t aa;
for (int64_t i = 0; i < m; i++) {
cin >> aa;
a.push(aa);
}
vector<int64_t> p(n + 1, 1);
p.at(0) = 1;
p.at(1) = 1;
for (int i = 0; i < m; i++) {
p.at(a.front()) = 0;
a.pop();
}
for (int64_t i = 0; i < n - 1; i++) {
if (p.at(i + 2) != 0) {
p.at(i + 2) = (p.at(i + 1) + p.at(i)) % l;
}
}
cout << p.at(n) << endl;
}
| delete | 15 | 16 | 15 | 15 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MOD 1000000000 + 7
int N, M;
long long A[10 + 10];
long long dp[10 + 10];
int main(void) {
cin >> N >> M;
for (int i = 0; i < M; i++) {
long long temp;
cin >> temp;
A[temp] = 1;
}
dp[0] = 1;
for (int n = 1; n <= N; n++) {
if (A[n] == 1) {
continue;
}
dp[n] = dp[n - 1];
if (2 <= n) {
dp[n] += dp[n - 2];
}
dp[n] %= MOD;
}
cout << dp[N] << endl;
return 0;
}
| #include <iostream>
using namespace std;
#define MOD 1000000000 + 7
int N, M;
long long A[100000 + 10];
long long dp[100000 + 10];
int main(void) {
cin >> N >> M;
for (int i = 0; i < M; i++) {
long long temp;
cin >> temp;
A[temp] = 1;
}
dp[0] = 1;
for (int n = 1; n <= N; n++) {
if (A[n] == 1) {
continue;
}
dp[n] = dp[n - 1];
if (2 <= n) {
dp[n] += dp[n - 2];
}
dp[n] %= MOD;
}
cout << dp[N] << endl;
return 0;
}
| replace | 7 | 9 | 7 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin(x) \
ll(x); \
cin >> (x);
#define stin(x) \
str(x); \
cin >> (x);
#define vllin(x, n) \
vll(x)(n); \
FOR(i, 0, n - 1) { cin >> (x)[i]; }
#define vllin2(a, b, n) \
vll(a)(n); \
vll(b)(n); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i]; }
#define vllin3(a, b, c, n) \
vll(a)(n); \
vll(b)(n); \
vll(c)(n); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i] >> (c)[i]; }
#define vlling(x, n) \
(x).assign(n, 0); \
FOR(i, 0, n - 1) { cin >> (x)[i]; }
#define vlling2(a, b, n) \
(a).assign(n, 0); \
(b).assign(n, 0); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i]; }
#define vlling3(a, b, c, n) \
(a).assign(n, 0); \
(b).assign(n, 0); \
(c).assign(n, 0); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i] >> (c)[i]; }
#define vpl4in(x, n) \
vpl4(x)((n), mp(0, 0)); \
FOR(i, 0, n - 1) { cin >> x[i].fi >> x[i].se; }
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
#define rFOR(i, b, a) for (ll i = a; i >= b; i--)
#define SORT(x) sort(x.be, x.en)
#define rSORT(x) sort(x.rbegin(), x.rend())
#define say(x) cout << (x);
#define sal(x) cout << (x) << endl;
#define says(x) cout << (x) << (' ');
#define sas cout << (' ');
#define sayR(x) cout << fixed << setprecision(10) << (x);
#define salR(x) cout << fixed << setprecision(10) << (x) << endl;
#define yn(a) cout << ((a) ? "yes" : "no") << endl;
#define Yn(a) cout << ((a) ? "Yes" : "No") << endl;
#define YN(a) cout << ((a) ? "YES" : "NO") << endl;
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << endl;
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << endl;
#define pow(a, b) ll(pow(a, b))
ll MOD = 1000000007;
signed main() {
llin(n);
llin(m);
vllin(a, m);
vll c(n, 0);
if (n == 1) {
sal(1) return 0;
}
c[0] = 1;
c[1] = 1;
FOR(i, 2, n) { c[i] = (c[i - 1] + c[i - 2]) % MOD; }
if (m == 0) {
sal(c[n]) return 0;
}
ll k = c[a[0] - 1];
FOR(i, 1, m - 1) {
if (a[i] - a[i - 1] == 1) {
sal(0) return 0;
}
k = (k * c[a[i] - a[i - 1] - 2]) % MOD;
}
k = (k * c[n - a[m - 1] - 1]) % MOD;
sal(k)
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vvvvll = vector<vector<vector<vector<ll>>>>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin(x) \
ll(x); \
cin >> (x);
#define stin(x) \
str(x); \
cin >> (x);
#define vllin(x, n) \
vll(x)(n); \
FOR(i, 0, n - 1) { cin >> (x)[i]; }
#define vllin2(a, b, n) \
vll(a)(n); \
vll(b)(n); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i]; }
#define vllin3(a, b, c, n) \
vll(a)(n); \
vll(b)(n); \
vll(c)(n); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i] >> (c)[i]; }
#define vlling(x, n) \
(x).assign(n, 0); \
FOR(i, 0, n - 1) { cin >> (x)[i]; }
#define vlling2(a, b, n) \
(a).assign(n, 0); \
(b).assign(n, 0); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i]; }
#define vlling3(a, b, c, n) \
(a).assign(n, 0); \
(b).assign(n, 0); \
(c).assign(n, 0); \
FOR(i, 0, n - 1) { cin >> (a)[i] >> (b)[i] >> (c)[i]; }
#define vpl4in(x, n) \
vpl4(x)((n), mp(0, 0)); \
FOR(i, 0, n - 1) { cin >> x[i].fi >> x[i].se; }
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
#define rFOR(i, b, a) for (ll i = a; i >= b; i--)
#define SORT(x) sort(x.be, x.en)
#define rSORT(x) sort(x.rbegin(), x.rend())
#define say(x) cout << (x);
#define sal(x) cout << (x) << endl;
#define says(x) cout << (x) << (' ');
#define sas cout << (' ');
#define sayR(x) cout << fixed << setprecision(10) << (x);
#define salR(x) cout << fixed << setprecision(10) << (x) << endl;
#define yn(a) cout << ((a) ? "yes" : "no") << endl;
#define Yn(a) cout << ((a) ? "Yes" : "No") << endl;
#define YN(a) cout << ((a) ? "YES" : "NO") << endl;
#define Imp(a) cout << ((a) ? "Possible" : "Impossible") << endl;
#define IMP(a) cout << ((a) ? "POSSIBLE" : "IMPOSSIBLE") << endl;
#define pow(a, b) ll(pow(a, b))
ll MOD = 1000000007;
signed main() {
llin(n);
llin(m);
vllin(a, m);
vll c(n + 1, 0);
if (n == 1) {
sal(1) return 0;
}
c[0] = 1;
c[1] = 1;
FOR(i, 2, n) { c[i] = (c[i - 1] + c[i - 2]) % MOD; }
if (m == 0) {
sal(c[n]) return 0;
}
ll k = c[a[0] - 1];
FOR(i, 1, m - 1) {
if (a[i] - a[i - 1] == 1) {
sal(0) return 0;
}
k = (k * c[a[i] - a[i - 1] - 2]) % MOD;
}
k = (k * c[n - a[m - 1] - 1]) % MOD;
sal(k)
}
| replace | 77 | 78 | 77 | 78 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, n) {
ll x;
cin >> x;
a[x] = false;
}
vector<ll> dp(n + 1, 0);
dp[0] = 1;
rep(i, n) {
if (a[i + 1])
dp[i + 1] = (dp[i] + dp[i + 1]) % mod;
if (i == n - 1)
break;
if (a[i + 2])
dp[i + 2] = (dp[i] + dp[i + 2]) % mod;
}
cout << dp[n] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll mod = 1000000007;
int main() {
ll n, m;
cin >> n >> m;
vector<bool> a(n + 1, true);
rep(i, m) {
ll x;
cin >> x;
a[x] = false;
}
vector<ll> dp(n + 1, 0);
dp[0] = 1;
rep(i, n) {
if (a[i + 1])
dp[i + 1] = (dp[i] + dp[i + 1]) % mod;
if (i == n - 1)
break;
if (a[i + 2])
dp[i + 2] = (dp[i] + dp[i + 2]) % mod;
}
cout << dp[n] << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> ng(m);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
ng[a] = true;
}
const ll mod = 1e9 + 7;
vector<ll> memo(n + 1, -1);
memo[0] = 1;
function<ll(int)> f = [&](int n) -> ll {
if (n < 0)
return 0;
if (memo[n] != -1)
return memo[n];
if (ng[n])
return 0;
return memo[n] = (f(n - 1) + f(n - 2)) % mod;
};
cout << f(n) << endl;
// vector<ll> dp(n + 1, 0);
// dp[0] = 1;
// for (int i = 1; i <= n; i++) {
// if (find(a.begin(), a.end(), i) != a.end())
// continue;
// dp[i] += dp[i - 1];
// dp[i] %= mod;
// if (i > 1) {
// dp[i] += dp[i - 2];
// dp[i] %= mod;
// }
// }
//
// cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<bool> ng(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
ng[a] = true;
}
const ll mod = 1e9 + 7;
vector<ll> memo(n + 1, -1);
memo[0] = 1;
function<ll(int)> f = [&](int n) -> ll {
if (n < 0)
return 0;
if (memo[n] != -1)
return memo[n];
if (ng[n])
return 0;
return memo[n] = (f(n - 1) + f(n - 2)) % mod;
};
cout << f(n) << endl;
// vector<ll> dp(n + 1, 0);
// dp[0] = 1;
// for (int i = 1; i <= n; i++) {
// if (find(a.begin(), a.end(), i) != a.end())
// continue;
// dp[i] += dp[i - 1];
// dp[i] %= mod;
// if (i > 1) {
// dp[i] += dp[i - 2];
// dp[i] %= mod;
// }
// }
//
// cout << dp[n] << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#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> dp(N);
int x = 0;
if (a[x] == 1) {
dp[0] = 0;
x++;
} else
dp[0] = 1;
if (a[x] == 2) {
dp[1] = 0;
x++;
} else
dp[1] = 1 + dp[0];
for (int i = 2; i < N; i++) {
if (i == a[x] - 1) {
dp[i] = 0;
x++;
} else
dp[i] = (dp[i - 2] + dp[i - 1]) % 1000000007;
}
cout << dp[N - 1];
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(100000);
for (int i = 0; i < M; i++)
cin >> a[i];
vector<int> dp(N);
int x = 0;
if (a[x] == 1) {
dp[0] = 0;
x++;
} else
dp[0] = 1;
if (a[x] == 2) {
dp[1] = 0;
x++;
} else
dp[1] = 1 + dp[0];
for (int i = 2; i < N; i++) {
if (i == a[x] - 1) {
dp[i] = 0;
x++;
} else
dp[i] = (dp[i - 2] + dp[i - 1]) % 1000000007;
}
cout << dp[N - 1];
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const ll INFLL = 1001001001001001001; // > 10^18
const int MOD = (int)1e9 + 7;
const ll MODLL = (ll)1e9 + 7;
const double EPS = 1e-9;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
REP(i, m) cin >> a[i];
vector<bool> flag(n + 1, true);
for (int i = 0; i < m; i++) {
flag[a[i]] = false;
}
vector<int> dp(n + 1, 0);
dp[0] = 1;
for (int i = 1; i <= n + 1; i++) {
if (flag[i]) {
dp[i] += dp[i - 1];
dp[i] %= MOD;
if (i >= 2) {
dp[i] += dp[i - 2];
dp[i] %= MOD;
}
} else {
dp[i] = 0;
}
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const ll INFLL = 1001001001001001001; // > 10^18
const int MOD = (int)1e9 + 7;
const ll MODLL = (ll)1e9 + 7;
const double EPS = 1e-9;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
REP(i, m) cin >> a[i];
vector<bool> flag(n + 1, true);
for (int i = 0; i < m; i++) {
flag[a[i]] = false;
}
vector<int> dp(n + 1, 0);
dp[0] = 1;
for (int i = 1; i <= n; i++) {
if (flag[i]) {
dp[i] += dp[i - 1];
dp[i] %= MOD;
if (i >= 2) {
dp[i] += dp[i - 2];
dp[i] %= MOD;
}
} else {
dp[i] = 0;
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
// fatorial.cpp depend on this.
#ifndef MOD_INT
#define MOD_INT
template <int mod> struct ModInt {
private:
int x;
public:
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; }
template <typename T> operator T() const { return (T)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 mint = ModInt<MOD>;
#endif
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> available(N + 2, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
available[a] = false;
}
vector<mint> vec(N + 1, 0);
vec[0] = 1;
for (int i = 0; i < N; i++) {
if (available[i + 1])
vec[i + 1] += vec[i];
if (available[i + 2])
vec[i + 2] += vec[i];
}
cout << vec[N] << '\n';
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
// fatorial.cpp depend on this.
#ifndef MOD_INT
#define MOD_INT
template <int mod> struct ModInt {
private:
int x;
public:
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; }
template <typename T> operator T() const { return (T)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 mint = ModInt<MOD>;
#endif
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> available(N + 2, true);
for (int i = 0; i < M; i++) {
int a;
cin >> a;
available[a] = false;
}
vector<mint> vec(N + 2, 0);
vec[0] = 1;
for (int i = 0; i < N; i++) {
if (available[i + 1])
vec[i + 1] += vec[i];
if (available[i + 2])
vec[i + 2] += vec[i];
}
cout << vec[N] << '\n';
return 0;
} | replace | 94 | 95 | 94 | 95 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define revrep(i, N) for (int(i) = (N)-1; (i) >= 0; (i)--)
#define dump(vec) \
for (int i = 0; i < (vec).size(); i++) { \
cout << vec.at(i) << ","; \
} \
cout << endl
typedef long long ll;
ll func(int n, set<int> &a);
int main(void) {
int N, M;
cin >> N >> M;
set<int> a;
rep(i, M) {
int temp;
cin >> temp;
a.insert(temp);
}
cout << func(N, a) << endl;
return 0;
}
/* n段目までたどり着くための移動方法と通り数*/
vector<ll> cache(100000, -1);
ll func(int n, set<int> &a) {
if (n == 0) {
return 1;
} else if (n < 0) {
return 0;
} else if (cache.at(n) != (-1)) {
return cache.at(n);
}
ll ret = 0;
if (a.count(n - 1) == 0) {
ret += func(n - 1, a);
}
if (a.count(n - 2) == 0) {
ret += func(n - 2, a);
}
ret = ret % 1000000007;
cache.at(n) = ret;
return ret;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define revrep(i, N) for (int(i) = (N)-1; (i) >= 0; (i)--)
#define dump(vec) \
for (int i = 0; i < (vec).size(); i++) { \
cout << vec.at(i) << ","; \
} \
cout << endl
typedef long long ll;
ll func(int n, set<int> &a);
int main(void) {
int N, M;
cin >> N >> M;
set<int> a;
rep(i, M) {
int temp;
cin >> temp;
a.insert(temp);
}
cout << func(N, a) << endl;
return 0;
}
/* n段目までたどり着くための移動方法と通り数*/
vector<ll> cache(100010, -1);
ll func(int n, set<int> &a) {
if (n == 0) {
return 1;
} else if (n < 0) {
return 0;
} else if (cache.at(n) != (-1)) {
return cache.at(n);
}
ll ret = 0;
if (a.count(n - 1) == 0) {
ret += func(n - 1, a);
}
if (a.count(n - 2) == 0) {
ret += func(n - 2, a);
}
ret = ret % 1000000007;
cache.at(n) = ret;
return ret;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const int MOD = int(1e9) + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
size_t N, M;
cin >> N >> M;
vector<bool> bad(N + 1);
for (size_t i = 0; i < M; ++i) {
int a;
cin >> a;
bad[a] = true;
}
vector<int64_t> dp(N);
dp[0] = 1;
for (size_t i = 1; i <= N; ++i) {
if (bad[i]) {
continue;
} else {
if (i == 1) {
dp[i] = dp[0];
} else {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
}
}
cout << dp[N] << "\n";
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
const int MOD = int(1e9) + 7;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
size_t N, M;
cin >> N >> M;
vector<bool> bad(N + 1);
for (size_t i = 0; i < M; ++i) {
int a;
cin >> a;
bad[a] = true;
}
vector<int64_t> dp(N + 1);
dp[0] = 1;
for (size_t i = 1; i <= N; ++i) {
if (bad[i]) {
continue;
} else {
if (i == 1) {
dp[i] = dp[0];
} else {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
}
}
cout << dp[N] << "\n";
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (auto &A : a)
cin >> A;
vector<int> path(N + 1);
path[0] = 1;
int idx = 0;
int mod = 1000000007;
for (int i = 1; i <= N; ++i) {
if (a[idx] == i) {
path[i] = 0;
++idx;
continue;
}
int sum = 0;
if (0 <= i - 1)
sum += path[i - 1];
if (0 <= i - 2)
sum += path[i - 2];
path[i] = sum % mod;
}
cout << path[N];
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
for (auto &A : a)
cin >> A;
vector<int> path(N + 1);
path[0] = 1;
int idx = 0;
int mod = 1000000007;
for (int i = 1; i <= N; ++i) {
if ((idx < M) && (a[idx] == i)) {
path[i] = 0;
++idx;
continue;
}
int sum = 0;
if (0 <= i - 1)
sum += path[i - 1];
if (0 <= i - 2)
sum += path[i - 2];
path[i] = sum % mod;
}
cout << path[N];
return 0;
}
| replace | 16 | 17 | 16 | 17 | 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; i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define ALL(v) (v).begin(), (v).end()
#define m0(x) memset(x, 0, sizeof(x))
typedef long long ll;
using namespace std;
static const ll MOD = 1e9 + 7;
static const ll INF = 1e18;
static const ll MAX_N = 10000;
static const ll MAX_M = 10000;
static const int White = 0;
static const int Gray = 1;
static const int Black = 2;
void pvector(vector<int> A) {
cout << "[vector]";
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
ll N, M;
cin >> N >> M;
int A[MAX_N + 1] = {0};
REP(i, M) {
int a;
cin >> a;
A[a]++;
}
ll dp[MAX_N + 1] = {0}; // i段目での場合の数
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= N; i++) {
if (A[i] == 0) {
if (A[i - 1] == 0 && A[i - 2] == 0)
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
else if (A[i - 1] == 0 && A[i - 2] != 0)
dp[i] = dp[i - 1] % MOD;
else if (A[i - 1] != 0 && A[i - 2] == 0)
dp[i] = dp[i - 2] % MOD;
else
dp[i] = 0;
}
}
p(dp[N]);
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define p(s) cout << (s) << endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define ALL(v) (v).begin(), (v).end()
#define m0(x) memset(x, 0, sizeof(x))
typedef long long ll;
using namespace std;
static const ll MOD = 1e9 + 7;
static const ll INF = 1e18;
static const ll MAX_N = 100000;
static const ll MAX_M = 100000;
static const int White = 0;
static const int Gray = 1;
static const int Black = 2;
void pvector(vector<int> A) {
cout << "[vector]";
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
int main() {
ll N, M;
cin >> N >> M;
int A[MAX_N + 1] = {0};
REP(i, M) {
int a;
cin >> a;
A[a]++;
}
ll dp[MAX_N + 1] = {0}; // i段目での場合の数
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= N; i++) {
if (A[i] == 0) {
if (A[i - 1] == 0 && A[i - 2] == 0)
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
else if (A[i - 1] == 0 && A[i - 2] != 0)
dp[i] = dp[i - 1] % MOD;
else if (A[i - 1] != 0 && A[i - 2] == 0)
dp[i] = dp[i - 2] % MOD;
else
dp[i] = 0;
}
}
p(dp[N]);
} | replace | 15 | 17 | 15 | 17 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> dp(100001, -1);
vector<bool> broken(100001);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken.at(a) = true;
}
dp.at(0) = 1;
dp.at(1) = 1;
for (int i = 1; i <= N; i++) {
if (broken.at(i)) {
dp.at(i) = 0;
} else {
dp.at(i) = (dp.at(i - 1) + dp.at(i - 2)) % MOD;
}
}
cout << dp.at(N) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> dp(100001, -1);
vector<bool> broken(100001);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
int N, M;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
broken.at(a) = true;
}
dp.at(0) = 1;
if (broken.at(1)) {
dp.at(1) = 0;
} else {
dp.at(1) = 1;
}
for (int i = 2; i <= N; i++) {
if (broken.at(i)) {
dp.at(i) = 0;
} else {
dp.at(i) = (dp.at(i - 1) + dp.at(i - 2)) % MOD;
}
}
cout << dp.at(N) << endl;
}
| replace | 22 | 25 | 22 | 28 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 100001)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(m + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 2] + dp[i + 1]) % 1000000007;
}
cout << dp[0] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
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);
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken[i]) {
dp[i] = 0;
continue;
}
dp[i] = (dp[i + 2] + dp[i + 1]) % 1000000007;
}
cout << dp[0] << endl;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define bit(n) (1LL << (n))
// #define DEBUG
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll extgcd(ll a, ll b, ll &x, ll &y) {
x = 1, y = 0;
ll g = a;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= a / b * x;
return g;
}
ll ADD(const ll &a, const ll &b, const ll mod = MOD) { return (a + b) % mod; }
ll SUB(const ll &a, const ll &b, const ll mod = MOD) {
return (a - b + mod) % mod;
}
ll MUL(const ll &a, const ll &b, const ll mod = MOD) {
return (1LL * a * b) % mod;
}
ll DIV(const ll &a, const ll &b, const ll mod = MOD) {
ll x, y;
extgcd(b, mod, x, y);
return MUL(a, (x + mod) % mod, mod);
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vi broken(n + 1);
rep(_, m) {
int x;
cin >> x;
broken[x] = true;
}
vll dp(n + 1);
dp[0] = 1LL;
rep(i, n) {
ll cur = dp[i];
if (cur == 0LL)
continue;
rep(k, 1, 3) {
int ni = i + k;
if (broken[ni])
continue;
dp[ni] = ADD(dp[ni], cur);
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)
#define _all(arg) begin(arg), end(arg)
#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))
#define bit(n) (1LL << (n))
// #define DEBUG
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf = INT_MAX;
const ll INF = LLONG_MAX;
const ll MOD = 1000000007LL;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll extgcd(ll a, ll b, ll &x, ll &y) {
x = 1, y = 0;
ll g = a;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= a / b * x;
return g;
}
ll ADD(const ll &a, const ll &b, const ll mod = MOD) { return (a + b) % mod; }
ll SUB(const ll &a, const ll &b, const ll mod = MOD) {
return (a - b + mod) % mod;
}
ll MUL(const ll &a, const ll &b, const ll mod = MOD) {
return (1LL * a * b) % mod;
}
ll DIV(const ll &a, const ll &b, const ll mod = MOD) {
ll x, y;
extgcd(b, mod, x, y);
return MUL(a, (x + mod) % mod, mod);
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vi broken(n + 1);
rep(_, m) {
int x;
cin >> x;
broken[x] = true;
}
vll dp(n + 2);
dp[0] = 1LL;
rep(i, n) {
ll cur = dp[i];
if (cur == 0LL)
continue;
rep(k, 1, 3) {
int ni = i + k;
if (broken[ni])
continue;
dp[ni] = ADD(dp[ni], cur);
}
}
cout << dp[n] << endl;
return 0;
}
| replace | 76 | 77 | 76 | 77 | 0 | |
p03013 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
long long dp[100001];
priority_queue<int, vector<int>, greater<int>> a;
int N, M;
memset(dp, 0, sizeof(dp));
cin >> N >> M;
for (int i = 0; i < M; i++) {
int n;
cin >> n;
a.push(n);
}
dp[0] = 1;
for (int i = 1; i <= N; i++) {
if (i == a.top()) {
a.pop();
continue;
}
if (i == 1) {
dp[1] = dp[0];
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
}
}
cout << dp[N] << endl;
return 0;
}
| #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
#ifdef DEBUG
#define IFD if (true)
#else
#define IFD if (false)
#endif
int main() {
long long dp[100001];
priority_queue<int, vector<int>, greater<int>> a;
int N, M;
memset(dp, 0, sizeof(dp));
cin >> N >> M;
for (int i = 0; i < M; i++) {
int n;
cin >> n;
a.push(n);
}
dp[0] = 1;
for (int i = 1; i <= N; i++) {
if (!a.empty() && i == a.top()) {
a.pop();
continue;
}
if (i == 1) {
dp[1] = dp[0];
} else {
dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
}
}
cout << dp[N] << endl;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v).size(); ++i) { \
cout << v.at(i) << endl; \
}
#define REP(i, n) for (int64_t i = 0; i < n; ++i)
#define FOR(i, r, n) for (int64_t i = (r); i < n; ++i)
#define VIN(v) \
for (int64_t i = 0; i < (v).size(); ++i) { \
cin >> (v).at(i); \
}
typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pavec;
typedef vector<pali> palivec;
typedef vector<pal> palvec;
typedef vector<vector<bool>> bmat;
typedef vector<vector<int>> imat;
typedef vector<vector<long long>> lmat;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;
const ll MOD = 1000000007;
ll gcd(ll x, ll y) {
ll r = x % y;
if (r == 0)
return y;
else
return gcd(y, r);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
lvec mfactor(ll n) {
bvec ip(n, true);
lvec mf(n, -1);
ip[0] = false;
ip[1] = false;
mf[0] = 0;
mf[1] = 1;
REP(i, n) {
if (ip[i]) {
mf[i] = i;
for (ll j = i * i; j < n; j += i) {
ip[j] = false;
if (mf[j] == -1)
mf[j] = i;
}
}
}
return mf;
}
palivec get_prime(ll n, const lvec &mf) {
palivec plist;
while (n != 1) {
int cnt = 0;
ll m = mf[n];
while (mf[n] == m) {
cnt++;
n /= m;
}
plist.pb(pali(m, cnt));
}
return plist;
}
void COMinit(int m, lvec &fac, lvec &finv) {
lvec inv(m);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < m; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll pow_mod(ll a, ll n) {
ll x = 1;
while (n > 0) {
if (n & 1) {
x = x * a % MOD;
}
a = a * a % MOD;
n >>= 1;
}
return x;
}
ll COM(int n, int k, const lvec &fac, const lvec &finv) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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;
}
ll P(ll n, ll m) {
ll s = 1;
ll cnt = n;
REP(i, n - m) {
s *= cnt % MOD;
s %= MOD;
--cnt;
}
return s;
}
void fac(int a, int b, bvec &fmap) {
for (int i = 2; i < b; i++) {
if (fmap[i])
continue;
else if (a % i == 0) {
fmap[i] = true;
int n = a / i, x = i;
while (n >= i) {
n /= i;
x += i;
fmap[x] = true;
}
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ivec a(m + 1);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
a[m] = n + 1;
lvec dp(n);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i < n + 1; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
ll ans = 1;
int c = 0;
for (int i = 0; i < m + 1; i++) {
int ns = a[i] - c - 1;
if (ns < 0) {
cout << 0 << endl;
return 0;
}
ans *= dp[ns];
ans %= MOD;
c = a[i] + 1;
}
/*
lvec fac(n+1), finv(n+1);
COMinit(n+1, fac, finv);
int c=0;
ll ans=1;
for (int i=0; i<m+1; i++){
int ns = a[i]-c-1;
if(ns<0) {
cout << 0 << endl;
return 0;
}
int n2=0;
int nss = ns;
ll tmp=0;
while(((nss >= n2)&&!(ns%2)) || ((nss > n2)&&(ns%2))){
//cout << nss << ' ' << n2 << endl;
tmp+=COM(nss, n2, fac, finv);
++n2;
--nss;
}
ans*=tmp;
ans%=MOD;
c = a[i]+1;
}
*/
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v).size(); ++i) { \
cout << v.at(i) << endl; \
}
#define REP(i, n) for (int64_t i = 0; i < n; ++i)
#define FOR(i, r, n) for (int64_t i = (r); i < n; ++i)
#define VIN(v) \
for (int64_t i = 0; i < (v).size(); ++i) { \
cin >> (v).at(i); \
}
typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pavec;
typedef vector<pali> palivec;
typedef vector<pal> palvec;
typedef vector<vector<bool>> bmat;
typedef vector<vector<int>> imat;
typedef vector<vector<long long>> lmat;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;
const ll MOD = 1000000007;
ll gcd(ll x, ll y) {
ll r = x % y;
if (r == 0)
return y;
else
return gcd(y, r);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
lvec mfactor(ll n) {
bvec ip(n, true);
lvec mf(n, -1);
ip[0] = false;
ip[1] = false;
mf[0] = 0;
mf[1] = 1;
REP(i, n) {
if (ip[i]) {
mf[i] = i;
for (ll j = i * i; j < n; j += i) {
ip[j] = false;
if (mf[j] == -1)
mf[j] = i;
}
}
}
return mf;
}
palivec get_prime(ll n, const lvec &mf) {
palivec plist;
while (n != 1) {
int cnt = 0;
ll m = mf[n];
while (mf[n] == m) {
cnt++;
n /= m;
}
plist.pb(pali(m, cnt));
}
return plist;
}
void COMinit(int m, lvec &fac, lvec &finv) {
lvec inv(m);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < m; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll pow_mod(ll a, ll n) {
ll x = 1;
while (n > 0) {
if (n & 1) {
x = x * a % MOD;
}
a = a * a % MOD;
n >>= 1;
}
return x;
}
ll COM(int n, int k, const lvec &fac, const lvec &finv) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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;
}
ll P(ll n, ll m) {
ll s = 1;
ll cnt = n;
REP(i, n - m) {
s *= cnt % MOD;
s %= MOD;
--cnt;
}
return s;
}
void fac(int a, int b, bvec &fmap) {
for (int i = 2; i < b; i++) {
if (fmap[i])
continue;
else if (a % i == 0) {
fmap[i] = true;
int n = a / i, x = i;
while (n >= i) {
n /= i;
x += i;
fmap[x] = true;
}
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
ivec a(m + 1);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
a[m] = n + 1;
lvec dp(n + 1);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i < n + 1; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= MOD;
}
ll ans = 1;
int c = 0;
for (int i = 0; i < m + 1; i++) {
int ns = a[i] - c - 1;
if (ns < 0) {
cout << 0 << endl;
return 0;
}
ans *= dp[ns];
ans %= MOD;
c = a[i] + 1;
}
/*
lvec fac(n+1), finv(n+1);
COMinit(n+1, fac, finv);
int c=0;
ll ans=1;
for (int i=0; i<m+1; i++){
int ns = a[i]-c-1;
if(ns<0) {
cout << 0 << endl;
return 0;
}
int n2=0;
int nss = ns;
ll tmp=0;
while(((nss >= n2)&&!(ns%2)) || ((nss > n2)&&(ns%2))){
//cout << nss << ' ' << n2 << endl;
tmp+=COM(nss, n2, fac, finv);
++n2;
--nss;
}
ans*=tmp;
ans%=MOD;
c = a[i]+1;
}
*/
cout << ans << endl;
} | replace | 167 | 168 | 167 | 168 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> v(n, false);
vector<ll> dp(n, 0);
rep(i, m) {
int a;
cin >> a;
a--;
v.at(a) = true;
}
if (!v.at(0))
dp.at(0) = 1;
if (!v.at(1))
dp.at(1) = dp.at(0) + 1;
for (int i = 2; i < n; i++) {
if (v.at(i))
continue;
dp.at(i) = (dp.at(i - 1) + dp.at(i - 2)) % mod;
}
cout << dp.at(n - 1) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<bool> v(n, false);
vector<ll> dp(n, 0);
rep(i, m) {
int a;
cin >> a;
a--;
v.at(a) = true;
}
if (!v.at(0))
dp.at(0) = 1;
if (n > 1 && !v.at(1))
dp.at(1) = dp.at(0) + 1;
for (int i = 2; i < n; i++) {
if (v.at(i))
continue;
dp.at(i) = (dp.at(i - 1) + dp.at(i - 2)) % mod;
}
cout << dp.at(n - 1) << endl;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define tl 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> DP(n + 1, 0);
vector<ll> A(m, 0);
REP(i, m) {
cin >> A[i];
DP[A[i]] = -1;
}
DP[0] = 1;
REP(i, n) {
if (DP[i] == -1)
continue;
if (DP[i + 1] != -1)
DP[i + 1] = (DP[i + 1] + DP[i]) % tl;
if (DP[i + 2] != -1)
DP[i + 2] = (DP[i + 2] + DP[i]) % tl;
}
cout << DP[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define tl 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> DP(n + 2, 0);
vector<ll> A(m, 0);
REP(i, m) {
cin >> A[i];
DP[A[i]] = -1;
}
DP[0] = 1;
REP(i, n) {
if (DP[i] == -1)
continue;
if (DP[i + 1] != -1)
DP[i + 1] = (DP[i + 1] + DP[i]) % tl;
if (DP[i + 2] != -1)
DP[i + 2] = (DP[i + 2] + DP[i]) % tl;
}
cout << DP[n] << endl;
} | replace | 12 | 13 | 12 | 13 | -6 | munmap_chunk(): invalid pointer
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> d(m);
for (int i = 0; i < m; i++)
cin >> d[i];
vector<int> dp(n + 1, 0);
dp[0] = dp[1] = 1;
int tmp = 0;
if (d[0] == 1) {
tmp++;
dp[1] = 0;
}
for (int i = 2; i <= n; i++) {
if (tmp < m && d[tmp] == i) {
tmp++;
continue;
}
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= mod;
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> d(m);
for (int i = 0; i < m; i++)
cin >> d[i];
vector<int> dp(n + 1, 0);
dp[0] = dp[1] = 1;
int tmp = 0;
if (d.size() > 0 && d[0] == 1) {
tmp++;
dp[1] = 0;
}
for (int i = 2; i <= n; i++) {
if (tmp < m && d[tmp] == i) {
tmp++;
continue;
}
dp[i] = dp[i - 1] + dp[i - 2];
dp[i] %= mod;
}
cout << dp[n] << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++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(obj) (obj).begin(), (obj).end()
#define SORT(list) sort(ALL((list)));
#define MOD 1000000007
using namespace std;
using ll = unsigned long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m);
vector<ll> b(n);
REP(i, n + 1) b[i] = -1;
REP(i, m) {
cin >> a[i];
b[a[i]] = 0;
}
if (n == 1) {
cout << 1 << endl;
return 0;
} else if (n == 2) {
if (b[1] == 0)
cout << 1 << endl;
else
cout << 2 << endl;
return 0;
}
b[0] = 1;
if (b[1] != 0)
b[1] = 1;
FOR(i, 2, n + 1) {
if (b[i] == 0)
continue;
b[i] = (b[i - 1] + b[i - 2]) % MOD;
// printf("b[%d] = %lld + %lld\n",i,b[i-1],b[i-2]);
}
cout << b[n] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a) for (int i = 0; i < (a); ++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(obj) (obj).begin(), (obj).end()
#define SORT(list) sort(ALL((list)));
#define MOD 1000000007
using namespace std;
using ll = unsigned long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m);
vector<ll> b(n + 1);
REP(i, n + 1) b[i] = -1;
REP(i, m) {
cin >> a[i];
b[a[i]] = 0;
}
if (n == 1) {
cout << 1 << endl;
return 0;
} else if (n == 2) {
if (b[1] == 0)
cout << 1 << endl;
else
cout << 2 << endl;
return 0;
}
b[0] = 1;
if (b[1] != 0)
b[1] = 1;
FOR(i, 2, n + 1) {
if (b[i] == 0)
continue;
b[i] = (b[i - 1] + b[i - 2]) % MOD;
// printf("b[%d] = %lld + %lld\n",i,b[i-1],b[i-2]);
}
cout << b[n] << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long INF = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(K);
vector<long long> count(100001);
count[0] = 1;
count[1] = 1;
for (int i = 2; i < 100001; i++) {
count[i] = count[i - 1] + count[i - 2];
count[i] %= INF;
}
for (int i = 0; i < K; i++) {
cin >> A[i];
if (i != 0)
if (A[i] - 1 == A[i - 1]) {
cout << 0 << endl;
return 0;
}
}
long long ans = 1;
for (int i = 0; i <= K; i++) {
if (i == 0)
ans *= count[A[i] - 1];
else if (i == K)
ans *= count[N - A[i - 1] - 1];
else
ans *= count[A[i] - A[i - 1] - 2];
ans %= INF;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long INF = 1e9 + 7;
int main() {
int N, K;
cin >> N >> K;
vector<long long> A(K);
vector<long long> count(100001);
count[0] = 1;
count[1] = 1;
for (int i = 2; i < 100001; i++) {
count[i] = count[i - 1] + count[i - 2];
count[i] %= INF;
}
for (int i = 0; i < K; i++) {
cin >> A[i];
if (i != 0)
if (A[i] - 1 == A[i - 1]) {
cout << 0 << endl;
return 0;
}
}
if (K == 0) {
cout << count[N] << endl;
return 0;
}
long long ans = 1;
for (int i = 0; i <= K; i++) {
if (i == 0)
ans *= count[A[i] - 1];
else if (i == K)
ans *= count[N - A[i - 1] - 1];
else
ans *= count[A[i] - A[i - 1] - 2];
ans %= INF;
}
cout << ans << endl;
} | insert | 22 | 22 | 22 | 26 | 0 | |
p03013 | Python | Runtime Error | import sys
sys.setrecursionlimit(100000)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
# print(ANS)
# if x in A:
# print('::::', x)
# d[x] = 0
# return 0
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
return 1
# if d.get(x + 1):
# x1 = d.get(x + 1)
# else:
# x1 = f(x + 1)
# d[x + 1] = x1
#
# if d.get(x + 2):
# x2 = d.get(x + 2)
# else:
# x2 = f(x + 2)
# d[x + 2] = x2
# ans = x1 + x2
ans = f(x + 1) + f(x + 2)
ANS[x] = ans
return ans
print(f(0) % 1000000007)
| import sys
sys.setrecursionlimit(1000000)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
# print(ANS)
# if x in A:
# print('::::', x)
# d[x] = 0
# return 0
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
return 1
# if d.get(x + 1):
# x1 = d.get(x + 1)
# else:
# x1 = f(x + 1)
# d[x + 1] = x1
#
# if d.get(x + 2):
# x2 = d.get(x + 2)
# else:
# x2 = f(x + 2)
# d[x + 2] = x2
# ans = x1 + x2
ans = f(x + 1) + f(x + 2)
ANS[x] = ans
return ans
print(f(0) % 1000000007)
| replace | 2 | 3 | 2 | 3 | 0 | |
p03013 | Python | Runtime Error | import sys
sys.setrecursionlimit(10**5)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
return 1
if ANS[x + 1] is None:
x1 = f(x + 1)
ANS[x + 1] = x1
else:
x1 = ANS[x + 1]
if ANS[x + 2] is None:
x2 = f(x + 2)
ANS[x + 2] = x1
else:
x2 = ANS[x + 2]
ans = x1 + x2
# ans = f(x + 1) + f(x + 2)
ANS[x] = ans
return ans
print(f(0) % 1000000007)
| import sys
sys.setrecursionlimit(10**6)
N, M = map(int, input().split())
A = []
ANS = []
for i in range(N + 10):
ANS.append(None)
for _ in range(M):
a = int(input())
A.append(a)
ANS[a] = 0
def f(x):
if ANS[x] is not None:
return ANS[x]
if x > N:
return 0
if x == N:
return 1
if ANS[x + 1] is None:
x1 = f(x + 1)
ANS[x + 1] = x1
else:
x1 = ANS[x + 1]
if ANS[x + 2] is None:
x2 = f(x + 2)
ANS[x + 2] = x1
else:
x2 = ANS[x + 2]
ans = x1 + x2
# ans = f(x + 1) + f(x + 2)
ANS[x] = ans
return ans
print(f(0) % 1000000007)
| replace | 2 | 3 | 2 | 3 | 0 | |
p03013 | Python | Runtime Error | n, m = map(int, input().split())
s = [0] * (n + 1)
s[-1] = 1
for _ in range(m):
a = int(input())
s[a] = None
if s[0] is None and s[1] is None:
print(0)
exit()
for i in range(n - 1, -1, -1):
if s[i] is None:
continue
if i + 1 < len(s) and s[i + 1] is not None:
s[i] += s[i + 1]
if i + 2 < len(s) and s[i + 2] is not None:
s[i] += s[i + 2]
print(s[0] % 1_000_000_007)
| n, m = map(int, input().split())
s = [0] * (n + 1)
s[-1] = 1
for _ in range(m):
a = int(input())
s[a] = None
if s[0] is None and s[1] is None:
print(0)
exit()
for i in range(n - 1, -1, -1):
if s[i] is None:
continue
if i + 1 < len(s) and s[i + 1] is not None:
s[i] += s[i + 1]
if i + 2 < len(s) and s[i + 2] is not None:
s[i] += s[i + 2]
print(s[0] % 1000000007)
| replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | Python | Time Limit Exceeded | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = map(int, input().split())
A = [int(input()) for _ in range(M)]
mod = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
if i == 1:
dp[1] = dp[0]
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print(dp[N])
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = map(int, input().split())
A = set([int(input()) for _ in range(M)])
mod = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
if i == 1:
dp[1] = dp[0]
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print(dp[N])
if __name__ == "__main__":
main()
| replace | 6 | 7 | 6 | 7 | TLE | |
p03013 | Python | Runtime Error | import sys
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = map(int, read().split())
a = {int(read()) - 1 for _ in range(m)}
mod = 10**9 + 7
dp = [0] * n
if 0 not in a:
dp[0] = 1
if 1 not in a:
dp[1] = 1 + dp[0]
for i in range(2, n):
if i in a:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % mod
print(dp[-1])
if __name__ == "__main__":
main()
| import sys
def read():
return sys.stdin.readline().rstrip()
def main():
n, m = map(int, read().split())
a = {int(read()) - 1 for _ in range(m)}
if n == 1:
print(1)
return
mod = 10**9 + 7
dp = [0] * n
if 0 not in a:
dp[0] = 1
if 1 not in a:
dp[1] = 1 + dp[0]
for i in range(2, n):
if i in a:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % mod
print(dp[-1])
if __name__ == "__main__":
main()
| insert | 10 | 10 | 10 | 13 | 0 | |
p03013 | Python | Time Limit Exceeded | # input
N, M = map(int, input().split())
a = []
a_append = a.append
for n in range(M):
a_append(int(input()))
mod = 1000000007
# check
check = {}
for n in range(N + 1):
if n in a:
check[n] = False
else:
check[n] = True
dp = {0: 1}
if check[1] is True:
dp[1] = 1
else:
dp[1] = 0
for n in range(2, N + 1):
dp[n] = 0
if check[n - 1] is True:
dp[n] += dp[n - 1]
if check[n - 2] is True:
dp[n] += dp[n - 2]
dp[n] %= mod
print(dp[N])
| # input
N, M = map(int, input().split())
a = []
a_append = a.append
for n in range(M):
a_append(int(input()))
mod = 1000000007
# check
check = [True] * (N + 1)
for i in a:
check[i] = False
dp = {0: 1}
if check[1] is True:
dp[1] = 1
else:
dp[1] = 0
for n in range(2, N + 1):
dp[n] = 0
if check[n - 1] is True:
dp[n] += dp[n - 1]
if check[n - 2] is True:
dp[n] += dp[n - 2]
dp[n] %= mod
print(dp[N])
| replace | 11 | 17 | 11 | 14 | TLE | |
p03013 | Python | Time Limit Exceeded | Q = 1000000007
n, m = map(int, input().split())
a = [int(input()) for _ in range(m)]
dp = {0: 1, 1: 0 if 1 in a else 1}
for k in range(2, n + 1):
dp[k] = (0 if k in a else dp[k - 1] + dp[k - 2]) % Q
print(dp[n])
| Q = 1000000007
n, m = map(int, input().split())
a = set([int(input()) for _ in range(m)])
dp = {0: 1, 1: 0 if 1 in a else 1}
for k in range(2, n + 1):
dp[k] = (0 if k in a else dp[k - 1] + dp[k - 2]) % Q
print(dp[n])
| replace | 2 | 3 | 2 | 3 | TLE | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> A;
int a;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> a;
A.push_back(a);
}
long long way[101000] = {0};
way[0] = 1;
int nextout = 0;
for (int w = 1; w <= N; w++) {
if (w == A[nextout]) {
nextout++;
continue;
}
if (w == 1)
way[w] = way[w - 1];
else
way[w] = way[w - 1] + way[w - 2];
way[w] %= 1000000007;
}
cout << way[N] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> A;
int a;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> a;
A.push_back(a);
}
long long way[101000] = {0};
way[0] = 1;
int nextout = 0;
for (int w = 1; w <= N; w++) {
if (nextout < M && w == A[nextout]) {
nextout++;
continue;
}
if (w == 1)
way[w] = way[w - 1];
else
way[w] = way[w - 1] + way[w - 2];
way[w] %= 1000000007;
}
cout << way[N] << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p03013 | Python | Runtime Error | n, m = map(int, input().split())
hole_ids = {int(input()) - 1: 0 for _ in range(m)}
X = 1000000007
def solve(n, hole_ids):
nums = []
# nums = [0] * n
for i in range(n):
if i in hole_ids:
nums.append(0)
# nums[i] = 0
continue
if i == 0:
nums.append(1)
# nums[i] = 1
elif i == 1:
# 1つ前から1段上がるから2つ前から2個飛ばし
nums.append(nums[-1] + 1)
# nums[i] = nums[i-1] + 1
else:
nums.append((nums[-1] % X + nums[-2] % X) % X)
# nums[i] = (nums[i-1] + nums[i-2]) % X
return nums[-1]
print(solve(n, hole_ids))
n, m = map(int, input().split())
hole_ids = {int(input()) - 1: 0 for _ in range(m)}
X = 1000000007
def solve(n, hole_ids):
nums = []
# nums = [0] * n
for i in range(n):
if i in hole_ids:
nums.append(0)
# nums[i] = 0
continue
if i == 0:
nums.append(1)
# nums[i] = 1
elif i == 1:
# 1つ前から1段上がるから2つ前から2個飛ばし
nums.append(nums[-1] + 1)
# nums[i] = nums[i-1] + 1
else:
nums.append((nums[-1] % X + nums[-2] % X) % X)
# nums[i] = (nums[i-1] + nums[i-2]) % X
return nums[-1]
print(solve(n, hole_ids))
| n, m = map(int, input().split())
hole_ids = {int(input()) - 1: 0 for _ in range(m)}
X = 1000000007
def solve(n, hole_ids):
nums = []
# nums = [0] * n
for i in range(n):
if i in hole_ids:
nums.append(0)
# nums[i] = 0
continue
if i == 0:
nums.append(1)
# nums[i] = 1
elif i == 1:
# 1つ前から1段上がるから2つ前から2個飛ばし
nums.append(nums[-1] + 1)
# nums[i] = nums[i-1] + 1
else:
nums.append((nums[-1] % X + nums[-2] % X) % X)
# nums[i] = (nums[i-1] + nums[i-2]) % X
return nums[-1]
print(solve(n, hole_ids))
| delete | 28 | 56 | 28 | 28 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03013/Python/s744106332.py", line 29, in <module>
n, m = map(int, input().split())
EOFError: EOF when reading a line
|
p03013 | Python | Runtime Error | n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(input().strip()))
broken = [False] * (n + 1)
for i in range(m):
broken[a[i]] = True
dp = []
dp.append(1)
if broken[1]:
dp.append(0)
else:
dp.append(1)
for i in range(2, n + 1, 1):
if broken[i]:
dp.append(0)
else:
dp.append((dp[i - 1] + dp[i - 2]) % 1_000_000_007)
print(dp[n])
| n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(input().strip()))
broken = [False] * (n + 1)
for i in range(m):
broken[a[i]] = True
dp = []
dp.append(1)
if broken[1]:
dp.append(0)
else:
dp.append(1)
for i in range(2, n + 1, 1):
if broken[i]:
dp.append(0)
else:
dp.append((dp[i - 1] + dp[i - 2]) % 1000000007)
print(dp[n])
| replace | 23 | 24 | 23 | 24 | 0 | |
p03013 | Python | Runtime Error | N, M = map(int, input().split())
steps = [True] * (N + 1)
for _ in range(M):
steps[int(input())] = False
dp = [0] * (N + 1)
dp[0] = 1
for prev in range(N):
for now in range(prev + 1, min(N, prev + 2) + 1):
if steps[now]:
dp[now] += dp[prev]
dp[now] %= 1_000_000_007
print(dp[N])
| N, M = map(int, input().split())
steps = [True] * (N + 1)
for _ in range(M):
steps[int(input())] = False
dp = [0] * (N + 1)
dp[0] = 1
for prev in range(N):
for now in range(prev + 1, min(N, prev + 2) + 1):
if steps[now]:
dp[now] += dp[prev]
dp[now] %= 10**9 + 7
print(dp[N])
| replace | 10 | 11 | 10 | 11 | 0 | |
p03013 | Python | Time Limit Exceeded | mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(input()) for _ in range(m)]
dp = {}
for i in range(n + 1):
dp[i] = 1
dp[1] = 0 if 1 in a else 1
for i in range(2, n + 1):
if i in a:
dp[i] = 0
else:
dp[i] = dp[i - 1] % mod + dp[i - 2] % mod
dp[i] %= mod
print(dp[n] % mod)
| mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = set([int(input()) for _ in range(m)])
dp = {}
for i in range(n + 1):
dp[i] = 1
dp[1] = 0 if 1 in a else 1
for i in range(2, n + 1):
if i in a:
dp[i] = 0
else:
dp[i] = dp[i - 1] % mod + dp[i - 2] % mod
dp[i] %= mod
print(dp[n] % mod)
| replace | 3 | 4 | 3 | 4 | TLE | |
p03013 | Python | Time Limit Exceeded | import sys
import os
MOD = 10**9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = [int(sys.stdin.buffer.readline().rstrip()) for _ in range(M)]
ret = [0, 1]
for i in range(1, N + 1):
if i in A:
ret.append(0)
else:
ret.append((ret[-1] + ret[-2]) % MOD)
print(ret[-1] % MOD)
if __name__ == "__main__":
main()
| import sys
import os
MOD = 10**9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = set([int(sys.stdin.buffer.readline().rstrip()) for _ in range(M)])
ret = [0, 1]
for i in range(1, N + 1):
if i in A:
ret.append(0)
else:
ret.append((ret[-1] + ret[-2]) % MOD)
print(ret[-1] % MOD)
if __name__ == "__main__":
main()
| replace | 11 | 12 | 11 | 12 | TLE | |
p03013 | Python | Time Limit Exceeded | def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def solve(inputs):
[N, M] = list(map(lambda x: int(x), inputs[0].split()))
broke_steps = list(map(lambda x: int(x), inputs[1:]))
SSSS = 1000000007
patterns = [1]
for step in range(1, N + 1):
if step in broke_steps:
ap = 0
elif step == 1:
ap = 1
else:
ap = (patterns[step - 1] + patterns[step - 2]) % SSSS
patterns.append(ap)
return patterns[-1]
if __name__ == "__main__":
first = input()
[N, M] = list(map(lambda x: int(x), first.split()))
inputs_str = inputs(M)
inputs_str.insert(0, first)
ret = solve(inputs_str)
print(ret)
| def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def solve(inputs):
[N, M] = list(map(lambda x: int(x), inputs[0].split()))
broke_steps = {}
for b in map(lambda x: int(x), inputs[1:]):
broke_steps[b] = True
SSSS = 1000000007
patterns = [1]
for step in range(1, N + 1):
if step in broke_steps:
ap = 0
elif step == 1:
ap = 1
else:
ap = (patterns[step - 1] + patterns[step - 2]) % SSSS
patterns.append(ap)
return patterns[-1]
if __name__ == "__main__":
first = input()
[N, M] = list(map(lambda x: int(x), first.split()))
inputs_str = inputs(M)
inputs_str.insert(0, first)
ret = solve(inputs_str)
print(ret)
| replace | 7 | 8 | 7 | 10 | TLE | |
p03013 | Python | Runtime Error | N, M = map(int, input().split())
A = []
for _ in range(M):
A[int(input())] = True
step = [0] * (N + 1)
step[0] = 1
for s in range(1, N + 1):
if A[s]:
step[s] = 0
continue
if s == 1:
step[s] = 1
continue
else:
step[s] = step[s - 1] + step[s - 2]
step[s] %= 1000000007
print(step[N])
| N, M = map(int, input().split())
A = [False] * (N + 1)
for _ in range(M):
A[int(input())] = True
step = [0] * (N + 1)
step[0] = 1
for s in range(1, N + 1):
if A[s]:
step[s] = 0
continue
if s == 1:
step[s] = 1
continue
else:
step[s] = step[s - 1] + step[s - 2]
step[s] %= 1000000007
print(step[N])
| replace | 2 | 3 | 2 | 3 | IndexError: list assignment index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03013/Python/s337394668.py", line 6, in <module>
A[int(input())] = True
IndexError: list assignment index out of range
|
p03013 | Python | Runtime Error | n, m = map(int, input().split())
stairs = []
is_continuous = False
for i in range(m):
stairs.append(int(input()))
if i > 0 and stairs[i] - 1 == stairs[i - 1]:
is_continuous = True
break
if is_continuous:
print(0)
else:
countup_num = [0] * (n + 1)
countup_num[0] = 1
countup_num[1] = 1
for i in range(2, n + 1):
countup_num[i] = (countup_num[i - 1] + countup_num[i - 2]) % 1000000007
res = 1
diff = 0
now = 0
for i in range(m):
diff = stairs[i] - now - 1
now = stairs[i] + 1
res *= (countup_num[diff]) % 1000000007
# print(res, now)
diff = n - stairs[-1] - 1
res *= (countup_num[diff]) % 1000000007
res %= 1000000007
# print(countup_num)
print(res)
| n, m = map(int, input().split())
stairs = []
is_continuous = False
for i in range(m):
stairs.append(int(input()))
if i > 0 and stairs[i] - 1 == stairs[i - 1]:
is_continuous = True
break
if is_continuous:
print(0)
else:
countup_num = [0] * (n + 1)
countup_num[0] = 1
countup_num[1] = 1
for i in range(2, n + 1):
countup_num[i] = (countup_num[i - 1] + countup_num[i - 2]) % 1000000007
res = 1
diff = 0
now = 0
for i in range(m):
diff = stairs[i] - now - 1
now = stairs[i] + 1
res *= (countup_num[diff]) % 1000000007
# print(res, now)
if m == 0:
res = countup_num[n]
else:
diff = n - stairs[-1] - 1
res *= (countup_num[diff]) % 1000000007
res %= 1000000007
# print(countup_num)
print(res)
| replace | 26 | 28 | 26 | 31 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.