problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03013 | Python | Time Limit Exceeded | div = 1000000007
n, m = map(int, input().split())
a = [int(input()) for i in range(m)]
f = [0] * (n + 1)
f[0] = 1
if 1 not in a:
f[1] = 1
for i in range(2, n + 1):
if i in a:
continue
f[i] = (f[i - 1] + f[i - 2]) % div
print(f[-1])
| div = 1000000007
n, m, *b = map(int, open(0).read().split())
a = set(b)
f = [0] * (n + 1)
f[0] = 1
if 1 not in a:
f[1] = 1
for i in range(2, n + 1):
if i in a:
continue
f[i] = (f[i - 1] + f[i - 2]) % div
print(f[-1])
| replace | 2 | 4 | 2 | 4 | TLE | |
p03013 | Python | Runtime Error | def Fib(n, memo={}):
if n < 2:
return 1
elif n in memo:
return memo[n]
else:
memo[n] = Fib(n - 1, memo) + Fib(n - 2, memo)
return memo[n]
def resolve():
N, M = [int(i) for i in input().split()]
aa = []
for _ in range(M):
aa.append(int(input()))
fib_l... | def Fib(n, memo={}):
if n < 2:
return 1
elif n in memo:
return memo[n]
else:
memo[n] = Fib(n - 1, memo) + Fib(n - 2, memo)
return memo[n]
def resolve():
N, M = [int(i) for i in input().split()]
aa = []
for _ in range(M):
aa.append(int(input()))
fib_l... | replace | 15 | 16 | 15 | 16 | 0 | |
p03013 | Python | Time Limit Exceeded | N, M = map(int, input().split())
a = [int(input()) for i in range(M)]
MOD = 10**9 + 7
dp = [1]
if 1 in a:
dp.append(0)
else:
dp.append(1)
for ith_stair in range(2, N + 1):
if ith_stair in a:
dp.append(0)
else:
dp.append((dp[ith_stair - 1] + dp[ith_stair - 2]) % MOD)
print(dp[N] % MOD)
| N, M = map(int, input().split())
a = set([int(input()) for i in range(M)])
MOD = 10**9 + 7
dp = [1]
if 1 in a:
dp.append(0)
else:
dp.append(1)
for ith_stair in range(2, N + 1):
if ith_stair in a:
dp.append(0)
else:
dp.append((dp[ith_stair - 1] + dp[ith_stair - 2]) % MOD)
print(dp[N] % MO... | replace | 1 | 2 | 1 | 2 | TLE | |
p03013 | Python | Runtime Error | d = {}
def calc_step_combination(num):
if num == 0:
return 0
if num == 1 or num == 2:
return 1
if num in d:
return d[num]
res = calc_step_combination(num - 1) + calc_step_combination(num - 2)
d[num] = res
return res
def sol(n, a_list):
step_batch = []
batch_st... | import sys
sys.setrecursionlimit(110000)
d = {}
def calc_step_combination(num):
if num == 0:
return 0
if num == 1 or num == 2:
return 1
if num in d:
return d[num]
res = calc_step_combination(num - 1) + calc_step_combination(num - 2)
d[num] = res
return res
def sol(n... | insert | 0 | 0 | 0 | 4 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
int n, m;
int a;
ll dp[mx];
bool dpflag[mx] = {true};
int main() {
cin >> n >> m;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const int mx = 200010;
const ll mod = 1e9 + 7;
int n, m;
int a;
ll dp[mx];
bool dpflag[mx] = {true};
int main() {
cin >> n >> m;
for (int i ... | replace | 30 | 36 | 30 | 34 | TLE | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long patterns(int a) {
if (a == 0)
return 1;
else if (a == 1)
return 1;
else if (a == 2)
return 2;
else {
return 2 * patterns(a - 2) + patterns(a - 3);
}
}
int main() {
int n, m, i, skip = 1;
long long ans = 1;
cin >> n >> m;
vector... | #include <bits/stdc++.h>
using namespace std;
long long patterns(int a) {
if (a == 0)
return 1;
else if (a == 1)
return 1;
else if (a == 2)
return 2;
else if (a % 2 == 0) {
return (patterns(a / 2) * patterns(a / 2) +
patterns(a / 2 - 1) * patterns(a / 2 - 1)) %
1000000007... | replace | 10 | 12 | 10 | 18 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi fir... | #include <bits/stdc++.h>
#include <map>
#include <math.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi fir... | replace | 29 | 31 | 29 | 31 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 1)
|
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string... | replace | 45 | 46 | 45 | 46 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
templ... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
templ... | replace | 79 | 80 | 79 | 84 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define moju (long long int)(1e9 + 7)
using namespace std;
int main() {
int n, m;
int i;
long long int c, ans = 1;
cin >> n >> m;
vector<long long int> a(m), b(n);
for (i = 0; i < m; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (i <= 1)
b[i] = i + (lon... | #include <iostream>
#include <vector>
#define moju (long long int)(1e9 + 7)
using namespace std;
int main() {
int n, m;
int i;
long long int c, ans = 1;
cin >> n >> m;
if (m == 0) {
vector<long long int> b(n);
for (i = 0; i < n; i++) {
if (i <= 1)
b[i] = i + (long long int)1;
else
... | insert | 9 | 9 | 9 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
std::vector<bool> stiustir;
std::vector<long long> recordstepstir;
int N = 0;
void search(int now) {
long long step = 0;
if (stiustir[now] == false) {
recordstepstir[now] = 0;
search(now - 1);
return;
}... | #include <bits/stdc++.h>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
std::vector<bool> stiustir;
std::vector<long long> recordstepstir;
int N = 0;
void search(int now) {
long long step = 0;
if (stiustir[now] == false) {
recordstepstir[now] = 0;
search(now - 1);
return;
}... | insert | 49 | 49 | 49 | 53 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<ll> dp(n + 5, 0);
dp[0] = 1;
dp[1] = (a[0] == 1) ? 0 : 1;
for (int i = 2; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<ll> dp(n + 5, 0);
dp[0] = 1;
dp[1] = 1;
if (m != 0 and a[0] == 1) {
dp... | replace | 15 | 16 | 15 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
#define INF ... | replace | 45 | 46 | 45 | 46 | -6 | munmap_chunk(): invalid pointer
|
p03013 | C++ | Runtime Error | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, be... | replace | 217 | 218 | 217 | 222 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
int kMod = 1e9 + 7;
void print_all(const std::vector<int> &v) {
for (int x : v) {
std::cout << x << '\n';
}
}
int main() {
int n, m;
std::cin >> n >> m;
std::vector<bool> is_broken(n, false);
for (int i = 0; i < m; i++) {
int broken_index;
std::cin >> bro... | #include <iostream>
#include <vector>
int kMod = 1e9 + 7;
void print_all(const std::vector<int> &v) {
for (int x : v) {
std::cout << x << '\n';
}
}
int main() {
int n, m;
std::cin >> n >> m;
std::vector<bool> is_broken(n, false);
for (int i = 0; i < m; i++) {
int broken_index;
std::cin >> bro... | insert | 26 | 26 | 26 | 30 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
#define pb push_back
template... | insert | 54 | 54 | 54 | 55 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), ... | replace | 28 | 30 | 28 | 30 | -6 | munmap_chunk(): invalid pointer
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, x, bk = 0;
cin >> N >> M;
vector<int> a(M), sum(N + 1);
sum[0] = 1;
sum[1] = 1;
for (int i = 0; i < M; i++) {
cin >> x;
a[i] = x;
}
if (M != 0) {
if (a[0] == 1) {
sum[1] = 0;
bk++;
}
}
for (int i = 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, x, bk = 0;
cin >> N >> M;
vector<int> a(M), sum(N + 1);
sum[0] = 1;
sum[1] = 1;
for (int i = 0; i < M; i++) {
cin >> x;
a[i] = x;
}
if (M != 0) {
if (a[0] == 1) {
sum[1] = 0;
bk++;
}
}
for (int i = 2... | replace | 23 | 28 | 23 | 33 | 0 | |
p03013 | C++ | Runtime Error | // int a = stoi(c); 文字列をintへ
// 小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
// 途中の出力をそのまま残さない
// 数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
// 絶対値 abs()
// 入力... | // int a = stoi(c); 文字列をintへ
// 小文字から大文字
// transform(a.begin(), a.end(), a.begin(), ::toupper);
// 途中の出力をそのまま残さない
// 数値計算 個数以外はdouble
// map<キー,値> p は辞書。p[キー] = 値
// map 全探索
// auto begin = p.begin(), end = p.end();
// for (auto it = begin; it != end; it++) {}
// mapのキー：it->first mapのバリュー：it->second
// 絶対値 abs()
// 入力... | insert | 162 | 162 | 162 | 167 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n, m;
... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, s, n) for (long long i = (s); i < (long long)(n); i++)
typedef long long ll;
const ll inf = 1e18 + 7;
const ll mod = 1e9 + 7;
int main() {
int n, m;
... | replace | 28 | 29 | 28 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i... | replace | 64 | 65 | 64 | 65 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(m), dp(n + 10, 0);
for (int i = 0; i < m; i++)
cin >> a[i]; // hole
dp[0] = 1;
int j = 0; // next hole
if (a[0] != 1) {
dp[1] = 1;
} else {
dp[1]... | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<ll> dp(n + 1);
vector<int> a(n + 1);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
dp[0] = 1;
int j = 0; // next hole
if (a[0] != 1) {
dp[1] = 1;
} else... | replace | 8 | 11 | 8 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
const long double PI = (acos(-1));
const long double EPS = 0.0000000001;
const ll dx[] = {1, 0, -1, 0};
const ll dy[] = {0, 1, 0, -1};
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0,... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | replace | 88 | 89 | 88 | 89 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
int n;
bool M[11111] = {};
ll dp[11111] = {};
ll cnt = 0;
int main() {
int m;
cin >> n >> m;
int a;
M[n + 1] = 1;
rep(i, m) {
cin >> a;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
typedef long long ll;
int n;
bool M[101010] = {};
ll dp[101010] = {};
ll cnt = 0;
int main() {
int m;
cin >> n >> m;
int a;
M[n + 1] = 1;
rep(i, m) {
cin >> a;
... | replace | 7 | 9 | 7 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> oks(n + 1, true);
int a;
cin >> a;
oks[a] = false;
vector<int> dp(n + 1);
dp[0] = 1;
for (int now = 0; now < n; now++) {
for (int next = now + 1; next ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
vector<int> oks(n + 1, true);
for (int i = 0; i < k; i++) {
int a;
cin >> a;
oks[a] = false;
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int now = 0; now < n; n... | replace | 9 | 12 | 9 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, j = 0;
cin >> n >> m;
vector<long> a(m);
vector<long> dp(n + 1);
for (int i = 0; i < m; i++)
cin >> a.at(i);
dp.at(0) = 1;
for (int i = 1; i <= n; i++) {
if (a.at(j) == i) {
j++;
if (j == m)
j--;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, j = 0;
cin >> n >> m;
vector<long> a(101000);
vector<long> dp(n + 1);
for (int i = 0; i < m; i++)
cin >> a.at(i);
dp.at(0) = 1;
for (int i = 1; i <= n; i++) {
if (a.at(j) == i) {
j++;
if (j == m)
j--;
} ... | replace | 6 | 7 | 6 | 7 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 1000000007
#define endl "\n"
void fastio() {
ios_base::syn... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define vec vector<ll>
#define ms multiset<ll>
#define f(i, x, n) for (int i = x; i < n; i++)
#define int long long
#define mod 1000000007
#define endl "\n"
void fastio() {
ios_base::syn... | replace | 27 | 28 | 27 | 28 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n, m, b[10001], s[10001], now = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < m; i++) {
if (b[i] + 1 == b[i + 1]) {
cout << "0" << endl;
return 0;
}
}
s[0] = 1;
if (b[now]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n, m, b[200000], s[200002], now = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> b[i];
}
for (int i = 0; i < m; i++) {
if (b[i] + 1 == b[i + 1]) {
cout << "0" << endl;
return 0;
}
}
s[0] = 1;
if (b[no... | replace | 3 | 4 | 3 | 4 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statisti... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statisti... | replace | 32 | 36 | 32 | 42 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (ll i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T... | replace | 41 | 42 | 41 | 42 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> forbidden(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
forbidden[a] = true;
}
long long mod = 1e9 + 7;
vector<long long> count(n, 0);
count[0] = 1;
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<bool> forbidden(n + 1, false);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
forbidden[a] = true;
}
long long mod = 1e9 + 7;
vector<long long> count(n + 1, 0);
count[0] = 1;
for (int i = 0; i < n; i... | replace | 12 | 13 | 12 | 13 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI ... | #include <algorithm>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
#define ll long long
constexpr long long int INFLL = 1001001001001001LL;
constexpr int INFI ... | replace | 25 | 26 | 25 | 26 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repf(i, n) for (int i = 0; i <= n; i++)
const ll mod = 1000000000 + 7;
typedef pair<ll, ll> P;
ll N, M;
priority_queue<ll, vector<ll>, greater<ll>> A;
ll dp[100010];
int main() {
cin >> N >> ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repf(i, n) for (int i = 0; i <= n; i++)
const ll mod = 1000000000 + 7;
typedef pair<ll, ll> P;
ll N, M;
priority_queue<ll, vector<ll>, greater<ll>> A;
ll dp[100010];
int main() {
cin >> N >> ... | replace | 23 | 24 | 23 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<bool> arr(n + 1, true);
int x;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<bool> arr(n + 1, true);
int x;
for (int i = 0; i < m; i++) {
cin >> x;
arr[x] = false;
}
// if (arr[0] == false)
// {
// co... | delete | 5 | 9 | 5 | 5 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout... | replace | 273 | 274 | 273 | 274 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 2);
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i <= 0; i--) {
if (broken... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> dp(n + 2);
vector<int> broken(n + 1);
for (int i = 0; i < m; i++) {
int a;
cin >> a;
broken[a] = 1;
}
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >= 0; i--) {
if (broken... | replace | 18 | 20 | 18 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <unordered_set>
using namespace std;
const long long mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
unordered_set<int> a_i;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
a_i.insert(a);
}
long long s[10001] = {};
s[0] = 1;
for (int i = 1; i <= n; ... | #include <iostream>
#include <unordered_set>
using namespace std;
const long long mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
unordered_set<int> a_i;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
a_i.insert(a);
}
long long s[100001] = {};
s[0] = 1;
for (int i = 1; i <= n;... | replace | 19 | 20 | 19 | 20 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
int64_t mod64 = 1e9 + 7;
template <typename T> T gcd... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int inf = (1 << 30);
int mod = 1e9 + 7;
int64_t inf64 = (1LL << 60);
int64_t mod64 = 1e9 + 7;
template <typename T> T gcd... | replace | 71 | 73 | 71 | 73 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m, false);
for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.1415926535897932384626433
#define mod 1000000007
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 1, false);
for... | replace | 14 | 15 | 14 | 15 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | #include <bits/stdc++.h>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class S, class T> using P = pair<S, T>;
template <class S, class T, class U> using TP = tuple<S, T, U>;
using ll = long long;
using ull = unsi... | replace | 1,263 | 1,264 | 1,263 | 1,264 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7, MAX = 1e5;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < m; i++) {
dp[a[i]] = -1;
}
if (a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7, MAX = 1e5;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 0; i < m; i++) {
dp[a[i]] = -1;
}
if (!... | replace | 17 | 18 | 17 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 2);
dp.assign(N + 1, 0);
vector<ll> m(M);
for (int i = 0; i < M; ++i)
cin >> m[i];
int idx = 0;
dp[0] = 1;
dp[1] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
// cout << setprecision(20) <<
int main() {
ll N, M;
cin >> N >> M;
vector<ll> dp(N + 2);
dp.assign(N + 1, 0);
vector<ll> m(M + 1);
for (int i = 0; i < M; ++i)
cin >> m[i];
int idx = 0;
dp[0] = 1;
dp[... | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(),... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repf(i, m, n) for (int(i) = m; (i) < n; (i)++)
#define all(v) (v).begin(),... | replace | 73 | 74 | 73 | 74 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll IN... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll IN... | replace | 27 | 28 | 27 | 28 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int mod = 1000000007;
bool square(ll a) {
ll n = (ll)sqrt(a);
return a == n * n;
}
int digitsum(ll N, int a); // a進数におけるNの各桁の和、計算量はloga(N)
ll mpow(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int mod = 1000000007;
bool square(ll a) {
ll n = (ll)sqrt(a);
return a == n * n;
}
int digitsum(ll N, int a); // a進数におけるNの各桁の和、計算量はloga(N)
ll mpow(... | replace | 22 | 23 | 22 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define INF 100000000
using namespace std;
int main() {
int64_t N, M, step2down = 1, step1down = 1, brokepoint = 0;
cin >> N >> M;
vector<int64_t> A(M);
vector<int64_t> mem(100001, 0);
for (int i = 0; i < M; i++) {
cin >> A[i];
if (i > 0) {
if (A... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define INF 100000000
using namespace std;
int main() {
int64_t N, M, step2down = 1, step1down = 1, brokepoint = 0;
cin >> N >> M;
vector<int64_t> A(100000);
vector<int64_t> mem(100001, 0);
for (int i = 0; i < M; i++) {
cin >> A[i];
if (i > 0) {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
tem... | #include <bits/stdc++.h>
using namespace std;
#define LLINF (1LL << 60)
typedef long long ll;
#define mod 1000000007
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
tem... | insert | 64 | 64 | 64 | 65 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) ... | replace | 42 | 43 | 42 | 43 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll memo[100001];
ll fract(ll num) {
if (num == 1 || num == 0)
return 1;
if (memo[num] == -1)
memo[num] = (num * fract(num - 1)) % 1000000007;
return memo[num];
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll memo[100001];
ll fract(ll num) {
if (num == 1 || num == 0)
return 1;
if (memo[num] == -1)
memo[num] = (num * fract(num - 1)) % 1000000007;
return memo[num];
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll ... | replace | 59 | 61 | 59 | 65 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | replace | 98 | 99 | 98 | 99 | TLE | |
p03013 | C++ | Time Limit Exceeded | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | #define _USE_MAT_DEFINES
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
... | replace | 29 | 30 | 29 | 30 | TLE | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define ... | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define ... | replace | 28 | 29 | 28 | 29 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int twx = 1000000007;
long long n, m, a, dp[10010];
bool pan[10010];
int main() {
scanf("%lld %lld", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%lld", &a);
pan[a] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++)
if (!pan[i])
if (i == 1)
... | #include <bits/stdc++.h>
using namespace std;
const int twx = 1000000007;
long long n, m, a, dp[100010];
bool pan[100010];
int main() {
scanf("%lld %lld", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%lld", &a);
pan[a] = 1;
}
dp[0] = 1;
for (int i = 1; i <= n; i++)
if (!pan[i])
if (i == 1)... | replace | 3 | 5 | 3 | 5 | 0 | |
p03013 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n >> m;
vector<ll> aa(m);
for (i = 0; i < m; i++)
cin >> aa[i];
vecto... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
int main() {
ll a, b, c, h, i, j, k, l, m, n, x, y;
ll ans = 0;
string s;
cin >> n >> m;
vector<ll> aa(m);
for (i = 0; i < m; i++)
cin >> aa[i];
vecto... | replace | 15 | 16 | 15 | 16 | 0 | |
p03013 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define RFOR(i, a, b) for (int i = (int)... | replace | 229 | 230 | 229 | 230 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) f... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, N) f... | replace | 32 | 33 | 32 | 33 | 0 | |
p03013 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 121 | 122 | 121 | 122 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int dp[100000] = {};
long long cnt(int n) {
if (n == 0 || n == 1)
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int dp[100000] = {};
long long cnt(int n) {
if (n == 0 || n == 1)
... | replace | 22 | 23 | 22 | 23 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = k; i < n; i++)
#define REPEACH(itr, k) for (auto itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL <<... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, k, n) for (int i = k; i < n; i++)
#define REPEACH(itr, k) for (auto itr : k)
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL <<... | replace | 23 | 24 | 23 | 24 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ... | replace | 80 | 81 | 80 | 81 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, m, tmp, a[10009], dp[10009];
cin >> n >> m;
for (int i = 0; i <= n; i++) {
a[i] = 0;
dp[i] = 0;
}
for (int i = 0; i < m; i++) {
cin >> tmp... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
using namespace std;
int main() {
int n, m, tmp, a[100009], dp[100009];
cin >> n >> m;
for (int i = 0; i <= n; i++) {
a[i] = 0;
dp[i] = 0;
}
for (int i = 0; i < m; i++) {
cin >> t... | replace | 10 | 11 | 10 | 11 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
whi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++) // 0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key) {
ll right = n, left = -1;
ll md = (right + left) / 2;
whi... | replace | 65 | 66 | 65 | 66 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;... | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;... | insert | 104 | 104 | 104 | 109 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | replace | 31 | 37 | 31 | 32 | -11 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | replace | 73 | 74 | 73 | 74 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int p = 1000000007;
ll f(ll x) {
if (x == 0) {
return 1;
}
if (x == 1) {
return 1;
}
ll a = 1, b = 1, c = 0;
rep(i, x - 1) {
c = (a + b) % p;
a = b;
b = c;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int p = 1000000007;
ll f(ll x) {
if (x == 0) {
return 1;
}
if (x == 1) {
return 1;
}
ll a = 1, b = 1, c = 0;
rep(i, x - 1) {
c = (a + b) % p;
a = b;
b = c;
}
... | replace | 34 | 35 | 34 | 37 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int MOD = 1000000007;
// void warshall_floyd(int n){
// for(int k=0;k<n;... | replace | 41 | 42 | 41 | 42 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
using ll = long long;
/*
string -> int : stoi(S);
int -> string : to_string(N);
Sのn文字以降をm文字取り出す : S.substr(n,m)
int: -2,147,483,648 ～ 2,147,483,647 (2×10^9)
l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
using ll = long long;
/*
string -> int : stoi(S);
int -> string : to_string(N);
Sのn文字以降をm文字取り出す : S.substr(n,m)
int: -2,147,483,648 ～ 2,147,483,647 (2×10^9)
l... | replace | 30 | 31 | 30 | 31 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(M);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> broken(N + 1);
rep(i, M) {
int w;
cin >> w;
broken[w] = 1;
}
vector<int> a(N + 2);
a[N] = 1;
for (int i = N - 1; i >= 0; i--)... | replace | 8 | 9 | 8 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> oks(M, true);
for (int i = 0; i < M; i++) {
... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <iomanip> //stw(数字)で空白による桁揃え
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<bool> oks(N + 1, true);
for (int i = 0; i < M; i++) ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
// dp[i] : i段目にたどりつくまでの移動法の総数
vector<int> dp(n + 1);
dp[0] = 1;
int j = 0;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
// dp[i] : i段目にたどりつくまでの移動法の総数
vector<int> dp(n + 1);
dp[0] = 1;
int j = 0;
rep(... | replace | 19 | 22 | 19 | 24 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MOD = 1e9 + 7;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
set<int> st;
rep(i, m) st.insert(a[i]);
vector<int> dp(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MOD = 1e9 + 7;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> a(m);
rep(i, m) cin >> a[i];
set<int> st;
rep(i, m) st.insert(a[i]);
vector<int> dp(... | insert | 20 | 20 | 20 | 22 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
int64_t mod = 1e9 + 7;
cin >> N >> M;
vector<int64_t> a(M);
for (int64_t i = 0; i < M; i++) {
cin >> a.at(i);
}
vector<int64_t> ans(N + 1, 0);
ans.at(0) = 1;
vector<bool> flag(N + 1, true);
for (int64_t i = 0; i < M; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
int64_t mod = 1e9 + 7;
cin >> N >> M;
vector<int64_t> a(M);
for (int64_t i = 0; i < M; i++) {
cin >> a.at(i);
}
vector<int64_t> ans(N + 1, 0);
ans.at(0) = 1;
vector<bool> flag(N + 1, true);
for (int64_t i = 0; i < M; i++) ... | replace | 17 | 18 | 17 | 22 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define MAX 510000
#define rep(i, n) for (ll i = 0; i... | replace | 46 | 47 | 46 | 47 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
... | replace | 25 | 26 | 25 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll sum = 0;
int main() {
ll N, M;
ll waru = 1000000007;
cin >> ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
ll sum = 0;
int main() {
ll N, M;
ll waru = 1000000007;
cin >> ... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long long n, m;
cin >> n >> m;
vector<long lo... | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
long long n, m;
cin >> n >> m;
vector<long lo... | insert | 28 | 28 | 28 | 32 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | replace | 55 | 56 | 55 | 56 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
ll inf = LLONG_MAX;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
int main() {
ll n, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
ll inf = LLONG_MAX;
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
int main() {
ll n, ... | replace | 20 | 21 | 20 | 21 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, m, temp;
cin >> n >> m;
vector<bool> broken(m);
vector<ll> d... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
typedef long long ll;
using namespace std;
int main() {
int n, m, temp;
cin >> n >> m;
vector<bool> broken(n + 1);
vector<l... | replace | 16 | 17 | 16 | 17 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int mod = 1e9 + 7;
ll dp[100005];
ll f(int i) {
if (i < 0)
return 0;
if (dp[i] == -1)
return 0;
if (dp[i] != 0)
return dp[i];
return dp[i] = (f(i - 1) + f(i - 2)) % mod;
}
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int mod = 1e9 + 7;
ll dp[100005];
ll f(int i) {
if (i < 0)
return 0;
if (dp[i] == -1)
return 0;
if (dp[i] != 0)
return dp[i];
return dp[i] = (f(i - 1) + f(i - 2)) % mod;
}
i... | replace | 30 | 32 | 30 | 40 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
ll mod = 1000000007;
int main(void) {
cin >> n >> m;
ll dp[10005] = {};
rep(i, m) {
int t... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
ll mod = 1000000007;
int main(void) {
cin >> n >> m;
ll dp[100005] = {};
rep(i, m) {
int ... | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include ... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include ... | replace | 62 | 63 | 62 | 63 | 0 | |
p03013 | C++ | Runtime Error |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
#ifdef LOCAL
#include <... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
using namespace std;
#ifdef LOCAL
#include <... | replace | 64 | 68 | 64 | 69 | 0 | |
p03013 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++) // repマクロ
#define leng(n) (int)(log10(n) + 1) // 桁数leng
#define INF 9223372036854775807 // 巨大数INF
using namespace std;
int f(int n) {
if (n == 0)
return 1;
if (n == 1)
... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++) // repマクロ
#define leng(n) (int)(log10(n) + 1) // 桁数leng
#define INF 9223372036854775807 // 巨大数INF
using namespace std;
int f(int n) {
vector<int> vec(n + 3);
vec[0] = 1;
ve... | replace | 8 | 13 | 8 | 13 | TLE | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n + 10);
vector<bool> s(m, true);
vector<long long> dp(n + 10, 0);
for (int i = 0; i < m; i++) {
cin >> a[i];
s[a[i]] = false;
}
dp[0] = 1;
if ... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<bool> s(n + 10, true);
vector<long long> dp(n + 10, 0);
for (int i = 0; i < m; i++) {
cin >> a[i];
s[a[i]] = false;
}
dp[0] = 1;
if ... | replace | 7 | 9 | 7 | 9 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<int> aa(M);
for (int k = 0; k < M; k++) {
cin >> aa[k];
}
vector<int> ans(N + 1);
ans[0] = 1;
for (int k = 1, l = 0; k <= N; k++) {
if (aa[l] == k) {
l++;
continue;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int mod = 1e9 + 7;
int N, M;
cin >> N >> M;
vector<int> aa(M);
for (int k = 0; k < M; k++) {
cin >> aa[k];
}
vector<int> ans(N + 1);
ans[0] = 1;
for (int k = 1, l = 0; k <= N; k++) {
if (l < M && aa[l] == k) {
l++;
cont... | replace | 17 | 18 | 17 | 18 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void add(long long &n, long long m) {
n += m;
if (n >= mod) {
n -= mod;
}
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> dp(n + 1);
int br[100009] = {0};
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
br[x]... | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void add(long long &n, long long m) {
n += m;
if (n >= mod) {
n -= mod;
}
}
int main() {
int n, m;
cin >> n >> m;
vector<long long> dp(n + 1);
int br[100009] = {0};
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
br[x]... | replace | 24 | 25 | 24 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
vector<ll> B(N + 1);
rep(i, 0, M) cin >> A[i];
B[0] = 1;
ll a = 0;
... | #include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for (long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
vector<ll> B(N + 1);
rep(i, 0, M) cin >> A[i];
B[0] = 1;
ll a = 0;
... | insert | 17 | 17 | 17 | 19 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define push emplace_back
#defin... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define push emplace_back
#defin... | replace | 68 | 69 | 68 | 69 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long num = 1e9 + 7;
cin >> n >> m;
vector<long long> fib(n);
vector<bool> is_not_breaked(n, true);
vector<int> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i];
is_not_breaked[a[i]] = fal... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long num = 1e9 + 7;
cin >> n >> m;
vector<long long> fib(n + 1);
vector<bool> is_not_breaked(n, true);
vector<int> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i];
is_not_breaked[a[i]] =... | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) < (b))
#de... | replace | 83 | 84 | 83 | 84 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[100005] = {0};
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
queue<int> out;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
out.push(a);
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll dp[100005] = {0};
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
queue<int> out;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
out.push(a);
... | replace | 20 | 24 | 20 | 26 | 0 | |
p03013 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define ll long long int
using namespace std;
int main() {
int n, m, denger_id;
vector<int> a;
vector<ll> step;
cin >> n >> m;
a.resize(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
step.resize(n + 100);
for (int i = 0; i < n + 1; i++) {
step[i] = 0;
... | #include <iostream>
#include <vector>
#define ll long long int
using namespace std;
int main() {
int n, m, denger_id;
vector<int> a;
vector<ll> step;
cin >> n >> m;
a.resize(m + 100);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
step.resize(n + 100);
for (int i = 0; i < n + 1; i++) {
step[i]... | replace | 11 | 12 | 11 | 12 | 0 | |
p03013 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >=... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n + 1);
rep(i, m) {
int a;
cin >> a;
broken[a] = 1;
}
vector<int> dp(n + 2);
const int mod = 1000000007;
dp[n] = 1;
for (int i = n - 1; i >=... | replace | 16 | 17 | 16 | 17 | -11 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#incl... | replace | 61 | 76 | 61 | 78 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll n, m, a, dp[100010];
string s[2010];
bool ju[2010];
ll pow(ll x, ll y) {
if (y == 0)
retu... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
ll n, m, a, dp[100010];
string s[2010];
bool ju[100010];
ll pow(ll x, ll y) {
if (y == 0)
re... | replace | 13 | 14 | 13 | 14 | 0 | |
p03013 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
... | #include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
... | insert | 45 | 45 | 45 | 48 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.