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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03081 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, q;
string s;
cin >> n >> q >> s;
vector<char> ts(n), ds(n);
for (int i = 0; i < q; i++) {
cin >> ts[i] >> ds[i];
}
int l = -1, r = n;
while (l + 1 < r) {
int m = (l + r) / 2, p = m;
char t = s[p];
for (int i = 0; i < q; i++) {
if (ts[i] == t) {
if (ds[i] == 'L') {
p--;
} else
p++;
}
if (p < 0 || p >= n)
break;
t = s[p];
}
if (p < 0)
l = m;
else
r = m;
}
int ans = n - l - 1;
l = -1, r = n;
while (l + 1 < r) {
int m = (l + r) / 2, p = m;
char t = s[p];
for (int i = 0; i < q; i++) {
if (ts[i] == t) {
if (ds[i] == 'L') {
p--;
} else
p++;
}
if (p < 0 || p >= n)
break;
t = s[p];
}
if (p >= n)
r = m;
else
l = m;
}
ans -= n - r;
cout << ans << endl;
}
int main(void) {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, q;
string s;
cin >> n >> q >> s;
vector<char> ts(q), ds(q);
for (int i = 0; i < q; i++) {
cin >> ts[i] >> ds[i];
}
int l = -1, r = n;
while (l + 1 < r) {
int m = (l + r) / 2, p = m;
char t = s[p];
for (int i = 0; i < q; i++) {
if (ts[i] == t) {
if (ds[i] == 'L') {
p--;
} else
p++;
}
if (p < 0 || p >= n)
break;
t = s[p];
}
if (p < 0)
l = m;
else
r = m;
}
int ans = n - l - 1;
l = -1, r = n;
while (l + 1 < r) {
int m = (l + r) / 2, p = m;
char t = s[p];
for (int i = 0; i < q; i++) {
if (ts[i] == t) {
if (ds[i] == 'L') {
p--;
} else
p++;
}
if (p < 0 || p >= n)
break;
t = s[p];
}
if (p >= n)
r = m;
else
l = m;
}
ans -= n - r;
cout << ans << endl;
}
int main(void) {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03081 | C++ | Runtime Error | #include <cstdio>
int const NMAX = 201;
char s[NMAX], t[NMAX], d[NMAX];
int n, q;
int lastposition(int i) {
int c = i;
for (int qi = 0; qi < q; qi++) {
if (s[c] == t[qi]) {
if (d[qi] == 'L') {
c--;
if (c < 0)
return -1;
} else {
c++;
if (c >= n)
return n;
}
}
}
return c;
}
int main() {
scanf("%d%d%s", &n, &q, s);
for (int i = 0; i < q; i++) {
char tmp0[2], tmp1[2];
scanf("%s%s", tmp0, tmp1);
t[i] = tmp0[0];
d[i] = tmp1[0];
}
// for(int i=0;i<n;i++)printf("%d->%d\n",i,lastposition(i));
// 端にあるゴーレムが反対側の端に落ちるならすべて消滅する
if (lastposition(n - 1) == -1 || lastposition(0) == n) {
printf("0\n");
return 0;
}
// l,l+1,...,rにいたゴーレムが生き残るとする
// l-1は-1に消える
int lmin = 0, lmax = n - 1, l;
while (lmin + 1 < lmax) {
int lmid = (lmin + lmax) / 2;
if (lastposition(lmid) >= 0)
lmax = lmid;
else
lmin = lmid;
}
if (lastposition(lmin) == -1)
l = lmax;
else
l = lmin;
// r+1はnに消える
int rmin = 0, rmax = n - 1, r;
while (rmin + 1 < rmax) {
int rmid = (rmin + rmax) / 2;
if (lastposition(rmid) < n)
rmin = rmid;
else
rmax = rmid;
}
if (lastposition(rmax) == n)
r = rmin;
else
r = rmax;
printf("%d\n", r - l + 1);
return 0;
} | #include <cstdio>
int const NMAX = 200001;
char s[NMAX], t[NMAX], d[NMAX];
int n, q;
int lastposition(int i) {
int c = i;
for (int qi = 0; qi < q; qi++) {
if (s[c] == t[qi]) {
if (d[qi] == 'L') {
c--;
if (c < 0)
return -1;
} else {
c++;
if (c >= n)
return n;
}
}
}
return c;
}
int main() {
scanf("%d%d%s", &n, &q, s);
for (int i = 0; i < q; i++) {
char tmp0[2], tmp1[2];
scanf("%s%s", tmp0, tmp1);
t[i] = tmp0[0];
d[i] = tmp1[0];
}
// for(int i=0;i<n;i++)printf("%d->%d\n",i,lastposition(i));
// 端にあるゴーレムが反対側の端に落ちるならすべて消滅する
if (lastposition(n - 1) == -1 || lastposition(0) == n) {
printf("0\n");
return 0;
}
// l,l+1,...,rにいたゴーレムが生き残るとする
// l-1は-1に消える
int lmin = 0, lmax = n - 1, l;
while (lmin + 1 < lmax) {
int lmid = (lmin + lmax) / 2;
if (lastposition(lmid) >= 0)
lmax = lmid;
else
lmin = lmid;
}
if (lastposition(lmin) == -1)
l = lmax;
else
l = lmin;
// r+1はnに消える
int rmin = 0, rmax = n - 1, r;
while (rmin + 1 < rmax) {
int rmid = (rmin + rmax) / 2;
if (lastposition(rmid) < n)
rmin = rmid;
else
rmax = rmid;
}
if (lastposition(rmax) == n)
r = rmin;
else
r = rmax;
printf("%d\n", r - l + 1);
return 0;
} | replace | 1 | 2 | 1 | 2 | 0 | |
p03081 | 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++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
ll n, q;
string s;
vector<char> t(100010), d(100010);
ll check(ll x) {
REP(i, q) {
if (t[i] != s[x])
continue;
if (d[i] == 'L')
--x;
else
++x;
if (x == -1 || x == n)
return x;
}
return 0;
}
int main() {
cin >> n >> q;
cin >> s;
REP(i, q) { cin >> t[i] >> d[i]; }
t.resize(q);
d.resize(q);
ll sum = 0;
ll lb = -1, ub = n;
while (ub - lb > 1) {
ll mid = (ub + lb) / 2;
if (check(mid) == -1)
lb = mid;
else
ub = mid;
}
sum += ub;
lb = -1, ub = n;
while (ub - lb > 1) {
ll mid = (ub + lb) / 2;
if (check(mid) == n)
ub = mid;
else
lb = mid;
}
sum += n - ub;
cout << n - sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
ll n, q;
string s;
vector<char> t(200010), d(200010);
ll check(ll x) {
REP(i, q) {
if (t[i] != s[x])
continue;
if (d[i] == 'L')
--x;
else
++x;
if (x == -1 || x == n)
return x;
}
return 0;
}
int main() {
cin >> n >> q;
cin >> s;
REP(i, q) { cin >> t[i] >> d[i]; }
t.resize(q);
d.resize(q);
ll sum = 0;
ll lb = -1, ub = n;
while (ub - lb > 1) {
ll mid = (ub + lb) / 2;
if (check(mid) == -1)
lb = mid;
else
ub = mid;
}
sum += ub;
lb = -1, ub = n;
while (ub - lb > 1) {
ll mid = (ub + lb) / 2;
if (check(mid) == n)
ub = mid;
else
lb = mid;
}
sum += n - ub;
cout << n - sum << endl;
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define Ans(f, y, n) \
if (f) \
cout << y << endl; \
else \
cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i, v.size()) { cout << v[i] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i, m.size()) { \
REP(j, m[i].size()) { cout << m[i][j] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
template <typename T> void readv(vector<T> &a) { REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a) {
REP(i, a.size()) {
cin >> a[i];
a[i]--;
}
}
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
int mod = 1000000007;
// int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
vec D(N);
REP(i, Q) {
cin >> t[i] >> d[i];
if (d[i] == 'L')
D[i] = -1;
else
D[i] = 1;
}
int i1 = -1, i2 = N;
while (i2 - i1 > 1) {
int i0 = (i1 + i2) / 2;
int now = i0;
bool fall = false;
REP(i, Q) if (t[i] == s[now]) {
now += D[i];
if (now >= N)
break;
if (now < 0) {
fall = true;
break;
}
}
if (fall)
i1 = i0;
else
i2 = i0;
}
int j1 = -1, j2 = N;
while (j2 - j1 > 1) {
int j0 = (j1 + j2) / 2;
int now = j0;
bool fall = false;
REP(i, Q) if (t[i] == s[now]) {
now += D[i];
if (now < 0)
break;
if (now >= N) {
fall = true;
break;
}
}
if (fall)
j2 = j0;
else
j1 = j0;
}
// debug(i1);
// debug(j1);
int ans = j1 - i1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define Ans(f, y, n) \
if (f) \
cout << y << endl; \
else \
cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
cout << #v << "=" << endl; \
REP(i, v.size()) { cout << v[i] << ","; } \
cout << endl;
#define mdebug(m) \
cout << #m << "=" << endl; \
REP(i, m.size()) { \
REP(j, m[i].size()) { cout << m[i][j] << ","; } \
cout << endl; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
template <typename T> void readv(vector<T> &a) { REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a) {
REP(i, a.size()) {
cin >> a[i];
a[i]--;
}
}
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
int mod = 1000000007;
// int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main() {
int N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<char> t(Q), d(Q);
vec D(Q);
REP(i, Q) {
cin >> t[i] >> d[i];
if (d[i] == 'L')
D[i] = -1;
else
D[i] = 1;
}
int i1 = -1, i2 = N;
while (i2 - i1 > 1) {
int i0 = (i1 + i2) / 2;
int now = i0;
bool fall = false;
REP(i, Q) if (t[i] == s[now]) {
now += D[i];
if (now >= N)
break;
if (now < 0) {
fall = true;
break;
}
}
if (fall)
i1 = i0;
else
i2 = i0;
}
int j1 = -1, j2 = N;
while (j2 - j1 > 1) {
int j0 = (j1 + j2) / 2;
int now = j0;
bool fall = false;
REP(i, Q) if (t[i] == s[now]) {
now += D[i];
if (now < 0)
break;
if (now >= N) {
fall = true;
break;
}
}
if (fall)
j2 = j0;
else
j1 = j0;
}
// debug(i1);
// debug(j1);
int ans = j1 - i1;
cout << ans << endl;
return 0;
}
| replace | 78 | 79 | 78 | 79 | 0 | |
p03081 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, s, t) for (register int i = s; i <= t; ++i)
#define _rep(i, s, t) for (register int i = s; i >= t; --i)
#define Rep(i, s, t) for (register int i = s; i < t; ++i)
#define go(x) for (register int e = las[x]; e; e = nxt[e])
#define re register
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define is insert
#define es erase
#define pii pair<int, int>
#define ms(f, x) memset(f, x, sizeof f)
#define mc(f, x) memcpy(f, x, sizeof f)
#define open(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
#define gi(x) read(x)
#define gii(x, y) read(x), read(y)
#define giii(x, y, z) read(x), read(y), read(z)
namespace IO {
#define gc getchar()
#define pc(x) putchar(x)
template <typename T> inline void read(T &x) {
x = 0;
int f = 1;
char ch = gc;
while (ch > '9' || ch < '0') {
if (ch == '-')
f = -1;
ch = gc;
}
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = gc;
x *= f;
return;
}
template <typename T> inline void write(T x = 0) {
T wr[51];
wr[0] = 0;
if (x < 0)
pc('-'), x = -x;
if (!x)
pc(48);
while (x)
wr[++wr[0]] = x % 10, x /= 10;
while (wr[0])
pc(48 + wr[wr[0]--]);
return;
}
} // namespace IO
using IO::read;
using IO::write;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
const int N = 1e5 + 11;
int n, m;
char c[3];
char s[N], id[N], op[N];
int mx[27], mn[27], p[27], hv[N];
inline bool check1(int x) {
rep(i, 1, m) {
if (id[i] == s[x]) {
if (op[i] == 'L')
--x;
else
++x;
}
if (x < 1)
return 1;
}
return 0;
}
inline bool check2(int x) {
rep(i, 1, m) {
if (id[i] == s[x]) {
if (op[i] == 'L')
--x;
else
++x;
}
if (x > n)
return 1;
}
return 0;
}
int main() {
scanf("%d%d", &n, &m);
scanf("%s", s + 1);
rep(i, 1, m) {
scanf("%s%s", c, c + 1);
id[i] = c[0], op[i] = c[1];
}
if (check1(n) || check2(1)) {
puts("0");
return 0;
}
int l = 0;
_rep(i, log2(n), 0) if (check1(l | (1 << i))) l |= (1 << i);
int r = 0;
_rep(i, log2(n), 0) if (check2(n + 1 - (r | (1 << i)))) r |= (1 << i);
printf("%d\n", n - r - l);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, s, t) for (register int i = s; i <= t; ++i)
#define _rep(i, s, t) for (register int i = s; i >= t; --i)
#define Rep(i, s, t) for (register int i = s; i < t; ++i)
#define go(x) for (register int e = las[x]; e; e = nxt[e])
#define re register
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define is insert
#define es erase
#define pii pair<int, int>
#define ms(f, x) memset(f, x, sizeof f)
#define mc(f, x) memcpy(f, x, sizeof f)
#define open(x) freopen(#x ".in", "r", stdin), freopen(#x ".out", "w", stdout)
#define gi(x) read(x)
#define gii(x, y) read(x), read(y)
#define giii(x, y, z) read(x), read(y), read(z)
namespace IO {
#define gc getchar()
#define pc(x) putchar(x)
template <typename T> inline void read(T &x) {
x = 0;
int f = 1;
char ch = gc;
while (ch > '9' || ch < '0') {
if (ch == '-')
f = -1;
ch = gc;
}
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = gc;
x *= f;
return;
}
template <typename T> inline void write(T x = 0) {
T wr[51];
wr[0] = 0;
if (x < 0)
pc('-'), x = -x;
if (!x)
pc(48);
while (x)
wr[++wr[0]] = x % 10, x /= 10;
while (wr[0])
pc(48 + wr[wr[0]--]);
return;
}
} // namespace IO
using IO::read;
using IO::write;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
const int N = 1e6 + 11;
int n, m;
char c[3];
char s[N], id[N], op[N];
int mx[27], mn[27], p[27], hv[N];
inline bool check1(int x) {
rep(i, 1, m) {
if (id[i] == s[x]) {
if (op[i] == 'L')
--x;
else
++x;
}
if (x < 1)
return 1;
}
return 0;
}
inline bool check2(int x) {
rep(i, 1, m) {
if (id[i] == s[x]) {
if (op[i] == 'L')
--x;
else
++x;
}
if (x > n)
return 1;
}
return 0;
}
int main() {
scanf("%d%d", &n, &m);
scanf("%s", s + 1);
rep(i, 1, m) {
scanf("%s%s", c, c + 1);
id[i] = c[0], op[i] = c[1];
}
if (check1(n) || check2(1)) {
puts("0");
return 0;
}
int l = 0;
_rep(i, log2(n), 0) if (check1(l | (1 << i))) l |= (1 << i);
int r = 0;
_rep(i, log2(n), 0) if (check2(n + 1 - (r | (1 << i)))) r |= (1 << i);
printf("%d\n", n - r - l);
return 0;
} | replace | 75 | 76 | 75 | 76 | 0 | |
p03081 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
char t[N], d[N];
int ts = -1, te = N;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
for (int i = Q - 1; i >= 0; i--) {
if (te - ts <= 1)
break;
if (d[i] == 'L') {
if (ts < N - 1 && S[ts + 1] == t[i])
ts++;
if (te < N && S[te] == t[i])
te++;
} else if (d[i] == 'R') {
if (0 <= ts && S[ts] == t[i])
ts--;
if (0 < te && S[te - 1] == t[i])
te--;
}
}
cout << N - (ts + 1 + N - te) << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N, Q;
cin >> N >> Q;
string S;
cin >> S;
char t[Q], d[Q];
int ts = -1, te = N;
for (int i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
for (int i = Q - 1; i >= 0; i--) {
if (te - ts <= 1)
break;
if (d[i] == 'L') {
if (ts < N - 1 && S[ts + 1] == t[i])
ts++;
if (te < N && S[te] == t[i])
te++;
} else if (d[i] == 'R') {
if (0 <= ts && S[ts] == t[i])
ts--;
if (0 < te && S[te - 1] == t[i])
te--;
}
}
cout << N - (ts + 1 + N - te) << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03081 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N, Q;
string s;
vector<char> t, d;
void input() {
cin >> N >> Q >> s;
t.resize(N);
d.resize(N);
for (ll i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
}
ll goal(ll p) {
for (ll i = 0; i < Q; i++) {
if (s[p] == t[i]) {
if (d[i] == 'L')
p--;
else
p++;
}
if (p < 0 or p >= N)
return p;
}
return p;
}
ll solve() {
vector<ll> spos[0xff];
for (ll i = 0; i < N; i++) {
spos[ll(s[i])].push_back(i);
}
ll dels = 0;
ll l = 0, r = N - 1;
ll c = (l + r) / 2;
while (l <= r) {
if (goal(c) < 0) {
dels += c - l + 1;
l = c + 1;
} else {
r = c - 1;
}
c = (l + r) / 2;
}
l = 0, r = N - 1;
while (l <= r) {
if (goal(c) >= N) {
dels += r - c + 1;
r = c - 1;
} else {
l = c + 1;
}
c = (l + r) / 2;
}
return N - dels;
}
int main() {
input();
cout << solve() << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
ll N, Q;
string s;
vector<char> t, d;
void input() {
cin >> N >> Q >> s;
t.resize(Q);
d.resize(Q);
for (ll i = 0; i < Q; i++) {
cin >> t[i] >> d[i];
}
}
ll goal(ll p) {
for (ll i = 0; i < Q; i++) {
if (s[p] == t[i]) {
if (d[i] == 'L')
p--;
else
p++;
}
if (p < 0 or p >= N)
return p;
}
return p;
}
ll solve() {
vector<ll> spos[0xff];
for (ll i = 0; i < N; i++) {
spos[ll(s[i])].push_back(i);
}
ll dels = 0;
ll l = 0, r = N - 1;
ll c = (l + r) / 2;
while (l <= r) {
if (goal(c) < 0) {
dels += c - l + 1;
l = c + 1;
} else {
r = c - 1;
}
c = (l + r) / 2;
}
l = 0, r = N - 1;
while (l <= r) {
if (goal(c) >= N) {
dels += r - c + 1;
r = c - 1;
} else {
l = c + 1;
}
c = (l + r) / 2;
}
return N - dels;
}
int main() {
input();
cout << solve() << endl;
return 0;
}
| replace | 19 | 21 | 19 | 21 | 0 | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; \
for (int(i) = (a); (i) < (b); ++(i)) \
cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); \
cout << "]\n"; \
} while (0)
#define p_map(map, it) \
do { \
cout << "{"; \
for (auto(it) = map.begin();; ++(it)) { \
if ((it) == map.end()) { \
cout << "}\n"; \
break; \
} else \
cout << "" << (it)->first << "=>" << (it)->second << ", "; \
} \
} while (0)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[n], d[n];
for (int i = 0; i < q; ++i)
cin >> t[i] >> d[i];
int min = -1, max = n;
while (max - min > 1) {
int mid = (max + min) / 2;
int i = mid;
bool ok = false;
for (int j = 0; j < q; ++j)
if (t[j] == s[i]) {
i += (d[j] == 'R' ? 1 : -1);
if (i == n)
break;
if (i == -1) {
ok = true;
break;
}
}
(ok ? min : max) = mid;
}
int l = min;
min = -1;
max = n;
while (max - min > 1) {
int mid = (max + min) / 2;
int i = n - 1 - mid;
bool ok = false;
for (int j = 0; j < q; ++j)
if (t[j] == s[i]) {
i += (d[j] == 'R' ? 1 : -1);
if (i == -1)
break;
if (i == n) {
ok = true;
break;
}
}
(ok ? min : max) = mid;
}
cout << n - l - 2 - min;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; \
for (int(i) = (a); (i) < (b); ++(i)) \
cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); \
cout << "]\n"; \
} while (0)
#define p_map(map, it) \
do { \
cout << "{"; \
for (auto(it) = map.begin();; ++(it)) { \
if ((it) == map.end()) { \
cout << "}\n"; \
break; \
} else \
cout << "" << (it)->first << "=>" << (it)->second << ", "; \
} \
} while (0)
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
char t[q], d[q];
for (int i = 0; i < q; ++i)
cin >> t[i] >> d[i];
int min = -1, max = n;
while (max - min > 1) {
int mid = (max + min) / 2;
int i = mid;
bool ok = false;
for (int j = 0; j < q; ++j)
if (t[j] == s[i]) {
i += (d[j] == 'R' ? 1 : -1);
if (i == n)
break;
if (i == -1) {
ok = true;
break;
}
}
(ok ? min : max) = mid;
}
int l = min;
min = -1;
max = n;
while (max - min > 1) {
int mid = (max + min) / 2;
int i = n - 1 - mid;
bool ok = false;
for (int j = 0; j < q; ++j)
if (t[j] == s[i]) {
i += (d[j] == 'R' ? 1 : -1);
if (i == -1)
break;
if (i == n) {
ok = true;
break;
}
}
(ok ? min : max) = mid;
}
cout << n - l - 2 - min;
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p03081 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <cmath>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <vector>
// #include <unordered_map>
// #include <unordered_set>
// #include <boost/container/static_vector.hpp>
// #include <boost/unordered_set.hpp>
// #include <boost/unordered_map.hpp>
// #include <unistd.h>
const int MAX_N = 100050;
int N, Q;
std::string S;
char tile[MAX_N];
char t[MAX_N], d[MAX_N];
int cal_pos(int pos) {
for (int i = 1; i <= Q; i++) {
if (t[i] == tile[pos]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == 0 || pos == N + 1) {
break;
}
}
return pos;
}
int main(int argc, char **argv) {
std::cin >> N >> Q;
std::cin >> S;
for (int i = 1; i <= Q; i++) {
std::cin >> t[i] >> d[i];
}
for (int i = 0; i < S.size(); i++) {
tile[i + 1] = S[i];
}
int lb = 0;
int ub = N + 1;
while (lb + 1 < ub) {
int mid = (lb + ub) / 2;
if (cal_pos(mid) == 0) {
lb = mid;
} else {
ub = mid;
}
}
int left_cond = lb;
lb = 0;
ub = N + 1;
while (lb + 1 < ub) {
int mid = (lb + ub) / 2;
if (cal_pos(mid) == N + 1) {
ub = mid;
} else {
lb = mid;
}
}
int right_cond = ub;
// std::cout << left_cond << " " << right_cond << std::endl;
int ret = 0;
for (int i = 1; i <= N; i++) {
if (left_cond < i && i < right_cond) {
ret++;
}
}
std::cout << ret << std::endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <cmath>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <stdio.h>
#include <vector>
// #include <unordered_map>
// #include <unordered_set>
// #include <boost/container/static_vector.hpp>
// #include <boost/unordered_set.hpp>
// #include <boost/unordered_map.hpp>
// #include <unistd.h>
const int MAX_N = 200050;
int N, Q;
std::string S;
char tile[MAX_N];
char t[MAX_N], d[MAX_N];
int cal_pos(int pos) {
for (int i = 1; i <= Q; i++) {
if (t[i] == tile[pos]) {
if (d[i] == 'L') {
pos--;
} else {
pos++;
}
}
if (pos == 0 || pos == N + 1) {
break;
}
}
return pos;
}
int main(int argc, char **argv) {
std::cin >> N >> Q;
std::cin >> S;
for (int i = 1; i <= Q; i++) {
std::cin >> t[i] >> d[i];
}
for (int i = 0; i < S.size(); i++) {
tile[i + 1] = S[i];
}
int lb = 0;
int ub = N + 1;
while (lb + 1 < ub) {
int mid = (lb + ub) / 2;
if (cal_pos(mid) == 0) {
lb = mid;
} else {
ub = mid;
}
}
int left_cond = lb;
lb = 0;
ub = N + 1;
while (lb + 1 < ub) {
int mid = (lb + ub) / 2;
if (cal_pos(mid) == N + 1) {
ub = mid;
} else {
lb = mid;
}
}
int right_cond = ub;
// std::cout << left_cond << " " << right_cond << std::endl;
int ret = 0;
for (int i = 1; i <= N; i++) {
if (left_cond < i && i < right_cond) {
ret++;
}
}
std::cout << ret << std::endl;
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03081 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const int maxn = 222;
const int maxs = 200100;
const int mod = 1000000007;
char t[maxn], d[maxn];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 0; i < q; i++)
cin >> t[i] >> d[i];
int tot = 0;
int lo = 0, hi = n - 1, ans = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
int pv = mid;
for (int i = 0; i < q && pv > -1 && pv < n; i++)
if (s[pv] == t[i]) {
if (d[i] == 'L')
pv--;
else
pv++;
}
if (pv < 0)
ans = mid, lo = mid + 1;
else
hi = mid - 1;
}
tot += ans + 1;
lo = 0, hi = n - 1, ans = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
int pv = mid;
for (int i = 0; i < q && pv > -1 && pv < n; i++)
if (s[pv] == t[i]) {
if (d[i] == 'L')
pv--;
else
pv++;
}
if (pv >= n)
ans = mid, hi = mid - 1;
else
lo = mid + 1;
}
if (ans != -1)
tot += n - ans;
cout << n - tot << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
const int maxn = 200200;
const int maxs = 200100;
const int mod = 1000000007;
char t[maxn], d[maxn];
int main() {
int n, q;
cin >> n >> q;
string s;
cin >> s;
for (int i = 0; i < q; i++)
cin >> t[i] >> d[i];
int tot = 0;
int lo = 0, hi = n - 1, ans = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
int pv = mid;
for (int i = 0; i < q && pv > -1 && pv < n; i++)
if (s[pv] == t[i]) {
if (d[i] == 'L')
pv--;
else
pv++;
}
if (pv < 0)
ans = mid, lo = mid + 1;
else
hi = mid - 1;
}
tot += ans + 1;
lo = 0, hi = n - 1, ans = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
int pv = mid;
for (int i = 0; i < q && pv > -1 && pv < n; i++)
if (s[pv] == t[i]) {
if (d[i] == 'L')
pv--;
else
pv++;
}
if (pv >= n)
ans = mid, hi = mid - 1;
else
lo = mid + 1;
}
if (ans != -1)
tot += n - ans;
cout << n - tot << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p03081 | C++ | Runtime Error | #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, q;
string s;
vector<pair<char, char>> Q;
bool Cr(int k) {
int pos = k;
REP(i, q) {
char c, d;
c = Q[i].first;
d = Q[i].second;
if (d == 'R') {
if (s[pos] == c) {
if (pos == n - 1) {
return true;
} else {
++pos;
}
}
} else {
if (s[pos] == c) {
if (pos == 0)
continue;
else
--pos;
}
}
}
return false;
}
bool Cl(int k) {
int pos = k;
REP(i, q) {
char c, d;
c = Q[i].first;
d = Q[i].second;
if (d == 'R') {
if (s[pos] == c) {
if (pos == n - 1) {
continue;
} else {
++pos;
}
}
} else {
if (s[pos] == c) {
if (pos == 0)
return true;
else
--pos;
}
}
}
return false;
}
int main() {
accelerate();
cin >> n >> q;
cin >> s;
Q.resize(n);
REP(i, q) {
char c, d;
cin >> c >> d;
Q[i].first = c;
Q[i].second = d;
}
int l, r, m;
l = 0, r = n;
m = (l + r) >> 1;
int ans = n;
while (r - l > 1) {
if (Cr(m)) {
r = m;
} else {
l = m;
}
m = (l + r) >> 1;
}
if (Cr(l)) {
cout << 0 << endl;
return 0;
} else if (r == n) {
ans = n;
} else {
ans = r;
}
l = 0, r = n;
m = (l + r) >> 1;
while (r - l > 1) {
if (Cl(m)) {
l = m;
} else {
r = m;
}
m = (l + r) >> 1;
}
if (Cl(l)) {
if (l + 1 > ans) {
cout << 0 << endl;
return 0;
} else {
cout << ans - l - 1 << endl;
return 0;
}
} else {
cout << ans << endl;
return 0;
}
}
| #pragma comment(linker, "/stack:247474112")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; ++i)
#define RANGE(i, x, n) for (ll i = x; i < n; ++i)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
void accelerate() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n, q;
string s;
vector<pair<char, char>> Q;
bool Cr(int k) {
int pos = k;
REP(i, q) {
char c, d;
c = Q[i].first;
d = Q[i].second;
if (d == 'R') {
if (s[pos] == c) {
if (pos == n - 1) {
return true;
} else {
++pos;
}
}
} else {
if (s[pos] == c) {
if (pos == 0)
continue;
else
--pos;
}
}
}
return false;
}
bool Cl(int k) {
int pos = k;
REP(i, q) {
char c, d;
c = Q[i].first;
d = Q[i].second;
if (d == 'R') {
if (s[pos] == c) {
if (pos == n - 1) {
continue;
} else {
++pos;
}
}
} else {
if (s[pos] == c) {
if (pos == 0)
return true;
else
--pos;
}
}
}
return false;
}
int main() {
accelerate();
cin >> n >> q;
cin >> s;
Q.resize(q);
REP(i, q) {
char c, d;
cin >> c >> d;
Q[i].first = c;
Q[i].second = d;
}
int l, r, m;
l = 0, r = n;
m = (l + r) >> 1;
int ans = n;
while (r - l > 1) {
if (Cr(m)) {
r = m;
} else {
l = m;
}
m = (l + r) >> 1;
}
if (Cr(l)) {
cout << 0 << endl;
return 0;
} else if (r == n) {
ans = n;
} else {
ans = r;
}
l = 0, r = n;
m = (l + r) >> 1;
while (r - l > 1) {
if (Cl(m)) {
l = m;
} else {
r = m;
}
m = (l + r) >> 1;
}
if (Cl(l)) {
if (l + 1 > ans) {
cout << 0 << endl;
return 0;
} else {
cout << ans - l - 1 << endl;
return 0;
}
} else {
cout << ans << endl;
return 0;
}
}
| replace | 76 | 77 | 76 | 77 | 0 | |
p03081 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> query;
typedef vector<vector<ll>> matrix;
int n, q;
string s;
char desire[100005];
char dir[100005];
bool valid[100005];
void solve() {
// TODO: fix input
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin.ignore();
cin >> desire[i] >> dir[i];
}
{
// prefix
int lhs = -1;
int rhs = n - 1;
while (lhs != rhs) {
int mid = (lhs + rhs + 1) / 2;
int curr = mid;
for (int i = 0; i < q && curr >= 0 && curr < n; i++) {
if (desire[i] == s[curr]) {
if (dir[i] == 'L')
curr--;
else
curr++;
}
}
if (curr < 0)
lhs = mid;
else
rhs = mid - 1;
}
for (int i = 0; i <= lhs; i++) {
valid[i] = true;
}
}
{
// suffix
int lhs = 0;
int rhs = n;
while (lhs != rhs) {
int mid = (lhs + rhs) / 2;
int curr = mid;
for (int i = 0; i < q && curr >= 0 && curr < n; i++) {
if (desire[i] == s[curr]) {
if (dir[i] == 'L')
curr--;
else
curr++;
}
}
if (curr >= n)
rhs = mid;
else
lhs = mid + 1;
}
for (int i = lhs; i < n; i++) {
valid[i] = true;
}
}
int ret = 0;
for (int i = 0; i < n; i++) {
ret += valid[i];
}
cout << n - ret << "\n";
}
void casesolve() {
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Case #" << i << ": ";
solve();
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
// casesolve();
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> query;
typedef vector<vector<ll>> matrix;
int n, q;
string s;
char desire[200005];
char dir[200005];
bool valid[200005];
void solve() {
// TODO: fix input
cin >> n >> q >> s;
for (int i = 0; i < q; i++) {
cin.ignore();
cin >> desire[i] >> dir[i];
}
{
// prefix
int lhs = -1;
int rhs = n - 1;
while (lhs != rhs) {
int mid = (lhs + rhs + 1) / 2;
int curr = mid;
for (int i = 0; i < q && curr >= 0 && curr < n; i++) {
if (desire[i] == s[curr]) {
if (dir[i] == 'L')
curr--;
else
curr++;
}
}
if (curr < 0)
lhs = mid;
else
rhs = mid - 1;
}
for (int i = 0; i <= lhs; i++) {
valid[i] = true;
}
}
{
// suffix
int lhs = 0;
int rhs = n;
while (lhs != rhs) {
int mid = (lhs + rhs) / 2;
int curr = mid;
for (int i = 0; i < q && curr >= 0 && curr < n; i++) {
if (desire[i] == s[curr]) {
if (dir[i] == 'L')
curr--;
else
curr++;
}
}
if (curr >= n)
rhs = mid;
else
lhs = mid + 1;
}
for (int i = lhs; i < n; i++) {
valid[i] = true;
}
}
int ret = 0;
for (int i = 0; i < n; i++) {
ret += valid[i];
}
cout << n - ret << "\n";
}
void casesolve() {
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
cout << "Case #" << i << ": ";
solve();
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
// casesolve();
}
| replace | 22 | 25 | 22 | 25 | 0 | |
p03081 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct {
int first;
int second;
int third;
} T;
// 昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
int N, Q;
string s;
vector<pair<char, char>> v;
int fall(int x) {
if (x < 0)
return 1;
else if (x >= N)
return 2;
int i;
REP(i, v.size()) {
if (v[i].first == s[x]) {
if (v[i].second == 'L')
x--;
else
x++;
}
if (x < 0)
return 1;
else if (x >= N)
return 2;
}
return 0;
}
// mode 0 左側に落ちない最小値，mode 1 右側に落ちる最小値
int binary_search(int start, int end, int mode) {
while (true) {
int mid = (start + end) / 2;
int f = fall(mid);
if (end - start <= 1)
break;
if (mode) {
if (!f)
start = mid;
else
end = mid;
} else {
if (!f)
end = mid;
else
start = mid;
}
}
return end;
}
int main(void) {
int i, j;
cin >> N >> Q;
cin >> s;
REP(i, Q) {
char x, y;
cin >> x >> y;
v.push_back(pair<char, char>(x, y));
}
int start = 0, end = N, mid;
// xが落ちない位置になるようにする．
while (true) {
mid = (start + end) / 2;
int f = fall(mid);
if (!f)
break;
else if (f == 1)
start = mid;
else
end = mid;
if (end - start < 1)
break;
}
int S, E;
// S左側に落ちない最初
// E右側に落ちる最初
if (fall(start) % 2 == 0)
S = start;
else
S = binary_search(start, mid, 0);
if (fall(end) != 2)
E = end + 1;
else
E = binary_search(mid, end, 1);
cout << E - S << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (i = 0; i < N; i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct {
int first;
int second;
int third;
} T;
// 昇順
bool comp_Se(T &l, T &r) { return l.second < r.second; }
int N, Q;
string s;
vector<pair<char, char>> v;
int fall(int x) {
if (x < 0)
return 1;
else if (x >= N)
return 2;
int i;
REP(i, v.size()) {
if (v[i].first == s[x]) {
if (v[i].second == 'L')
x--;
else
x++;
}
if (x < 0)
return 1;
else if (x >= N)
return 2;
}
return 0;
}
// mode 0 左側に落ちない最小値，mode 1 右側に落ちる最小値
int binary_search(int start, int end, int mode) {
while (true) {
int mid = (start + end) / 2;
int f = fall(mid);
if (end - start <= 1)
break;
if (mode) {
if (!f)
start = mid;
else
end = mid;
} else {
if (!f)
end = mid;
else
start = mid;
}
}
return end;
}
int main(void) {
int i, j;
cin >> N >> Q;
cin >> s;
REP(i, Q) {
char x, y;
cin >> x >> y;
v.push_back(pair<char, char>(x, y));
}
int start = 0, end = N, mid;
// xが落ちない位置になるようにする．
while (true) {
mid = (start + end) / 2;
int f = fall(mid);
if (!f)
break;
else if (f == 1)
start = mid + 1;
else
end = mid;
if (end - start < 1)
break;
}
int S, E;
// S左側に落ちない最初
// E右側に落ちる最初
if (fall(start) % 2 == 0)
S = start;
else
S = binary_search(start, mid, 0);
if (fall(end) != 2)
E = end + 1;
else
E = binary_search(mid, end, 1);
cout << E - S << endl;
return 0;
}
| replace | 79 | 80 | 79 | 80 | TLE | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP \
cin.tie(0); \
ios::sync_with_stdio(false);
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<char, char> PCC;
typedef pair<ll, ll> PLL;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<ll, char> PLC;
typedef pair<char, ll> PCL;
inline void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
inline void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
inline void Yay(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
string s;
vector<PCC> v;
int N, Q;
int move(int pos) {
rep(i, Q) {
if (s[pos] == v[i].first) {
if (v[i].second == 'L')
--pos;
else
++pos;
}
}
return pos;
}
int main(void) {
SPEEDUP
cout << setprecision(15);
cin >> N >> Q;
cin >> s;
s = " " + s + " ";
v.resize(N);
rep(i, Q) cin >> v[i].first >> v[i].second;
// 左に落ちる最大の位置
int ls = 0, le = N + 1;
while (le - ls > 1) {
int lm = (ls + le) / 2;
if (move(lm) == 0)
ls = lm;
else
le = lm;
}
// 右に落ちる最小の位置
int rs = 0, re = N + 1;
while (re - rs > 1) {
int rm = (rs + re) / 2;
if (move(rm) == N + 1)
re = rm;
else
rs = rm;
}
cout << N - ls - (N + 1 - re) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0, i##_max = (N); i < i##_max; ++i)
#define repp(i, l, r) for (int i = (l), i##_max = (r); i < i##_max; ++i)
#define per(i, N) for (int i = (N)-1; i >= 0; --i)
#define perr(i, l, r) for (int i = r - 1, i##_min(l); i >= i##_min; --i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP \
cin.tie(0); \
ios::sync_with_stdio(false);
#define MAX_I INT_MAX // 1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX // 1e9
#define MAX_LL LLONG_MAX // 1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX // 1e19
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<char, char> PCC;
typedef pair<ll, ll> PLL;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<ll, int> PLI;
typedef pair<int, ll> PIL;
typedef pair<ll, char> PLC;
typedef pair<char, ll> PCL;
inline void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
inline void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
inline void Yay(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
string s;
vector<PCC> v;
int N, Q;
int move(int pos) {
rep(i, Q) {
if (s[pos] == v[i].first) {
if (v[i].second == 'L')
--pos;
else
++pos;
}
}
return pos;
}
int main(void) {
SPEEDUP
cout << setprecision(15);
cin >> N >> Q;
cin >> s;
s = " " + s + " ";
v.resize(Q);
rep(i, Q) cin >> v[i].first >> v[i].second;
// 左に落ちる最大の位置
int ls = 0, le = N + 1;
while (le - ls > 1) {
int lm = (ls + le) / 2;
if (move(lm) == 0)
ls = lm;
else
le = lm;
}
// 右に落ちる最小の位置
int rs = 0, re = N + 1;
while (re - rs > 1) {
int rm = (rs + re) / 2;
if (move(rm) == N + 1)
re = rm;
else
rs = rm;
}
cout << N - ls - (N + 1 - re) << endl;
return 0;
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p03081 | C++ | Runtime Error | // https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_c
// C - Snuke the Wizard
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-2.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
#else
cin.tie(0);
ios::sync_with_stdio(false);
#endif
ll N, Q;
cin >> N >> Q;
string s;
cin >> s;
struct Info {
char c;
char d;
ll ofs = 0;
};
vector<Info> tdq(Q);
for (auto &&tq : tdq) {
cin >> tq.c >> tq.d;
tq.ofs = tq.d == 'L' ? -1 : 1;
}
auto check_t = [&](ll v, ll pos) { // vが到達するか?
for (const auto &tq : tdq) {
auto c = s.at(v);
if (c == tq.c)
v += tq.ofs;
if (v == pos)
return true;
if (v < 0 || v >= s.size())
break;
}
return false;
};
auto check_func = [&](ll pos, bool is_flag) {
ll lb = 0, ub = s.size();
while (ub - lb > 1) {
ll mid = (lb + ub) / 2;
if (check_t(mid, pos) == is_flag) {
ub = mid;
} else {
lb = mid;
}
dump(mid, lb, ub);
}
return ub;
};
// REP(i,s.size()){
// dump(i,check_t(i,-1));
// dump(i,check_t(i,s.size()));
// }
ll r = check_func(s.size(), true) - 1;
dump(r);
ll l = check_func(-1, false);
dump(l);
assert(r >= l);
cout << r - l + 1 << endl;
return 0;
}
int main_() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
#else
cin.tie(0);
ios::sync_with_stdio(false);
#endif
ll N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<ll> num(N, 1);
unordered_map<char, vector<ll>> c_pos;
REP(i, s.size()) {
auto c = s[i];
c_pos[c].push_back(i);
}
REP(i, Q) {
char t, d;
cin >> t >> d;
ll ofs = d == 'L' ? -1 : 1;
for (auto &pos : c_pos[t]) {
if (pos + ofs >= 0 && pos + ofs < num.size())
num[pos + ofs] += num[pos];
num[pos] = 0;
}
}
ll ans = accumulate(num.begin(), num.end(), 0LL);
cout << ans << endl;
return 0;
} | // https://atcoder.jp/contests/exawizards2019/tasks/exawizards2019_c
// C - Snuke the Wizard
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
#if LOCAL & 01
std::ifstream in("./test/sample-2.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
#else
cin.tie(0);
ios::sync_with_stdio(false);
#endif
ll N, Q;
cin >> N >> Q;
string s;
cin >> s;
struct Info {
char c;
char d;
ll ofs = 0;
};
vector<Info> tdq(Q);
for (auto &&tq : tdq) {
cin >> tq.c >> tq.d;
tq.ofs = tq.d == 'L' ? -1 : 1;
}
auto check_t = [&](ll v, ll pos) { // vが到達するか?
for (const auto &tq : tdq) {
auto c = s.at(v);
if (c == tq.c)
v += tq.ofs;
if (v == pos)
return true;
if (v < 0 || v >= s.size())
break;
}
return false;
};
auto check_func = [&](ll pos, bool is_flag) {
ll lb = 0, ub = s.size();
while (ub - lb > 1) {
ll mid = (lb + ub) / 2;
if (check_t(mid, pos) == is_flag) {
ub = mid;
} else {
lb = mid;
}
dump(mid, lb, ub);
}
return ub;
};
// REP(i,s.size()){
// dump(i,check_t(i,-1));
// dump(i,check_t(i,s.size()));
// }
ll r = check_func(s.size(), true) - 1;
dump(r);
ll l = check_func(-1, false);
dump(l);
// assert(r>=l);
cout << r - l + 1 << endl;
return 0;
}
int main_() {
#if LOCAL & 01
std::ifstream in("./test/sample-1.in"); // input.txt
std::cin.rdbuf(in.rdbuf());
#else
cin.tie(0);
ios::sync_with_stdio(false);
#endif
ll N, Q;
cin >> N >> Q;
string s;
cin >> s;
vector<ll> num(N, 1);
unordered_map<char, vector<ll>> c_pos;
REP(i, s.size()) {
auto c = s[i];
c_pos[c].push_back(i);
}
REP(i, Q) {
char t, d;
cin >> t >> d;
ll ofs = d == 'L' ? -1 : 1;
for (auto &pos : c_pos[t]) {
if (pos + ofs >= 0 && pos + ofs < num.size())
num[pos + ofs] += num[pos];
num[pos] = 0;
}
}
ll ans = accumulate(num.begin(), num.end(), 0LL);
cout << ans << endl;
return 0;
} | replace | 83 | 84 | 83 | 84 | 0 | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e9
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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
string t;
int d[200010];
int n, q;
string s;
bool left(int p) {
for (int i = 0; i < q; i++) {
if (s[p] - 'A' == t[i] - 'A') {
p += d[i];
if (p < 0)
return true;
if (p >= n)
return false;
}
}
return false;
}
bool right(int p) {
for (int i = 0; i < q; i++) {
if (s[p] - 'A' == t[i] - 'A') {
p += d[i];
if (p >= n)
return true;
if (p < 0)
return false;
}
}
return false;
}
signed main() {
cin >> n >> q;
cin >> s;
for (int i = 0; i < q; i++) {
cin >> t[i];
char x;
cin >> x;
if (x == 'L')
d[i] = -1;
else
d[i] = 1;
}
int ret = n;
int l = -1, r = n;
while (r - l > 1) {
int mid = l + (r - l) / 2;
if (left(mid))
l = mid;
else
r = mid;
}
ret -= l;
l = -1, r = n;
while (r - l > 1) {
int mid = l + (r - l) / 2;
if (right(mid))
r = mid;
else
l = mid;
}
ret -= n - l;
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e9
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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
char t[200010];
int d[200010];
int n, q;
string s;
bool left(int p) {
for (int i = 0; i < q; i++) {
if (s[p] - 'A' == t[i] - 'A') {
p += d[i];
if (p < 0)
return true;
if (p >= n)
return false;
}
}
return false;
}
bool right(int p) {
for (int i = 0; i < q; i++) {
if (s[p] - 'A' == t[i] - 'A') {
p += d[i];
if (p >= n)
return true;
if (p < 0)
return false;
}
}
return false;
}
signed main() {
cin >> n >> q;
cin >> s;
for (int i = 0; i < q; i++) {
cin >> t[i];
char x;
cin >> x;
if (x == 'L')
d[i] = -1;
else
d[i] = 1;
}
int ret = n;
int l = -1, r = n;
while (r - l > 1) {
int mid = l + (r - l) / 2;
if (left(mid))
l = mid;
else
r = mid;
}
ret -= l;
l = -1, r = n;
while (r - l > 1) {
int mid = l + (r - l) / 2;
if (right(mid))
r = mid;
else
l = mid;
}
ret -= n - l;
cout << ret << endl;
return 0;
} | replace | 58 | 59 | 58 | 59 | 0 | |
p03081 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
constexpr double PI = 3.1415926535897932; // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using Pcc = pair<char, char>;
istream &operator>>(istream &is, Pcc &p) {
char ch1, ch2;
is >> ch1 >> ch2;
p = Pcc(ch1, ch2);
return is;
}
ostream &operator<<(ostream &os, const Pcc &p) {
return os << p.first << ' ' << p.second << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
string s;
cin >> n >> q >> s;
vector<Pcc> query(n);
for (int i = 0; i < q; ++i)
cin >> query[i];
int lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
bool ok = true;
int pos = mid;
for (int i = 0; i < q; ++i) {
if (s[pos] != query[i].first)
continue;
if (query[i].second == 'L')
--pos;
else
++pos;
if (pos < 0) {
ok = false;
break;
}
if (pos >= n)
break;
}
if (!ok)
lb = mid;
else
ub = mid;
}
int left = ub;
lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
bool ok = true;
int pos = mid;
for (int i = 0; i < q; ++i) {
if (s[pos] != query[i].first)
continue;
if (query[i].second == 'L')
--pos;
else
++pos;
if (pos >= n) {
ok = false;
break;
}
if (pos < 0)
break;
}
if (ok)
lb = mid;
else
ub = mid;
}
int right = ub;
int ans = max(0, right - left);
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
constexpr double PI = 3.1415926535897932; // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using Pcc = pair<char, char>;
istream &operator>>(istream &is, Pcc &p) {
char ch1, ch2;
is >> ch1 >> ch2;
p = Pcc(ch1, ch2);
return is;
}
ostream &operator<<(ostream &os, const Pcc &p) {
return os << p.first << ' ' << p.second << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
string s;
cin >> n >> q >> s;
vector<Pcc> query(q);
for (int i = 0; i < q; ++i)
cin >> query[i];
int lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
bool ok = true;
int pos = mid;
for (int i = 0; i < q; ++i) {
if (s[pos] != query[i].first)
continue;
if (query[i].second == 'L')
--pos;
else
++pos;
if (pos < 0) {
ok = false;
break;
}
if (pos >= n)
break;
}
if (!ok)
lb = mid;
else
ub = mid;
}
int left = ub;
lb = -1, ub = n;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
bool ok = true;
int pos = mid;
for (int i = 0; i < q; ++i) {
if (s[pos] != query[i].first)
continue;
if (query[i].second == 'L')
--pos;
else
++pos;
if (pos >= n) {
ok = false;
break;
}
if (pos < 0)
break;
}
if (ok)
lb = mid;
else
ub = mid;
}
int right = ub;
int ans = max(0, right - left);
cout << ans << endl;
} | replace | 54 | 55 | 54 | 55 | 0 | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long N;
long Q;
vector<char> t_ls;
vector<char> d_ls;
string s;
bool check_left(long ind) {
for (int i = 0; i < ::Q; i++) {
if (::t_ls[i] == ::s[ind]) {
if (::d_ls[i] == (char)'L') {
ind -= 1;
} else {
ind += 1;
}
}
if (ind >= N) {
return false;
};
if (ind <= -1) {
return true;
}
}
return false;
}
bool check_right(long ind) {
for (int i = 0; i < ::Q; i++) {
if (::t_ls[i] == ::s[ind]) {
if (::d_ls[i] == (char)'L') {
ind -= 1;
} else {
ind += 1;
}
}
if (ind >= N) {
return true;
};
if (ind <= -1) {
return false;
}
}
return false;
}
int main() {
long last;
long ind;
long dif;
long tmp;
long _sum;
int flg;
cin >> ::N >> ::Q;
cin >> ::s;
::t_ls.resize(N);
::d_ls.resize(N);
for (int i = 0; i < Q; i++) {
cin >> ::t_ls[i] >> ::d_ls[i];
}
last = ::N - 1;
ind = ::N / 2;
flg = 0;
while (true) {
dif = abs((int)(last - ind));
if (check_left(ind)) {
if (dif <= 1 && flg == 0) {
break;
} else if (dif < 1) {
break;
}
flg = 1;
tmp = ind;
ind += 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
} else {
if (dif <= 1 && flg == 1) {
ind -= 1;
break;
} else if (dif < 1) {
ind = -1;
break;
}
flg = 0;
tmp = ind;
ind -= 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
}
ind = ind > ::N - 1 ? ::N - 1 : ind;
ind = ind < 0 ? 0 : ind;
}
_sum = ind + 1;
last = ::N - 1;
ind = ::N / 2;
flg = 0;
while (true) {
dif = abs((int)(last - ind));
if (check_right(ind)) {
if (dif <= 1 && flg == 0) {
break;
} else if (dif < 1) {
break;
}
flg = 1;
tmp = ind;
ind -= 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
} else {
if (dif <= 1 && flg == 1) {
ind += 1;
break;
} else if (dif < 1) {
ind = N;
break;
}
flg = 0;
tmp = ind;
ind += 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
}
ind = ind > ::N - 1 ? ::N - 1 : ind;
ind = ind < 0 ? 0 : ind;
}
_sum += ::N - ind;
cout << ::N - _sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long N;
long Q;
vector<char> t_ls;
vector<char> d_ls;
string s;
bool check_left(long ind) {
for (int i = 0; i < ::Q; i++) {
if (::t_ls[i] == ::s[ind]) {
if (::d_ls[i] == (char)'L') {
ind -= 1;
} else {
ind += 1;
}
}
if (ind >= N) {
return false;
};
if (ind <= -1) {
return true;
}
}
return false;
}
bool check_right(long ind) {
for (int i = 0; i < ::Q; i++) {
if (::t_ls[i] == ::s[ind]) {
if (::d_ls[i] == (char)'L') {
ind -= 1;
} else {
ind += 1;
}
}
if (ind >= N) {
return true;
};
if (ind <= -1) {
return false;
}
}
return false;
}
int main() {
long last;
long ind;
long dif;
long tmp;
long _sum;
int flg;
cin >> ::N >> ::Q;
cin >> ::s;
::t_ls.resize(Q);
::d_ls.resize(Q);
for (int i = 0; i < Q; i++) {
cin >> ::t_ls[i] >> ::d_ls[i];
}
last = ::N - 1;
ind = ::N / 2;
flg = 0;
while (true) {
dif = abs((int)(last - ind));
if (check_left(ind)) {
if (dif <= 1 && flg == 0) {
break;
} else if (dif < 1) {
break;
}
flg = 1;
tmp = ind;
ind += 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
} else {
if (dif <= 1 && flg == 1) {
ind -= 1;
break;
} else if (dif < 1) {
ind = -1;
break;
}
flg = 0;
tmp = ind;
ind -= 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
}
ind = ind > ::N - 1 ? ::N - 1 : ind;
ind = ind < 0 ? 0 : ind;
}
_sum = ind + 1;
last = ::N - 1;
ind = ::N / 2;
flg = 0;
while (true) {
dif = abs((int)(last - ind));
if (check_right(ind)) {
if (dif <= 1 && flg == 0) {
break;
} else if (dif < 1) {
break;
}
flg = 1;
tmp = ind;
ind -= 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
} else {
if (dif <= 1 && flg == 1) {
ind += 1;
break;
} else if (dif < 1) {
ind = N;
break;
}
flg = 0;
tmp = ind;
ind += 1 < dif / 2 ? dif / 2 : 1;
last = tmp;
}
ind = ind > ::N - 1 ? ::N - 1 : ind;
ind = ind < 0 ? 0 : ind;
}
_sum += ::N - ind;
cout << ::N - _sum << endl;
}
| replace | 54 | 56 | 54 | 56 | 0 | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
#define S second
#define F first
#define kill(x) return (cout << x << endl, 0)
#define debug(x) cerr << #x << " : " << x << endl
#define ddebug(x, y) \
cerr << #x << " : " << x << ", " << #y << " : " << y << endl
#define sz(s) (int)s.size()
#define sq(x) (x) * (x)
#define PB(x) push_back(x)
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) x.begin(), x.end()
#define SP fixed << setprecision(10)
#define UB upper_bound
const int MAXN = 100 * 1000 + 10;
int n, q;
char c[MAXN], s[MAXN];
bool d[MAXN];
bool dead(int ind) {
for (int i = 0; i < q; i++) {
if (c[i] == s[ind])
ind += (d[i] ? +1 : -1);
if (ind < 0)
return true;
}
return false;
}
int bs() {
int l = 0, r = n + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (dead(mid - 1))
l = mid;
else
r = mid;
}
return l;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < q; i++) {
char cc;
cin >> c[i] >> cc;
d[i] = (cc == 'R');
}
int ans1 = bs();
reverse(s, s + n);
for (int i = 0; i < q; i++)
d[i] ^= 1;
int ans2 = bs();
cout << n - min(ans1 + ans2, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
#define S second
#define F first
#define kill(x) return (cout << x << endl, 0)
#define debug(x) cerr << #x << " : " << x << endl
#define ddebug(x, y) \
cerr << #x << " : " << x << ", " << #y << " : " << y << endl
#define sz(s) (int)s.size()
#define sq(x) (x) * (x)
#define PB(x) push_back(x)
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) x.begin(), x.end()
#define SP fixed << setprecision(10)
#define UB upper_bound
const int MAXN = 200 * 1000 + 10;
int n, q;
char c[MAXN], s[MAXN];
bool d[MAXN];
bool dead(int ind) {
for (int i = 0; i < q; i++) {
if (c[i] == s[ind])
ind += (d[i] ? +1 : -1);
if (ind < 0)
return true;
}
return false;
}
int bs() {
int l = 0, r = n + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
if (dead(mid - 1))
l = mid;
else
r = mid;
}
return l;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < q; i++) {
char cc;
cin >> c[i] >> cc;
d[i] = (cc == 'R');
}
int ans1 = bs();
reverse(s, s + n);
for (int i = 0; i < q; i++)
d[i] ^= 1;
int ans2 = bs();
cout << n - min(ans1 + ans2, n) << endl;
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p03081 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 (ll)1 << 60
#define ALL(n) n.begin(), n.end()
#define MOD 1000000007
#define P pair<ll, ll>
ll n, q, a1, a2, v;
string s;
vector<pair<ll, ll>> p;
bool ok[110000];
bool ss(ll a) {
ll now = a;
REP(i, q) {
if (p[i].first == s[now] - 'A') {
if (p[i].second == 0)
now--;
else
now++;
if (now == n or now < 0)
return false;
}
}
return true;
}
// index が条件を満たすかどうか
bool isOK(int index, int key) {
if (key == 0) {
if (ss(index))
return true;
else
return false;
} else {
if (ss(index))
return false;
if (ok[index])
return false;
return true;
}
}
// 汎用的な二分探索のテンプレ
int bs(int key) {
int left = -1; // 「index = 0」が条件を満たすこともあるので、初期値は -1
int right = (int)s.size(); // 「index =
// a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* どんな二分探索でもここの書き方を変えずにできる！ */
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, key))
right = mid;
else
left = mid;
}
/* left は条件を満たさない最大の値、right は条件を満たす最小の値になっている
*/
return right;
}
int main() {
cin >> n >> q;
cin >> s;
REP(i, q) {
char a, b;
cin >> a >> b;
ll c = 0;
if (b == 'R')
c++;
p.push_back(make_pair(a - 'A', c));
}
a1 = bs(0);
REP(i, a1) ok[i] = true;
a2 = bs(1);
cout << a2 - a1 << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 (ll)1 << 60
#define ALL(n) n.begin(), n.end()
#define MOD 1000000007
#define P pair<ll, ll>
ll n, q, a1, a2, v;
string s;
vector<pair<ll, ll>> p;
bool ok[210000];
bool ss(ll a) {
ll now = a;
REP(i, q) {
if (p[i].first == s[now] - 'A') {
if (p[i].second == 0)
now--;
else
now++;
if (now == n or now < 0)
return false;
}
}
return true;
}
// index が条件を満たすかどうか
bool isOK(int index, int key) {
if (key == 0) {
if (ss(index))
return true;
else
return false;
} else {
if (ss(index))
return false;
if (ok[index])
return false;
return true;
}
}
// 汎用的な二分探索のテンプレ
int bs(int key) {
int left = -1; // 「index = 0」が条件を満たすこともあるので、初期値は -1
int right = (int)s.size(); // 「index =
// a.size()-1」が条件を満たさないこともあるので、初期値は
// a.size()
/* どんな二分探索でもここの書き方を変えずにできる！ */
while (right - left > 1) {
int mid = left + (right - left) / 2;
if (isOK(mid, key))
right = mid;
else
left = mid;
}
/* left は条件を満たさない最大の値、right は条件を満たす最小の値になっている
*/
return right;
}
int main() {
cin >> n >> q;
cin >> s;
REP(i, q) {
char a, b;
cin >> a >> b;
ll c = 0;
if (b == 'R')
c++;
p.push_back(make_pair(a - 'A', c));
}
a1 = bs(0);
REP(i, a1) ok[i] = true;
a2 = bs(1);
cout << a2 - a1 << endl;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p03081 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
ll N, Q;
vector<char> t(20000);
vector<char> d(20000);
int simulation(int pos) {
for (int i = 0; i < Q; ++i) {
if (pos == 0)
return -1;
if (pos == N + 1)
return 1;
if (s[pos - 1] == t[i]) {
if (d[i] == 'R')
pos++;
else
pos--;
}
}
if (pos == 0)
return -1;
if (pos == N + 1)
return 1;
return 0;
}
int main() {
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; ++i) {
cin >> t[i] >> d[i];
}
int L1 = 0, R1 = N + 1, M1, maxn = 0;
while (L1 + 1 < R1) {
M1 = (L1 + R1) / 2;
int a = simulation(M1);
if (a == -1) {
maxn = max(maxn, M1);
L1 = M1;
} else {
R1 = M1;
}
}
int L2 = 0, R2 = N + 1, M2, minn = N + 1;
while (L2 + 1 < R2) {
M2 = (L2 + R2) / 2;
int a = simulation(M2);
if (a == 1) {
minn = min(minn, M2);
R2 = M2;
} else {
L2 = M2;
}
}
cout << minn - maxn - 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
ll N, Q;
vector<char> t(200000);
vector<char> d(200000);
int simulation(int pos) {
for (int i = 0; i < Q; ++i) {
if (pos == 0)
return -1;
if (pos == N + 1)
return 1;
if (s[pos - 1] == t[i]) {
if (d[i] == 'R')
pos++;
else
pos--;
}
}
if (pos == 0)
return -1;
if (pos == N + 1)
return 1;
return 0;
}
int main() {
cin >> N >> Q;
cin >> s;
for (int i = 0; i < Q; ++i) {
cin >> t[i] >> d[i];
}
int L1 = 0, R1 = N + 1, M1, maxn = 0;
while (L1 + 1 < R1) {
M1 = (L1 + R1) / 2;
int a = simulation(M1);
if (a == -1) {
maxn = max(maxn, M1);
L1 = M1;
} else {
R1 = M1;
}
}
int L2 = 0, R2 = N + 1, M2, minn = N + 1;
while (L2 + 1 < R2) {
M2 = (L2 + R2) / 2;
int a = simulation(M2);
if (a == 1) {
minn = min(minn, M2);
R2 = M2;
} else {
L2 = M2;
}
}
cout << minn - maxn - 1 << endl;
}
| replace | 7 | 9 | 7 | 9 | 0 | |
p03082 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int N, X;
int S[220];
template <typename... Args> void debug(Args... args) {
for (auto arg : {args...})
cerr << arg << " ";
cerr << endl;
}
// const int mod = //998244353;
const int mod = 1000000007;
const int FacN = 220; // 使わないなら0
constexpr int power(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res *= a;
a *= a;
res %= mod;
a %= mod;
b /= 2;
}
return res;
}
constexpr int inv(int x) { return power(x, mod - 2); }
const struct Fac {
int val[FacN];
constexpr Fac() : val() {
if (FacN == 0)
return;
val[0] = 1;
for (int i = 1; i < FacN; ++i)
val[i] = val[i - 1] * i % mod;
}
const int &operator[](size_t i) const { return val[i]; }
} fac;
const struct FacInv {
int val[FacN];
constexpr FacInv() : val() {
if (FacN == 0)
return;
val[FacN - 1] = 1;
for (int i = 1; i < FacN; ++i)
val[FacN - 1] = val[FacN - 1] * i % mod;
val[FacN - 1] = inv(val[FacN - 1]);
for (int i = FacN - 1; i >= 1; --i)
val[i - 1] = val[i] * i % mod;
}
const int &operator[](size_t i) const { return val[i]; }
} fac_inv;
int Perm(int n, int r) {
if (n < r)
return 0;
return fac[n] * fac_inv[n - r] % mod;
}
int Comb(int n, int r) { return Perm(n, r) * fac_inv[r] % mod; }
// mod,Factorial書き換え
// 要検証
signed main() {
cin >> N >> X;
rep(i, N) { cin >> S[i]; }
sort(S, S + N, greater<int>());
map<pii, int> a, b;
b[pii(0, X)] = 1;
rep(i, N) {
for (auto e : b) {
pii key = e.first;
int val = e.second;
a[pii(key.first + 1, key.second)] += val;
a[pii(key.first + 1, key.second)] %= mod;
a[pii(0, key.second % S[i])] +=
val * Perm(N - i - 1 + key.first, key.first);
a[pii(0, key.second % S[i])] %= mod;
}
swap(a, b);
a.clear();
}
int ans = 0;
for (auto e : b) {
pii key = e.first;
int val = e.second;
if (key.first != 0)
continue;
ans += key.second * val;
ans %= mod;
}
(ans += mod) %= mod;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int N, X;
int S[220];
template <typename... Args> void debug(Args... args) {
for (auto arg : {args...})
cerr << arg << " ";
cerr << endl;
}
// const int mod = //998244353;
const int mod = 1000000007;
const int FacN = 220; // 使わないなら0
constexpr int power(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res *= a;
a *= a;
res %= mod;
a %= mod;
b /= 2;
}
return res;
}
constexpr int inv(int x) { return power(x, mod - 2); }
const struct Fac {
int val[FacN];
constexpr Fac() : val() {
if (FacN == 0)
return;
val[0] = 1;
for (int i = 1; i < FacN; ++i)
val[i] = val[i - 1] * i % mod;
}
const int &operator[](size_t i) const { return val[i]; }
} fac;
const struct FacInv {
int val[FacN];
constexpr FacInv() : val() {
if (FacN == 0)
return;
val[FacN - 1] = 1;
for (int i = 1; i < FacN; ++i)
val[FacN - 1] = val[FacN - 1] * i % mod;
val[FacN - 1] = inv(val[FacN - 1]);
for (int i = FacN - 1; i >= 1; --i)
val[i - 1] = val[i] * i % mod;
}
const int &operator[](size_t i) const { return val[i]; }
} fac_inv;
int Perm(int n, int r) {
if (n < r)
return 0;
return fac[n] * fac_inv[n - r] % mod;
}
int Comb(int n, int r) { return Perm(n, r) * fac_inv[r] % mod; }
// mod,Factorial書き換え
// 要検証
signed main() {
cin >> N >> X;
rep(i, N) { cin >> S[i]; }
sort(S, S + N, greater<int>());
map<pii, int> a, b;
b[pii(0, X)] = 1;
rep(i, N) {
for (auto e : b) {
pii key = e.first;
int val = e.second;
a[pii(1, key.second)] += val * (N - i - 1);
a[pii(1, key.second)] %= mod;
a[pii(0, key.second % S[i])] += val;
a[pii(0, key.second % S[i])] %= mod;
}
swap(a, b);
a.clear();
}
int ans = 0;
for (auto e : b) {
pii key = e.first;
int val = e.second;
if (key.first != 0)
continue;
ans += key.second * val;
ans %= mod;
}
(ans += mod) %= mod;
cout << ans << endl;
return 0;
}
| replace | 103 | 107 | 103 | 106 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r;
int c, s;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long 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; }
explicit operator int() const { return x; } // added by QCFium
ModInt operator=(const int p) {
x = p;
return ModInt(*this);
} // added by QCFium
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return ModInt(u);
}
friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
typedef ModInt<MOD> mint;
mint mpow(s64 num, s64 times) { // O(log(times))
mint next = num % MOD;
mint res = 1;
while (times) {
if (times % 2)
res *= next;
next *= next;
times /= 2;
}
return res;
}
struct MComb {
std::vector<mint> fact;
std::vector<mint> inversed;
MComb(int n) { // O(n+log(mod))
fact = std::vector<mint>(n + 1, 1);
UPTO(i, 1, n) fact[i] = fact[i - 1] * mint(i);
inversed = std::vector<mint>(n + 1);
inversed[n] = mpow((int)fact[n], MOD - 2);
DOWN(i, n) inversed[i] = inversed[i + 1] * mint(i + 1);
}
mint ncr(int n, int r) { return (fact[n] * inversed[r] * inversed[n - r]); }
mint npr(int n, int r) { return (fact[n] * inversed[n - r]); }
mint nhr(int n, int r) {
assert(n + r - 1 < (int)fact.size());
return ncr(n + r - 1, r);
}
};
int n;
std::vector<int> a;
std::vector<std::vector<mint>> memo;
std::vector<std::vector<bool>> ava;
mint dfs(int left, int cur) {
if (!left)
return cur;
if (ava[left][cur])
return memo[left][cur];
mint res = 0;
// use a[left - 1] as first
res += dfs(left - 1, cur % a[left - 1]);
// don't use a[left - 1] as first(throw everywhere)
if (left > 1)
res += dfs(left - 1, cur) * (left - 1);
return memo[left][cur] = res;
}
int main() {
n = ri();
int x = ri();
a.resize(n);
FOR(i, n) a[i] = ri();
sort(a.begin(), a.end(), std::less<int>());
ava.resize(n + 1, std::vector<bool>(x + 1, false));
memo.resize(n + 1, std::vector<mint>(x + 1, 0));
std::cout << dfs(n, x) << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define vi std::vector<int>
#define vvi std::vector<std::vector<int>>
#define vpi std::vector<pi>
#define pi std::pair<int, int>
#define fi first
#define se second
#define all(n) n.begin(), n.end()
#define FROMTO(var, from, to) \
for (int var = (from), var##down = ((int)(to)) < ((int)(from)); \
var##down ? (var >= (int)(to)) : (var <= (int)(to)); \
var##down ? var-- : var++)
#define UPTO(var, from, to) for (int var = (from); var <= ((int)(to)); var++)
#define DOWNTO(var, from, to) for (int var = (from); var >= ((int)(to)); var--)
#define FOR(var, to) UPTO(var, 0, (to)-1)
#define DOWN(var, from) DOWNTO(var, (from)-1, 0)
#define INIT(var, val) FOR(i, countof(var)) var[i] = val
#define INPUT(var) FOR(i, countof(var)) cin >> var[i]
#define INPUT1(var) FOR(i, countof(var)) cin >> var[i], var[i]--
#define SORT(v) qsort(v, countof(v), sizeof(*v), int_less)
#define SORTT(v) qsort(v, countof(v), sizeof(*v), int_greater)
#define QSORT(v, b) qsort(v, countof(v), sizeof(*v), b)
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t s8;
typedef int16_t s16;
typedef int32_t s32;
typedef int64_t s64;
static const int MOD = 1000000007;
static const int INF = ((1 << 30) - 1);
static const s64 LINF = ((1LL << 62) - 1);
struct Comb {
std::vector<std::vector<s64>> a;
Comb(int n) { // O(n^2)
a.resize(n + 1);
FOR(i, n + 1) {
a[i].resize(i + 1, 1);
UPTO(j, 1, i - 1) a[i][j] = a[i - 1][j] + a[i - 1][j];
}
}
s64 ncr(int n, int r) {
assert(n >= 0);
assert(n <= (int)a.size());
assert(r >= 0);
assert(r <= n);
return a[n][r];
}
};
#define gc(c) (c) = getchar()
int ri() {
int c, s = 0, r = 0;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
s64 rs64() {
s64 r;
int c, s;
for (;;) {
gc(c);
if (c == '-') {
s = 1;
break;
}
if (c >= '0' && c <= '9') {
r = c - '0';
break;
}
}
for (;;) {
gc(c);
if (c < '0' || c > '9')
break;
r *= 10;
r += c - '0';
}
if (s)
r = -r;
return r;
}
int int_less(const void *a, const void *b) {
return (*(const int *)a - *(const int *)b);
}
int int_greater(const void *a, const void *b) {
return (*(const int *)b - *(const int *)a);
}
std::string operator*(const std::string &s, int n) {
std::string res;
FOR(i, n) res += s;
return res;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> a) {
for (auto i : a)
os << i << " ";
return os;
}
template <class A, class B>
std::ostream &operator<<(std::ostream &os, std::pair<A, B> a) {
os << a.fi << "," << a.se;
return os;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long 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; }
explicit operator int() const { return x; } // added by QCFium
ModInt operator=(const int p) {
x = p;
return ModInt(*this);
} // added by QCFium
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return ModInt(u);
}
friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
typedef ModInt<MOD> mint;
mint mpow(s64 num, s64 times) { // O(log(times))
mint next = num % MOD;
mint res = 1;
while (times) {
if (times % 2)
res *= next;
next *= next;
times /= 2;
}
return res;
}
struct MComb {
std::vector<mint> fact;
std::vector<mint> inversed;
MComb(int n) { // O(n+log(mod))
fact = std::vector<mint>(n + 1, 1);
UPTO(i, 1, n) fact[i] = fact[i - 1] * mint(i);
inversed = std::vector<mint>(n + 1);
inversed[n] = mpow((int)fact[n], MOD - 2);
DOWN(i, n) inversed[i] = inversed[i + 1] * mint(i + 1);
}
mint ncr(int n, int r) { return (fact[n] * inversed[r] * inversed[n - r]); }
mint npr(int n, int r) { return (fact[n] * inversed[n - r]); }
mint nhr(int n, int r) {
assert(n + r - 1 < (int)fact.size());
return ncr(n + r - 1, r);
}
};
int n;
std::vector<int> a;
std::vector<std::vector<mint>> memo;
std::vector<std::vector<bool>> ava;
mint dfs(int left, int cur) {
if (!left)
return cur;
if (ava[left][cur])
return memo[left][cur];
mint res = 0;
// use a[left - 1] as first
res += dfs(left - 1, cur % a[left - 1]);
// don't use a[left - 1] as first(throw everywhere)
if (left > 1)
res += dfs(left - 1, cur) * (left - 1);
ava[left][cur] = true;
return memo[left][cur] = res;
}
int main() {
n = ri();
int x = ri();
a.resize(n);
FOR(i, n) a[i] = ri();
sort(a.begin(), a.end(), std::less<int>());
ava.resize(n + 1, std::vector<bool>(x + 1, false));
memo.resize(n + 1, std::vector<mint>(x + 1, 0));
std::cout << dfs(n, x) << std::endl;
return 0;
}
| insert | 243 | 243 | 243 | 244 | TLE | |
p03082 | C++ | Time Limit Exceeded | // 見せてやるぜ、奇跡ってやつをよぉ……
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define DEBUG_VLL(vec) \
REP(sz, vec.size()) cerr << vec[sz] << (sz == vec.size() - 1 ? '\n' : ' ');
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vll s(n);
REP(i, n) cin >> s[i];
sort(ALL(s));
vvll dp(n + 1, vll(x + 1, 0));
REP(i, x + 1) dp[0][i] = i;
REP(i, n) {
REP(j, x + 1) {
// 順番の最初に入れる場合
dp[i + 1][j] += dp[i][j % s[i]];
if (dp[i + 1][j] >= MOD)
dp[i + 1][j] -= MOD;
// 最初以降（つまり、余りに関係ない場合）
dp[i + 1][j] += dp[i][j] * i % MOD;
if (dp[i + 1][j] >= MOD)
dp[i + 1][j] -= MOD;
}
REP(j, x + 1) DEBUG_VLL(dp[i + 1]) cout << '\n';
}
cout << dp[n][x] << '\n';
return 0;
}
| // 見せてやるぜ、奇跡ってやつをよぉ……
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define DEBUG_VLL(vec) \
REP(sz, vec.size()) cerr << vec[sz] << (sz == vec.size() - 1 ? '\n' : ' ');
const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
vll s(n);
REP(i, n) cin >> s[i];
sort(ALL(s));
vvll dp(n + 1, vll(x + 1, 0));
REP(i, x + 1) dp[0][i] = i;
REP(i, n) {
REP(j, x + 1) {
// 順番の最初に入れる場合
dp[i + 1][j] += dp[i][j % s[i]];
if (dp[i + 1][j] >= MOD)
dp[i + 1][j] -= MOD;
// 最初以降（つまり、余りに関係ない場合）
dp[i + 1][j] += dp[i][j] * i % MOD;
if (dp[i + 1][j] >= MOD)
dp[i + 1][j] -= MOD;
}
cout << '\n';
}
cout << dp[n][x] << '\n';
return 0;
}
| replace | 74 | 75 | 74 | 75 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#define Rep(i, a, b) for (register int i = (a); i <= (b); ++i)
#define Repe(i, a, b) for (register int i = (a); i >= (b); --i)
#define rep(i, a, b) for (register int i = (a); i < (b); ++i)
#define pb push_back
#define mp make_pair
#define mx(a, b) (a > b ? a : b)
#define mn(a, b) (a < b ? a : b)
typedef unsigned long long uint64;
typedef unsigned int uint32;
typedef long long ll;
using namespace std;
namespace IO {
const uint32 Buffsize = 1 << 15, Output = 1 << 24;
static char Ch[Buffsize], *S = Ch, *T = Ch;
inline char getc() {
return ((S == T) && (T = (S = Ch) + fread(Ch, 1, Buffsize, stdin), S == T)
? 0
: *S++);
}
static char Out[Output], *nowps = Out;
inline void flush() {
fwrite(Out, 1, nowps - Out, stdout);
nowps = Out;
}
template <typename T> inline void read(T &x) {
x = 0;
static char ch;
T f = 1;
for (ch = getc(); !isdigit(ch); ch = getc())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getc())
x = x * 10 + (ch ^ 48);
x *= f;
}
template <typename T> inline void write(T x, char ch = '\n') {
if (!x)
*nowps++ = '0';
if (x < 0)
*nowps++ = '-', x = -x;
static uint32 sta[111], tp;
for (tp = 0; x; x /= 10)
sta[++tp] = x % 10;
for (; tp; *nowps++ = sta[tp--] ^ 48)
;
*nowps++ = ch;
if (nowps - Out >= 1 << 23)
flush();
}
} // namespace IO
using namespace IO;
void file() {
#ifndef ONLINE_JUDGE
FILE *DSD = freopen("water.in", "r", stdin);
FILE *CSC = freopen("water.out", "w", stdout);
#endif
}
inline void Chkmin(int &u, int v) { u > v ? u = v : 0; }
inline void Chkmax(int &u, int v) { u < v ? u = v : 0; }
inline void Chkmax(ll &u, ll v) { u < v ? u = v : 0; }
inline void Chkmin(ll &u, ll v) { u > v ? u = v : 0; }
const int MAXN = 1e5 + 7, mod = 1e9 + 7;
static int dp[2][MAXN], n, x, a[MAXN];
inline void init() {
read(n), read(x);
Rep(i, 1, n) read(a[i]);
sort(a + 1, a + n + 1, greater<int>());
}
inline void solve() {
dp[0][x] = 1;
Rep(i, 0, n - 1) {
int *cr = dp[i & 1], *nx = dp[~i & 1];
memset(nx + 1, 0, sizeof(int) * x);
Rep(j, 1, x) if (cr[j]) {
nx[j % a[i + 1]] = (nx[j % a[i + 1]] + cr[j]) % mod;
nx[j] = (nx[j] + (ll)cr[j] * (n - i - 1)) % mod;
}
}
static int ans = 0;
Rep(i, 1, x) ans = (ans + (ll)i * dp[n & 1][i]) % mod;
cout << ans << endl;
}
int main() {
file();
init();
solve();
return 0;
} | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#define Rep(i, a, b) for (register int i = (a); i <= (b); ++i)
#define Repe(i, a, b) for (register int i = (a); i >= (b); --i)
#define rep(i, a, b) for (register int i = (a); i < (b); ++i)
#define pb push_back
#define mp make_pair
#define mx(a, b) (a > b ? a : b)
#define mn(a, b) (a < b ? a : b)
typedef unsigned long long uint64;
typedef unsigned int uint32;
typedef long long ll;
using namespace std;
namespace IO {
const uint32 Buffsize = 1 << 15, Output = 1 << 24;
static char Ch[Buffsize], *S = Ch, *T = Ch;
inline char getc() {
return ((S == T) && (T = (S = Ch) + fread(Ch, 1, Buffsize, stdin), S == T)
? 0
: *S++);
}
static char Out[Output], *nowps = Out;
inline void flush() {
fwrite(Out, 1, nowps - Out, stdout);
nowps = Out;
}
template <typename T> inline void read(T &x) {
x = 0;
static char ch;
T f = 1;
for (ch = getc(); !isdigit(ch); ch = getc())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getc())
x = x * 10 + (ch ^ 48);
x *= f;
}
template <typename T> inline void write(T x, char ch = '\n') {
if (!x)
*nowps++ = '0';
if (x < 0)
*nowps++ = '-', x = -x;
static uint32 sta[111], tp;
for (tp = 0; x; x /= 10)
sta[++tp] = x % 10;
for (; tp; *nowps++ = sta[tp--] ^ 48)
;
*nowps++ = ch;
if (nowps - Out >= 1 << 23)
flush();
}
} // namespace IO
using namespace IO;
void file() {
#ifndef ONLINE_JUDGE
FILE *DSD = freopen("water.in", "r", stdin);
FILE *CSC = freopen("water.out", "w", stdout);
#endif
}
inline void Chkmin(int &u, int v) { u > v ? u = v : 0; }
inline void Chkmax(int &u, int v) { u < v ? u = v : 0; }
inline void Chkmax(ll &u, ll v) { u < v ? u = v : 0; }
inline void Chkmin(ll &u, ll v) { u > v ? u = v : 0; }
const int MAXN = 1e5 + 7, mod = 1e9 + 7;
static int dp[2][MAXN], n, x, a[MAXN];
inline void init() {
read(n), read(x);
Rep(i, 1, n) read(a[i]);
sort(a + 1, a + n + 1, greater<int>());
}
inline void solve() {
dp[0][x] = 1;
Rep(i, 0, n - 1) {
int *cr = dp[i & 1], *nx = dp[~i & 1];
memset(nx + 1, 0, sizeof(int) * x);
Rep(j, 1, x) if (cr[j]) {
nx[j % a[i + 1]] = (nx[j % a[i + 1]] + cr[j]) % mod;
nx[j] = (nx[j] + (ll)cr[j] * (n - i - 1)) % mod;
}
}
static int ans = 0;
Rep(i, 1, x) ans = (ans + (ll)i * dp[n & 1][i]) % mod;
cout << ans << endl;
}
int main() {
init();
solve();
return 0;
} | delete | 107 | 108 | 107 | 107 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define MOD 1000000007LL
#define int long long
int N, X, S[200];
int dp[200][100001];
bool already[200][100001] = {};
int solve(int now, int X) {
if (now == N - 1)
return X % S[now];
if (already[now][X])
return dp[now][X];
if (S[now] > X) {
dp[now][X] = (N - now) * solve(now + 1, X);
} else {
dp[now][X] = (N - now - 1) * solve(now + 1, X);
dp[now][X] %= MOD;
dp[now][X] += solve(now + 1, X % S[now]);
}
dp[now][X] = dp[now][X] % MOD;
// cout << now << " " << X << " " << dp[now][X] << endl;
return dp[now][X];
}
signed main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> S[i];
sort(S, S + N);
reverse(S, S + N);
cout << solve(0, X) << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define PB push_back
#define MP make_pair
#define all(x) x.begin(), x.end()
#define MOD 1000000007LL
#define int long long
int N, X, S[200];
int dp[200][100001];
bool already[200][100001] = {};
int solve(int now, int X) {
if (now == N - 1)
return X % S[now];
if (already[now][X])
return dp[now][X];
if (S[now] > X) {
dp[now][X] = (N - now) * solve(now + 1, X);
} else {
dp[now][X] = (N - now - 1) * solve(now + 1, X);
dp[now][X] %= MOD;
dp[now][X] += solve(now + 1, X % S[now]);
}
dp[now][X] = dp[now][X] % MOD;
// cout << now << " " << X << " " << dp[now][X] << endl;
already[now][X] = true;
return dp[now][X];
}
signed main() {
cin >> N >> X;
for (int i = 0; i < N; i++)
cin >> S[i];
sort(S, S + N);
reverse(S, S + N);
cout << solve(0, X) << endl;
return 0;
}
| insert | 30 | 30 | 30 | 31 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
ll facl = 1;
for (ll i = 1; i <= n; i++)
facl = (facl * i) % mod;
vector<mint> dp(100010, 0);
dp[k] = (mint)1;
for (ll x = k; x >= 1; x--) {
mint cnt = 0;
ll l = -1, r = n;
while (l + 1 != r) {
ll m = (l + r) / 2;
if (a[m] > x)
r = m;
else
l = m;
}
cnt = (mint)(l + 1);
if (cnt.x == 0) {
continue;
}
for (ll i = 0; i < cnt.x; i++) {
dp[x % a[i]] += dp[x] / cnt;
}
dp[x] = 0;
}
mint sum = 0;
for (ll x = k; x >= 0; x--) {
sum += (mint)x * dp[x];
}
sum *= facl;
cout << sum.x << '\n';
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
ll facl = 1;
for (ll i = 1; i <= n; i++)
facl = (facl * i) % mod;
vector<mint> dp(100010, 0);
dp[k] = (mint)1;
for (ll x = k; x >= 1; x--) {
if (dp[x].x == 0)
continue;
mint cnt = 0;
ll l = -1, r = n;
while (l + 1 != r) {
ll m = (l + r) / 2;
if (a[m] > x)
r = m;
else
l = m;
}
cnt = (mint)(l + 1);
if (cnt.x == 0) {
continue;
}
for (ll i = 0; i < cnt.x; i++) {
dp[x % a[i]] += dp[x] / cnt;
}
dp[x] = 0;
}
mint sum = 0;
for (ll x = k; x >= 0; x--) {
sum += (mint)x * dp[x];
}
sum *= facl;
cout << sum.x << '\n';
}
| insert | 99 | 99 | 99 | 101 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
typedef long double ld;
// macros
#define rep(i, a, b) for (int i = a; i < b; i++)
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define tr(c, it) for (auto it = (c).begin(); it != c.end(); it++)
#define PB push_back
#define MP make_pair
#define bitcount __builtin_popcount
#define watch(x) cerr << (#x) << " is " << (x) << "\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first << 32 | (p).second)
// template functions
template <typename T> inline void printV(vector<T> &a) {
rep(i, 0, sz(a)) { cout << a[i] << " "; }
cout << "\n";
}
template <typename T> inline void printV(vector<T> &a, int n) {
rep(i, 0, n) { cout << a[i] << " "; }
cout << "\n";
}
template <typename T> inline void printVV(vector<vector<T>> &a) {
rep(i, 0, sz(a)) { printV(a[i]); }
cout << "\n";
}
template <typename T> inline void clearVV(vector<vector<T>> &a) {
for (auto &x : a) {
x.clear();
}
a.clear();
}
template <typename T> inline void assignVV(vector<vector<T>> &a, T val) {
for (int i = 0; i < sz(a); i++) {
for (int j = 0; j < sz(a[i]); j++) {
a[i][j] = val;
}
}
}
// random number generation
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// constants
const long double eps = LDBL_EPSILON;
const int inf = 5e8;
const int modn = 1e9 + 7;
const int MAX = 1e5;
inline int add(int a, int b) {
int ret = ((ll)a + b) % modn;
if (ret < 0) {
ret = (ret + modn) % modn;
}
return ret;
}
inline int mul(int a, int b) {
int ret = ((ll)a * b) % modn;
if (ret < 0) {
ret = (ret + modn) % modn;
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Your code here
int N, X;
cin >> N >> X;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
sort(all(a));
vector<vector<int>> dp(N + 1, vector<int>(X + 1, -1));
function<int(int, int)> solve = [&](int n, int x) {
if (n == 1) {
return x % a[n];
}
int &memo = dp[n][x];
if (memo != -1)
return memo;
int ans = 0;
ans = add(ans, solve(n - 1, x % a[n]));
ans = add(ans, mul(n - 1, solve(n - 1, x)));
return ans;
};
int ans = solve(N, X);
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
typedef long double ld;
// macros
#define rep(i, a, b) for (int i = a; i < b; i++)
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define tr(c, it) for (auto it = (c).begin(); it != c.end(); it++)
#define PB push_back
#define MP make_pair
#define bitcount __builtin_popcount
#define watch(x) cerr << (#x) << " is " << (x) << "\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first << 32 | (p).second)
// template functions
template <typename T> inline void printV(vector<T> &a) {
rep(i, 0, sz(a)) { cout << a[i] << " "; }
cout << "\n";
}
template <typename T> inline void printV(vector<T> &a, int n) {
rep(i, 0, n) { cout << a[i] << " "; }
cout << "\n";
}
template <typename T> inline void printVV(vector<vector<T>> &a) {
rep(i, 0, sz(a)) { printV(a[i]); }
cout << "\n";
}
template <typename T> inline void clearVV(vector<vector<T>> &a) {
for (auto &x : a) {
x.clear();
}
a.clear();
}
template <typename T> inline void assignVV(vector<vector<T>> &a, T val) {
for (int i = 0; i < sz(a); i++) {
for (int j = 0; j < sz(a[i]); j++) {
a[i][j] = val;
}
}
}
// random number generation
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// constants
const long double eps = LDBL_EPSILON;
const int inf = 5e8;
const int modn = 1e9 + 7;
const int MAX = 1e5;
inline int add(int a, int b) {
int ret = ((ll)a + b) % modn;
if (ret < 0) {
ret = (ret + modn) % modn;
}
return ret;
}
inline int mul(int a, int b) {
int ret = ((ll)a * b) % modn;
if (ret < 0) {
ret = (ret + modn) % modn;
}
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Your code here
int N, X;
cin >> N >> X;
vector<int> a(N + 1);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
sort(all(a));
vector<vector<int>> dp(N + 1, vector<int>(X + 1, -1));
function<int(int, int)> solve = [&](int n, int x) {
if (n == 1) {
return x % a[n];
}
int &memo = dp[n][x];
if (memo != -1)
return memo;
int ans = 0;
ans = add(ans, solve(n - 1, x % a[n]));
ans = add(ans, mul(n - 1, solve(n - 1, x)));
return memo = ans;
};
int ans = solve(N, X);
cout << ans << "\n";
return 0;
}
| replace | 105 | 106 | 105 | 106 | TLE | |
p03082 | C++ | Runtime Error | // #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const int N = 201;
int s[200];
ll f[N], fr[N];
ll binpow(ll a, int p) {
ll res = 1;
while (p) {
if (p & 1) {
(res *= a) %= mod;
}
(a *= a) %= mod;
p >>= 1;
}
return res;
}
ll cnk(int n, int k) { return f[n] * fr[k] % mod * fr[n - k] % mod; }
int mp[200][100005];
int solve(int x, int pref) {
if (pref == 0) {
return x;
}
if (mp[pref][x] != -1) {
return mp[pref][x];
}
ll res = 0;
for (int i = 0; i < pref; i++) {
(res += solve(x % s[i], i) * cnk(pref - 1, i) % mod * f[pref - i - 1]) %=
mod;
}
return mp[pref][x] = res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> s[i];
fill(mp[i + 1], mp[i + 1] + x + 1, -1);
}
f[0] = fr[0] = 1;
for (int i = 1; i <= n; i++) {
f[i] = (f[i - 1] * i) % mod;
fr[i] = binpow(f[i], mod - 2);
}
sort(s, s + n);
cout << solve(x, n);
return 0;
} | // #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const int N = 201;
int s[200];
ll f[N], fr[N];
ll binpow(ll a, int p) {
ll res = 1;
while (p) {
if (p & 1) {
(res *= a) %= mod;
}
(a *= a) %= mod;
p >>= 1;
}
return res;
}
ll cnk(int n, int k) { return f[n] * fr[k] % mod * fr[n - k] % mod; }
int mp[201][100005];
int solve(int x, int pref) {
if (pref == 0) {
return x;
}
if (mp[pref][x] != -1) {
return mp[pref][x];
}
ll res = 0;
for (int i = 0; i < pref; i++) {
(res += solve(x % s[i], i) * cnk(pref - 1, i) % mod * f[pref - i - 1]) %=
mod;
}
return mp[pref][x] = res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
cin >> s[i];
fill(mp[i + 1], mp[i + 1] + x + 1, -1);
}
f[0] = fr[0] = 1;
for (int i = 1; i <= n; i++) {
f[i] = (f[i - 1] * i) % mod;
fr[i] = binpow(f[i], mod - 2);
}
sort(s, s + n);
cout << solve(x, n);
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p03082 | C++ | Runtime Error | // todo 文字数を少なくする
#pragma GCC optimize("-O3")
#include <bits/stdc++.h>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} __initon;
// 衝突対策
#define ws ___ws
//@必須構造
struct T {
int f, s, t;
T() { f = -1, s = -1, t = -1; }
T(int f, int s, int t) : f(f), s(s), t(t) {}
bool operator<(const T &r) const {
return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;
// return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 大きい順
}
bool operator>(const T &r) const {
return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;
// return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 小さい順
}
bool operator==(const T &r) const { return f == r.f && s == r.s && t == r.t; }
bool operator!=(const T &r) const { return f != r.f || s != r.s || t != r.t; }
int operator[](int i) {
assert(i < 3);
return i == 0 ? f : i == 1 ? s : t;
}
};
struct F {
int a, b, c, d;
F() { a = -1, b = -1, c = -1, d = -1; }
F(int a, int b, int c, int d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d;
// return a != r.a ? a > r.a : b != r.b ? b > r.b : c != r.c ? c >
// r.c : d > r.d;
}
bool operator>(const F &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d;
// return a != r.a ? a < r.a : b != r.b ? b < r.b : c != r.c ? c <
// r.c : d < r.d;
}
bool operator==(const F &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
int operator[](int i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
T mt(int a, int b, int c) { return T(a, b, c); }
//@マクロ省略系 型,構造
#define int long long
#define ll long long
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define vec vector
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define minq 0
#define maxq 1
// マクロ省略系 コンテナ
using vi = vector<int>;
#define _overloadvvi(_1, _2, _3, _4, name, ...) name
#define vvi0() vec<vi>
#define vvi1(a) vec<vi> a
#define vvi2(a, b) vec<vi> a(b)
#define vvi3(a, b, c) vec<vi> a(b, vi(c))
#define vvi4(a, b, c, d) vec<vi> a(b, vi(c, d))
#define vvi(...) \
_overloadvvi(__VA_ARGS__, vvi4, vvi3, vvi2, vvi1, vvi0)(__VA_ARGS__)
using vl = vector<ll>;
#define _overloadvvl(_1, _2, _3, _4, name, ...) name
#define vvl1(a) vec<vl> a
#define vvl2(a, b) vec<vl> a(b)
#define vvl3(a, b, c) vec<vl> a(b, vl(c))
#define vvl4(a, b, c, d) vec<vl> a(b, vl(c, d))
#define vvl(...) _overloadvvl(__VA_ARGS__, vvl4, vvl3, vvl2, vvl1)(__VA_ARGS__)
using vb = vector<bool>;
#define _overloadvvb(_1, _2, _3, _4, name, ...) name
#define vvb1(a) vec<vb> a
#define vvb2(a, b) vec<vb> a(b)
#define vvb3(a, b, c) vec<vb> a(b, vb(c))
#define vvb4(a, b, c, d) vec<vb> a(b, vb(c, d))
#define vvb(...) _overloadvvb(__VA_ARGS__, vvb4, vvb3, vvb2, vvb1)(__VA_ARGS__)
using vs = vector<string>;
#define _overloadvvs(_1, _2, _3, _4, name, ...) name
#define vvs1(a) vec<vs> a
#define vvs2(a, b) vec<vs> a(b)
#define vvs3(a, b, c) vec<vs> a(b, vs(c))
#define vvs4(a, b, c, d) vec<vs> a(b, vs(c, d))
#define vvs(...) _overloadvvs(__VA_ARGS__, vvs4, vvs3, vvs2, vvs1)(__VA_ARGS__)
using vd = vector<double>;
#define _overloadvvd(_1, _2, _3, _4, name, ...) name
#define vvd1(a) vec<vd> a
#define vvd2(a, b) vec<vd> a(b)
#define vvd3(a, b, c) vec<vd> a(b, vd(c))
#define vvd4(a, b, c, d) vec<vd> a(b, vd(c, d))
#define vvd(...) _overloadvvd(__VA_ARGS__, vvd4, vvd3, vvd2, vvd1)(__VA_ARGS__)
using vc = vector<char>;
#define _overloadvvc(_1, _2, _3, _4, name, ...) name
#define vvc1(a) vec<vc> a
#define vvc2(a, b) vec<vc> a(b)
#define vvc3(a, b, c) vec<vc> a(b, vc(c))
#define vvc4(a, b, c, d) vec<vc> a(b, vc(c, d))
#define vvc(...) _overloadvvc(__VA_ARGS__, vvc4, vvc3, vvc2, vvc1)(__VA_ARGS__)
using vp = vector<P>;
#define _overloadvvp(_1, _2, _3, _4, name, ...) name
#define vvp1(a) vec<vp> a
#define vvp2(a, b) vec<vp> a(b)
#define vvp3(a, b, c) vec<vp> a(b, vp(c))
#define vvp4(a, b, c, d) vec<vp> a(b, vp(c, d))
#define vvp(...) _overloadvvp(__VA_ARGS__, vvp4, vvp3, vvp2, vvp1)(__VA_ARGS__)
using vt = vector<T>;
#define _overloadvvt(_1, _2, _3, _4, name, ...) name
#define vvt1(a) vec<vt> a
#define vvt2(a, b) vec<vt> a(b)
#define vvt3(a, b, c) vec<vt> a(b, vt(c))
#define vvt4(a, b, c, d) vec<vt> a(b, vt(c, d))
#define vvt(...) _overloadvvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1)(__VA_ARGS__)
#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))
#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))
#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))
#define _vvi vector<vi>
#define _vvl vector<vl>
#define _vvb vector<vb>
#define _vvs vector<vs>
#define _vvd vector<vd>
#define _vvc vector<vc>
#define _vvp vector<vp>
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<int>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<int, int>;
using mapd = map<dou, int>;
using mapc = map<char, int>;
using maps = map<str, int>;
using seti = set<int>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<int>;
#define bset bitset
#define uset unordered_set
#define mset multiset
#define umap unordered_map
#define umapi unordered_map<int, int>
#define umapp unordered_map<P, int>
#define mmap multimap
// マクロ 繰り返し
#define _overloadrep(_1, _2, _3, _4, name, ...) name
#define _rep(i, n) for (int i = 0, _lim = n; i < _lim; i++)
#define repi(i, m, n) for (int i = m, _lim = n; i < _lim; i++)
#define repadd(i, m, n, ad) for (int i = m, _lim = n; i < _lim; i += ad)
#define rep(...) _overloadrep(__VA_ARGS__, repadd, repi, _rep, )(__VA_ARGS__)
#define _rer(i, n) for (int i = n; i >= 0; i--)
#define reri(i, m, n) for (int i = m, _lim = n; i >= _lim; i--)
#define rerdec(i, m, n, dec) for (int i = m, _lim = n; i >= _lim; i -= dec)
#define rer(...) _overloadrep(__VA_ARGS__, rerdec, reri, _rer, )(__VA_ARGS__)
#define fora(a, b) for (auto &&a : b)
#define forg(gi, ve) \
for (int gi = 0, f, t, c; \
gi < ve.size() && (f = ve[gi].f, t = ve[gi].t, c = ve[gi].c, true); \
gi++)
#define fort(gi, ve) \
for (int gi = 0, f, t, c; \
gi < ve.size() && (f = ve[gi].f, t = ve[gi].t, c = ve[gi].c, true); \
gi++) \
if (t != p)
// #define fort(gi, ve) for (int gi = 0, f, t, c;gi<ve.size()&& (gi+=
// (ve[gi].t==p))< ve.size() && (f = ve[gi].f,t=ve[gi].t, c = ve[gi].c,true);
// gi++)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const int inf = (int)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
const int y4[] = {-1, 1, 0, 0};
const int x4[] = {0, 0, -1, 1};
const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((int)(a).size())
#define rs resize
#define mp make_pair
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) + x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public:
// 大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) + x.second);
}
};
} // namespace std
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
ostream &operator<<(ostream &os, P p) {
os << p.fi << " " << p.se << endl;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec[0].size(); j++) {
os << vec[i][j];
}
os << endl;
}
return os;
}
template <typename V, typename H> void resize(vector<V> &vec, const H head) {
vec.resize(head);
}
template <typename V, typename H, typename... T>
void resize(vector<V> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
template <typename T, typename _Pr>
bool all_of(const vector<T> &vec, _Pr pred) {
return std::all_of(vec.begin(), vec.end(), pred);
}
template <typename T, typename _Pr>
bool any_of(const vector<T> &vec, _Pr pred) {
return std::any_of(vec.begin(), vec.end(), pred);
}
template <typename T, typename _Pr>
bool none_of(const vector<T> &vec, _Pr pred) {
return std::none_of(vec.begin(), vec.end(), pred);
}
template <typename T, typename _Pr>
const typename vector<T>::const_iterator find_if(const vector<T> &vec,
_Pr pred) {
return std::find_if(vec.begin(), vec.end(), pred);
}
template <typename T> bool contains(const vector<T> &vec, const T &val) {
return std::find(vec.begin(), vec.end(), val) != vec.end();
}
template <typename T, typename _Pr>
bool contains_if(const vector<T> &vec, _Pr pred) {
return std::find_if(vec.begin(), vec.end(), pred) != vec.end();
}
template <class T> void replace(vector<T> &a, T key, T v) {
replace(a.begin(), a.end(), key, v);
}
template <class T> void replace(str &a, T key, T v) {
replace(a.begin(), a.end(), key, v);
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
template <class T> T pop(set<T> &set) {
T res = *set.begin();
set.erase(set.find(res));
return res;
}
template <class T> T pop(mset<T> &set) {
T res = *set.begin();
set.erase(set.find(res));
return res;
}
template <class T> T popBack(set<T> &set) {
T res = *set.rbegin();
set.erase(set.find(res));
return res;
}
template <class T> T popBack(mset<T> &set) {
T res = *set.rbegin();
set.erase(set.find(res));
return res;
}
inline void sort(string &a) { sort(a.begin(), a.end()); }
template <class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); }
template <class T> inline void sort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len);
}
template <class T, class F> inline void sort(vector<T> &a, F f) {
sort(a.begin(), a.end(), [&](T a, T b) { return f(a) < f(b); });
}
enum ___pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
inline void sort(vector<P> &a, ___pcomparator type) {
switch (type) {
case fisi:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
break;
case fisd:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
break;
case fdsi:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
break;
case fdsd:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
break;
case sifi:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
break;
case sifd:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
break;
case sdfi:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
break;
case sdfd:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
break;
}
};
inline void sort(vector<T> &a, ___pcomparator type) {
switch (type) {
case fisi:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
break;
case fisd:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
break;
case fdsi:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
break;
case fdsd:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
break;
case sifi:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
break;
case sifd:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
break;
case sdfi:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
break;
case sdfd:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
break;
}
};
template <class T> inline void rsort(vector<T> &a) {
sort(a.begin(), a.end(), greater<T>());
};
template <class T> inline void rsort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len, greater<T>());
};
template <class U, class F> inline void rsort(vector<U> &a, F f) {
sort(a.begin(), a.end(), [&](U l, U r) { return f(l) > f(r); });
};
template <class U> inline void sortp(vector<U> &a, vector<U> &b) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
sort(c);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
;
}
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class U, class F> inline void sortp(vector<U> &a, vector<U> &b, F f) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
sort(c, f);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U, class F>
inline void sortp(vector<U> &a, vector<U> &b, char type) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
sort(c, type);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U> inline void rsortp(vector<U> &a, vector<U> &b) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
rsort(c);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U, class F>
inline void rsortp(vector<U> &a, vector<U> &b, F f) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
rsort(c, f);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U> inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c) {
vt r;
int n = sz(a);
assert(n == sz(b));
assert(n == sz(c));
rep(i, n) r.eb(a[i], b[i], c[i]);
sort(r);
rep(i, n) {
a[i] = r[i].f;
b[i] = r[i].s;
c[i] = r[i].t;
}
};
template <class U, class F>
inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {
vt r;
int n = sz(a);
assert(n == sz(b));
assert(n == sz(c));
rep(i, n) r.eb(a[i], b[i], c[i]);
sort(r, f);
rep(i, n) {
a[i] = r[i].f;
b[i] = r[i].s;
c[i] = r[i].t;
}
};
template <class U, class F>
inline void rsortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {
vt r;
int n = sz(a);
assert(n == sz(b));
assert(n == sz(c));
rep(i, n) r.eb(a[i], b[i], c[i]);
rsort(r, f);
rep(i, n) {
a[i] = r[i].f;
b[i] = r[i].s;
c[i] = r[i].t;
}
};
template <class T> inline void sort2(vector<vector<T>> &a) {
for (int i = 0, n = a.size(); i < n; i++)
sort(a[i]);
}
template <class T> inline void rsort2(vector<vector<T>> &a) {
for (int i = 0, n = a.size(); i < n; i++)
rsort(a[i]);
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename V, typename T> void fill(V &xx, const T vall) { xx = vall; }
template <typename V, typename T> void fill(vector<V> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
//@汎用便利関数 入力
template <typename T = int> T _in() {
T x;
cin >> x;
return (x);
}
#define _overloadin(_1, _2, _3, _4, name, ...) name
#define in0() _in()
#define in1(a) cin >> a
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define in4(a, b, c, d) cin >> a >> b >> c >> d
#define in(...) _overloadin(__VA_ARGS__, in4, in3, in2, in1, in0)(__VA_ARGS__)
#define _overloaddin(_1, _2, _3, _4, name, ...) name
#define din1(a) \
int a; \
cin >> a
#define din2(a, b) \
int a, b; \
cin >> a >> b
#define din3(a, b, c) \
int a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
int a, b, c, d; \
cin >> a >> b >> c >> d
#define din(...) _overloadin(__VA_ARGS__, din4, din3, din2, din1)(__VA_ARGS__)
#define _overloaddind(_1, _2, _3, _4, name, ...) name
#define din1d(a) \
int a; \
cin >> a; \
a--
#define din2d(a, b) \
int a, b; \
cin >> a >> b; \
a--, b--
#define din3d(a, b, c) \
int a, b, c; \
cin >> a >> b >> c; \
a--, b--, c--
#define din4d(a, b, c, d) \
int a, b, c, d; \
cin >> a >> b >> c >> d; \
; \
a--, b--, c--, d--
#define dind(...) \
_overloaddind(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
#define _overloadout(_1, _2, _3, _4, name, ...) name
#define out1(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define out3(a, b, c) cout << a << " " << b << " " << c << endl
#define out4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define out(...) _overloadout(__VA_ARGS__, out4, out3, out2, out1)(__VA_ARGS__)
#define _overloadoutl(_1, _2, _3, _4, name, ...) name
#define outl1(a) cout << a << endl
#define outl2(a, b) \
cout << a << endl; \
cout << b << endl
#define outl3(a, b, c) \
cout << a << endl; \
cout << b << endl; \
cout << c << endl
#define outl4(a, b, c, d) \
cout << a << endl; \
cout << b << endl; \
cout << c << endl; \
cout << d << endl
#define outl(...) \
_overloadout(__VA_ARGS__, outl4, outl3, outl2, outl1)(__VA_ARGS__)
string sin() { return _in<string>(); }
ll lin() { return _in<ll>(); }
#define na(a, n) \
a.resize(n); \
rep(i, n) cin >> a[i];
#define nao(a, n) \
a.resize(n + 1); \
rep(i, n) cin >> a[i + 1];
#define nad(a, n) \
a.resize(n); \
rep(i, n) { \
cin >> a[i]; \
a[i]--; \
}
#define na2(a, b, n) \
a.resize(n), b.resize(n); \
rep(i, n) cin >> a[i] >> b[i];
#define nao2(a, b, n) \
a.resize(n + 1), b.resize(n + 1); \
rep(i, n) cin >> a[i + 1] >> b[i + 1];
#define na2d(a, b, n) \
a.resize(n), b.resize(n); \
rep(i, n) { \
cin >> a[i] >> b[i]; \
a[i]--, b[i]--; \
}
#define na3(a, b, c, n) \
a.resize(n), b.resize(n), c.resize(n); \
rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define na3d(a, b, c, n) \
a.resize(n), b.resize(n), c.resize(n); \
rep(i, n) { \
cin >> a[i] >> b[i] >> c[i]; \
a[i]--, b[i]--, c[i]--; \
}
#define nt(a, h, w) \
resize(a, h, w); \
rep(hi, h) rep(wi, w) cin >> a[hi][wi];
#define ntd(a, h, w) \
rs(a, h, w); \
rep(hi, h) rep(wi, w) cin >> a[hi][wi], a[hi][wi]--;
#define ntp(a, h, w) \
fill(a, '#'); \
rep(hi, 1, h + 1) rep(wi, 1, w + 1) cin >> a[hi][wi];
// デバッグ
#define sp << " " <<
#define debugName(VariableName) #VariableName
#define _deb1(x) cerr << debugName(x) << " = " << x << endl
#define _deb2(x, y) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< endl
#define _deb3(x, y, z) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< ", " debugName(z) << " = " << z << endl
#define _deb4(x, y, z, a) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< ", " << debugName(z) << " = " << z << ", " << debugName(a) << " = " \
<< a << endl
#define _deb5(x, y, z, a, b) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< ", " << debugName(z) << " = " << z << ", " << debugName(a) << " = " \
<< a << ", " << debugName(b) << " = " << b << endl
#define _overloadebug(_1, _2, _3, _4, _5, name, ...) name
#define debug(...) \
_overloadebug(__VA_ARGS__, _deb5, _deb4, _deb3, _deb2, _deb1)(__VA_ARGS__)
#ifdef _DEBUG
#define deb(...) \
_overloadebug(__VA_ARGS__, _deb5, _deb4, _deb3, _deb2, _deb1)(__VA_ARGS__)
#else
#define deb(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// よく使うクラス、構造体
class UnionFind {
public:
vi par, rank, sizes;
int n, trees;
UnionFind(int n) : n(n), trees(n) {
par.resize(n), rank.resize(n), sizes.resize(n);
rep(i, n) par[i] = i, sizes[i] = 1;
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
int find(int x) { return root(x); }
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y])
swap(x, y);
trees--;
par[y] = x;
sizes[x] += sizes[y];
if (rank[x] == rank[y])
rank[x]++;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return sizes[root(x)]; }
// 順不同 umapなので
vec<vi> sets() {
vec<vi> res(trees);
umap<int, vi> map;
rep(i, n) map[root(i)].push_back(i);
int i = 0;
for (auto &&p : map) {
int r = p.fi;
res[i].push_back(r);
for (auto &&v : p.se) {
if (r == v)
continue;
res[i].push_back(v);
}
i++;
}
return res;
}
};
using bint = __int128;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 toi128(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
template <typename T> T minv(T a, T m);
template <typename T> class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) { value = normalize(x); }
template <typename U> static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod())
v = static_cast<Type>(x);
else
v = static_cast<Type>(x % mod());
if (v < 0)
v += mod();
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> Modular &operator+=(const U &other) {
return *this += Modular(other);
}
template <typename U> Modular &operator-=(const U &other) {
return *this -= Modular(other);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(signed) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(signed) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, signed>::value,
Modular>::type &
operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),
d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod()));
value = m;
#else
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
Modular>::type &
operator*=(const Modular &rhs) {
int64_t q =
static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value,
Modular>::type &
operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) {
return *this *= Modular(minv(other.value, mod()));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
constexpr signed MOD = 1000000007;
using mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
template <typename T> T minv(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T, typename U>
Modular<T> mpow(const Modular<T> &a, const U &b) {
assert(b >= 0);
int x = a(), res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U> Modular<T> mpow(const T &a, const U &b) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T> string to_string(const Modular<T> &number) {
return to_string(number());
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
return stream << number();
}
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
using PM = pair<mint, mint>;
using vm = vector<mint>;
#define _overloadvvm(_1, _2, _3, _4, name, ...) name
#define vvm1(a) vec<vm> a
#define vvm2(a, b) vec<vm> a(b)
#define vvm3(a, b, c) vec<vm> a(b, vm(c))
#define vvm4(a, b, c, d) vec<vm> a(b, vm(c, d))
#define vvm(...) _overloadvvm(__VA_ARGS__, vvm4, vvm3, vvm2, vvm1)(__VA_ARGS__)
vb isPrime;
vi primes;
void setPrime() {
int len = 4010101;
isPrime.resize(4010101);
fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= sqrt(len) + 5; ++i) {
if (!isPrime[i])
continue;
for (int j = 2; i * j < len; ++j) {
isPrime[i * j] = false;
}
}
rep(i, len) if (isPrime[i]) primes.pb(i);
}
// 幾何 Pをcomplexとして扱う
bool eq(double a, double b) { return fabs(a - b) < eps; }
using C = complex<double>;
C rot(C &a, dou th) { return a * C(cos(th), sin(th)); }
dou inpro(C &a, C &b) { return real(a * conj(b)); }
// 90度回転させて内積が0なら平行
bool line(C a, C b, C c) {
C ab = b - a;
C ac = c - a;
// 複素数の掛け算は回転
ab *= C(0, 1);
return eq(inpro(ab, ac), 0);
}
bool line(P a, P b, P c) {
return line(C(a.fi, a.se), C(b.fi, b.se), C(c.fi, c.se));
}
bool line(int xa, int ya, int xb, int yb, int xc, int yc) {
C a = C(xa, ya);
C b = C(xb, yb);
C c = C(xc, yc);
return line(a, b, c);
}
// 便利関数
// テスト用
char ranc() { return (char)('a' + rand() % 26); }
int rand(int min, int max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
//+
if (rand() % 2) {
return rand(0, max);
//-
} else {
return -rand(0, -min);
}
}
}
vi ranv(int n, int min, int max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
// 単調増加
vi ranvi(int n, int min, int max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
void ranvlr(int n, int min, int max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
// 便利 汎用
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else {
rep(i, sz(a)) {
if (a[i] < b[i]) {
return b;
} else if (a[i] > b[i])
return a;
}
}
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) < sz(b)) {
return a;
} else if (sz(a) > sz(b)) {
return b;
} else {
rep(i, sz(a)) {
if (a[i] < b[i]) {
return a;
} else if (a[i] > b[i])
return b;
}
}
return a;
}
template <typename V, typename T> int find(vector<V> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename V, typename T> P find(vector<vector<V>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
template <typename V, typename U>
T find(vector<vector<vector<V>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
template <typename V, typename T> int count(V &a, const T k) { return a == k; }
template <typename V, typename T> int count(vector<V> &a, const T k) {
int ret = 0;
fora(v, a) ret += count(v, k);
return ret;
}
template <typename V> int count_odd(V &a) { return a % 2; }
template <typename V> int count_odd(vector<V> &a) {
int ret = 0;
fora(v, a) ret += count_odd(v);
return ret;
}
template <typename V> int count_even(V &a) { return a % 2 == 0; }
template <typename V> int count_even(vector<V> &a) {
int ret = 0;
fora(v, a) ret += count_even(v);
return ret;
}
// algorythm
void iota(vector<int> &ve, int s, int n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(int s, int n) {
vi ve(n);
iota(all(ve), s);
return ve;
}
// 便利 数学
int mod(int a, int m) { return (a % m + m) % m; }
int pow(int a) { return a * a; };
ll fact(int v) { return v <= 1 ? 1 : v * fact(v - 1); }
ll comi(int n, int r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll gcd(vi b) {
ll res = b[0];
for (auto &&v : b)
res = gcd(v, res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
void rev(string &a) { reverse(all(a)); }
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
res++;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return (1 + t) * t / 2; }
ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }
vi divisors(int v) {
vi res;
double lim = std::sqrt(v);
for (int i = 1; i <= lim; ++i) {
if (v % i == 0) {
res.pb(i);
if (i != v / i)
res.pb(v / i);
}
}
return res;
}
vi factorization(int v) {
int tv = v;
vi res;
if (isPrime.size() == 0)
setPrime();
for (auto &&p : primes) {
if (v % p == 0)
res.push_back(p);
while (v % p == 0) {
v /= p;
}
if (v == 1 || p * p > tv)
break;
}
if (v > 1)
res.pb(v);
return res;
}
unordered_map<int, int> factorizationMap(int v) {
int tv = v;
unordered_map<int, int> res;
if (isPrime.size() == 0)
setPrime();
for (auto &&p : primes) {
while (v % p == 0) {
res[p]++;
v /= p;
}
if (v == 1 || p * p > tv)
break;
}
if (v > 1)
res[v]++;
return res;
}
int get(int a, int keta) { return (a / (int)pow(10, keta)) % 10; }
int keta(int v) {
int cou = 0;
while (v) {
cou++, v %= 10;
}
return cou;
}
int dsum(int v) {
int ret = 0;
for (; v; v /= 10)
ret += v % 10;
return ret;
}
int sumd(int v) { return dsum(v); }
// 変換系
template <class T, class U> vector<T> keys(vector<pair<T, U>> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.fi);
return res;
}
template <class T, class U> vector<U> keys(map<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.fi);
return res;
}
template <class T, class U> vector<U> keys(umap<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.fi);
return res;
}
template <class T, class U> vector<U> values(vector<pair<T, U>> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.se);
return res;
}
template <class T, class U> vector<T> values(map<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.se);
return res;
}
template <class T, class U> vector<T> values(umap<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.se);
return res;
}
vi list(int a) {
vi res;
while (a) {
res.insert(res.begin(), a % 10);
a /= 10;
}
return res;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class U> bool chmax(const U &b) { return chmax(ma, b); }
template <class T, class U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class U> bool chmin(const U &b) { return chmin(mi, b); }
#define chmi chmin
#define chma chmax
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> a) { return *min_element(all(a)); }
template <class T> T min(vector<T> a, int n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> a, int s, int n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> a) { return *max_element(all(a)); }
template <class T> T max(vector<T> a, int n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> a, int s, int n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> v, int len = -1) {
if (len == -1)
len = v.size();
T res = 0;
chmin(len, v.size());
rep(i, len) res += v[i];
return res;
}
template <class T> T sum(vector<vector<T>> &v, int h = -1, int w = -1) {
if (h == -1)
h = v.size();
if (w == -1)
w = v[0].size();
T res = 0;
chmin(h, v.size());
chmin(w, v[0].size());
rep(i, h) rep(j, w) res += v[i][j];
return res;
}
P sump(vp &v, int len = -1) {
if (len == -1)
len = v.size();
P res = {0, 0};
chmin(len, v.size());
rep(i, len) {
res.fi += v[i].fi;
res.se += v[i].se;
}
return res;
}
/// 要素が0の時、返り値は0か1か
template <class T> T mul(vector<T> &v, int len = -1) {
if (len == -1)
len = v.size();
T res = 1;
chmin(len, v.size());
rep(i, len) res *= v[i];
return res;
}
void clear(PQ &q) {
while (q.size())
q.pop();
}
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(int size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(int h, int w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (int i = 1; i <= 2 * h + 1; i++) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imomi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmin(ret[i + 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
const vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
T operator()(int l, int r) {
assert(l <= r);
return rui[r] - rui[l];
}
T operator[](int i) { return rui[i]; }
};
template <class T> struct rruic {
const T *rrui;
rruic(T *ru) : rrui(ru) {}
// n-1から-1へ
T operator()(int l, int r) {
assert(l >= r);
return rrui[r] - rrui[l];
}
T operator[](int i) { return rrui[i]; }
};
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
// xor
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> rruic<T> rrui(vector<T> &a) {
int len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
rer(i, len - 1) res[i - 1] = res[i] + a[i];
return rruic<T>(res);
}
// 掛け算
template <class T> T *rruim(vector<T> &a) {
int len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T> void inc(vector<T> &a) {
for (auto &u : a)
inc(u, 1);
}
template <class T, class U> void plus(T &a, U v = 1) { a += v; }
template <class T, class U> void plus(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T> void plus(vector<T> &a) {
for (auto &u : a)
inc(u, 1);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void dec(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
template <class T, class U> void minu(T &a, U v = 1) { a -= v; }
template <class T, class U> void minu(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void minu(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
inline bool inside(int h, int w, int H, int W) {
return h >= 0 && w >= 0 && h < H && w < W;
}
inline bool inside(int v, int l, int r) { return l <= v && v < r; }
#define ins inside
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(const vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
ll goldd(ll left, ll right, function<ll(ll)> calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; i++) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
ll goldt(ll left, ll right, function<ll(ll)> calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; i++) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmin(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chmax(res, *max_element(all(a[i])));
return res;
}
bool bget(ll m, int keta) { return (m >> keta) & 1; }
int bget(ll m, int keta, int sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
inline ll bit(int n) { return (1LL << (n)); }
inline ll bit(int n, int sinsuu) { return (ll)pow(sinsuu, n); }
// int bcou(ll m) { return __builtin_popcount(m & 0xFFFFFFFF) +
// __builtin_popcount(m >> 32); }
#define bcou __builtin_popcountll
// 最下位ビット
int lbit(int n) { return n & -n; }
// 最上位ビット
int hbit(int n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
// 初期化は0を渡す
ll nextComb(ll &mask, int n, int r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; // 最下位の1
ll y = mask + x; // 連続した下の1を繰り上がらせる
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vl bitCombList(int n, int r) {
vl res;
int m = 0;
while (nextComb(m, n, r)) {
res.pb(m);
}
return res;
}
// 大文字小文字を区別する
int altoiaZ(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a' + 26;
}
char itoalaZ(int i) {
if (i < 26)
return 'A' + i;
return 'a' + i - 26;
}
// aもAも0を返す 基本小文字
int altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
char itoal(int i) { return 'a' + i; }
int ctoi(char c) { return c - '0'; }
char itoc(int i) { return i + '0'; }
int vtoi(vi &v) {
int res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(int i) {
vi res;
while (i) {
res.pb(i % 10);
i /= 10;
}
rev(res);
return res;
}
vector<vector<int>> ctoi(vector<vector<char>> s, char c) {
int n = sz(s), m = sz(s[0]);
vector<vector<int>> res(n, vector<int>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
void compress(vi &a) {
vi b;
int len = a.size();
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
void compress(int a[], int len) {
vi b;
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define ans(a) \
cout << a << endl; \
continue;
#define poll(a) \
q.front(); \
q.pop()
#define dpoll(a) \
q.front(); \
q.pop_front()
#define pollLast(a) \
q.back(); \
q.pop_back()
#define pollBack(a) \
q.back(); \
q.pop_back()
template <class T> inline void fin(T s) { cout << s << endl, exit(0); }
template <class T> struct edge {
int f, t;
T c;
int id;
int type;
edge(int f, int t, T c = 1, int id = -1, int ty = -1)
: f(f), t(t), c(c), id(id), type(ty) {}
bool operator<(const edge &b) const { return c < b.c; }
bool operator>(const edge &b) const { return c > b.c; }
};
template <class T> ostream &operator<<(ostream &os, edge<T> &e) {
os << e.f << " " << e.t << " " << e.c;
return os;
}
template <typename T> class graph {
protected:
vector<bool> _used;
public:
vector<vector<edge<T>>> g;
vector<edge<T>> edges;
int n;
graph(int n) : n(n) { g.resize(n), _used.resize(n); }
void clear() { g.clear(), edges.clear(); }
void resize(int n) {
this->n = n;
g.resize(n);
_used.resize(n);
}
int size() { return g.size(); }
vector<edge<T>> &operator[](int i) { return g[i]; }
virtual void add(int f, int t, T c, int id, int ty) = 0;
virtual bool used(edge<T> &e) = 0;
virtual bool used(int id) = 0;
virtual void del(edge<T> &e) = 0;
virtual void del(int id) = 0;
virtual void set_edges() = 0;
};
template <typename T = ll> class digraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
int eid = 0;
digraph(int n) : graph<T>(n) {}
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("digraph add");
deb(f, t, c, id, ty);
ole();
}
if (id == -1)
id = eid++;
g[f].emplace_back(f, t, c, id, ty);
edges.emplace_back(f, t, c, id, ty);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
void set_edges() {
if (sz(edges))
return;
rep(i, n) fora(e, g[i]) edges.pb(e);
}
};
template <class T = int> class undigraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
int eid = 0;
undigraph(int n) : graph<T>(n) {}
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("undigraph add");
deb(f, t, c, id, ty);
ole();
}
if (id == -1)
id = eid, eid += 2;
g[f].emplace_back(f, t, c, id, ty);
g[t].emplace_back(t, f, c, id + 1, ty);
edges.emplace_back(f, t, c, id, ty);
edges.emplace_back(t, f, c, id + 1, ty);
}
void add(edge<T> &e) {
int f = e.f, t = e.t, ty = e.type;
T c = e.c;
add(f, t, c, ty);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
void set_edges() {
if (sz(edges))
return;
rep(i, n) fora(e, g[i]) edges.pb(e);
}
};
template <class T>
vector<T> dijkstra(const graph<T> &g, int s, int cant_arrive = -1) {
if (!(0 <= s && s < g.n)) {
debugline("dijkstra");
deb(s, g.n);
ole();
}
T initValue = MAX(T);
vector<T> dis(g.n, initValue);
priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;
dis[s] = 0;
q.emplace(0, s);
while (q.size()) {
T nowc = q.top().fi;
int i = q.top().se;
q.pop();
if (dis[i] != nowc)
continue;
for (auto &&e : g.g[i]) {
int to = e.t;
T c = nowc + e.c;
if (dis[to] > c) {
dis[to] = c;
q.emplace(dis[to], to);
}
}
}
// 基本、たどり着かないなら-1
if (cant_arrive == -1)
for (auto &&d : dis)
if (d == initValue)
d = -1;
return dis;
}
template <class T>
vector<vector<T>> warshall(const graph<T> &g, int cant_arrive = -1) {
int n = g.n;
vector<vector<T>> dis(n, vector<T>(n, linf));
rep(i, n) fora(e, g.g[i]) chmin(dis[e.f][e.t], e.c);
rep(i, n) dis[i][i] = 0;
rep(k, n) rep(i, n) rep(j, n) chmin(dis[i][j], dis[i][k] + dis[k][j]);
// 基本、たどり着かないなら-1
if (cant_arrive == -1)
rep(i, n) rep(j, n) if (dis[i][j] == linf) dis[i][j] = -1;
return dis;
}
template <class T = int> class tree : public undigraph<T> {
public:
using undigraph<T>::g;
using undigraph<T>::n;
using undigraph<T>::edges;
using undigraph<T>::_used;
vi dep;
vi disv;
private:
bool never = 1;
int root = -1;
vector<vector<int>> par;
bool costallone;
void dfs(int v, int p, int d) {
dep[v] = d;
par[0][v] = p;
int lim = (*this)[v].size();
for (int i = 0; i < lim; i++) {
int t = g[v][i].t;
if (t == p)
con;
dfs(t, v, d + 1);
}
}
void built() {
never = 0;
n = g.size();
par.assign(30, vi(n));
dep.resize(n);
costallone = 1;
rep(i, n) fora(e, g[i]) if (e.c != 1) costallone = 0;
dfs(root, -1, 0);
rep(k, par.size() - 1) {
rep(i, n) {
if (par[k][i] == -1)
par[k + 1][i] = -1;
else
par[k + 1][i] = par[k][par[k][i]];
}
}
if (costallone)
disv = dep;
else
disv = dijkstra(*this, root);
}
int _lca(int u, int v) {
if (dep[u] > dep[v])
swap(u, v);
rep(k, par.size()) {
if ((dep[u] - dep[v]) >> k & 1) {
v = par[k][v];
}
}
if (u == v)
return u;
rer(k, par.size() - 1) {
if (par[k][u] != par[k][v]) {
u = par[k][u];
v = par[k][v];
}
}
return par[0][u];
}
int _dis(int u, int v) {
int p = _lca(u, v);
return disv[u] + disv[v] - disv[p] * 2;
}
public:
tree(int n, int root = 0) : undigraph<T>(n), root(root) {}
bool leaf(int v) { return sz(g[v]) == 1 && v != root; }
int dis(int u, int v) {
if (never) {
built();
}
return _dis(u, v);
}
int lca(int u, int v) {
if (never) {
built();
}
return _lca(u, v);
}
};
// 辺によりメモリを大量消費
// よってedgesを消している
// 頂点10^6でメモリを190MB(制限の8割)使う
// 軽量化のため、辺を持たないbig gridクラスがあってもいいかもしれない
//
template <class T = int> class grid_k6 : public undigraph<T> {
public:
using undigraph<T>::g;
using undigraph<T>::n;
using undigraph<T>::edges;
using undigraph<T>::_used;
int H, W;
int eid = 0;
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("grid_k6 add");
deb(f, t, c, id, ty);
ole();
}
g[f].emplace_back(f, t, c, eid++, ty);
g[t].emplace_back(t, f, c, eid++, ty);
}
int getid(int h, int w) {
if (!inside(h, w, H, W))
return -1;
return W * h + w;
}
P get2(int id) { return mp(id / W, id % W); }
P operator()(int id) { return get2(id); }
int operator()(int h, int w) { return getid(h, w); }
grid_k6(int H, int W) : H(H), W(W), undigraph<T>(H * W) {
rep(h, H) {
rep(w, W) {
int f = getid(h, w);
if (w + 1 < W)
add(f, getid(h, w + 1));
if (h + 1 < H)
add(f, getid(h + 1, w));
}
}
}
grid_k6(_vvc ba, char wall = '#')
: H(sz(ba)), W(sz(ba[0])), undigraph<T>(sz(ba) * sz(ba[0])) {
rep(h, H) {
rep(w, W) {
if (ba[h][w] == wall)
con;
int f = getid(h, w);
if (w + 1 < W && ba[h][w + 1] != wall) {
add(f, getid(h, w + 1));
}
if (h + 1 < H && ba[h + 1][w] != wall) {
add(f, getid(h + 1, w));
}
}
}
}
void add(int fh, int fw, int th, int tw) {
add(getid(fh, fw), getid(th, tw));
}
void set_edges() { rep(i, n) fora(e, g[i]) edges.pb(e); }
};
// 左上から右下に移動できる
template <class T = int> class digrid_k6 : public digraph<T> {
public:
using digraph<T>::g;
using digraph<T>::n;
using digraph<T>::edges;
using digraph<T>::_used;
int H, W;
int eid = 0;
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("digrid_k6 add");
deb(f, t, c, id, ty);
ole();
}
g[f].emplace_back(f, t, c, eid++, ty);
}
int getid(int h, int w) {
if (!inside(h, w, H, W))
return -1;
return W * h + w;
}
P get2(int id) { return mp(id / W, id % W); }
P operator()(int id) { return get2(id); }
int operator()(int h, int w) { return getid(h, w); }
digrid_k6(int H, int W) : H(H), W(W), digraph<T>(H * W) {
rep(h, H) {
rep(w, W) {
int f = getid(h, w);
if (w + 1 < W)
add(f, getid(h, w + 1));
if (h + 1 < H)
add(f, getid(h + 1, w));
}
}
}
digrid_k6(_vvc ba, char wall = '#')
: H(sz(ba)), W(sz(ba[0])), digraph<T>(sz(ba) * sz(ba[0])) {
rep(h, H) {
rep(w, W) {
if (ba[h][w] == wall)
con;
int f = getid(h, w);
if (w + 1 < W && ba[h][w + 1] != wall) {
add(f, getid(h, w + 1));
}
if (h + 1 < H && ba[h + 1][w] != wall) {
add(f, getid(h + 1, w));
}
}
}
}
void add(int fh, int fw, int th, int tw) {
add(getid(fh, fw), getid(th, tw));
}
void set_edges() { rep(i, n) fora(e, g[i]) edges.pb(e); }
};
template <class T> bool nibu(const graph<T> &g) {
int size = 0;
rep(i, g.n) size += sz(g.g[i]);
if (size == 0)
return true;
UnionFind uf(g.n * 2);
rep(i, g.n) fora(e, g.g[i]) uf.unite(e.f, e.t + g.n),
uf.unite(e.f + g.n, e.t);
rep(i, g.n) if (uf.same(i, i + g.n)) return 0;
return 1;
}
// 二部グラフを色分けした際の頂点数を返す
template <class T> vp nibug(graph<T> &g) {
vp cg;
if (!nibu(g)) {
debugline("nibu");
ole();
}
int _n = g.size();
vb _was(_n);
queue<P> q;
rep(i, _n) {
if (_was[i])
continue;
q.push(mp(i, 1));
_was[i] = 1;
int red = 0;
int coun = 0;
while (q.size()) {
int now = q.front().fi;
int col = q.front().se;
red += col;
coun++;
q.pop();
forg(gi, g[now]) {
if (_was[t])
continue;
q.push(mp(t, col ^ 1));
_was[t] = 1;
}
}
cg.push_back(mp(red, coun - red));
}
return cg;
}
template <class T> ostream &operator<<(ostream &os, graph<T> &g) {
rep(i, sz(g)) {
forg(gi, g[i]) { os << f << " " << t << " " << c << endl; }
}
return os;
}
// 機能拡張
vp vtop(vi &a, vi &b) {
vp res(sz(a));
rep(i, sz(a)) res[i] = mp(a[i], b[i]);
return res;
}
void ptov(vp &p, vi &a, vi &b) {
a.resize(sz(p));
b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>
operator+(const basic_string<_CharT, _Traits, _Alloc> &__lhs, const int __rv) {
basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
__str.append(to_string(__rv));
return __str;
}
template <typename _CharT, typename _Traits, typename _Alloc>
void operator+=(basic_string<_CharT, _Traits, _Alloc> &__lhs, const int __rv) {
__lhs += to_string(__rv);
}
template <typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>
operator+(const basic_string<_CharT, _Traits, _Alloc> &__lhs,
const signed __rv) {
basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
__str.append(to_string(__rv));
return __str;
}
template <typename _CharT, typename _Traits, typename _Alloc>
void operator+=(basic_string<_CharT, _Traits, _Alloc> &__lhs,
const signed __rv) {
__lhs += to_string(__rv);
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T, class U> set<T> &operator+=(set<T> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.pb(v);
return a;
}
template <class T, class U> vector<T> operator+(const vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, const vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
fora(v, b) a += v;
return a;
}
template <class T, class U>
vector<T> &operator+=(vector<T> &a, initializer_list<U> v) {
for (auto &&va : v)
a.pb(va);
return a;
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
ole();
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <typename T> void remove(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T>
void remove(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void removen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T> void erase(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void erasen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned int i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned int i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T, typename U>
void insert(vector<T> &v, initializer_list<U> list) {
for (auto &&va : list)
v.pb(va);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned int i, initializer_list<U> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
template <typename T> void insert(set<T> &v, initializer_list<T> list) {
for (auto &&va : list)
v.insert(va);
}
// 閉路がなければtrue
bool topo(vi &res, digraph<int> &g) {
int n = g.g.size();
vi nyu(n);
rep(i, n) for (auto &&e : g[i]) nyu[e.t]++;
queue<int> st;
rep(i, n) if (nyu[i] == 0) st.push(i);
while (st.size()) {
int v = st.front();
st.pop();
res.pb(v);
fora(e, g[v]) if (--nyu[e.t] == 0) st.push(e.t);
}
return res.size() == n;
}
// 辞書順最小トポロジカルソート
bool topos(vi &res, digraph<int> &g) {
int n = g.g.size();
vi nyu(n);
rep(i, n) for (auto &&e : g[i]) nyu[e.t]++;
// 小さい順
priority_queue<int, vector<int>, greater<int>> q;
rep(i, n) if (nyu[i] == 0) q.push(i);
while (q.size()) {
int i = q.top();
q.pop();
res.pb(i);
fora(e, g[i]) if (--nyu[e.t] == 0) q.push(e.t);
}
return res.size() == n;
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
int l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
string b = a + deli;
int l = 0, r = 0, n = b.size(), dn = deli.size();
vector<string> res;
rep(i, n) {
if (i + dn <= n && b.substr(i, i + dn) == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
i += dn - 1;
l = i + 1;
}
}
return res;
}
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
int n, m, k, d, H, W, x, y, z, q;
int cou;
vi a, b, c;
vvi(s, 0, 0);
vvc(ba, 0, 0);
vp p;
const int NUM_ = 1400001;
static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];
mint com(int n, int r) {
if (fac[0] == 0) {
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
if (r < 0 || r > n)
return 0;
return mint(finv[r] * fac[n] % MOD * finv[n - r]);
}
mint ncr(int n, int r) { return com(n, r); }
mint dp[202][k5];
map<int, int> was[202];
mint rec(int n, int x) {
if (n == 0) {
return x;
}
// n)でxから作れる数
if (was[n][x])
return dp[n][x];
was[n][x] = 1;
if (a[0] > x) {
dp[n][x] += fac[n] * x;
return dp[n][x];
}
// iをまず使う
rep(i, n) {
// 超えたら以降答え同じ
if (a[i] > x) {
int nx = x % a[i];
mint v = rec(i, nx) * fac[n - i - 1] * ncr(n - 1, n - i - 1);
dp[n][x] += v * (n - i); // 自分も
break;
} else {
int nx = x % a[i];
dp[n][x] += rec(i, nx) * fac[n - i - 1] * ncr(n - 1, n - i - 1);
}
}
return dp[n][x];
}
void solve() {
com(1, 1);
cin >> n >> x;
rep(i, n) cin >> a[i];
sort(a);
cout << rec(n, x) << endl;
}
int my(int n, vi a) { return 0; }
int sister(int n, vi a) { return 0; }
signed main() {
solve();
//
#define _arg n, a
#ifdef _DEBUG
bool bad = 0;
for (int i = 0, ok = 1; i < k5 && ok; i++) {
int n = rand(1, 4);
vi a = ranv(m, 1, 10);
int myres = my(_arg);
int res = sister(_arg);
ok = myres == res;
if (!ok) {
outl(_arg);
cout << "正解 : " << res << endl;
cout << "自分 : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧です。" << endl;
}
#endif
return 0;
};
| // todo 文字数を少なくする
#pragma GCC optimize("-O3")
#include <bits/stdc++.h>
using namespace std;
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} __initon;
// 衝突対策
#define ws ___ws
//@必須構造
struct T {
int f, s, t;
T() { f = -1, s = -1, t = -1; }
T(int f, int s, int t) : f(f), s(s), t(t) {}
bool operator<(const T &r) const {
return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;
// return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 大きい順
}
bool operator>(const T &r) const {
return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;
// return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 小さい順
}
bool operator==(const T &r) const { return f == r.f && s == r.s && t == r.t; }
bool operator!=(const T &r) const { return f != r.f || s != r.s || t != r.t; }
int operator[](int i) {
assert(i < 3);
return i == 0 ? f : i == 1 ? s : t;
}
};
struct F {
int a, b, c, d;
F() { a = -1, b = -1, c = -1, d = -1; }
F(int a, int b, int c, int d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d;
// return a != r.a ? a > r.a : b != r.b ? b > r.b : c != r.c ? c >
// r.c : d > r.d;
}
bool operator>(const F &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d;
// return a != r.a ? a < r.a : b != r.b ? b < r.b : c != r.c ? c <
// r.c : d < r.d;
}
bool operator==(const F &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
int operator[](int i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
T mt(int a, int b, int c) { return T(a, b, c); }
//@マクロ省略系 型,構造
#define int long long
#define ll long long
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define vec vector
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define minq 0
#define maxq 1
// マクロ省略系 コンテナ
using vi = vector<int>;
#define _overloadvvi(_1, _2, _3, _4, name, ...) name
#define vvi0() vec<vi>
#define vvi1(a) vec<vi> a
#define vvi2(a, b) vec<vi> a(b)
#define vvi3(a, b, c) vec<vi> a(b, vi(c))
#define vvi4(a, b, c, d) vec<vi> a(b, vi(c, d))
#define vvi(...) \
_overloadvvi(__VA_ARGS__, vvi4, vvi3, vvi2, vvi1, vvi0)(__VA_ARGS__)
using vl = vector<ll>;
#define _overloadvvl(_1, _2, _3, _4, name, ...) name
#define vvl1(a) vec<vl> a
#define vvl2(a, b) vec<vl> a(b)
#define vvl3(a, b, c) vec<vl> a(b, vl(c))
#define vvl4(a, b, c, d) vec<vl> a(b, vl(c, d))
#define vvl(...) _overloadvvl(__VA_ARGS__, vvl4, vvl3, vvl2, vvl1)(__VA_ARGS__)
using vb = vector<bool>;
#define _overloadvvb(_1, _2, _3, _4, name, ...) name
#define vvb1(a) vec<vb> a
#define vvb2(a, b) vec<vb> a(b)
#define vvb3(a, b, c) vec<vb> a(b, vb(c))
#define vvb4(a, b, c, d) vec<vb> a(b, vb(c, d))
#define vvb(...) _overloadvvb(__VA_ARGS__, vvb4, vvb3, vvb2, vvb1)(__VA_ARGS__)
using vs = vector<string>;
#define _overloadvvs(_1, _2, _3, _4, name, ...) name
#define vvs1(a) vec<vs> a
#define vvs2(a, b) vec<vs> a(b)
#define vvs3(a, b, c) vec<vs> a(b, vs(c))
#define vvs4(a, b, c, d) vec<vs> a(b, vs(c, d))
#define vvs(...) _overloadvvs(__VA_ARGS__, vvs4, vvs3, vvs2, vvs1)(__VA_ARGS__)
using vd = vector<double>;
#define _overloadvvd(_1, _2, _3, _4, name, ...) name
#define vvd1(a) vec<vd> a
#define vvd2(a, b) vec<vd> a(b)
#define vvd3(a, b, c) vec<vd> a(b, vd(c))
#define vvd4(a, b, c, d) vec<vd> a(b, vd(c, d))
#define vvd(...) _overloadvvd(__VA_ARGS__, vvd4, vvd3, vvd2, vvd1)(__VA_ARGS__)
using vc = vector<char>;
#define _overloadvvc(_1, _2, _3, _4, name, ...) name
#define vvc1(a) vec<vc> a
#define vvc2(a, b) vec<vc> a(b)
#define vvc3(a, b, c) vec<vc> a(b, vc(c))
#define vvc4(a, b, c, d) vec<vc> a(b, vc(c, d))
#define vvc(...) _overloadvvc(__VA_ARGS__, vvc4, vvc3, vvc2, vvc1)(__VA_ARGS__)
using vp = vector<P>;
#define _overloadvvp(_1, _2, _3, _4, name, ...) name
#define vvp1(a) vec<vp> a
#define vvp2(a, b) vec<vp> a(b)
#define vvp3(a, b, c) vec<vp> a(b, vp(c))
#define vvp4(a, b, c, d) vec<vp> a(b, vp(c, d))
#define vvp(...) _overloadvvp(__VA_ARGS__, vvp4, vvp3, vvp2, vvp1)(__VA_ARGS__)
using vt = vector<T>;
#define _overloadvvt(_1, _2, _3, _4, name, ...) name
#define vvt1(a) vec<vt> a
#define vvt2(a, b) vec<vt> a(b)
#define vvt3(a, b, c) vec<vt> a(b, vt(c))
#define vvt4(a, b, c, d) vec<vt> a(b, vt(c, d))
#define vvt(...) _overloadvvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1)(__VA_ARGS__)
#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))
#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))
#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))
#define _vvi vector<vi>
#define _vvl vector<vl>
#define _vvb vector<vb>
#define _vvs vector<vs>
#define _vvd vector<vd>
#define _vvc vector<vc>
#define _vvp vector<vp>
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<int>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<int, int>;
using mapd = map<dou, int>;
using mapc = map<char, int>;
using maps = map<str, int>;
using seti = set<int>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<int>;
#define bset bitset
#define uset unordered_set
#define mset multiset
#define umap unordered_map
#define umapi unordered_map<int, int>
#define umapp unordered_map<P, int>
#define mmap multimap
// マクロ 繰り返し
#define _overloadrep(_1, _2, _3, _4, name, ...) name
#define _rep(i, n) for (int i = 0, _lim = n; i < _lim; i++)
#define repi(i, m, n) for (int i = m, _lim = n; i < _lim; i++)
#define repadd(i, m, n, ad) for (int i = m, _lim = n; i < _lim; i += ad)
#define rep(...) _overloadrep(__VA_ARGS__, repadd, repi, _rep, )(__VA_ARGS__)
#define _rer(i, n) for (int i = n; i >= 0; i--)
#define reri(i, m, n) for (int i = m, _lim = n; i >= _lim; i--)
#define rerdec(i, m, n, dec) for (int i = m, _lim = n; i >= _lim; i -= dec)
#define rer(...) _overloadrep(__VA_ARGS__, rerdec, reri, _rer, )(__VA_ARGS__)
#define fora(a, b) for (auto &&a : b)
#define forg(gi, ve) \
for (int gi = 0, f, t, c; \
gi < ve.size() && (f = ve[gi].f, t = ve[gi].t, c = ve[gi].c, true); \
gi++)
#define fort(gi, ve) \
for (int gi = 0, f, t, c; \
gi < ve.size() && (f = ve[gi].f, t = ve[gi].t, c = ve[gi].c, true); \
gi++) \
if (t != p)
// #define fort(gi, ve) for (int gi = 0, f, t, c;gi<ve.size()&& (gi+=
// (ve[gi].t==p))< ve.size() && (f = ve[gi].f,t=ve[gi].t, c = ve[gi].c,true);
// gi++)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const int inf = (int)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
const int y4[] = {-1, 1, 0, 0};
const int x4[] = {0, 0, -1, 1};
const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((int)(a).size())
#define rs resize
#define mp make_pair
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) + x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public:
// 大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) + x.second);
}
};
} // namespace std
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
ostream &operator<<(ostream &os, P p) {
os << p.fi << " " << p.se << endl;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec[0].size(); j++) {
os << vec[i][j];
}
os << endl;
}
return os;
}
template <typename V, typename H> void resize(vector<V> &vec, const H head) {
vec.resize(head);
}
template <typename V, typename H, typename... T>
void resize(vector<V> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
template <typename T, typename _Pr>
bool all_of(const vector<T> &vec, _Pr pred) {
return std::all_of(vec.begin(), vec.end(), pred);
}
template <typename T, typename _Pr>
bool any_of(const vector<T> &vec, _Pr pred) {
return std::any_of(vec.begin(), vec.end(), pred);
}
template <typename T, typename _Pr>
bool none_of(const vector<T> &vec, _Pr pred) {
return std::none_of(vec.begin(), vec.end(), pred);
}
template <typename T, typename _Pr>
const typename vector<T>::const_iterator find_if(const vector<T> &vec,
_Pr pred) {
return std::find_if(vec.begin(), vec.end(), pred);
}
template <typename T> bool contains(const vector<T> &vec, const T &val) {
return std::find(vec.begin(), vec.end(), val) != vec.end();
}
template <typename T, typename _Pr>
bool contains_if(const vector<T> &vec, _Pr pred) {
return std::find_if(vec.begin(), vec.end(), pred) != vec.end();
}
template <class T> void replace(vector<T> &a, T key, T v) {
replace(a.begin(), a.end(), key, v);
}
template <class T> void replace(str &a, T key, T v) {
replace(a.begin(), a.end(), key, v);
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
template <class T> T pop(set<T> &set) {
T res = *set.begin();
set.erase(set.find(res));
return res;
}
template <class T> T pop(mset<T> &set) {
T res = *set.begin();
set.erase(set.find(res));
return res;
}
template <class T> T popBack(set<T> &set) {
T res = *set.rbegin();
set.erase(set.find(res));
return res;
}
template <class T> T popBack(mset<T> &set) {
T res = *set.rbegin();
set.erase(set.find(res));
return res;
}
inline void sort(string &a) { sort(a.begin(), a.end()); }
template <class T> inline void sort(vector<T> &a) { sort(a.begin(), a.end()); }
template <class T> inline void sort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len);
}
template <class T, class F> inline void sort(vector<T> &a, F f) {
sort(a.begin(), a.end(), [&](T a, T b) { return f(a) < f(b); });
}
enum ___pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
inline void sort(vector<P> &a, ___pcomparator type) {
switch (type) {
case fisi:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
break;
case fisd:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
break;
case fdsi:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
break;
case fdsd:
sort(all(a),
[&](P l, P r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
break;
case sifi:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
break;
case sifd:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
break;
case sdfi:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
break;
case sdfd:
sort(all(a),
[&](P l, P r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
break;
}
};
inline void sort(vector<T> &a, ___pcomparator type) {
switch (type) {
case fisi:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
break;
case fisd:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
break;
case fdsi:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
break;
case fdsd:
sort(all(a), [&](T l, T r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
break;
case sifi:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
break;
case sifd:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
break;
case sdfi:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
break;
case sdfd:
sort(all(a), [&](T l, T r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
break;
}
};
template <class T> inline void rsort(vector<T> &a) {
sort(a.begin(), a.end(), greater<T>());
};
template <class T> inline void rsort(vector<T> &a, int len) {
sort(a.begin(), a.begin() + len, greater<T>());
};
template <class U, class F> inline void rsort(vector<U> &a, F f) {
sort(a.begin(), a.end(), [&](U l, U r) { return f(l) > f(r); });
};
template <class U> inline void sortp(vector<U> &a, vector<U> &b) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
sort(c);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
;
}
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class U, class F> inline void sortp(vector<U> &a, vector<U> &b, F f) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
sort(c, f);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U, class F>
inline void sortp(vector<U> &a, vector<U> &b, char type) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
sort(c, type);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U> inline void rsortp(vector<U> &a, vector<U> &b) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
rsort(c);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U, class F>
inline void rsortp(vector<U> &a, vector<U> &b, F f) {
vp c;
int n = sz(a);
assert(n == sz(b));
rep(i, n) c.eb(a[i], b[i]);
rsort(c, f);
rep(i, n) {
a[i] = c[i].first;
b[i] = c[i].second;
}
};
template <class U> inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c) {
vt r;
int n = sz(a);
assert(n == sz(b));
assert(n == sz(c));
rep(i, n) r.eb(a[i], b[i], c[i]);
sort(r);
rep(i, n) {
a[i] = r[i].f;
b[i] = r[i].s;
c[i] = r[i].t;
}
};
template <class U, class F>
inline void sortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {
vt r;
int n = sz(a);
assert(n == sz(b));
assert(n == sz(c));
rep(i, n) r.eb(a[i], b[i], c[i]);
sort(r, f);
rep(i, n) {
a[i] = r[i].f;
b[i] = r[i].s;
c[i] = r[i].t;
}
};
template <class U, class F>
inline void rsortt(vector<U> &a, vector<U> &b, vector<U> &c, F f) {
vt r;
int n = sz(a);
assert(n == sz(b));
assert(n == sz(c));
rep(i, n) r.eb(a[i], b[i], c[i]);
rsort(r, f);
rep(i, n) {
a[i] = r[i].f;
b[i] = r[i].s;
c[i] = r[i].t;
}
};
template <class T> inline void sort2(vector<vector<T>> &a) {
for (int i = 0, n = a.size(); i < n; i++)
sort(a[i]);
}
template <class T> inline void rsort2(vector<vector<T>> &a) {
for (int i = 0, n = a.size(); i < n; i++)
rsort(a[i]);
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename V, typename T> void fill(V &xx, const T vall) { xx = vall; }
template <typename V, typename T> void fill(vector<V> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
//@汎用便利関数 入力
template <typename T = int> T _in() {
T x;
cin >> x;
return (x);
}
#define _overloadin(_1, _2, _3, _4, name, ...) name
#define in0() _in()
#define in1(a) cin >> a
#define in2(a, b) cin >> a >> b
#define in3(a, b, c) cin >> a >> b >> c
#define in4(a, b, c, d) cin >> a >> b >> c >> d
#define in(...) _overloadin(__VA_ARGS__, in4, in3, in2, in1, in0)(__VA_ARGS__)
#define _overloaddin(_1, _2, _3, _4, name, ...) name
#define din1(a) \
int a; \
cin >> a
#define din2(a, b) \
int a, b; \
cin >> a >> b
#define din3(a, b, c) \
int a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
int a, b, c, d; \
cin >> a >> b >> c >> d
#define din(...) _overloadin(__VA_ARGS__, din4, din3, din2, din1)(__VA_ARGS__)
#define _overloaddind(_1, _2, _3, _4, name, ...) name
#define din1d(a) \
int a; \
cin >> a; \
a--
#define din2d(a, b) \
int a, b; \
cin >> a >> b; \
a--, b--
#define din3d(a, b, c) \
int a, b, c; \
cin >> a >> b >> c; \
a--, b--, c--
#define din4d(a, b, c, d) \
int a, b, c, d; \
cin >> a >> b >> c >> d; \
; \
a--, b--, c--, d--
#define dind(...) \
_overloaddind(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
#define _overloadout(_1, _2, _3, _4, name, ...) name
#define out1(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define out3(a, b, c) cout << a << " " << b << " " << c << endl
#define out4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define out(...) _overloadout(__VA_ARGS__, out4, out3, out2, out1)(__VA_ARGS__)
#define _overloadoutl(_1, _2, _3, _4, name, ...) name
#define outl1(a) cout << a << endl
#define outl2(a, b) \
cout << a << endl; \
cout << b << endl
#define outl3(a, b, c) \
cout << a << endl; \
cout << b << endl; \
cout << c << endl
#define outl4(a, b, c, d) \
cout << a << endl; \
cout << b << endl; \
cout << c << endl; \
cout << d << endl
#define outl(...) \
_overloadout(__VA_ARGS__, outl4, outl3, outl2, outl1)(__VA_ARGS__)
string sin() { return _in<string>(); }
ll lin() { return _in<ll>(); }
#define na(a, n) \
a.resize(n); \
rep(i, n) cin >> a[i];
#define nao(a, n) \
a.resize(n + 1); \
rep(i, n) cin >> a[i + 1];
#define nad(a, n) \
a.resize(n); \
rep(i, n) { \
cin >> a[i]; \
a[i]--; \
}
#define na2(a, b, n) \
a.resize(n), b.resize(n); \
rep(i, n) cin >> a[i] >> b[i];
#define nao2(a, b, n) \
a.resize(n + 1), b.resize(n + 1); \
rep(i, n) cin >> a[i + 1] >> b[i + 1];
#define na2d(a, b, n) \
a.resize(n), b.resize(n); \
rep(i, n) { \
cin >> a[i] >> b[i]; \
a[i]--, b[i]--; \
}
#define na3(a, b, c, n) \
a.resize(n), b.resize(n), c.resize(n); \
rep(i, n) cin >> a[i] >> b[i] >> c[i];
#define na3d(a, b, c, n) \
a.resize(n), b.resize(n), c.resize(n); \
rep(i, n) { \
cin >> a[i] >> b[i] >> c[i]; \
a[i]--, b[i]--, c[i]--; \
}
#define nt(a, h, w) \
resize(a, h, w); \
rep(hi, h) rep(wi, w) cin >> a[hi][wi];
#define ntd(a, h, w) \
rs(a, h, w); \
rep(hi, h) rep(wi, w) cin >> a[hi][wi], a[hi][wi]--;
#define ntp(a, h, w) \
fill(a, '#'); \
rep(hi, 1, h + 1) rep(wi, 1, w + 1) cin >> a[hi][wi];
// デバッグ
#define sp << " " <<
#define debugName(VariableName) #VariableName
#define _deb1(x) cerr << debugName(x) << " = " << x << endl
#define _deb2(x, y) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< endl
#define _deb3(x, y, z) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< ", " debugName(z) << " = " << z << endl
#define _deb4(x, y, z, a) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< ", " << debugName(z) << " = " << z << ", " << debugName(a) << " = " \
<< a << endl
#define _deb5(x, y, z, a, b) \
cerr << debugName(x) << " = " << x << ", " << debugName(y) << " = " << y \
<< ", " << debugName(z) << " = " << z << ", " << debugName(a) << " = " \
<< a << ", " << debugName(b) << " = " << b << endl
#define _overloadebug(_1, _2, _3, _4, _5, name, ...) name
#define debug(...) \
_overloadebug(__VA_ARGS__, _deb5, _deb4, _deb3, _deb2, _deb1)(__VA_ARGS__)
#ifdef _DEBUG
#define deb(...) \
_overloadebug(__VA_ARGS__, _deb5, _deb4, _deb3, _deb2, _deb1)(__VA_ARGS__)
#else
#define deb(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// よく使うクラス、構造体
class UnionFind {
public:
vi par, rank, sizes;
int n, trees;
UnionFind(int n) : n(n), trees(n) {
par.resize(n), rank.resize(n), sizes.resize(n);
rep(i, n) par[i] = i, sizes[i] = 1;
}
int root(int x) {
if (par[x] == x)
return x;
else
return par[x] = root(par[x]);
}
int find(int x) { return root(x); }
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y])
swap(x, y);
trees--;
par[y] = x;
sizes[x] += sizes[y];
if (rank[x] == rank[y])
rank[x]++;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return sizes[root(x)]; }
// 順不同 umapなので
vec<vi> sets() {
vec<vi> res(trees);
umap<int, vi> map;
rep(i, n) map[root(i)].push_back(i);
int i = 0;
for (auto &&p : map) {
int r = p.fi;
res[i].push_back(r);
for (auto &&v : p.se) {
if (r == v)
continue;
res[i].push_back(v);
}
i++;
}
return res;
}
};
using bint = __int128;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 toi128(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
template <typename T> T minv(T a, T m);
template <typename T> class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) { value = normalize(x); }
template <typename U> static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod())
v = static_cast<Type>(x);
else
v = static_cast<Type>(x % mod());
if (v < 0)
v += mod();
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> Modular &operator+=(const U &other) {
return *this += Modular(other);
}
template <typename U> Modular &operator-=(const U &other) {
return *this -= Modular(other);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(signed) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(signed) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, signed>::value,
Modular>::type &
operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),
d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod()));
value = m;
#else
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
Modular>::type &
operator*=(const Modular &rhs) {
int64_t q =
static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value,
Modular>::type &
operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) {
return *this *= Modular(minv(other.value, mod()));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
constexpr signed MOD = 1000000007;
using mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
template <typename T> T minv(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T, typename U>
Modular<T> mpow(const Modular<T> &a, const U &b) {
assert(b >= 0);
int x = a(), res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U> Modular<T> mpow(const T &a, const U &b) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T> string to_string(const Modular<T> &number) {
return to_string(number());
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
return stream << number();
}
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
using PM = pair<mint, mint>;
using vm = vector<mint>;
#define _overloadvvm(_1, _2, _3, _4, name, ...) name
#define vvm1(a) vec<vm> a
#define vvm2(a, b) vec<vm> a(b)
#define vvm3(a, b, c) vec<vm> a(b, vm(c))
#define vvm4(a, b, c, d) vec<vm> a(b, vm(c, d))
#define vvm(...) _overloadvvm(__VA_ARGS__, vvm4, vvm3, vvm2, vvm1)(__VA_ARGS__)
vb isPrime;
vi primes;
void setPrime() {
int len = 4010101;
isPrime.resize(4010101);
fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= sqrt(len) + 5; ++i) {
if (!isPrime[i])
continue;
for (int j = 2; i * j < len; ++j) {
isPrime[i * j] = false;
}
}
rep(i, len) if (isPrime[i]) primes.pb(i);
}
// 幾何 Pをcomplexとして扱う
bool eq(double a, double b) { return fabs(a - b) < eps; }
using C = complex<double>;
C rot(C &a, dou th) { return a * C(cos(th), sin(th)); }
dou inpro(C &a, C &b) { return real(a * conj(b)); }
// 90度回転させて内積が0なら平行
bool line(C a, C b, C c) {
C ab = b - a;
C ac = c - a;
// 複素数の掛け算は回転
ab *= C(0, 1);
return eq(inpro(ab, ac), 0);
}
bool line(P a, P b, P c) {
return line(C(a.fi, a.se), C(b.fi, b.se), C(c.fi, c.se));
}
bool line(int xa, int ya, int xb, int yb, int xc, int yc) {
C a = C(xa, ya);
C b = C(xb, yb);
C c = C(xc, yc);
return line(a, b, c);
}
// 便利関数
// テスト用
char ranc() { return (char)('a' + rand() % 26); }
int rand(int min, int max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
//+
if (rand() % 2) {
return rand(0, max);
//-
} else {
return -rand(0, -min);
}
}
}
vi ranv(int n, int min, int max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
// 単調増加
vi ranvi(int n, int min, int max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
void ranvlr(int n, int min, int max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
// 便利 汎用
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else {
rep(i, sz(a)) {
if (a[i] < b[i]) {
return b;
} else if (a[i] > b[i])
return a;
}
}
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) < sz(b)) {
return a;
} else if (sz(a) > sz(b)) {
return b;
} else {
rep(i, sz(a)) {
if (a[i] < b[i]) {
return a;
} else if (a[i] > b[i])
return b;
}
}
return a;
}
template <typename V, typename T> int find(vector<V> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename V, typename T> P find(vector<vector<V>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
template <typename V, typename U>
T find(vector<vector<vector<V>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
template <typename V, typename T> int count(V &a, const T k) { return a == k; }
template <typename V, typename T> int count(vector<V> &a, const T k) {
int ret = 0;
fora(v, a) ret += count(v, k);
return ret;
}
template <typename V> int count_odd(V &a) { return a % 2; }
template <typename V> int count_odd(vector<V> &a) {
int ret = 0;
fora(v, a) ret += count_odd(v);
return ret;
}
template <typename V> int count_even(V &a) { return a % 2 == 0; }
template <typename V> int count_even(vector<V> &a) {
int ret = 0;
fora(v, a) ret += count_even(v);
return ret;
}
// algorythm
void iota(vector<int> &ve, int s, int n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(int s, int n) {
vi ve(n);
iota(all(ve), s);
return ve;
}
// 便利 数学
int mod(int a, int m) { return (a % m + m) % m; }
int pow(int a) { return a * a; };
ll fact(int v) { return v <= 1 ? 1 : v * fact(v - 1); }
ll comi(int n, int r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll gcd(vi b) {
ll res = b[0];
for (auto &&v : b)
res = gcd(v, res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
void rev(string &a) { reverse(all(a)); }
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
res++;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return (1 + t) * t / 2; }
ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }
vi divisors(int v) {
vi res;
double lim = std::sqrt(v);
for (int i = 1; i <= lim; ++i) {
if (v % i == 0) {
res.pb(i);
if (i != v / i)
res.pb(v / i);
}
}
return res;
}
vi factorization(int v) {
int tv = v;
vi res;
if (isPrime.size() == 0)
setPrime();
for (auto &&p : primes) {
if (v % p == 0)
res.push_back(p);
while (v % p == 0) {
v /= p;
}
if (v == 1 || p * p > tv)
break;
}
if (v > 1)
res.pb(v);
return res;
}
unordered_map<int, int> factorizationMap(int v) {
int tv = v;
unordered_map<int, int> res;
if (isPrime.size() == 0)
setPrime();
for (auto &&p : primes) {
while (v % p == 0) {
res[p]++;
v /= p;
}
if (v == 1 || p * p > tv)
break;
}
if (v > 1)
res[v]++;
return res;
}
int get(int a, int keta) { return (a / (int)pow(10, keta)) % 10; }
int keta(int v) {
int cou = 0;
while (v) {
cou++, v %= 10;
}
return cou;
}
int dsum(int v) {
int ret = 0;
for (; v; v /= 10)
ret += v % 10;
return ret;
}
int sumd(int v) { return dsum(v); }
// 変換系
template <class T, class U> vector<T> keys(vector<pair<T, U>> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.fi);
return res;
}
template <class T, class U> vector<U> keys(map<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.fi);
return res;
}
template <class T, class U> vector<U> keys(umap<T, U> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.fi);
return res;
}
template <class T, class U> vector<U> values(vector<pair<T, U>> a) {
vector<U> res;
for (auto &&k : a)
res.pb(k.se);
return res;
}
template <class T, class U> vector<T> values(map<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.se);
return res;
}
template <class T, class U> vector<T> values(umap<T, U> a) {
vector<T> res;
for (auto &&k : a)
res.pb(k.se);
return res;
}
vi list(int a) {
vi res;
while (a) {
res.insert(res.begin(), a % 10);
a /= 10;
}
return res;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class U> bool chmax(const U &b) { return chmax(ma, b); }
template <class T, class U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class U> bool chmin(const U &b) { return chmin(mi, b); }
#define chmi chmin
#define chma chmax
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> a) { return *min_element(all(a)); }
template <class T> T min(vector<T> a, int n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> a, int s, int n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> a) { return *max_element(all(a)); }
template <class T> T max(vector<T> a, int n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> a, int s, int n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> v, int len = -1) {
if (len == -1)
len = v.size();
T res = 0;
chmin(len, v.size());
rep(i, len) res += v[i];
return res;
}
template <class T> T sum(vector<vector<T>> &v, int h = -1, int w = -1) {
if (h == -1)
h = v.size();
if (w == -1)
w = v[0].size();
T res = 0;
chmin(h, v.size());
chmin(w, v[0].size());
rep(i, h) rep(j, w) res += v[i][j];
return res;
}
P sump(vp &v, int len = -1) {
if (len == -1)
len = v.size();
P res = {0, 0};
chmin(len, v.size());
rep(i, len) {
res.fi += v[i].fi;
res.se += v[i].se;
}
return res;
}
/// 要素が0の時、返り値は0か1か
template <class T> T mul(vector<T> &v, int len = -1) {
if (len == -1)
len = v.size();
T res = 1;
chmin(len, v.size());
rep(i, len) res *= v[i];
return res;
}
void clear(PQ &q) {
while (q.size())
q.pop();
}
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(int size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(int h, int w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (int i = 1; i <= 2 * h + 1; i++) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imomi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmin(ret[i + 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
const vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
T operator()(int l, int r) {
assert(l <= r);
return rui[r] - rui[l];
}
T operator[](int i) { return rui[i]; }
};
template <class T> struct rruic {
const T *rrui;
rruic(T *ru) : rrui(ru) {}
// n-1から-1へ
T operator()(int l, int r) {
assert(l >= r);
return rrui[r] - rrui[l];
}
T operator[](int i) { return rrui[i]; }
};
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
// xor
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> rruic<T> rrui(vector<T> &a) {
int len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
rer(i, len - 1) res[i - 1] = res[i] + a[i];
return rruic<T>(res);
}
// 掛け算
template <class T> T *rruim(vector<T> &a) {
int len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T> void inc(vector<T> &a) {
for (auto &u : a)
inc(u, 1);
}
template <class T, class U> void plus(T &a, U v = 1) { a += v; }
template <class T, class U> void plus(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T> void plus(vector<T> &a) {
for (auto &u : a)
inc(u, 1);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void dec(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
template <class T, class U> void minu(T &a, U v = 1) { a -= v; }
template <class T, class U> void minu(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void minu(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
inline bool inside(int h, int w, int H, int W) {
return h >= 0 && w >= 0 && h < H && w < W;
}
inline bool inside(int v, int l, int r) { return l <= v && v < r; }
#define ins inside
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(const vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
ll goldd(ll left, ll right, function<ll(ll)> calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; i++) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
ll goldt(ll left, ll right, function<ll(ll)> calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; i++) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmin(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chmax(res, *max_element(all(a[i])));
return res;
}
bool bget(ll m, int keta) { return (m >> keta) & 1; }
int bget(ll m, int keta, int sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
inline ll bit(int n) { return (1LL << (n)); }
inline ll bit(int n, int sinsuu) { return (ll)pow(sinsuu, n); }
// int bcou(ll m) { return __builtin_popcount(m & 0xFFFFFFFF) +
// __builtin_popcount(m >> 32); }
#define bcou __builtin_popcountll
// 最下位ビット
int lbit(int n) { return n & -n; }
// 最上位ビット
int hbit(int n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
// 初期化は0を渡す
ll nextComb(ll &mask, int n, int r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; // 最下位の1
ll y = mask + x; // 連続した下の1を繰り上がらせる
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vl bitCombList(int n, int r) {
vl res;
int m = 0;
while (nextComb(m, n, r)) {
res.pb(m);
}
return res;
}
// 大文字小文字を区別する
int altoiaZ(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a' + 26;
}
char itoalaZ(int i) {
if (i < 26)
return 'A' + i;
return 'a' + i - 26;
}
// aもAも0を返す 基本小文字
int altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
char itoal(int i) { return 'a' + i; }
int ctoi(char c) { return c - '0'; }
char itoc(int i) { return i + '0'; }
int vtoi(vi &v) {
int res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(int i) {
vi res;
while (i) {
res.pb(i % 10);
i /= 10;
}
rev(res);
return res;
}
vector<vector<int>> ctoi(vector<vector<char>> s, char c) {
int n = sz(s), m = sz(s[0]);
vector<vector<int>> res(n, vector<int>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
void compress(vi &a) {
vi b;
int len = a.size();
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
void compress(int a[], int len) {
vi b;
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define ans(a) \
cout << a << endl; \
continue;
#define poll(a) \
q.front(); \
q.pop()
#define dpoll(a) \
q.front(); \
q.pop_front()
#define pollLast(a) \
q.back(); \
q.pop_back()
#define pollBack(a) \
q.back(); \
q.pop_back()
template <class T> inline void fin(T s) { cout << s << endl, exit(0); }
template <class T> struct edge {
int f, t;
T c;
int id;
int type;
edge(int f, int t, T c = 1, int id = -1, int ty = -1)
: f(f), t(t), c(c), id(id), type(ty) {}
bool operator<(const edge &b) const { return c < b.c; }
bool operator>(const edge &b) const { return c > b.c; }
};
template <class T> ostream &operator<<(ostream &os, edge<T> &e) {
os << e.f << " " << e.t << " " << e.c;
return os;
}
template <typename T> class graph {
protected:
vector<bool> _used;
public:
vector<vector<edge<T>>> g;
vector<edge<T>> edges;
int n;
graph(int n) : n(n) { g.resize(n), _used.resize(n); }
void clear() { g.clear(), edges.clear(); }
void resize(int n) {
this->n = n;
g.resize(n);
_used.resize(n);
}
int size() { return g.size(); }
vector<edge<T>> &operator[](int i) { return g[i]; }
virtual void add(int f, int t, T c, int id, int ty) = 0;
virtual bool used(edge<T> &e) = 0;
virtual bool used(int id) = 0;
virtual void del(edge<T> &e) = 0;
virtual void del(int id) = 0;
virtual void set_edges() = 0;
};
template <typename T = ll> class digraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
int eid = 0;
digraph(int n) : graph<T>(n) {}
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("digraph add");
deb(f, t, c, id, ty);
ole();
}
if (id == -1)
id = eid++;
g[f].emplace_back(f, t, c, id, ty);
edges.emplace_back(f, t, c, id, ty);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
void set_edges() {
if (sz(edges))
return;
rep(i, n) fora(e, g[i]) edges.pb(e);
}
};
template <class T = int> class undigraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
int eid = 0;
undigraph(int n) : graph<T>(n) {}
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("undigraph add");
deb(f, t, c, id, ty);
ole();
}
if (id == -1)
id = eid, eid += 2;
g[f].emplace_back(f, t, c, id, ty);
g[t].emplace_back(t, f, c, id + 1, ty);
edges.emplace_back(f, t, c, id, ty);
edges.emplace_back(t, f, c, id + 1, ty);
}
void add(edge<T> &e) {
int f = e.f, t = e.t, ty = e.type;
T c = e.c;
add(f, t, c, ty);
}
bool used(edge<T> &e) { return _used[e.id]; }
bool used(int id) { return _used[id]; }
void del(edge<T> &e) { _used[e.id] = _used[e.id ^ 1] = 1; }
void del(int id) { _used[id] = _used[id ^ 1] = 1; }
void set_edges() {
if (sz(edges))
return;
rep(i, n) fora(e, g[i]) edges.pb(e);
}
};
template <class T>
vector<T> dijkstra(const graph<T> &g, int s, int cant_arrive = -1) {
if (!(0 <= s && s < g.n)) {
debugline("dijkstra");
deb(s, g.n);
ole();
}
T initValue = MAX(T);
vector<T> dis(g.n, initValue);
priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;
dis[s] = 0;
q.emplace(0, s);
while (q.size()) {
T nowc = q.top().fi;
int i = q.top().se;
q.pop();
if (dis[i] != nowc)
continue;
for (auto &&e : g.g[i]) {
int to = e.t;
T c = nowc + e.c;
if (dis[to] > c) {
dis[to] = c;
q.emplace(dis[to], to);
}
}
}
// 基本、たどり着かないなら-1
if (cant_arrive == -1)
for (auto &&d : dis)
if (d == initValue)
d = -1;
return dis;
}
template <class T>
vector<vector<T>> warshall(const graph<T> &g, int cant_arrive = -1) {
int n = g.n;
vector<vector<T>> dis(n, vector<T>(n, linf));
rep(i, n) fora(e, g.g[i]) chmin(dis[e.f][e.t], e.c);
rep(i, n) dis[i][i] = 0;
rep(k, n) rep(i, n) rep(j, n) chmin(dis[i][j], dis[i][k] + dis[k][j]);
// 基本、たどり着かないなら-1
if (cant_arrive == -1)
rep(i, n) rep(j, n) if (dis[i][j] == linf) dis[i][j] = -1;
return dis;
}
template <class T = int> class tree : public undigraph<T> {
public:
using undigraph<T>::g;
using undigraph<T>::n;
using undigraph<T>::edges;
using undigraph<T>::_used;
vi dep;
vi disv;
private:
bool never = 1;
int root = -1;
vector<vector<int>> par;
bool costallone;
void dfs(int v, int p, int d) {
dep[v] = d;
par[0][v] = p;
int lim = (*this)[v].size();
for (int i = 0; i < lim; i++) {
int t = g[v][i].t;
if (t == p)
con;
dfs(t, v, d + 1);
}
}
void built() {
never = 0;
n = g.size();
par.assign(30, vi(n));
dep.resize(n);
costallone = 1;
rep(i, n) fora(e, g[i]) if (e.c != 1) costallone = 0;
dfs(root, -1, 0);
rep(k, par.size() - 1) {
rep(i, n) {
if (par[k][i] == -1)
par[k + 1][i] = -1;
else
par[k + 1][i] = par[k][par[k][i]];
}
}
if (costallone)
disv = dep;
else
disv = dijkstra(*this, root);
}
int _lca(int u, int v) {
if (dep[u] > dep[v])
swap(u, v);
rep(k, par.size()) {
if ((dep[u] - dep[v]) >> k & 1) {
v = par[k][v];
}
}
if (u == v)
return u;
rer(k, par.size() - 1) {
if (par[k][u] != par[k][v]) {
u = par[k][u];
v = par[k][v];
}
}
return par[0][u];
}
int _dis(int u, int v) {
int p = _lca(u, v);
return disv[u] + disv[v] - disv[p] * 2;
}
public:
tree(int n, int root = 0) : undigraph<T>(n), root(root) {}
bool leaf(int v) { return sz(g[v]) == 1 && v != root; }
int dis(int u, int v) {
if (never) {
built();
}
return _dis(u, v);
}
int lca(int u, int v) {
if (never) {
built();
}
return _lca(u, v);
}
};
// 辺によりメモリを大量消費
// よってedgesを消している
// 頂点10^6でメモリを190MB(制限の8割)使う
// 軽量化のため、辺を持たないbig gridクラスがあってもいいかもしれない
//
template <class T = int> class grid_k6 : public undigraph<T> {
public:
using undigraph<T>::g;
using undigraph<T>::n;
using undigraph<T>::edges;
using undigraph<T>::_used;
int H, W;
int eid = 0;
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("grid_k6 add");
deb(f, t, c, id, ty);
ole();
}
g[f].emplace_back(f, t, c, eid++, ty);
g[t].emplace_back(t, f, c, eid++, ty);
}
int getid(int h, int w) {
if (!inside(h, w, H, W))
return -1;
return W * h + w;
}
P get2(int id) { return mp(id / W, id % W); }
P operator()(int id) { return get2(id); }
int operator()(int h, int w) { return getid(h, w); }
grid_k6(int H, int W) : H(H), W(W), undigraph<T>(H * W) {
rep(h, H) {
rep(w, W) {
int f = getid(h, w);
if (w + 1 < W)
add(f, getid(h, w + 1));
if (h + 1 < H)
add(f, getid(h + 1, w));
}
}
}
grid_k6(_vvc ba, char wall = '#')
: H(sz(ba)), W(sz(ba[0])), undigraph<T>(sz(ba) * sz(ba[0])) {
rep(h, H) {
rep(w, W) {
if (ba[h][w] == wall)
con;
int f = getid(h, w);
if (w + 1 < W && ba[h][w + 1] != wall) {
add(f, getid(h, w + 1));
}
if (h + 1 < H && ba[h + 1][w] != wall) {
add(f, getid(h + 1, w));
}
}
}
}
void add(int fh, int fw, int th, int tw) {
add(getid(fh, fw), getid(th, tw));
}
void set_edges() { rep(i, n) fora(e, g[i]) edges.pb(e); }
};
// 左上から右下に移動できる
template <class T = int> class digrid_k6 : public digraph<T> {
public:
using digraph<T>::g;
using digraph<T>::n;
using digraph<T>::edges;
using digraph<T>::_used;
int H, W;
int eid = 0;
void add(int f, int t, T c = 1, int id = -1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n)) {
debugline("digrid_k6 add");
deb(f, t, c, id, ty);
ole();
}
g[f].emplace_back(f, t, c, eid++, ty);
}
int getid(int h, int w) {
if (!inside(h, w, H, W))
return -1;
return W * h + w;
}
P get2(int id) { return mp(id / W, id % W); }
P operator()(int id) { return get2(id); }
int operator()(int h, int w) { return getid(h, w); }
digrid_k6(int H, int W) : H(H), W(W), digraph<T>(H * W) {
rep(h, H) {
rep(w, W) {
int f = getid(h, w);
if (w + 1 < W)
add(f, getid(h, w + 1));
if (h + 1 < H)
add(f, getid(h + 1, w));
}
}
}
digrid_k6(_vvc ba, char wall = '#')
: H(sz(ba)), W(sz(ba[0])), digraph<T>(sz(ba) * sz(ba[0])) {
rep(h, H) {
rep(w, W) {
if (ba[h][w] == wall)
con;
int f = getid(h, w);
if (w + 1 < W && ba[h][w + 1] != wall) {
add(f, getid(h, w + 1));
}
if (h + 1 < H && ba[h + 1][w] != wall) {
add(f, getid(h + 1, w));
}
}
}
}
void add(int fh, int fw, int th, int tw) {
add(getid(fh, fw), getid(th, tw));
}
void set_edges() { rep(i, n) fora(e, g[i]) edges.pb(e); }
};
template <class T> bool nibu(const graph<T> &g) {
int size = 0;
rep(i, g.n) size += sz(g.g[i]);
if (size == 0)
return true;
UnionFind uf(g.n * 2);
rep(i, g.n) fora(e, g.g[i]) uf.unite(e.f, e.t + g.n),
uf.unite(e.f + g.n, e.t);
rep(i, g.n) if (uf.same(i, i + g.n)) return 0;
return 1;
}
// 二部グラフを色分けした際の頂点数を返す
template <class T> vp nibug(graph<T> &g) {
vp cg;
if (!nibu(g)) {
debugline("nibu");
ole();
}
int _n = g.size();
vb _was(_n);
queue<P> q;
rep(i, _n) {
if (_was[i])
continue;
q.push(mp(i, 1));
_was[i] = 1;
int red = 0;
int coun = 0;
while (q.size()) {
int now = q.front().fi;
int col = q.front().se;
red += col;
coun++;
q.pop();
forg(gi, g[now]) {
if (_was[t])
continue;
q.push(mp(t, col ^ 1));
_was[t] = 1;
}
}
cg.push_back(mp(red, coun - red));
}
return cg;
}
template <class T> ostream &operator<<(ostream &os, graph<T> &g) {
rep(i, sz(g)) {
forg(gi, g[i]) { os << f << " " << t << " " << c << endl; }
}
return os;
}
// 機能拡張
vp vtop(vi &a, vi &b) {
vp res(sz(a));
rep(i, sz(a)) res[i] = mp(a[i], b[i]);
return res;
}
void ptov(vp &p, vi &a, vi &b) {
a.resize(sz(p));
b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>
operator+(const basic_string<_CharT, _Traits, _Alloc> &__lhs, const int __rv) {
basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
__str.append(to_string(__rv));
return __str;
}
template <typename _CharT, typename _Traits, typename _Alloc>
void operator+=(basic_string<_CharT, _Traits, _Alloc> &__lhs, const int __rv) {
__lhs += to_string(__rv);
}
template <typename _CharT, typename _Traits, typename _Alloc>
basic_string<_CharT, _Traits, _Alloc>
operator+(const basic_string<_CharT, _Traits, _Alloc> &__lhs,
const signed __rv) {
basic_string<_CharT, _Traits, _Alloc> __str(__lhs);
__str.append(to_string(__rv));
return __str;
}
template <typename _CharT, typename _Traits, typename _Alloc>
void operator+=(basic_string<_CharT, _Traits, _Alloc> &__lhs,
const signed __rv) {
__lhs += to_string(__rv);
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T, class U> set<T> &operator+=(set<T> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.pb(v);
return a;
}
template <class T, class U> vector<T> operator+(const vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, const vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
fora(v, b) a += v;
return a;
}
template <class T, class U>
vector<T> &operator+=(vector<T> &a, initializer_list<U> v) {
for (auto &&va : v)
a.pb(va);
return a;
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
ole();
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <typename T> void remove(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T>
void remove(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void removen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T> void erase(vector<T> &v, unsigned int i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <typename T>
void erasen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned int i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned int i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T, typename U>
void insert(vector<T> &v, initializer_list<U> list) {
for (auto &&va : list)
v.pb(va);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned int i, initializer_list<U> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
template <typename T> void insert(set<T> &v, initializer_list<T> list) {
for (auto &&va : list)
v.insert(va);
}
// 閉路がなければtrue
bool topo(vi &res, digraph<int> &g) {
int n = g.g.size();
vi nyu(n);
rep(i, n) for (auto &&e : g[i]) nyu[e.t]++;
queue<int> st;
rep(i, n) if (nyu[i] == 0) st.push(i);
while (st.size()) {
int v = st.front();
st.pop();
res.pb(v);
fora(e, g[v]) if (--nyu[e.t] == 0) st.push(e.t);
}
return res.size() == n;
}
// 辞書順最小トポロジカルソート
bool topos(vi &res, digraph<int> &g) {
int n = g.g.size();
vi nyu(n);
rep(i, n) for (auto &&e : g[i]) nyu[e.t]++;
// 小さい順
priority_queue<int, vector<int>, greater<int>> q;
rep(i, n) if (nyu[i] == 0) q.push(i);
while (q.size()) {
int i = q.top();
q.pop();
res.pb(i);
fora(e, g[i]) if (--nyu[e.t] == 0) q.push(e.t);
}
return res.size() == n;
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
int l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
string b = a + deli;
int l = 0, r = 0, n = b.size(), dn = deli.size();
vector<string> res;
rep(i, n) {
if (i + dn <= n && b.substr(i, i + dn) == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
i += dn - 1;
l = i + 1;
}
}
return res;
}
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
int n, m, k, d, H, W, x, y, z, q;
int cou;
vi a, b, c;
vvi(s, 0, 0);
vvc(ba, 0, 0);
vp p;
const int NUM_ = 1400001;
static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];
mint com(int n, int r) {
if (fac[0] == 0) {
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
if (r < 0 || r > n)
return 0;
return mint(finv[r] * fac[n] % MOD * finv[n - r]);
}
mint ncr(int n, int r) { return com(n, r); }
mint dp[202][k5];
map<int, int> was[202];
mint rec(int n, int x) {
if (n == 0) {
return x;
}
// n)でxから作れる数
if (was[n][x])
return dp[n][x];
was[n][x] = 1;
if (a[0] > x) {
dp[n][x] += fac[n] * x;
return dp[n][x];
}
// iをまず使う
rep(i, n) {
// 超えたら以降答え同じ
if (a[i] > x) {
int nx = x % a[i];
mint v = rec(i, nx) * fac[n - i - 1] * ncr(n - 1, n - i - 1);
dp[n][x] += v * (n - i); // 自分も
break;
} else {
int nx = x % a[i];
dp[n][x] += rec(i, nx) * fac[n - i - 1] * ncr(n - 1, n - i - 1);
}
}
return dp[n][x];
}
void solve() {
com(1, 1);
cin >> n >> x;
a.resize(n);
cin >> a;
sort(a);
cout << rec(n, x) << endl;
}
int my(int n, vi a) { return 0; }
int sister(int n, vi a) { return 0; }
signed main() {
solve();
//
#define _arg n, a
#ifdef _DEBUG
bool bad = 0;
for (int i = 0, ok = 1; i < k5 && ok; i++) {
int n = rand(1, 4);
vi a = ranv(m, 1, 10);
int myres = my(_arg);
int res = sister(_arg);
ok = myres == res;
if (!ok) {
outl(_arg);
cout << "正解 : " << res << endl;
cout << "自分 : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧です。" << endl;
}
#endif
return 0;
};
| replace | 2,709 | 2,710 | 2,709 | 2,711 | -11 | |
p03082 | Python | Runtime Error | # -*- coding: utf-8 -*-
from collections import defaultdict
n, X = map(int, input().split())
s = list(map(int, input().split()))
s = sorted(s, reverse=True)
mod = 10**9 + 7
dp = defaultdict(int)
dp[X] = 1
for i in range(n):
new_dp = defaultdict(int)
for x in dp:
mod_x = x % s[i]
new_dp[x] += dp[x] * (n - i - 1)
new_dp[mod_x] += dp[x]
print("new_dp", new_dp)
dp = new_dp
total = 0
for x in dp:
total += dp[x] * x
total %= mod
print(total)
| # -*- coding: utf-8 -*-
from collections import defaultdict
n, X = map(int, input().split())
s = list(map(int, input().split()))
s = sorted(s, reverse=True)
mod = 10**9 + 7
dp = defaultdict(int)
dp[X] = 1
for i in range(n):
new_dp = defaultdict(int)
for x in dp:
mod_x = x % s[i]
new_dp[x] += dp[x] * (n - i - 1)
new_dp[mod_x] += dp[x]
dp = new_dp
total = 0
for x in dp:
total += dp[x] * x
total %= mod
print(total)
| delete | 21 | 22 | 21 | 21 | 0 | |
p03082 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iomanip>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PLDLD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<char> VB;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define CLR(a) memset((a), 0, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNQ(a) a.erase(std::unique(ALL(a)), a.end());
#define endl "\n"
const LD EPS = 1e-5;
const long long INFLL = (LL)(1e9) * (LL)(1e9);
const int INF = 1e9 + 7;
template <class T> void chmin(T &a, const T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T b) {
if (a < b)
a = b;
}
const LL powLL(const LL p, const LL q) {
LL t = 1;
for (int i = 0; i < q; i++)
t *= p;
return t;
}
template <typename T> struct has_iter {
private:
template <typename U>
static constexpr true_type check(typename U::iterator *);
template <typename U> static constexpr false_type check(...);
public:
static constexpr bool value = decltype(check<T>(nullptr))::value;
};
template <typename T, typename U = typename T::iterator>
void print(const T &container) {
auto &&first = begin(container), last = end(container);
auto &&back = prev(last);
for (auto e = first; e != last; e = next(e))
cout << *e << " \n"[e == back];
}
extern void *enabler;
template <typename Head,
typename enable_if<!has_iter<Head>::value>::type *& = enabler>
void print(const Head &head) {
cout << head << endl;
}
template <> void print<string>(const string &container) {
cout << container << endl;
}
template <typename Head, typename... Tail>
void print(const Head &head, const Tail &...tail) {
cout << head << " ";
print(tail...);
}
template <typename... Args> void printd(const Args &...args) {
#ifdef DEBUG
print(args...);
#endif
}
template <typename Head> void input(Head &head) { cin >> head; }
template <typename Head, typename... Tail>
void input(Head &head, Tail &...tail) {
cin >> head;
input(tail...);
}
void io_speedup() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &t) {
is >> t.first >> t.second;
return is;
}
template <int N, typename... Ts,
typename enable_if<N == sizeof...(Ts) - 1>::type *& = enabler>
void tuple_in(istream &is, tuple<Ts...> &t) {
is >> get<N>(t);
}
template <int N, typename... Ts,
typename enable_if<N<sizeof...(Ts) - 1>::type *& = enabler> void
tuple_in(istream &is, tuple<Ts...> &t) {
is >> get<N>(t);
tuple_in<N + 1, Ts...>(is, t);
}
template <typename... Ts> istream &operator>>(istream &is, tuple<Ts...> &t) {
tuple_in<0, Ts...>(is, t);
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &t) {
os << '(' << t.first << ", " << t.second << ')';
return os;
}
template <int N, typename... Ts,
typename enable_if<N == sizeof...(Ts) - 1>::type *& = enabler>
void tuple_out(ostream &os, const tuple<Ts...> &t) {
os << get<N>(t);
}
template <int N, typename... Ts,
typename enable_if<N<sizeof...(Ts) - 1>::type *& = enabler> void
tuple_out(ostream &os, const tuple<Ts...> &t) {
os << get<N>(t) << ", ";
tuple_out<N + 1, Ts...>(os, t);
}
template <typename... Ts>
ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << '(';
tuple_out<0, Ts...>(os, t);
os << ')';
return os;
}
template <typename T> vector<T> read(int n) {
vector<T> t(n);
cin >> t;
return t;
}
template <typename T> T read() {
T t;
cin >> t;
return t;
}
template <typename Head, typename... Tail> struct vector_demensions {
using type = vector<typename vector_demensions<Tail...>::type>;
};
template <typename Head> struct vector_demensions<Head> {
using type = Head;
};
template <typename T> vector<T> make_vectors(int size, T val) {
return vector<T>(size, val);
}
template <typename T = int, typename... Args>
auto make_vectors(int size, Args... tail) ->
typename vector_demensions<Args..., T>::type {
auto val = make_vectors<T>(forward<Args>(tail)...);
return vector<decltype(val)>(size, val);
}
// c++14
class Mod {
public:
using value_type = long long;
private:
static const value_type MODULO = 1e9 + 7;
value_type value;
constexpr value_type Normalize(value_type x) const {
return x < 0 ? (x % MODULO + MODULO) : (x % MODULO);
}
public:
constexpr Mod() : value(0) {}
constexpr Mod(const value_type &val) : value(Normalize(val)) {}
constexpr explicit operator value_type() const { return value; }
constexpr const Mod operator-() const { return Mod(MODULO - value); }
constexpr const Mod operator+(const Mod &rhs) const {
return Mod(value + rhs.value);
}
constexpr const Mod operator-(const Mod &rhs) const {
return Mod(value + (-rhs).value);
}
constexpr const Mod operator*(const Mod &rhs) const {
return Mod(value * rhs.value);
}
constexpr Mod &operator+=(const Mod &rhs) {
value = Normalize(value + rhs.value);
return *this;
}
constexpr Mod &operator-=(const Mod &rhs) {
value = Normalize(value - rhs.value);
return *this;
}
constexpr Mod &operator*=(const Mod &rhs) {
value = Normalize(value * rhs.value);
return *this;
}
constexpr Mod pow(value_type p) const;
constexpr Mod inv() const { return pow(MODULO - 2); }
constexpr const Mod operator/(const Mod &rhs) const {
return *this * rhs.inv();
}
constexpr Mod &operator/=(const Mod &rhs) { return *this = *this / rhs; }
constexpr bool operator==(const Mod &rhs) { return value == rhs.value; }
};
constexpr Mod Mod::pow(value_type p) const {
Mod tmp = 1, mult = *this;
while (p) {
if ((p & 1) > 0)
tmp *= mult;
p >>= 1;
mult *= mult;
}
return tmp;
}
namespace std {
ostream &operator<<(ostream &os, const Mod mod) {
os << (typename Mod::value_type)mod;
return os;
}
}; // namespace std
template <size_t N> struct Factorial {
private:
Mod ary[N];
public:
constexpr explicit Factorial() : ary() {
ary[0] = 1;
for (size_t i = 1; i < N; i++)
ary[i] = ary[i - 1] * i;
}
constexpr size_t size() const { return N; }
constexpr Mod operator[](const int id) const { return ary[id]; }
};
template <size_t N> class FactorialInv {
private:
Mod ary[N];
public:
constexpr explicit FactorialInv(const Factorial<N> &fact) : ary() {
for (size_t i = 0; i < N; i++)
ary[i] = fact[i].inv();
}
// FactorialInv& operator=(FactorialInv&&)=default;
constexpr Mod operator[](const int id) const { return ary[id]; }
};
template <size_t N, size_t M = N> class Combination {
private:
const Factorial<N> fact;
const FactorialInv<M> fact_inv;
public:
constexpr Combination(const Factorial<N> fact_,
const FactorialInv<M> fact_inv_)
: fact(fact_), fact_inv(fact_inv_) {}
constexpr Mod operator()(const int n, const int m) const {
return (fact)[n] * (fact_inv)[m] * (fact_inv)[n - m];
}
};
int main() {
Factorial<1024> fact;
int n, x;
cin >> n >> x;
auto s(read<int>(n));
sort(ALL(s), greater<int>());
auto dp = make_vectors<Mod>(n + 1, x + 1, Mod(0));
dp[0][x] = x;
REP(i, n)
REP(j, x + 1) {
dp[i + 1][j % s[i]] += dp[i][j] * (j % s[i]) / j;
dp[i + 1][j] += dp[i][j] * (n - i - 1);
}
Mod ans = 0;
REP(j, x + 1)
ans += dp[n][j];
print(ans);
} | #include <bits/stdc++.h>
#include <iomanip>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PLDLD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<char> VB;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define CLR(a) memset((a), 0, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNQ(a) a.erase(std::unique(ALL(a)), a.end());
#define endl "\n"
const LD EPS = 1e-5;
const long long INFLL = (LL)(1e9) * (LL)(1e9);
const int INF = 1e9 + 7;
template <class T> void chmin(T &a, const T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T b) {
if (a < b)
a = b;
}
const LL powLL(const LL p, const LL q) {
LL t = 1;
for (int i = 0; i < q; i++)
t *= p;
return t;
}
template <typename T> struct has_iter {
private:
template <typename U>
static constexpr true_type check(typename U::iterator *);
template <typename U> static constexpr false_type check(...);
public:
static constexpr bool value = decltype(check<T>(nullptr))::value;
};
template <typename T, typename U = typename T::iterator>
void print(const T &container) {
auto &&first = begin(container), last = end(container);
auto &&back = prev(last);
for (auto e = first; e != last; e = next(e))
cout << *e << " \n"[e == back];
}
extern void *enabler;
template <typename Head,
typename enable_if<!has_iter<Head>::value>::type *& = enabler>
void print(const Head &head) {
cout << head << endl;
}
template <> void print<string>(const string &container) {
cout << container << endl;
}
template <typename Head, typename... Tail>
void print(const Head &head, const Tail &...tail) {
cout << head << " ";
print(tail...);
}
template <typename... Args> void printd(const Args &...args) {
#ifdef DEBUG
print(args...);
#endif
}
template <typename Head> void input(Head &head) { cin >> head; }
template <typename Head, typename... Tail>
void input(Head &head, Tail &...tail) {
cin >> head;
input(tail...);
}
void io_speedup() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &t) {
is >> t.first >> t.second;
return is;
}
template <int N, typename... Ts,
typename enable_if<N == sizeof...(Ts) - 1>::type *& = enabler>
void tuple_in(istream &is, tuple<Ts...> &t) {
is >> get<N>(t);
}
template <int N, typename... Ts,
typename enable_if<N<sizeof...(Ts) - 1>::type *& = enabler> void
tuple_in(istream &is, tuple<Ts...> &t) {
is >> get<N>(t);
tuple_in<N + 1, Ts...>(is, t);
}
template <typename... Ts> istream &operator>>(istream &is, tuple<Ts...> &t) {
tuple_in<0, Ts...>(is, t);
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &t) {
os << '(' << t.first << ", " << t.second << ')';
return os;
}
template <int N, typename... Ts,
typename enable_if<N == sizeof...(Ts) - 1>::type *& = enabler>
void tuple_out(ostream &os, const tuple<Ts...> &t) {
os << get<N>(t);
}
template <int N, typename... Ts,
typename enable_if<N<sizeof...(Ts) - 1>::type *& = enabler> void
tuple_out(ostream &os, const tuple<Ts...> &t) {
os << get<N>(t) << ", ";
tuple_out<N + 1, Ts...>(os, t);
}
template <typename... Ts>
ostream &operator<<(ostream &os, const tuple<Ts...> &t) {
os << '(';
tuple_out<0, Ts...>(os, t);
os << ')';
return os;
}
template <typename T> vector<T> read(int n) {
vector<T> t(n);
cin >> t;
return t;
}
template <typename T> T read() {
T t;
cin >> t;
return t;
}
template <typename Head, typename... Tail> struct vector_demensions {
using type = vector<typename vector_demensions<Tail...>::type>;
};
template <typename Head> struct vector_demensions<Head> {
using type = Head;
};
template <typename T> vector<T> make_vectors(int size, T val) {
return vector<T>(size, val);
}
template <typename T = int, typename... Args>
auto make_vectors(int size, Args... tail) ->
typename vector_demensions<Args..., T>::type {
auto val = make_vectors<T>(forward<Args>(tail)...);
return vector<decltype(val)>(size, val);
}
// c++14
class Mod {
public:
using value_type = long long;
private:
static const value_type MODULO = 1e9 + 7;
value_type value;
constexpr value_type Normalize(value_type x) const {
return x < 0 ? (x % MODULO + MODULO) : (x % MODULO);
}
public:
constexpr Mod() : value(0) {}
constexpr Mod(const value_type &val) : value(Normalize(val)) {}
constexpr explicit operator value_type() const { return value; }
constexpr const Mod operator-() const { return Mod(MODULO - value); }
constexpr const Mod operator+(const Mod &rhs) const {
return Mod(value + rhs.value);
}
constexpr const Mod operator-(const Mod &rhs) const {
return Mod(value + (-rhs).value);
}
constexpr const Mod operator*(const Mod &rhs) const {
return Mod(value * rhs.value);
}
constexpr Mod &operator+=(const Mod &rhs) {
value = Normalize(value + rhs.value);
return *this;
}
constexpr Mod &operator-=(const Mod &rhs) {
value = Normalize(value - rhs.value);
return *this;
}
constexpr Mod &operator*=(const Mod &rhs) {
value = Normalize(value * rhs.value);
return *this;
}
constexpr Mod pow(value_type p) const;
constexpr Mod inv() const { return pow(MODULO - 2); }
constexpr const Mod operator/(const Mod &rhs) const {
return *this * rhs.inv();
}
constexpr Mod &operator/=(const Mod &rhs) { return *this = *this / rhs; }
constexpr bool operator==(const Mod &rhs) { return value == rhs.value; }
};
constexpr Mod Mod::pow(value_type p) const {
Mod tmp = 1, mult = *this;
while (p) {
if ((p & 1) > 0)
tmp *= mult;
p >>= 1;
mult *= mult;
}
return tmp;
}
namespace std {
ostream &operator<<(ostream &os, const Mod mod) {
os << (typename Mod::value_type)mod;
return os;
}
}; // namespace std
template <size_t N> struct Factorial {
private:
Mod ary[N];
public:
constexpr explicit Factorial() : ary() {
ary[0] = 1;
for (size_t i = 1; i < N; i++)
ary[i] = ary[i - 1] * i;
}
constexpr size_t size() const { return N; }
constexpr Mod operator[](const int id) const { return ary[id]; }
};
template <size_t N> class FactorialInv {
private:
Mod ary[N];
public:
constexpr explicit FactorialInv(const Factorial<N> &fact) : ary() {
for (size_t i = 0; i < N; i++)
ary[i] = fact[i].inv();
}
// FactorialInv& operator=(FactorialInv&&)=default;
constexpr Mod operator[](const int id) const { return ary[id]; }
};
template <size_t N, size_t M = N> class Combination {
private:
const Factorial<N> fact;
const FactorialInv<M> fact_inv;
public:
constexpr Combination(const Factorial<N> fact_,
const FactorialInv<M> fact_inv_)
: fact(fact_), fact_inv(fact_inv_) {}
constexpr Mod operator()(const int n, const int m) const {
return (fact)[n] * (fact_inv)[m] * (fact_inv)[n - m];
}
};
int main() {
Factorial<1024> fact;
int n, x;
cin >> n >> x;
auto s(read<int>(n));
sort(ALL(s), greater<int>());
auto dp = make_vectors<Mod>(n + 1, x + 1, Mod(0));
dp[0][x] = x;
REP(i, n)
REP(j, x + 1) {
if (dp[i][j] == 0)
continue;
dp[i + 1][j % s[i]] += dp[i][j] * (j % s[i]) / j;
dp[i + 1][j] += dp[i][j] * (n - i - 1);
}
Mod ans = 0;
REP(j, x + 1)
ans += dp[n][j];
print(ans);
} | insert | 311 | 311 | 311 | 313 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD = 1e9 + 7;
const int N = 202;
int n, x, s[N];
int fac[N];
LL dp[202][100000 + 10];
LL A[202][202];
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &s[i]);
}
dp[0][x] = 1;
sort(s + 1, s + 1 + n);
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= x; j++) {
int cnt = n - i;
for (int k = 1; k <= n; k++) {
if (s[k] <= j) {
(dp[i + 1][j % s[k]] += dp[i][j]);
if (dp[i + 1][j % s[k]] > MOD)
dp[i + 1][j % s[k]] -= MOD;
cnt--;
} else {
break;
}
}
(dp[i + 1][j] += dp[i][j] * cnt) %= MOD;
}
}
LL ans = 0;
for (int i = 0; i <= x; i++) {
ans = (ans + dp[n][i] * i) % MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD = 1e9 + 7;
const int N = 202;
int n, x, s[N];
int fac[N];
LL dp[202][100000 + 10];
LL A[202][202];
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &s[i]);
}
dp[0][x] = 1;
sort(s + 1, s + 1 + n);
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= x; j++) {
if (dp[i][j] == 0)
continue;
int cnt = n - i;
for (int k = 1; k <= n; k++) {
if (s[k] <= j) {
(dp[i + 1][j % s[k]] += dp[i][j]);
if (dp[i + 1][j % s[k]] > MOD)
dp[i + 1][j % s[k]] -= MOD;
cnt--;
} else {
break;
}
}
(dp[i + 1][j] += dp[i][j] * cnt) %= MOD;
}
}
LL ans = 0;
for (int i = 0; i <= x; i++) {
ans = (ans + dp[n][i] * i) % MOD;
}
cout << ans << endl;
} | insert | 19 | 19 | 19 | 21 | TLE | |
p03082 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
// #define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair<int, int> pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
: to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1 << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll factorial(ll x) {
if (x == 1)
return 1;
else
return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
ll ret = 1;
for (ll i = 1; i <= x; i++) {
ret *= i;
ret %= m;
}
return ret;
}
vector<int> MfactTable(int n, int m) {
vector<int> ret(n + 1);
ret[0] = 1;
int tmp = 1;
for (int i = 1; i <= n; i++) {
tmp *= i;
tmp %= m;
ret[i] = tmp;
}
return ret;
}
int Minverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
// O(n)
int ret = Mfactorial(n, m);
ret *= Minverse(Mfactorial(k, m), m);
ret %= m;
ret *= Minverse(Mfactorial(n - k, m), m);
return ret % m;
}
int McombFromFactTable(vector<int> &T, int n, int k, int m) {
if (k > n)
return 0;
int ret = T[n];
ret *= Minverse(T[k], m);
ret %= m;
ret *= Minverse(T[n - k], m);
return ret % m;
}
ll pow(ll x, int n) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = pow(x, n / 2);
return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = Mpow(x, n / 2, m);
return (((ret * a) % m) * a) % m;
}
vector<vector<int>> combTable(int N) {
vector<vector<int>> ret(N + 1, vector<int>(N + 1));
for (int i = 0; i <= N; i++)
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
ret[i][j] = 1;
else
ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
}
return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
// r>=l>=0
return (r - Q + P) / P - (l - Q + P - 1) / P;
}
int N, M, K, T, Q, H, W;
signed main() {
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.rbegin(), A.rend());
vector<int> t = MfactTable(N, MOD);
vector<vector<int>> dp(N + 1, vector<int>(1e5 + 10, 0));
dp[0][K] = 1;
rep(i, N) rep(j, dp[0].size()) {
dp[i + 1][j] = (dp[i + 1][j] +
dp[i][j] * (N - i - 1) % MOD * Minverse(N - i, MOD) % MOD) %
MOD;
dp[i + 1][j % A[i]] =
(dp[i + 1][j % A[i]] + dp[i][j] * Minverse(N - i, MOD) % MOD) % MOD;
}
int ans = 0;
rep(j, A[N - 1]) { ans = (ans + dp[N][j] * j % MOD) % MOD; }
ans = ans * t[N] % MOD;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
// #define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair<int, int> pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
: to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1 << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll factorial(ll x) {
if (x == 1)
return 1;
else
return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
ll ret = 1;
for (ll i = 1; i <= x; i++) {
ret *= i;
ret %= m;
}
return ret;
}
vector<int> MfactTable(int n, int m) {
vector<int> ret(n + 1);
ret[0] = 1;
int tmp = 1;
for (int i = 1; i <= n; i++) {
tmp *= i;
tmp %= m;
ret[i] = tmp;
}
return ret;
}
int Minverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
// O(n)
int ret = Mfactorial(n, m);
ret *= Minverse(Mfactorial(k, m), m);
ret %= m;
ret *= Minverse(Mfactorial(n - k, m), m);
return ret % m;
}
int McombFromFactTable(vector<int> &T, int n, int k, int m) {
if (k > n)
return 0;
int ret = T[n];
ret *= Minverse(T[k], m);
ret %= m;
ret *= Minverse(T[n - k], m);
return ret % m;
}
ll pow(ll x, int n) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = pow(x, n / 2);
return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = Mpow(x, n / 2, m);
return (((ret * a) % m) * a) % m;
}
vector<vector<int>> combTable(int N) {
vector<vector<int>> ret(N + 1, vector<int>(N + 1));
for (int i = 0; i <= N; i++)
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
ret[i][j] = 1;
else
ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
}
return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
// r>=l>=0
return (r - Q + P) / P - (l - Q + P - 1) / P;
}
int N, M, K, T, Q, H, W;
signed main() {
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
sort(A.rbegin(), A.rend());
vector<int> t = MfactTable(N, MOD);
vector<vector<int>> dp(N + 1, vector<int>(1e5 + 10, 0));
dp[0][K] = 1;
rep(i, N) {
int div = Minverse(N - i, MOD);
rep(j, dp[0].size()) {
dp[i + 1][j] =
(dp[i + 1][j] + dp[i][j] * (N - i - 1) % MOD * div % MOD) % MOD;
dp[i + 1][j % A[i]] = (dp[i + 1][j % A[i]] + dp[i][j] * div % MOD) % MOD;
}
}
int ans = 0;
rep(j, A[N - 1]) { ans = (ans + dp[N][j] * j % MOD) % MOD; }
ans = ans * t[N] % MOD;
cout << ans << endl;
return 0;
} | replace | 204 | 210 | 204 | 211 | TLE | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 5, MOD = 1e9 + 7;
int B, W, n;
int sumW[MAX_N];
int sumB[MAX_N];
int F[MAX_N];
int _sum(int a, int b) {
int c = a + b;
if (MOD <= c)
c -= MOD;
return c;
}
int _sub(int a, int b) {
int c = a - b;
if (c < 0)
c += MOD;
return c;
}
int _mul(int a, int b) {
int c = 1LL * a * b % MOD;
return c;
}
int _pow(int a, int b) {
if (!b)
return 1;
int res = _pow(a, b >> 1);
res = _mul(res, res);
if (b & 1)
res = _mul(res, a);
return res;
}
int _choose(int a, int b) {
if (a < 0 || b < a)
return 0;
int c = _mul(F[b], _mul(_pow(F[a], MOD - 2), _pow(F[b - a], MOD - 2)));
return c;
}
void pre_process() {
F[0] = 1;
for (int i = 1; i < MAX_N; i++)
F[i] = _mul(i, F[i - 1]);
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
pre_process();
cin >> B >> W;
n = B + W;
for (int i = W - 1; i < n - 1; i++) {
int s = _mul(_choose(W - 1, i), _pow(_pow(2, i + 1), MOD - 2));
sumW[i + 1] = s;
}
for (int i = B - 1; i < n - 1; i++) {
int s = _mul(_choose(B - 1, i), _pow(_pow(2, i + 1), MOD - 2));
sumB[i + 1] = s;
}
int w = 0, b = 0;
for (int i = 0; i < n; i++) {
w = _sum(w, sumW[i]);
b = _sum(b, sumB[i]);
int s = _sub(_sub(1, w), b);
cout << _sum(w, _mul(s, _pow(2, MOD - 2))) << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10, MOD = 1e9 + 7;
int B, W, n;
int sumW[MAX_N];
int sumB[MAX_N];
int F[MAX_N];
int _sum(int a, int b) {
int c = a + b;
if (MOD <= c)
c -= MOD;
return c;
}
int _sub(int a, int b) {
int c = a - b;
if (c < 0)
c += MOD;
return c;
}
int _mul(int a, int b) {
int c = 1LL * a * b % MOD;
return c;
}
int _pow(int a, int b) {
if (!b)
return 1;
int res = _pow(a, b >> 1);
res = _mul(res, res);
if (b & 1)
res = _mul(res, a);
return res;
}
int _choose(int a, int b) {
if (a < 0 || b < a)
return 0;
int c = _mul(F[b], _mul(_pow(F[a], MOD - 2), _pow(F[b - a], MOD - 2)));
return c;
}
void pre_process() {
F[0] = 1;
for (int i = 1; i < MAX_N; i++)
F[i] = _mul(i, F[i - 1]);
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
pre_process();
cin >> B >> W;
n = B + W;
for (int i = W - 1; i < n - 1; i++) {
int s = _mul(_choose(W - 1, i), _pow(_pow(2, i + 1), MOD - 2));
sumW[i + 1] = s;
}
for (int i = B - 1; i < n - 1; i++) {
int s = _mul(_choose(B - 1, i), _pow(_pow(2, i + 1), MOD - 2));
sumB[i + 1] = s;
}
int w = 0, b = 0;
for (int i = 0; i < n; i++) {
w = _sum(w, sumW[i]);
b = _sum(b, sumB[i]);
int s = _sub(_sub(1, w), b);
cout << _sum(w, _mul(s, _pow(2, MOD - 2))) << "\n";
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03083 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define N (long long)(1e9 + 7)
#define MAX 500000
using namespace std;
long long factorial[MAX] = {0}, finverse[MAX] = {0}, inverse[MAX] = {0};
void smodfact() {
factorial[0] = factorial[1] = 1;
finverse[0] = finverse[1] = 1;
inverse[1] = 1;
for (int i = 2; i < MAX; ++i) {
factorial[i] = factorial[i - 1] * i % N;
inverse[i] = N - (inverse[N % i] * (N / i)) % N;
finverse[i] = finverse[i - 1] * inverse[i] % N;
}
}
long long calccomb(long long n, long long k) {
if (n == k && n == 0)
return 1;
if (n < 0 || k < 0 || n < k)
return 0;
return factorial[n] * finverse[k] % N * finverse[n - k] % N;
}
long long b, w, n;
long long dpb[100005] = {0}, dpw[100005] = {0};
void solve();
int main() {
smodfact();
cin >> b >> w;
n = b + w;
solve();
return 0;
}
void solve() {
long long bin = 1;
for (int i = 0; i < n; ++i) {
long long now = 1;
now += (dpw[i] - dpb[i] + N) % N;
now %= N;
bin *= inverse[2];
bin %= N;
dpb[i + 1] = (dpb[i] + bin * calccomb(i, b - 1) % N) % N;
dpw[i + 1] = (dpw[i] + bin * calccomb(i, w - 1) % N) % N;
cout << now * inverse[2] % N << endl;
}
} | #include <bits/stdc++.h>
#define N (long long)(1e9 + 7)
#define MAX 500000
using namespace std;
long long factorial[MAX] = {0}, finverse[MAX] = {0}, inverse[MAX] = {0};
void smodfact() {
factorial[0] = factorial[1] = 1;
finverse[0] = finverse[1] = 1;
inverse[1] = 1;
for (int i = 2; i < MAX; ++i) {
factorial[i] = factorial[i - 1] * i % N;
inverse[i] = N - (inverse[N % i] * (N / i)) % N;
finverse[i] = finverse[i - 1] * inverse[i] % N;
}
}
long long calccomb(long long n, long long k) {
if (n == k && n == 0)
return 1;
if (n < 0 || k < 0 || n < k)
return 0;
return factorial[n] * finverse[k] % N * finverse[n - k] % N;
}
long long b, w, n;
long long dpb[300005] = {0}, dpw[300005] = {0};
void solve();
int main() {
smodfact();
cin >> b >> w;
n = b + w;
solve();
return 0;
}
void solve() {
long long bin = 1;
for (int i = 0; i < n; ++i) {
long long now = 1;
now += (dpw[i] - dpb[i] + N) % N;
now %= N;
bin *= inverse[2];
bin %= N;
dpb[i + 1] = (dpb[i] + bin * calccomb(i, b - 1) % N) % N;
dpw[i + 1] = (dpw[i] + bin * calccomb(i, w - 1) % N) % N;
cout << now * inverse[2] % N << endl;
}
} | replace | 26 | 27 | 26 | 27 | TLE | |
p03083 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
const int N = 103;
const int MOD = 1e9 + 7;
int add(int a, int b) { return (a + b) % MOD; }
int mul(int a, int b) { return (a * b) % MOD; }
int sub(int a, int b) { return (a - b + MOD) % MOD; }
int binpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = mul(res, a);
a = mul(a, a);
b >>= 1;
}
return res;
}
int divv(int a, int b) { return mul(a, binpow(b, MOD - 2)); }
int f[N];
void init() {
f[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = mul(i, f[i - 1]);
}
}
int C(int n, int k) {
if (k < 0 || k > n)
return 0;
return divv(f[n], mul(f[k], f[n - k]));
}
vector<int> dp_w;
vector<int> dp_b;
void calc_dp(int W, int B) {
dp_w.resize(W + B + 1);
dp_b.resize(W + B + 1);
for (int i = min(W, B); i <= W + B; i++) {
{
dp_w[i] = dp_w[i - 1];
dp_w[i] = add(dp_w[i], divv(C(i - 1, W - 1), binpow(2, i)));
}
{
dp_b[i] = dp_b[i - 1];
dp_b[i] = add(dp_b[i], divv(C(i - 1, B - 1), binpow(2, i)));
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
init();
int w, b;
cin >> b >> w;
calc_dp(w, b);
for (int i = 1; i <= w + b; i++) {
int prob_end = dp_w[i - 1];
int prob_ok = sub(1, add(dp_w[i - 1], dp_b[i - 1]));
int ans = add(prob_end, divv(prob_ok, 2));
cout << ans << '\n';
}
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
const int N = 2e5 + 9;
const int MOD = 1e9 + 7;
int add(int a, int b) { return (a + b) % MOD; }
int mul(int a, int b) { return (a * b) % MOD; }
int sub(int a, int b) { return (a - b + MOD) % MOD; }
int binpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = mul(res, a);
a = mul(a, a);
b >>= 1;
}
return res;
}
int divv(int a, int b) { return mul(a, binpow(b, MOD - 2)); }
int f[N];
void init() {
f[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = mul(i, f[i - 1]);
}
}
int C(int n, int k) {
if (k < 0 || k > n)
return 0;
return divv(f[n], mul(f[k], f[n - k]));
}
vector<int> dp_w;
vector<int> dp_b;
void calc_dp(int W, int B) {
dp_w.resize(W + B + 1);
dp_b.resize(W + B + 1);
for (int i = min(W, B); i <= W + B; i++) {
{
dp_w[i] = dp_w[i - 1];
dp_w[i] = add(dp_w[i], divv(C(i - 1, W - 1), binpow(2, i)));
}
{
dp_b[i] = dp_b[i - 1];
dp_b[i] = add(dp_b[i], divv(C(i - 1, B - 1), binpow(2, i)));
}
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
init();
int w, b;
cin >> b >> w;
calc_dp(w, b);
for (int i = 1; i <= w + b; i++) {
int prob_end = dp_w[i - 1];
int prob_ok = sub(1, add(dp_w[i - 1], dp_b[i - 1]));
int ans = add(prob_end, divv(prob_ok, 2));
cout << ans << '\n';
}
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p03083 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int N = 1e5 + 10, mod = 1e9 + 7;
int jc[N], inv[N], bit[N], B, W, sw[N], sb[N];
int ksm(int x, int k) {
int s = 1;
for (; k; k >>= 1, x = 1ll * x * x % mod)
if (k & 1)
s = 1ll * s * x % mod;
return s;
}
int C(int n, int k) { return 1ll * jc[n] * inv[k] % mod * inv[n - k] % mod; }
int main() {
cin >> B >> W;
jc[0] = bit[0] = inv[0] = 1;
for (int i = 1; i <= B + W; i++)
jc[i] = 1ll * i * jc[i - 1] % mod;
for (int i = 1; i <= B + W; i++)
inv[i] = ksm(jc[i], mod - 2);
for (int i = 1; i <= B + W; i++)
bit[i] = 1ll * bit[i - 1] * inv[2] % mod;
for (int i = W; i < B + W; i++)
sw[i] = 1ll * bit[i] * C(i - 1, i - W) % mod;
for (int i = B; i < B + W; i++)
sb[i] = 1ll * bit[i] * C(i - 1, i - B) % mod;
// for(int i=1;i<=B+W;i++)
// printf("sw[%d]=%d,sb[%d]=%d\n",i,sw[i],i,sb[i]);
for (int i = 1; i <= B + W; i++) {
(sw[i] += sw[i - 1]) %= mod;
(sb[i] += sb[i - 1]) %= mod;
}
for (int i = 1; i <= B + W; i++) {
int w = (sw[i - 1] + 1ll * ((mod + 1 - sw[i - 1] - sb[i - 1]) % mod + mod) %
mod * (i == B + W ? 1 : inv[2]) % mod) %
mod;
cout << w << endl;
}
}
| #include <iostream>
using namespace std;
const int N = 2e5 + 10, mod = 1e9 + 7;
int jc[N], inv[N], bit[N], B, W, sw[N], sb[N];
int ksm(int x, int k) {
int s = 1;
for (; k; k >>= 1, x = 1ll * x * x % mod)
if (k & 1)
s = 1ll * s * x % mod;
return s;
}
int C(int n, int k) { return 1ll * jc[n] * inv[k] % mod * inv[n - k] % mod; }
int main() {
cin >> B >> W;
jc[0] = bit[0] = inv[0] = 1;
for (int i = 1; i <= B + W; i++)
jc[i] = 1ll * i * jc[i - 1] % mod;
for (int i = 1; i <= B + W; i++)
inv[i] = ksm(jc[i], mod - 2);
for (int i = 1; i <= B + W; i++)
bit[i] = 1ll * bit[i - 1] * inv[2] % mod;
for (int i = W; i < B + W; i++)
sw[i] = 1ll * bit[i] * C(i - 1, i - W) % mod;
for (int i = B; i < B + W; i++)
sb[i] = 1ll * bit[i] * C(i - 1, i - B) % mod;
// for(int i=1;i<=B+W;i++)
// printf("sw[%d]=%d,sb[%d]=%d\n",i,sw[i],i,sb[i]);
for (int i = 1; i <= B + W; i++) {
(sw[i] += sw[i - 1]) %= mod;
(sb[i] += sb[i - 1]) %= mod;
}
for (int i = 1; i <= B + W; i++) {
int w = (sw[i - 1] + 1ll * ((mod + 1 - sw[i - 1] - sb[i - 1]) % mod + mod) %
mod * (i == B + W ? 1 : inv[2]) % mod) %
mod;
cout << w << endl;
}
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p03083 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
long long mod_pow(long long x, long long k) {
long long ret = 1;
while (k) {
if (k & 1)
ret *= x, ret %= mod;
x *= x, x %= mod;
k >>= 1;
}
return ret;
}
int main() {
int b, w;
cin >> b >> w;
int N = b + w;
vector<long long> B(N, 0), W(N, 0), F(N + 1, 1), F_(N + 1, 1);
for (int i = 1; i <= N; ++i)
F[i] = F[i - 1] * i % mod;
F_[N] = mod_pow(F[N], mod - 2);
for (int i = N - 1; i > 0; --i)
F_[i] = F_[i + 1] * (i + 1) % mod;
auto comb = [&F, &F_](int n, int m) {
if (m > n)
return 0LL;
return F[n] * F_[m] % mod * F_[n - m] % mod;
};
long long t = 1, inv2 = mod_pow(2, mod - 2);
for (int i = 1; i <= N; ++i) {
t *= inv2, t %= mod;
B[i] = (B[i - 1] + comb(i - 1, w - 1) * t % mod) % mod;
W[i] = (W[i - 1] + comb(i - 1, b - 1) * t % mod) % mod;
}
for (int i = 0; i < N; ++i) {
cout << ((1 + B[i] - W[i]) % mod + mod) % mod * inv2 % mod << endl;
}
}
| #include <iostream>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
long long mod_pow(long long x, long long k) {
long long ret = 1;
while (k) {
if (k & 1)
ret *= x, ret %= mod;
x *= x, x %= mod;
k >>= 1;
}
return ret;
}
int main() {
int b, w;
cin >> b >> w;
int N = b + w;
vector<long long> B(N, 0), W(N, 0), F(N + 1, 1), F_(N + 1, 1);
for (int i = 1; i <= N; ++i)
F[i] = F[i - 1] * i % mod;
F_[N] = mod_pow(F[N], mod - 2);
for (int i = N - 1; i > 0; --i)
F_[i] = F_[i + 1] * (i + 1) % mod;
auto comb = [&F, &F_](int n, int m) {
if (m > n)
return 0LL;
return F[n] * F_[m] % mod * F_[n - m] % mod;
};
long long t = 1, inv2 = mod_pow(2, mod - 2);
for (int i = 1; i < N; ++i) {
t *= inv2, t %= mod;
B[i] = (B[i - 1] + comb(i - 1, w - 1) * t % mod) % mod;
W[i] = (W[i - 1] + comb(i - 1, b - 1) * t % mod) % mod;
}
for (int i = 0; i < N; ++i) {
cout << ((1 + B[i] - W[i]) % mod + mod) % mod * inv2 % mod << endl;
}
}
| replace | 32 | 33 | 32 | 33 | -11 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
ll pw(ll x, ll e) {
ll ans = 1;
for (; e; e /= 2, x = (x * x) % MOD) {
if (e % 2)
ans = (ans * x) % MOD;
}
return ans;
}
ll fac[N], ifac[N], inv[N];
void pre() {
fac[0] = ifac[0] = 1;
inv[1] = 1;
for (int i = 2; i < N; i++) {
inv[i] = (MOD - (ll)(MOD / i) * inv[MOD % i] % MOD) % MOD;
}
for (int i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i % MOD;
ifac[i] = ifac[i - 1] * inv[i] % MOD;
}
}
ll choose(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
}
ll now[N], nob[N], ow[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
pre();
int b, w;
cin >> b >> w;
ow[0] = 1;
for (int i = 1; i < b + w; i++) {
now[i] = (now[i - 1] + choose(i - 1, w - 1) * pw(inv[2], i)) % MOD;
nob[i] = (nob[i - 1] + choose(i - 1, b - 1) * pw(inv[2], i)) % MOD;
ow[i] = (1 - now[i] - nob[i] + 2 * MOD) % MOD;
// cerr << now[i] << " ";
}
now[b + w] = nob[b + w] = 1;
for (int i = 1; i <= b + w; i++) {
// P(i is black) = P(no white) + 1/2 P(<W, <B eaten)
cout << (now[i - 1] + inv[2] * ow[i - 1]) % MOD << nl;
}
// cerr << nl;
return 0;
}
| #include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
const int N = 2e5 + 10;
ll pw(ll x, ll e) {
ll ans = 1;
for (; e; e /= 2, x = (x * x) % MOD) {
if (e % 2)
ans = (ans * x) % MOD;
}
return ans;
}
ll fac[N], ifac[N], inv[N];
void pre() {
fac[0] = ifac[0] = 1;
inv[1] = 1;
for (int i = 2; i < N; i++) {
inv[i] = (MOD - (ll)(MOD / i) * inv[MOD % i] % MOD) % MOD;
}
for (int i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i % MOD;
ifac[i] = ifac[i - 1] * inv[i] % MOD;
}
}
ll choose(ll n, ll k) {
if (k < 0 || k > n)
return 0;
return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
}
ll now[N], nob[N], ow[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
pre();
int b, w;
cin >> b >> w;
ow[0] = 1;
for (int i = 1; i < b + w; i++) {
now[i] = (now[i - 1] + choose(i - 1, w - 1) * pw(inv[2], i)) % MOD;
nob[i] = (nob[i - 1] + choose(i - 1, b - 1) * pw(inv[2], i)) % MOD;
ow[i] = (1 - now[i] - nob[i] + 2 * MOD) % MOD;
// cerr << now[i] << " ";
}
now[b + w] = nob[b + w] = 1;
for (int i = 1; i <= b + w; i++) {
// P(i is black) = P(no white) + 1/2 P(<W, <B eaten)
cout << (now[i - 1] + inv[2] * ow[i - 1]) % MOD << nl;
}
// cerr << nl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
// #define int ll
// #define int __int128
// #define ll __int128
// typedef __int128 long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 1e5 + 100;
const ll M = 1e9 + 7;
ll pw(ll a, ll n = M - 2) {
ll ret = 1;
while (n) {
if (n & 1)
ret = ret * a % M;
a = a * a % M;
n >>= 1;
}
return ret;
}
ll b, w;
ll fact[N], inv[N];
ll nCr(ll n, ll k) {
if (k > n || k < 0)
return 0;
return fact[n] * inv[k] % M * inv[n - k] % M;
}
ll pref_q[N];
ll suf_p[N];
void smain() {
fact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i % M;
}
inv[N - 1] = pw(fact[N - 1]);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % M;
}
cin >> b >> w;
ll n = b + w;
for (ll j = 2; j <= n; ++j) {
ll cur = pw(pw(2, j - 1)) * nCr(j - 1 - 1, w - 1) % M;
pref_q[j] = (pref_q[j - 1] + cur) % M;
}
for (ll j = n - 2; j >= 0; --j) {
ll cur = nCr(j + 1 - 2, b - 2) + nCr(j + 1 - 2, w - 1);
cur %= M;
cur = cur * pw(pw(2, j + 1)) % M;
suf_p[j] = (cur + suf_p[j + 1]) % M;
}
for (ll j = 1; j <= n; ++j) {
ll q = pref_q[j];
ll p = suf_p[j];
ll cur = nCr(j - 1, b - 1) * pw(pw(2, j)) % M;
if (j == n)
cur = 0;
p = (p + cur) % M;
p = (p + q) % M;
cout << p << '\n';
}
} | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
// #define int ll
// #define int __int128
// #define ll __int128
// typedef __int128 long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 4e5 + 100;
const ll M = 1e9 + 7;
ll pw(ll a, ll n = M - 2) {
ll ret = 1;
while (n) {
if (n & 1)
ret = ret * a % M;
a = a * a % M;
n >>= 1;
}
return ret;
}
ll b, w;
ll fact[N], inv[N];
ll nCr(ll n, ll k) {
if (k > n || k < 0)
return 0;
return fact[n] * inv[k] % M * inv[n - k] % M;
}
ll pref_q[N];
ll suf_p[N];
void smain() {
fact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i % M;
}
inv[N - 1] = pw(fact[N - 1]);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % M;
}
cin >> b >> w;
ll n = b + w;
for (ll j = 2; j <= n; ++j) {
ll cur = pw(pw(2, j - 1)) * nCr(j - 1 - 1, w - 1) % M;
pref_q[j] = (pref_q[j - 1] + cur) % M;
}
for (ll j = n - 2; j >= 0; --j) {
ll cur = nCr(j + 1 - 2, b - 2) + nCr(j + 1 - 2, w - 1);
cur %= M;
cur = cur * pw(pw(2, j + 1)) % M;
suf_p[j] = (cur + suf_p[j + 1]) % M;
}
for (ll j = 1; j <= n; ++j) {
ll q = pref_q[j];
ll p = suf_p[j];
ll cur = nCr(j - 1, b - 1) * pw(pw(2, j)) % M;
if (j == n)
cur = 0;
p = (p + cur) % M;
p = (p + q) % M;
cout << p << '\n';
}
} | replace | 100 | 101 | 100 | 101 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) {
swap(a %= b, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T1, typename T2> bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2> bool chmin(T1 &a, const T2 &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
template <int MOD = 1000000007> struct mod_int {
int val;
mod_int(long long val_ = 0)
: val(val_ >= 0 ? val_ % MOD : (MOD - (-val_) % MOD) % MOD) {}
bool operator==(const mod_int &rhs) const { return val == rhs.val; }
bool operator!=(const mod_int &rhs) const {
return std::rel_ops::operator!=(*this, rhs);
}
mod_int &operator+=(const mod_int &rhs) {
if ((val += rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((val += MOD - rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
val = (int)((long long)val * rhs.val % MOD);
return *this;
}
mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inv(); }
mod_int operator+() const { return *this; }
mod_int operator-() const { return mod_int(-val); }
mod_int operator++() { return *this += 1; }
mod_int operator--() { return *this -= 1; }
mod_int operator++(signed) {
const mod_int ret(*this);
++*this;
return ret;
}
mod_int operator--(signed) {
const mod_int ret(*this);
--*this;
return ret;
}
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
mod_int inv() const {
int a = MOD, b = val, u = 0, v = 1;
while (b > 0) {
int t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return mod_int(u);
}
mod_int pow(long long n) const {
if (n < 0) {
return pow(-n).inv();
}
mod_int ret = 1, mul = *this;
while (n > 0) {
if (n & 1) {
ret *= mul;
}
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
long long v;
is >> v;
rhs = v;
return is;
}
friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
return os << rhs.val;
}
struct combination {
std::vector<mod_int> fact{1, 1}, f_inv{1, 1}, inv{0, 1};
void calc(int n) {
while (fact.size() <= n) {
int i = fact.size();
fact.push_back(fact[i - 1] * i);
inv.push_back(-inv[MOD % i] * (MOD / i));
f_inv.push_back(f_inv[i - 1] * inv[i]);
}
}
mod_int P(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[n - r]);
}
mod_int C(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[r] * f_inv[n - r]);
}
mod_int H(int n, int r) { return C(n + r - 1, r); }
};
};
using mint = mod_int<>;
mint b[110000], w[110000];
int B, W;
signed main() {
cin >> B >> W;
mint::combination comb;
b[0] = w[0] = 0;
reps(i, B + W) {
b[i] = b[i - 1] + comb.C(i - 2, B - 1) / mint(2).pow(i - 1);
w[i] = w[i - 1] + comb.C(i - 2, W - 1) / mint(2).pow(i - 1);
cout << (mint(1) - b[i] - w[i]) / 2 + w[i] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) {
swap(a %= b, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T1, typename T2> bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2> bool chmin(T1 &a, const T2 &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
template <int MOD = 1000000007> struct mod_int {
int val;
mod_int(long long val_ = 0)
: val(val_ >= 0 ? val_ % MOD : (MOD - (-val_) % MOD) % MOD) {}
bool operator==(const mod_int &rhs) const { return val == rhs.val; }
bool operator!=(const mod_int &rhs) const {
return std::rel_ops::operator!=(*this, rhs);
}
mod_int &operator+=(const mod_int &rhs) {
if ((val += rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((val += MOD - rhs.val) >= MOD) {
val -= MOD;
}
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
val = (int)((long long)val * rhs.val % MOD);
return *this;
}
mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inv(); }
mod_int operator+() const { return *this; }
mod_int operator-() const { return mod_int(-val); }
mod_int operator++() { return *this += 1; }
mod_int operator--() { return *this -= 1; }
mod_int operator++(signed) {
const mod_int ret(*this);
++*this;
return ret;
}
mod_int operator--(signed) {
const mod_int ret(*this);
--*this;
return ret;
}
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
mod_int inv() const {
int a = MOD, b = val, u = 0, v = 1;
while (b > 0) {
int t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return mod_int(u);
}
mod_int pow(long long n) const {
if (n < 0) {
return pow(-n).inv();
}
mod_int ret = 1, mul = *this;
while (n > 0) {
if (n & 1) {
ret *= mul;
}
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
long long v;
is >> v;
rhs = v;
return is;
}
friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
return os << rhs.val;
}
struct combination {
std::vector<mod_int> fact{1, 1}, f_inv{1, 1}, inv{0, 1};
void calc(int n) {
while (fact.size() <= n) {
int i = fact.size();
fact.push_back(fact[i - 1] * i);
inv.push_back(-inv[MOD % i] * (MOD / i));
f_inv.push_back(f_inv[i - 1] * inv[i]);
}
}
mod_int P(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[n - r]);
}
mod_int C(int n, int r) {
return r < 0 || n < r ? 0 : (calc(n), fact[n] * f_inv[r] * f_inv[n - r]);
}
mod_int H(int n, int r) { return C(n + r - 1, r); }
};
};
using mint = mod_int<>;
mint b[220000], w[220000];
int B, W;
signed main() {
cin >> B >> W;
mint::combination comb;
b[0] = w[0] = 0;
reps(i, B + W) {
b[i] = b[i - 1] + comb.C(i - 2, B - 1) / mint(2).pow(i - 1);
w[i] = w[i - 1] + comb.C(i - 2, W - 1) / mint(2).pow(i - 1);
cout << (mint(1) - b[i] - w[i]) / 2 + w[i] << endl;
}
}
| replace | 158 | 159 | 158 | 159 | 0 | |
p03083 | C++ | Runtime Error | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
using namespace std;
char sr[1 << 21], z[20];
int K = -1, Z = 0;
inline void Ot() { fwrite(sr, 1, K + 1, stdout), K = -1; }
void print(R int x) {
if (K > 1 << 20)
Ot();
if (x < 0)
sr[++K] = '-', x = -x;
while (z[++Z] = x % 10 + 48, x /= 10)
;
while (sr[++K] = z[Z], --Z)
;
sr[++K] = '\n';
}
const int N = 205, M = 1e5 + 5, P = 1e9 + 7, inv2 = 500000004;
inline int add(R int x, R int y) { return x + y >= P ? x + y - P : x + y; }
inline int dec(R int x, R int y) { return x - y < 0 ? x - y + P : x - y; }
inline int mul(R int x, R int y) { return 1ll * x * y - 1ll * x * y / P * P; }
int ksm(R int x, R int y) {
R int res = 1;
for (; y; y >>= 1, x = mul(x, x))
(y & 1) ? res = mul(res, x) : 0;
return res;
}
int fac[N], ifac[N], bin[N], pw[N], pb[N], b, w;
inline int C(R int n, R int m) {
return m > n ? 0 : 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P;
}
int main() {
// freopen("testdata.in","r",stdin);
scanf("%d%d", &b, &w);
fac[0] = ifac[0] = 1;
fp(i, 1, b + w) fac[i] = mul(fac[i - 1], i);
ifac[b + w] = ksm(fac[b + w], P - 2);
fd(i, b + w - 1, 1) ifac[i] = mul(ifac[i + 1], i + 1);
bin[0] = 1;
fp(i, 1, b + w) bin[i] = mul(bin[i - 1], inv2);
fp(i, 1, b + w) {
pw[i] = add(pw[i - 1], mul(C(i - 1, w - 1), bin[i]));
pb[i] = add(pb[i - 1], mul(C(i - 1, b - 1), bin[i]));
print(add(1ll * (1 + P - pw[i - 1] + P - pb[i - 1]) * inv2 % P, pw[i - 1]));
}
return Ot(), 0;
} | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
using namespace std;
char sr[1 << 21], z[20];
int K = -1, Z = 0;
inline void Ot() { fwrite(sr, 1, K + 1, stdout), K = -1; }
void print(R int x) {
if (K > 1 << 20)
Ot();
if (x < 0)
sr[++K] = '-', x = -x;
while (z[++Z] = x % 10 + 48, x /= 10)
;
while (sr[++K] = z[Z], --Z)
;
sr[++K] = '\n';
}
const int N = 2e5 + 5, P = 1e9 + 7, inv2 = 500000004;
inline int add(R int x, R int y) { return x + y >= P ? x + y - P : x + y; }
inline int dec(R int x, R int y) { return x - y < 0 ? x - y + P : x - y; }
inline int mul(R int x, R int y) { return 1ll * x * y - 1ll * x * y / P * P; }
int ksm(R int x, R int y) {
R int res = 1;
for (; y; y >>= 1, x = mul(x, x))
(y & 1) ? res = mul(res, x) : 0;
return res;
}
int fac[N], ifac[N], bin[N], pw[N], pb[N], b, w;
inline int C(R int n, R int m) {
return m > n ? 0 : 1ll * fac[n] * ifac[m] % P * ifac[n - m] % P;
}
int main() {
// freopen("testdata.in","r",stdin);
scanf("%d%d", &b, &w);
fac[0] = ifac[0] = 1;
fp(i, 1, b + w) fac[i] = mul(fac[i - 1], i);
ifac[b + w] = ksm(fac[b + w], P - 2);
fd(i, b + w - 1, 1) ifac[i] = mul(ifac[i + 1], i + 1);
bin[0] = 1;
fp(i, 1, b + w) bin[i] = mul(bin[i - 1], inv2);
fp(i, 1, b + w) {
pw[i] = add(pw[i - 1], mul(C(i - 1, w - 1), bin[i]));
pb[i] = add(pb[i - 1], mul(C(i - 1, b - 1), bin[i]));
print(add(1ll * (1 + P - pw[i - 1] + P - pb[i - 1]) * inv2 % P, pw[i - 1]));
}
return Ot(), 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 100005;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; 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;
}
}
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
init();
int b, w, ans = inv[2], p = 1;
cin >> b >> w;
for (int i = 1; i <= b + w; i++) {
p = (p * inv[2]) % MOD;
ans = (ans + p * (COM(i - 2, w - 1) + MOD - COM(i - 2, b - 1))) % MOD;
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 200005;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; 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;
}
}
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
init();
int b, w, ans = inv[2], p = 1;
cin >> b >> w;
for (int i = 1; i <= b + w; i++) {
p = (p * inv[2]) % MOD;
ans = (ans + p * (COM(i - 2, w - 1) + MOD - COM(i - 2, b - 1))) % MOD;
cout << ans << endl;
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 7;
const int MOD = 1000 * 1000 * 1000 + 7;
int mod(int n) { return (n % MOD + MOD) % MOD; }
int fp(int n, int p) {
int ans = 1, c = n;
for (int i = 0; (1ll << i) <= p; ++i) {
if ((p >> i) & 1)
ans = mod(ans * c);
c = mod(c * c);
}
return ans;
}
int mdiv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
struct F {
int a, b;
F(int a_, int b_) {
a = a_;
b = b_;
}
F() {}
F operator+(F p) { return {mod(a * p.b + p.a * b), mod(b * p.b)}; }
F operator-(F p) { return {mod(a * p.b - p.a * b), mod(b * p.b)}; }
F operator*(F p) { return {mod(a * p.a), mod(b * p.b)}; }
F operator/(F p) { return {mod(a * p.b), mod(b * p.a)}; }
F operator*(int p) { return {mod(a * p), b}; }
F operator/(int p) { return {a, mod(b * p)}; }
};
int f[N];
void prec() {
f[0] = 1;
for (int i = 1; i < N; ++i) {
f[i] = mod(f[i - 1] * i);
}
}
F C(int n, int k) {
if (n < k)
return {0, 1};
else
return {f[n], mod(f[k] * f[n - k])};
}
int B, W;
F all_black[N], all_white[N];
F one_black(int h) {
int del = B - 1;
return C(h, del) / fp(2, h);
}
F one_white(int h) {
int del = W - 1;
return C(h, del) / fp(2, h);
}
void print(F p) { cout << "F " << p.a << ' ' << p.b << '\n'; }
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
prec();
cin >> B >> W;
all_white[0] = all_black[0] = {0, 1};
for (int i = 1; i < W + B; ++i) {
all_white[i] = all_white[i - 1] + one_black(i - 1) / 2;
all_black[i] = all_black[i - 1] + one_white(i - 1) / 2;
}
for (int i = 0; i < W + B; ++i) {
if (!all_white[i].a && !all_black[i].a) {
cout << mdiv(1, 2) << '\n';
} else {
F ans = {0, 1};
ans = ans + all_black[i];
ans = ans + (F(1, 1) - all_white[i] - all_black[i]) / 2;
#ifdef HOME
print(ans);
#endif
cout << mdiv(ans.a, ans.b) << '\n';
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 7;
const int MOD = 1000 * 1000 * 1000 + 7;
int mod(int n) { return (n % MOD + MOD) % MOD; }
int fp(int n, int p) {
int ans = 1, c = n;
for (int i = 0; (1ll << i) <= p; ++i) {
if ((p >> i) & 1)
ans = mod(ans * c);
c = mod(c * c);
}
return ans;
}
int mdiv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
struct F {
int a, b;
F(int a_, int b_) {
a = a_;
b = b_;
}
F() {}
F operator+(F p) { return {mod(a * p.b + p.a * b), mod(b * p.b)}; }
F operator-(F p) { return {mod(a * p.b - p.a * b), mod(b * p.b)}; }
F operator*(F p) { return {mod(a * p.a), mod(b * p.b)}; }
F operator/(F p) { return {mod(a * p.b), mod(b * p.a)}; }
F operator*(int p) { return {mod(a * p), b}; }
F operator/(int p) { return {a, mod(b * p)}; }
};
int f[N];
void prec() {
f[0] = 1;
for (int i = 1; i < N; ++i) {
f[i] = mod(f[i - 1] * i);
}
}
F C(int n, int k) {
if (n < k)
return {0, 1};
else
return {f[n], mod(f[k] * f[n - k])};
}
int B, W;
F all_black[N], all_white[N];
F one_black(int h) {
int del = B - 1;
return C(h, del) / fp(2, h);
}
F one_white(int h) {
int del = W - 1;
return C(h, del) / fp(2, h);
}
void print(F p) { cout << "F " << p.a << ' ' << p.b << '\n'; }
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
prec();
cin >> B >> W;
all_white[0] = all_black[0] = {0, 1};
for (int i = 1; i < W + B; ++i) {
all_white[i] = all_white[i - 1] + one_black(i - 1) / 2;
all_black[i] = all_black[i - 1] + one_white(i - 1) / 2;
}
for (int i = 0; i < W + B; ++i) {
if (!all_white[i].a && !all_black[i].a) {
cout << mdiv(1, 2) << '\n';
} else {
F ans = {0, 1};
ans = ans + all_black[i];
ans = ans + (F(1, 1) - all_white[i] - all_black[i]) / 2;
#ifdef HOME
print(ans);
#endif
cout << mdiv(ans.a, ans.b) << '\n';
}
}
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03083 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (int i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll base, ll exponent, ll module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
ll root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
ll inverse(ll x) { return power(x, mod - 2, mod); }
combination table(1e6);
ll b;
ll w;
signed main() {
ios::sync_with_stdio(false);
cin >> b >> w;
vector<ll> p(b + w);
vector<ll> q(b + w);
ll ans = inverse(2);
p[w] = inverse(power(2, w, mod));
REP_FROM(i, w, b + w) {
p[i + 1] =
p[i] + table.C(i, w - 1) * inverse(power(2, i + 1, mod) % mod) % mod;
p[i + 1] %= mod;
}
q[b] = inverse(power(2, b, mod));
REP_FROM(i, b, b + w) {
q[i + 1] =
q[i] + table.C(i, b - 1) * inverse(power(2, i + 1, mod) % mod) % mod;
q[i + 1] %= mod;
}
REP(i, b + w) {
ll ans = inverse(2);
ans += (inverse(2) * p[i]) % mod;
ans %= mod;
ans -= (inverse(2) * q[i]) % mod;
if (ans < 0)
ans += mod;
ans %= mod;
cout << ans << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (int i = (j); i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll power(ll base, ll exponent, ll module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
ll root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
ll inverse(ll x) { return power(x, mod - 2, mod); }
combination table(1e6);
ll b;
ll w;
signed main() {
ios::sync_with_stdio(false);
cin >> b >> w;
vector<ll> p(b + w + 1);
vector<ll> q(b + w + 1);
ll ans = inverse(2);
p[w] = inverse(power(2, w, mod));
REP_FROM(i, w, b + w) {
p[i + 1] =
p[i] + table.C(i, w - 1) * inverse(power(2, i + 1, mod) % mod) % mod;
p[i + 1] %= mod;
}
q[b] = inverse(power(2, b, mod));
REP_FROM(i, b, b + w) {
q[i + 1] =
q[i] + table.C(i, b - 1) * inverse(power(2, i + 1, mod) % mod) % mod;
q[i + 1] %= mod;
}
REP(i, b + w) {
ll ans = inverse(2);
ans += (inverse(2) * p[i]) % mod;
ans %= mod;
ans -= (inverse(2) * q[i]) % mod;
if (ans < 0)
ans += mod;
ans %= mod;
cout << ans << endl;
}
}
| replace | 50 | 52 | 50 | 52 | -6 | munmap_chunk(): invalid pointer
|
p03083 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
// #pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
// pythonのrangeのような範囲for文用のclass for(const auto& i : Range<>(10))
// のように書く
template <typename T = i64> struct Range {
struct iterator {
T value;
const T step, last;
const T &operator*() { return value; }
iterator(T value, T step, T last)
: value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
step(step), last(last) {}
iterator operator++() {
value = step < static_cast<T>(0) ? max(value + step, last)
: min(value + step, last);
return *this;
}
bool operator!=(const iterator &x) { return value != x.value; }
};
const T start, last, step;
Range(const T start, const T last, const T step = static_cast<T>(1))
: start(start), last(last), step(step) {}
Range(const T last) : start(0), last(last), step(1) {}
iterator begin() { return iterator(start, step, last); }
iterator end() { return iterator(last, step, last); }
};
// lambda式を用いた再帰
template <typename F> struct FixPoint {
const F _f;
FixPoint(F &&f) : _f(forward<F>(f)) {}
template <typename... Types>
decltype(auto) operator()(Types &&...args) const {
return _f(*this, forward<Types>(args)...);
}
};
template <typename F> static decltype(auto) makeRec(F &&f) {
return FixPoint<F>(forward<F>(f));
}
// 多次元vectorの一斉初期化 makeVector<i64, 0>(a, b, ...)のように書く
template <typename T, T Value = T()> vector<T> makeVector(size_t x) {
return vector<T>(x, T(Value));
}
template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args) {
return vector<decltype(makeVector<T, Value>(args...))>(
x, makeVector<T, Value>(args...));
}
// 最大値を更新し、更新できた時にはtrueを返す
template <typename T = i64> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 同様に最小値を更新する
template <typename T = i64> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// 行数と変数名、値をclogに表示するデバッグ用print
#define dump(x) \
fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); \
clog << "value = " << x << endl;
// 同様の配列向けデバッグ用print
#define vecdump(x) \
fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); \
_dump_macro(x);
void _dump(int, string &x) { clog << x << endl; }
template <typename T> void _dump(bool, T &x) { clog << x << " "; }
template <typename T, typename U = typename T::iterator> void _dump(int, T &x) {
for (auto &elm : x)
_dump(0, elm);
clog << endl;
}
template <typename T> void _dump_macro(T &x) { _dump(0, x); }
// input用の関数群
void _input(int, string &x) { cin >> x; }
template <typename T> void _input(bool, T &x) { cin >> x; }
template <typename T, typename U = typename T::iterator>
void _input(int, T &x) {
for (auto &elm : x)
_input(0, elm);
}
template <typename T> void input_single(T &x) { _input(0, x); }
auto input() {}
template <typename T, typename... Types> void input(T &value, Types &&...args) {
input_single(value);
input(forward<Types>(args)...);
};
void _pararell_input(size_t) {}
template <typename T, typename... Types>
void _pararell_input(size_t index, T &value, Types &&...args) {
input(value[index]);
_pararell_input(index, forward<Types>(args)...);
}
template <typename... Types>
void pararell_input(size_t count, Types &&...args) {
for (const auto &i : Range<>(count))
_pararell_input(i, forward<Types>(args)...);
}
template <i64 mod = MOD> struct ModInt {
i64 p;
ModInt() : p(0) {}
ModInt(i64 x) { p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod; }
ModInt &operator+=(const ModInt &y) {
p = p + *y - ((p + *y) >= mod ? mod : 0);
return *this;
}
ModInt &operator-=(const ModInt &y) {
p = p - *y + (p - *y < 0 ? mod : 0);
return *this;
}
ModInt &operator*=(const ModInt &y) {
p = (p * *y) % mod;
return *this;
}
ModInt &operator%=(const ModInt &y) {
if (y)
p %= *y;
return *this;
}
ModInt operator+(const ModInt &y) const {
ModInt x = *this;
return x += y;
}
ModInt operator-(const ModInt &y) const {
ModInt x = *this;
return x -= y;
}
ModInt operator*(const ModInt &y) const {
ModInt x = *this;
return x *= y;
}
ModInt operator%(const ModInt &y) const {
ModInt x = *this;
return x %= y;
}
friend ostream &operator<<(ostream &stream, const ModInt<mod> &x) {
stream << *x;
return stream;
}
friend ostream &operator>>(ostream &stream, const ModInt<mod> &x) {
stream >> *x;
return stream;
}
ModInt &operator++() {
p = (p + 1) % mod;
return *this;
}
ModInt &operator--() {
p = (p - 1 + mod) % mod;
return *this;
}
bool operator==(const ModInt &y) const { return p == *y; }
bool operator!=(const ModInt &y) const { return p != *y; }
const i64 &operator*() const { return p; }
i64 &operator*() { return p; }
};
using mint = ModInt<>;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int aa, bb;
input(aa, bb);
int n = aa + bb;
auto mpow = [&](mint x, i64 y) {
mint z = x;
mint val = y & 1 ? x : 1L;
while (z = z * z, y >>= 1)
if (y & 1)
val = val * z;
return val;
};
vector<mint> fact(n + 1, 1), inv(n + 1, 1);
for (const auto &i : Range<>(n)) {
fact[i + 1] = fact[i] * (i + 1);
inv[i + 1] = mpow(fact[i + 1], MOD - 2);
}
auto ncr = [&fact, &inv](int n, int r) {
if (n < r)
return mint(0);
return fact[n] * inv[r] * inv[n - r];
};
vector<mint> tpow(n + 1, 1), tinv(n + 1);
for (const auto &i : Range<>(1, n + 1)) {
tpow[i] = tpow[i - 1] * 2;
tinv[i] = mpow(tpow[i], MOD - 2);
}
auto f = [&](int a, int b) {
vector<mint> dp(a + 1, 0);
dp[a] = 1;
int n = a + b;
vector<mint> val(n, 0);
for (const auto &i : Range<>(n)) {
vector<mint> nex(a + 1, 0);
for (const auto &j : Range<>(a + 1)) {
if (j && i - (a - j) != b) {
nex[j - 1] += dp[j];
nex[j] += dp[j];
val[i] += dp[j];
} else if (j) {
nex[j - 1] += dp[j] * 2;
val[i] += dp[j] * 2;
} else {
nex[j] += dp[j] * 2;
}
}
dp = move(nex);
}
vector<mint> da(n + 1, 0), db(n + 1, 0);
for (const auto &i : Range<>(1, n + 1)) {
da[i] = da[i - 1] + ncr(i - 1, a - 1) * tinv[i];
db[i] = db[i - 1] + ncr(i - 1, b - 1) * tinv[i];
}
for (const auto &i : Range<>(0, n)) {
cout << (mint(1) - da[i] + db[i]) * tinv[1] << endl;
}
};
f(aa, bb);
}
| #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
// #pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
// pythonのrangeのような範囲for文用のclass for(const auto& i : Range<>(10))
// のように書く
template <typename T = i64> struct Range {
struct iterator {
T value;
const T step, last;
const T &operator*() { return value; }
iterator(T value, T step, T last)
: value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
step(step), last(last) {}
iterator operator++() {
value = step < static_cast<T>(0) ? max(value + step, last)
: min(value + step, last);
return *this;
}
bool operator!=(const iterator &x) { return value != x.value; }
};
const T start, last, step;
Range(const T start, const T last, const T step = static_cast<T>(1))
: start(start), last(last), step(step) {}
Range(const T last) : start(0), last(last), step(1) {}
iterator begin() { return iterator(start, step, last); }
iterator end() { return iterator(last, step, last); }
};
// lambda式を用いた再帰
template <typename F> struct FixPoint {
const F _f;
FixPoint(F &&f) : _f(forward<F>(f)) {}
template <typename... Types>
decltype(auto) operator()(Types &&...args) const {
return _f(*this, forward<Types>(args)...);
}
};
template <typename F> static decltype(auto) makeRec(F &&f) {
return FixPoint<F>(forward<F>(f));
}
// 多次元vectorの一斉初期化 makeVector<i64, 0>(a, b, ...)のように書く
template <typename T, T Value = T()> vector<T> makeVector(size_t x) {
return vector<T>(x, T(Value));
}
template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args) {
return vector<decltype(makeVector<T, Value>(args...))>(
x, makeVector<T, Value>(args...));
}
// 最大値を更新し、更新できた時にはtrueを返す
template <typename T = i64> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 同様に最小値を更新する
template <typename T = i64> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// 行数と変数名、値をclogに表示するデバッグ用print
#define dump(x) \
fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); \
clog << "value = " << x << endl;
// 同様の配列向けデバッグ用print
#define vecdump(x) \
fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); \
_dump_macro(x);
void _dump(int, string &x) { clog << x << endl; }
template <typename T> void _dump(bool, T &x) { clog << x << " "; }
template <typename T, typename U = typename T::iterator> void _dump(int, T &x) {
for (auto &elm : x)
_dump(0, elm);
clog << endl;
}
template <typename T> void _dump_macro(T &x) { _dump(0, x); }
// input用の関数群
void _input(int, string &x) { cin >> x; }
template <typename T> void _input(bool, T &x) { cin >> x; }
template <typename T, typename U = typename T::iterator>
void _input(int, T &x) {
for (auto &elm : x)
_input(0, elm);
}
template <typename T> void input_single(T &x) { _input(0, x); }
auto input() {}
template <typename T, typename... Types> void input(T &value, Types &&...args) {
input_single(value);
input(forward<Types>(args)...);
};
void _pararell_input(size_t) {}
template <typename T, typename... Types>
void _pararell_input(size_t index, T &value, Types &&...args) {
input(value[index]);
_pararell_input(index, forward<Types>(args)...);
}
template <typename... Types>
void pararell_input(size_t count, Types &&...args) {
for (const auto &i : Range<>(count))
_pararell_input(i, forward<Types>(args)...);
}
template <i64 mod = MOD> struct ModInt {
i64 p;
ModInt() : p(0) {}
ModInt(i64 x) { p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod; }
ModInt &operator+=(const ModInt &y) {
p = p + *y - ((p + *y) >= mod ? mod : 0);
return *this;
}
ModInt &operator-=(const ModInt &y) {
p = p - *y + (p - *y < 0 ? mod : 0);
return *this;
}
ModInt &operator*=(const ModInt &y) {
p = (p * *y) % mod;
return *this;
}
ModInt &operator%=(const ModInt &y) {
if (y)
p %= *y;
return *this;
}
ModInt operator+(const ModInt &y) const {
ModInt x = *this;
return x += y;
}
ModInt operator-(const ModInt &y) const {
ModInt x = *this;
return x -= y;
}
ModInt operator*(const ModInt &y) const {
ModInt x = *this;
return x *= y;
}
ModInt operator%(const ModInt &y) const {
ModInt x = *this;
return x %= y;
}
friend ostream &operator<<(ostream &stream, const ModInt<mod> &x) {
stream << *x;
return stream;
}
friend ostream &operator>>(ostream &stream, const ModInt<mod> &x) {
stream >> *x;
return stream;
}
ModInt &operator++() {
p = (p + 1) % mod;
return *this;
}
ModInt &operator--() {
p = (p - 1 + mod) % mod;
return *this;
}
bool operator==(const ModInt &y) const { return p == *y; }
bool operator!=(const ModInt &y) const { return p != *y; }
const i64 &operator*() const { return p; }
i64 &operator*() { return p; }
};
using mint = ModInt<>;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int aa, bb;
input(aa, bb);
int n = aa + bb;
auto mpow = [&](mint x, i64 y) {
mint z = x;
mint val = y & 1 ? x : 1L;
while (z = z * z, y >>= 1)
if (y & 1)
val = val * z;
return val;
};
vector<mint> fact(n + 1, 1), inv(n + 1, 1);
for (const auto &i : Range<>(n)) {
fact[i + 1] = fact[i] * (i + 1);
inv[i + 1] = mpow(fact[i + 1], MOD - 2);
}
auto ncr = [&fact, &inv](int n, int r) {
if (n < r)
return mint(0);
return fact[n] * inv[r] * inv[n - r];
};
vector<mint> tpow(n + 1, 1), tinv(n + 1);
for (const auto &i : Range<>(1, n + 1)) {
tpow[i] = tpow[i - 1] * 2;
tinv[i] = mpow(tpow[i], MOD - 2);
}
auto f = [&](int a, int b) {
vector<mint> da(n + 1, 0), db(n + 1, 0);
for (const auto &i : Range<>(1, n + 1)) {
da[i] = da[i - 1] + ncr(i - 1, a - 1) * tinv[i];
db[i] = db[i - 1] + ncr(i - 1, b - 1) * tinv[i];
}
for (const auto &i : Range<>(0, n)) {
cout << (mint(1) - da[i] + db[i]) * tinv[1] << endl;
}
};
f(aa, bb);
}
| delete | 254 | 275 | 254 | 254 | TLE | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1'000'000'007;
int64_t fact[200001], factinv[200001];
int64_t mpow(int64_t x, int64_t y) {
if (y == 0)
return 1;
if (y == 1)
return x % MOD;
if (y % 2 == 0)
return mpow(x * x % MOD, y / 2) % MOD;
return mpow(x * x % MOD, y / 2) * x % MOD;
}
int64_t comb(int64_t n, int64_t r) {
if (r > n)
return 0;
return fact[n] * factinv[r] % MOD * factinv[n - r] % MOD;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout.precision(12);
cout.setf(ios_base::fixed, ios_base::floatfield);
int B, W;
cin >> B >> W;
if (B == 0) {
for (int i = 0; i < B + W; i++)
cout << 0 << endl;
return 0;
}
if (W == 0) {
for (int i = 0; i < B + W; i++)
cout << 1 << endl;
return 0;
}
const int64_t half = mpow(2, MOD - 2);
fact[0] = fact[1] = 1;
for (int i = 2; i <= 200000; i++)
fact[i] = i * fact[i - 1] % MOD;
factinv[200000] = mpow(fact[200000], MOD - 2);
for (int i = 199999; i >= 0; i--)
factinv[i] = (i + 1) * factinv[i + 1] % MOD;
int64_t p[100001], q[100001];
p[0] = q[0] = 0;
for (int i = 1; i < B + W; i++) {
p[i] = p[i - 1];
q[i] = q[i - 1];
if (W - 1 >= 0 && i - W >= 0) {
p[i] =
(p[i] + comb(i - 1, W - 1) * mpow(half, i - 1) % MOD * half % MOD) %
MOD;
}
if (B - 1 >= 0 && i - B >= 0) {
q[i] =
(q[i] + comb(i - 1, B - 1) * mpow(half, i - 1) % MOD * half % MOD) %
MOD;
}
}
for (int i = 0; i < B + W; i++) {
cout << (p[i] + (1 - p[i] - q[i] + 2 * MOD) % MOD * half % MOD) % MOD
<< endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1'000'000'007;
int64_t fact[200001], factinv[200001];
int64_t mpow(int64_t x, int64_t y) {
if (y == 0)
return 1;
if (y == 1)
return x % MOD;
if (y % 2 == 0)
return mpow(x * x % MOD, y / 2) % MOD;
return mpow(x * x % MOD, y / 2) * x % MOD;
}
int64_t comb(int64_t n, int64_t r) {
if (r > n)
return 0;
return fact[n] * factinv[r] % MOD * factinv[n - r] % MOD;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout.precision(12);
cout.setf(ios_base::fixed, ios_base::floatfield);
int B, W;
cin >> B >> W;
if (B == 0) {
for (int i = 0; i < B + W; i++)
cout << 0 << endl;
return 0;
}
if (W == 0) {
for (int i = 0; i < B + W; i++)
cout << 1 << endl;
return 0;
}
const int64_t half = mpow(2, MOD - 2);
fact[0] = fact[1] = 1;
for (int i = 2; i <= 200000; i++)
fact[i] = i * fact[i - 1] % MOD;
factinv[200000] = mpow(fact[200000], MOD - 2);
for (int i = 199999; i >= 0; i--)
factinv[i] = (i + 1) * factinv[i + 1] % MOD;
int64_t p[200001], q[200001];
p[0] = q[0] = 0;
for (int i = 1; i < B + W; i++) {
p[i] = p[i - 1];
q[i] = q[i - 1];
if (W - 1 >= 0 && i - W >= 0) {
p[i] =
(p[i] + comb(i - 1, W - 1) * mpow(half, i - 1) % MOD * half % MOD) %
MOD;
}
if (B - 1 >= 0 && i - B >= 0) {
q[i] =
(q[i] + comb(i - 1, B - 1) * mpow(half, i - 1) % MOD * half % MOD) %
MOD;
}
}
for (int i = 0; i < B + W; i++) {
cout << (p[i] + (1 - p[i] - q[i] + 2 * MOD) % MOD * half % MOD) % MOD
<< endl;
}
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
const int N = 1000 * 100 + 10, M = 210;
const int mod = 1000 * 1000 * 1000 + 7;
int fact[N], inv[N];
int tv(int x, int y) {
if (!y)
return 1;
ll ans = tv(x, y / 2);
ans *= ans;
ans %= mod;
if (y & 1)
ans *= x;
return ans % mod;
}
int c(int x, int y) {
if (y > x)
return 0;
return 1ll * fact[x] * inv[y] % mod * inv[x - y] % mod;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = 1ll * fact[i - 1] * i % mod;
inv[N - 1] = tv(fact[N - 1], mod - 2);
for (int i = N - 2; i > -1; i--)
inv[i] = 1ll * (i + 1) * inv[i + 1] % mod;
int n, m;
cin >> n >> m;
int t = tv(2, mod - 2);
int p = 0, q = 0;
for (int i = 0; i < n + m; i++) {
cout << 1ll * (1ll + p - q + mod) * t % mod << '\n';
p += 1ll * c(i, m - 1) * tv(t, i + 1) % mod;
p %= mod;
q += 1ll * c(i, n - 1) * tv(t, i + 1) % mod;
q %= mod;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
const int N = 10000 * 100 + 10, M = 210;
const int mod = 1000 * 1000 * 1000 + 7;
int fact[N], inv[N];
int tv(int x, int y) {
if (!y)
return 1;
ll ans = tv(x, y / 2);
ans *= ans;
ans %= mod;
if (y & 1)
ans *= x;
return ans % mod;
}
int c(int x, int y) {
if (y > x)
return 0;
return 1ll * fact[x] * inv[y] % mod * inv[x - y] % mod;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = 1ll * fact[i - 1] * i % mod;
inv[N - 1] = tv(fact[N - 1], mod - 2);
for (int i = N - 2; i > -1; i--)
inv[i] = 1ll * (i + 1) * inv[i + 1] % mod;
int n, m;
cin >> n >> m;
int t = tv(2, mod - 2);
int p = 0, q = 0;
for (int i = 0; i < n + m; i++) {
cout << 1ll * (1ll + p - q + mod) * t % mod << '\n';
p += 1ll * c(i, m - 1) * tv(t, i + 1) % mod;
p %= mod;
q += 1ll * c(i, n - 1) * tv(t, i + 1) % mod;
q %= mod;
}
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03083 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
typedef pair<double, double> pd;
typedef pair<double, ll> pdl;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
class comb {
private:
ll mod;
ll mx;
vector<ll> F;
vector<ll> FR;
public:
comb(ll mod = 1000000007, ll mx = 100000)
: mod(mod), mx(mx), F(mx + 1, 1), FR(mx + 1, 1) {
mk_F();
}
ll mod_pow(ll a, ll x) {
a %= mod;
ll ans = 1;
while (x > 0) {
if (x & 1) {
ans *= a;
ans %= mod;
}
a *= a;
a %= mod;
x >>= 1;
}
return ans;
}
pll Ex_gcd(ll a, ll b) {
if (b == 0) {
return {1, 0};
}
pll ret = Ex_gcd(b, a % b);
ret.F -= a / b * ret.S;
return {ret.S, ret.F};
}
ll prime_R(ll a) { return mod_pow(a, mod - 2); }
ll R(ll a) {
ll ret = Ex_gcd(a, mod).F;
ret %= mod;
if (ret < 0) {
ret += mod;
}
return ret;
}
void mk_F() {
for (ll i = 1; i <= mx; i++) {
F[i] = F[i - 1] * i % mod;
FR[i] = R(F[i]);
}
}
ll c(ll n, ll k) {
if (n < k) {
return 0;
}
if (n == k || k == 0) {
return 1;
}
return F[n] * FR[n - k] % mod * FR[k] % mod;
}
// mod must be prime
ll Lucas_C(ll n, ll m) {
ll ret = 1;
while (n > 0 || m > 0) {
ret *= c(n % mod, m % mod);
ret %= mod;
n /= mod;
m /= mod;
}
return ret;
}
ll Stirling(ll n, ll k) {
ll ret = 0;
for (ll i = 1; i <= k; i++) {
if ((k - i) % 2) {
ret -= c(k, i) * mod_pow(i, n) % mod;
} else {
ret += c(k, i) * mod_pow(i, n) % mod;
}
ret %= mod;
}
ret *= R(F[k]);
ret %= mod;
if (ret < 0) {
ret += mod;
}
return ret;
}
ll Bell(ll n, ll k) {
ll ret = 0;
for (ll i = 1; i <= k; i++) {
ret += Stirling(n, i);
ret %= mod;
}
return ret;
}
};
comb C;
int main() {
ll b, w;
cin >> b >> w;
ll p = 0, q = 0;
ll inv = (MOD + 1) / 2;
ll T = 1;
ll all = 1;
for (ll i = 0; i < b + w; i++) {
ll ans = q * T % MOD;
ans += (all - p - q) * T % MOD * inv % MOD;
ans %= MOD;
if (ans < 0) {
ans += MOD;
}
cout << ans << endl;
all *= 2;
all %= MOD;
p *= 2;
q *= 2;
if (i + 1 >= b) {
p += C.c(i, b - 1);
}
if (i + 1 >= w) {
q += C.c(i, w - 1);
}
p %= MOD;
q %= MOD;
T *= inv;
T %= MOD;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pi;
typedef pair<double, double> pd;
typedef pair<double, ll> pdl;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 1000000007;
class comb {
private:
ll mod;
ll mx;
vector<ll> F;
vector<ll> FR;
public:
comb(ll mod = 1000000007, ll mx = 1000000)
: mod(mod), mx(mx), F(mx + 1, 1), FR(mx + 1, 1) {
mk_F();
}
ll mod_pow(ll a, ll x) {
a %= mod;
ll ans = 1;
while (x > 0) {
if (x & 1) {
ans *= a;
ans %= mod;
}
a *= a;
a %= mod;
x >>= 1;
}
return ans;
}
pll Ex_gcd(ll a, ll b) {
if (b == 0) {
return {1, 0};
}
pll ret = Ex_gcd(b, a % b);
ret.F -= a / b * ret.S;
return {ret.S, ret.F};
}
ll prime_R(ll a) { return mod_pow(a, mod - 2); }
ll R(ll a) {
ll ret = Ex_gcd(a, mod).F;
ret %= mod;
if (ret < 0) {
ret += mod;
}
return ret;
}
void mk_F() {
for (ll i = 1; i <= mx; i++) {
F[i] = F[i - 1] * i % mod;
FR[i] = R(F[i]);
}
}
ll c(ll n, ll k) {
if (n < k) {
return 0;
}
if (n == k || k == 0) {
return 1;
}
return F[n] * FR[n - k] % mod * FR[k] % mod;
}
// mod must be prime
ll Lucas_C(ll n, ll m) {
ll ret = 1;
while (n > 0 || m > 0) {
ret *= c(n % mod, m % mod);
ret %= mod;
n /= mod;
m /= mod;
}
return ret;
}
ll Stirling(ll n, ll k) {
ll ret = 0;
for (ll i = 1; i <= k; i++) {
if ((k - i) % 2) {
ret -= c(k, i) * mod_pow(i, n) % mod;
} else {
ret += c(k, i) * mod_pow(i, n) % mod;
}
ret %= mod;
}
ret *= R(F[k]);
ret %= mod;
if (ret < 0) {
ret += mod;
}
return ret;
}
ll Bell(ll n, ll k) {
ll ret = 0;
for (ll i = 1; i <= k; i++) {
ret += Stirling(n, i);
ret %= mod;
}
return ret;
}
};
comb C;
int main() {
ll b, w;
cin >> b >> w;
ll p = 0, q = 0;
ll inv = (MOD + 1) / 2;
ll T = 1;
ll all = 1;
for (ll i = 0; i < b + w; i++) {
ll ans = q * T % MOD;
ans += (all - p - q) * T % MOD * inv % MOD;
ans %= MOD;
if (ans < 0) {
ans += MOD;
}
cout << ans << endl;
all *= 2;
all %= MOD;
p *= 2;
q *= 2;
if (i + 1 >= b) {
p += C.c(i, b - 1);
}
if (i + 1 >= w) {
q += C.c(i, w - 1);
}
p %= MOD;
q %= MOD;
T *= inv;
T %= MOD;
}
return 0;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#define reset(x, y) memset(x, y, sizeof(x))
#define uni(x) (x).erase(unique(all(x)), (x).end());
#define BUG(x) cerr << #x << " = " << (x) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define _1 first
#define _2 second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
const int MOD = 1e9 + 7;
const int inv2 = 5e8 + 4;
const int maxn = 112345;
int fac[maxn * 2], ifac[maxn * 2];
inline int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline int mul(int a, int b) { return ll(a) * b % MOD; }
int C(int n, int m) {
if (m < 0 || m > n)
return 0;
return mul(mul(fac[n], ifac[m]), ifac[n - m]);
}
int pow_mod(int a, int k) {
int ret = 1;
while (k) {
if (k & 1)
ret = mul(ret, a);
a = mul(a, a);
k >>= 1;
}
return ret;
}
int inv(int a) { return pow_mod(a, MOD - 2); }
int b, w, dp[maxn][2];
int main() {
scanf("%d%d", &b, &w);
fac[0] = 1;
FOR(i, 1, b + w) fac[i] = mul(fac[i - 1], i);
REP(i, b + w + 1) ifac[i] = inv(fac[i]);
FOR(i, 1, b + w) {
dp[i][0] = add(mul(C(i - 1, i - b), pow_mod(inv2, i)), dp[i - 1][0]);
dp[i][1] = add(mul(C(i - 1, i - w), pow_mod(inv2, i)), dp[i - 1][1]);
int rem = add(add(1, MOD - dp[i - 1][0]), MOD - dp[i - 1][1]);
printf("%d\n", add(mul(rem, inv2), dp[i - 1][1]));
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#define reset(x, y) memset(x, y, sizeof(x))
#define uni(x) (x).erase(unique(all(x)), (x).end());
#define BUG(x) cerr << #x << " = " << (x) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define _1 first
#define _2 second
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
const int MOD = 1e9 + 7;
const int inv2 = 5e8 + 4;
const int maxn = 112345;
int fac[maxn * 2], ifac[maxn * 2];
inline int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline int mul(int a, int b) { return ll(a) * b % MOD; }
int C(int n, int m) {
if (m < 0 || m > n)
return 0;
return mul(mul(fac[n], ifac[m]), ifac[n - m]);
}
int pow_mod(int a, int k) {
int ret = 1;
while (k) {
if (k & 1)
ret = mul(ret, a);
a = mul(a, a);
k >>= 1;
}
return ret;
}
int inv(int a) { return pow_mod(a, MOD - 2); }
int b, w, dp[maxn * 2][2];
int main() {
scanf("%d%d", &b, &w);
fac[0] = 1;
FOR(i, 1, b + w) fac[i] = mul(fac[i - 1], i);
REP(i, b + w + 1) ifac[i] = inv(fac[i]);
FOR(i, 1, b + w) {
dp[i][0] = add(mul(C(i - 1, i - b), pow_mod(inv2, i)), dp[i - 1][0]);
dp[i][1] = add(mul(C(i - 1, i - w), pow_mod(inv2, i)), dp[i - 1][1]);
int rem = add(add(1, MOD - dp[i - 1][0]), MOD - dp[i - 1][1]);
printf("%d\n", add(mul(rem, inv2), dp[i - 1][1]));
}
}
| replace | 55 | 56 | 55 | 56 | 0 | |
p03083 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int N = 100 * 1000 + 5;
const int mod = 1000 * 1000 * 1000 + 7;
long long psw[N];
long long psb[N];
long long fac[2 * N];
int po(long long x, long long y) {
if (y == 0)
return 1;
long long ans = po(x, y / 2);
ans *= ans;
ans %= mod;
if (y % 2) {
ans *= x;
ans %= mod;
}
return ans;
}
int chs(int x, int y) {
if (x < y)
return 0;
if (x == y)
return 1;
long long ans = fac[x];
ans *= po(fac[y], mod - 2);
ans %= mod;
ans *= po(fac[x - y], mod - 2);
ans %= mod;
return ans;
}
int main() {
fac[0] = 1;
for (int i = 1; i < 2 * N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
// cout << "28 " << i << " " << fac[i] << endl;
}
int b, w;
cin >> b >> w;
for (int i = 1; i <= w + b; i++) {
long long x = chs(i - 1, w - 1);
long long y = chs(i - 1, b - 1);
// cout << "73 " << x << " " << y << endl;
x *= po(2, 1ll * i * (mod - 2));
y *= po(2, 1ll * i * (mod - 2));
x %= mod;
y %= mod;
psw[i] = psw[i - 1] + x;
psb[i] = psb[i - 1] + y;
psw[i] %= mod;
psb[i] %= mod;
long long z = 1 - psw[i - 1] - psb[i - 1] + 2 * mod;
z %= mod;
// cout << i << " " << x << " " << y << " " << psw[i] << " " << psb[i] <<
//endl;
long long ans = (long long)psw[i - 1] + z * po(2, mod - 2);
ans %= mod;
cout << ans << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
const int N = 100 * 1000 + 5;
const int mod = 1000 * 1000 * 1000 + 7;
long long psw[2 * N];
long long psb[2 * N];
long long fac[2 * N];
int po(long long x, long long y) {
if (y == 0)
return 1;
long long ans = po(x, y / 2);
ans *= ans;
ans %= mod;
if (y % 2) {
ans *= x;
ans %= mod;
}
return ans;
}
int chs(int x, int y) {
if (x < y)
return 0;
if (x == y)
return 1;
long long ans = fac[x];
ans *= po(fac[y], mod - 2);
ans %= mod;
ans *= po(fac[x - y], mod - 2);
ans %= mod;
return ans;
}
int main() {
fac[0] = 1;
for (int i = 1; i < 2 * N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
// cout << "28 " << i << " " << fac[i] << endl;
}
int b, w;
cin >> b >> w;
for (int i = 1; i <= w + b; i++) {
long long x = chs(i - 1, w - 1);
long long y = chs(i - 1, b - 1);
// cout << "73 " << x << " " << y << endl;
x *= po(2, 1ll * i * (mod - 2));
y *= po(2, 1ll * i * (mod - 2));
x %= mod;
y %= mod;
psw[i] = psw[i - 1] + x;
psb[i] = psb[i - 1] + y;
psw[i] %= mod;
psb[i] %= mod;
long long z = 1 - psw[i - 1] - psb[i - 1] + 2 * mod;
z %= mod;
// cout << i << " " << x << " " << y << " " << psw[i] << " " << psb[i] <<
//endl;
long long ans = (long long)psw[i - 1] + z * po(2, mod - 2);
ans %= mod;
cout << ans << endl;
}
return 0;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
int pw(int n, int k) {
if (k < 0)
return pw(n, k + MOD - 1);
int res = 1;
while (k) {
if (k & 1)
res *= n;
res %= MOD;
n *= n;
n %= MOD;
k >>= 1;
}
return res;
}
std::vector<int> Factorial(5e6), Finverse(5e6);
void Cinit() { // limit is 5e6 /// write Cinit&pw /// this takes 792ms at
// AtCoder
Factorial[0] = 1;
for (int i = 1; i < 5e6; i++)
Factorial[i] = Factorial[i - 1] * i % MOD;
for (int i = 0; i < 5e6; i++)
Finverse[i] = pw(Factorial[i], MOD - 2);
}
int nCk(int n, int k) {
if (n < k)
return 1;
if (k < 0)
return 0;
int res = Factorial[n];
res *= Finverse[k];
res %= MOD;
res *= Finverse[n - k];
res %= MOD;
return res;
}
/*
黒がなくなってる可能性と白がなくなってる可能性をそれぞれb_i,w_iとすると
(1-b_i-w_i)*1/2+w_i
更新は？
k回目でなくなってる可能性 (1/2)^k*nCk(k-1,B-1);
*/
int B, W;
int b[123456], w[123456];
signed main() {
Cinit();
cin >> B >> W;
for (int i = B; i < B + W; i++)
b[i] = nCk(i - 1, B - 1) * pw(pw(2, i), MOD - 2) % MOD;
for (int i = W; i < B + W; i++)
w[i] = nCk(i - 1, W - 1) * pw(pw(2, i), MOD - 2) % MOD;
for (int i = 0; i < B + W; i++)
b[i + 1] += b[i], w[i + 1] += w[i], b[i + 1] %= MOD, w[i + 1] %= MOD;
for (int i = 1; i <= B + W; i++) {
int res = (1 - b[i - 1] - w[i - 1]) * pw(2, MOD - 2) + w[i - 1];
res %= MOD;
if (res < 0)
res += MOD;
cout << res << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
int pw(int n, int k) {
if (k < 0)
return pw(n, k + MOD - 1);
int res = 1;
while (k) {
if (k & 1)
res *= n;
res %= MOD;
n *= n;
n %= MOD;
k >>= 1;
}
return res;
}
std::vector<int> Factorial(5e6), Finverse(5e6);
void Cinit() { // limit is 5e6 /// write Cinit&pw /// this takes 792ms at
// AtCoder
Factorial[0] = 1;
for (int i = 1; i < 5e6; i++)
Factorial[i] = Factorial[i - 1] * i % MOD;
for (int i = 0; i < 5e6; i++)
Finverse[i] = pw(Factorial[i], MOD - 2);
}
int nCk(int n, int k) {
if (n < k)
return 1;
if (k < 0)
return 0;
int res = Factorial[n];
res *= Finverse[k];
res %= MOD;
res *= Finverse[n - k];
res %= MOD;
return res;
}
/*
黒がなくなってる可能性と白がなくなってる可能性をそれぞれb_i,w_iとすると
(1-b_i-w_i)*1/2+w_i
更新は？
k回目でなくなってる可能性 (1/2)^k*nCk(k-1,B-1);
*/
int B, W;
int b[223456], w[223456];
signed main() {
Cinit();
cin >> B >> W;
for (int i = B; i < B + W; i++)
b[i] = nCk(i - 1, B - 1) * pw(pw(2, i), MOD - 2) % MOD;
for (int i = W; i < B + W; i++)
w[i] = nCk(i - 1, W - 1) * pw(pw(2, i), MOD - 2) % MOD;
for (int i = 0; i < B + W; i++)
b[i + 1] += b[i], w[i + 1] += w[i], b[i + 1] %= MOD, w[i + 1] %= MOD;
for (int i = 1; i <= B + W; i++) {
int res = (1 - b[i - 1] - w[i - 1]) * pw(2, MOD - 2) + w[i - 1];
res %= MOD;
if (res < 0)
res += MOD;
cout << res << endl;
}
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007, inv2 = mod + 1 >> 1;
long long fac[200010], inv[200010];
int B, W;
long long Pow(long long x, long long y) {
long long ans = 1;
for (; y; y >>= 1, x = x * x % mod)
if (y & 1)
ans = ans * x % mod;
return ans;
}
void pre(int n = 200000) {
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % mod;
inv[n] = Pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
}
long long C(int x, int y) { return fac[x] * inv[y] % mod * inv[x - y] % mod; }
int main() {
pre();
scanf("%d%d", &B, &W);
if (B < W) {
for (int i = 1; i <= B; i++)
printf("%d\n", inv2);
long long hh = Pow(inv2, B + 1);
long long now = (inv2 - hh + mod) % mod;
for (int i = B + 1; i <= W; i++) {
printf("%lld\n", now);
now = (now - hh * Pow(inv2, i - B) % mod * C(i - 1, B - 1) % mod + mod) %
mod;
}
} else
for (int i = 1; i <= W; i++)
printf("%d\n", inv2);
long long now1 = 0, now2 = 1;
for (int i = 1; i < B; i++)
now1 = (now1 + C(W, i)) % mod;
for (int i = W + 1; i <= W + B; i++) {
printf("%lld\n",
(now1 * Pow(inv2, i) % mod + now2 * Pow(inv2, W) % mod) % mod);
now1 = ((now1 * 2 % mod - C(i - 1, i - W) - C(i - 1, B - 1)) % mod + mod) %
mod;
now2 = (now2 + Pow(inv2, i - W) * C(i - 1, W - 1) % mod) % mod;
}
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007, inv2 = mod + 1 >> 1;
long long fac[200010], inv[200010];
int B, W;
long long Pow(long long x, long long y) {
long long ans = 1;
for (; y; y >>= 1, x = x * x % mod)
if (y & 1)
ans = ans * x % mod;
return ans;
}
void pre(int n = 200000) {
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % mod;
inv[n] = Pow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
}
long long C(int x, int y) {
if (x < y)
return 0;
return fac[x] * inv[y] % mod * inv[x - y] % mod;
}
int main() {
pre();
scanf("%d%d", &B, &W);
if (B < W) {
for (int i = 1; i <= B; i++)
printf("%d\n", inv2);
long long hh = Pow(inv2, B + 1);
long long now = (inv2 - hh + mod) % mod;
for (int i = B + 1; i <= W; i++) {
printf("%lld\n", now);
now = (now - hh * Pow(inv2, i - B) % mod * C(i - 1, B - 1) % mod + mod) %
mod;
}
} else
for (int i = 1; i <= W; i++)
printf("%d\n", inv2);
long long now1 = 0, now2 = 1;
for (int i = 1; i < B; i++)
now1 = (now1 + C(W, i)) % mod;
for (int i = W + 1; i <= W + B; i++) {
printf("%lld\n",
(now1 * Pow(inv2, i) % mod + now2 * Pow(inv2, W) % mod) % mod);
now1 = ((now1 * 2 % mod - C(i - 1, i - W) - C(i - 1, B - 1)) % mod + mod) %
mod;
now2 = (now2 + Pow(inv2, i - W) * C(i - 1, W - 1) % mod) % mod;
}
}
| replace | 22 | 23 | 22 | 27 | 0 | |
p03083 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define int long long
#define endl '\n'
#define INF 1000000000000000000
#define EPS 1e-10
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define double long double
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
template <class T, class S> bool chmax(T &a, const S &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class S> bool chmin(T &a, const S &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll n, ll m) { return (m ? gcd(m, n % m) : n); }
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
ll mod = 1000000007;
ll modsize = 100010;
ll modinv(ll a) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll modpow(ll a, ll b) {
ll ans = 1;
a %= mod;
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
vector<ll> fac(modsize + 5);
vector<ll> inv(modsize + 5);
vector<ll> facinv(modsize + 5);
void modcalc() {
fac[0] = fac[1] = 1;
inv[1] = 1;
facinv[0] = facinv[1] = 1;
for (int i = 2; i < modsize; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
facinv[i] = facinv[i - 1] * inv[i] % mod;
}
}
ll modcomb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}
ll modperm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fac[n] * facinv[n - k] % mod;
}
ll modhom(ll n, ll k) {
if (n < 0 || k < 0)
return 0;
if (n == 0 && k == 0)
return 1;
return modcomb(n + k - 1, k);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
modcalc();
int b, w;
cin >> b >> w;
vector<int> black(w), white(b);
rep(i, w) {
if (i == 0) {
black[i] = modinv(modpow(2, b));
} else {
black[i] =
black[i - 1] + modinv(modpow(2, b + i)) * modcomb(b + i - 1, b - 1);
black[i] %= mod;
}
}
rep(i, b) {
if (i == 0) {
white[i] = modinv(modpow(2, w));
} else {
white[i] =
white[i - 1] + modinv(modpow(2, w + i)) * modcomb(w + i - 1, w - 1);
white[i] %= mod;
}
}
rep(i, b + w) {
int bc = 0, wc = 0;
if (i >= b) {
bc = black[i - b];
}
if (i >= w) {
wc = white[i - w];
}
cout << (inv[2] + inv[2] * (wc - bc + mod)) % mod << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define int long long
#define endl '\n'
#define INF 1000000000000000000
#define EPS 1e-10
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fi first
#define se second
#define pb push_back
#define double long double
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
template <class T, class S> bool chmax(T &a, const S &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class S> bool chmin(T &a, const S &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll n, ll m) { return (m ? gcd(m, n % m) : n); }
ll lcm(ll n, ll m) { return n / gcd(n, m) * m; }
ll mod = 1000000007;
ll modsize = 200010;
ll modinv(ll a) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll modpow(ll a, ll b) {
ll ans = 1;
a %= mod;
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
vector<ll> fac(modsize + 5);
vector<ll> inv(modsize + 5);
vector<ll> facinv(modsize + 5);
void modcalc() {
fac[0] = fac[1] = 1;
inv[1] = 1;
facinv[0] = facinv[1] = 1;
for (int i = 2; i < modsize; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
facinv[i] = facinv[i - 1] * inv[i] % mod;
}
}
ll modcomb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fac[n] * facinv[k] % mod * facinv[n - k] % mod;
}
ll modperm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fac[n] * facinv[n - k] % mod;
}
ll modhom(ll n, ll k) {
if (n < 0 || k < 0)
return 0;
if (n == 0 && k == 0)
return 1;
return modcomb(n + k - 1, k);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
modcalc();
int b, w;
cin >> b >> w;
vector<int> black(w), white(b);
rep(i, w) {
if (i == 0) {
black[i] = modinv(modpow(2, b));
} else {
black[i] =
black[i - 1] + modinv(modpow(2, b + i)) * modcomb(b + i - 1, b - 1);
black[i] %= mod;
}
}
rep(i, b) {
if (i == 0) {
white[i] = modinv(modpow(2, w));
} else {
white[i] =
white[i - 1] + modinv(modpow(2, w + i)) * modcomb(w + i - 1, w - 1);
white[i] %= mod;
}
}
rep(i, b + w) {
int bc = 0, wc = 0;
if (i >= b) {
bc = black[i - b];
}
if (i >= w) {
wc = white[i - w];
}
cout << (inv[2] + inv[2] * (wc - bc + mod)) % mod << endl;
}
}
| replace | 48 | 49 | 48 | 49 | 0 | |
p03083 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
using namespace std;
using ll = int64_t;
constexpr int N = 1e5;
constexpr int MOD = 1e9 + 7;
ll factorials[N + 1];
pair<ll, ll> P[N + 1];
ll rev(ll x) {
ll p = MOD - 2;
ll ans = 1;
while (p) {
if (p & 1)
ans = (ans * x) % MOD;
x = (x * x) % MOD;
p >>= 1;
}
return ans;
}
pair<ll, ll> C(ll n, ll k) {
return {factorials[n], factorials[k] * factorials[n - k] % MOD};
}
pair<ll, ll> M(pair<ll, ll> lhs, pair<ll, ll> rhs) {
return {lhs.fi * rhs.fi % MOD, lhs.se * rhs.se % MOD};
}
ll A(pair<ll, ll> p) { return p.fi * rev(p.se) % MOD; }
pair<ll, ll> NEG(pair<ll, ll> p) { return {(MOD - p.fi) % MOD, p.se}; }
pair<ll, ll> PLUS(pair<ll, ll> lhs, pair<ll, ll> rhs) {
return {(lhs.fi * rhs.se + rhs.fi * lhs.se) % MOD, (lhs.se * rhs.se) % MOD};
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
factorials[0] = factorials[1] = 1;
for (int i = 2; i <= N; i++)
factorials[i] = (factorials[i - 1] * i) % MOD;
P[0] = {1, 1};
for (int i = 1; i <= N; i++) {
P[i] = M(P[i - 1], {1, 2});
}
int B, W;
cin >> B >> W;
pair<ll, ll> onlyBlackSum = {0, 1};
pair<ll, ll> onlyWhiteSum = {0, 1};
for (int i = 0; i < B + W; i++) {
if (B <= i) {
onlyWhiteSum = PLUS(
onlyWhiteSum,
M(M(C((i - 1), B - 1), M(P[B - 1], P[(i - 1) - (B - 1)])), {1, 2}));
}
if (W <= i) {
onlyBlackSum = PLUS(
onlyBlackSum,
M(M(C((i - 1), W - 1), M(P[W - 1], P[(i - 1) - (W - 1)])), {1, 2}));
}
// cout << "sums: " << A(onlyWhiteSum) << " " << A(onlyBlackSum) << endl;
ll ans = A(PLUS(
M(PLUS(PLUS({1, 1}, NEG(onlyWhiteSum)), NEG(onlyBlackSum)), {1, 2}),
onlyBlackSum));
cout << ans << "\n";
}
return 0;
}
| #pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
using namespace std;
using ll = int64_t;
constexpr int N = 3 * 1e5;
constexpr int MOD = 1e9 + 7;
ll factorials[N + 1];
pair<ll, ll> P[N + 1];
ll rev(ll x) {
ll p = MOD - 2;
ll ans = 1;
while (p) {
if (p & 1)
ans = (ans * x) % MOD;
x = (x * x) % MOD;
p >>= 1;
}
return ans;
}
pair<ll, ll> C(ll n, ll k) {
return {factorials[n], factorials[k] * factorials[n - k] % MOD};
}
pair<ll, ll> M(pair<ll, ll> lhs, pair<ll, ll> rhs) {
return {lhs.fi * rhs.fi % MOD, lhs.se * rhs.se % MOD};
}
ll A(pair<ll, ll> p) { return p.fi * rev(p.se) % MOD; }
pair<ll, ll> NEG(pair<ll, ll> p) { return {(MOD - p.fi) % MOD, p.se}; }
pair<ll, ll> PLUS(pair<ll, ll> lhs, pair<ll, ll> rhs) {
return {(lhs.fi * rhs.se + rhs.fi * lhs.se) % MOD, (lhs.se * rhs.se) % MOD};
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
factorials[0] = factorials[1] = 1;
for (int i = 2; i <= N; i++)
factorials[i] = (factorials[i - 1] * i) % MOD;
P[0] = {1, 1};
for (int i = 1; i <= N; i++) {
P[i] = M(P[i - 1], {1, 2});
}
int B, W;
cin >> B >> W;
pair<ll, ll> onlyBlackSum = {0, 1};
pair<ll, ll> onlyWhiteSum = {0, 1};
for (int i = 0; i < B + W; i++) {
if (B <= i) {
onlyWhiteSum = PLUS(
onlyWhiteSum,
M(M(C((i - 1), B - 1), M(P[B - 1], P[(i - 1) - (B - 1)])), {1, 2}));
}
if (W <= i) {
onlyBlackSum = PLUS(
onlyBlackSum,
M(M(C((i - 1), W - 1), M(P[W - 1], P[(i - 1) - (W - 1)])), {1, 2}));
}
// cout << "sums: " << A(onlyWhiteSum) << " " << A(onlyBlackSum) << endl;
ll ans = A(PLUS(
M(PLUS(PLUS({1, 1}, NEG(onlyWhiteSum)), NEG(onlyBlackSum)), {1, 2}),
onlyBlackSum));
cout << ans << "\n";
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03083 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#define Rep(i, a, b) for (register int i = (a); i <= (b); ++i)
#define Repe(i, a, b) for (register int i = (a); i >= (b); --i)
#define rep(i, a, b) for (register int i = (a); i < (b); ++i)
#define pb push_back
#define mp make_pair
#define mx(a, b) (a > b ? a : b)
#define mn(a, b) (a < b ? a : b)
typedef unsigned long long uint64;
typedef unsigned int uint32;
typedef long long ll;
using namespace std;
namespace IO {
const uint32 Buffsize = 1 << 15, Output = 1 << 24;
static char Ch[Buffsize], *S = Ch, *T = Ch;
inline char getc() {
return ((S == T) && (T = (S = Ch) + fread(Ch, 1, Buffsize, stdin), S == T)
? 0
: *S++);
}
static char Out[Output], *nowps = Out;
inline void flush() {
fwrite(Out, 1, nowps - Out, stdout);
nowps = Out;
}
template <typename T> inline void read(T &x) {
x = 0;
static char ch;
T f = 1;
for (ch = getc(); !isdigit(ch); ch = getc())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getc())
x = x * 10 + (ch ^ 48);
x *= f;
}
template <typename T> inline void write(T x, char ch = '\n') {
if (!x)
*nowps++ = '0';
if (x < 0)
*nowps++ = '-', x = -x;
static uint32 sta[111], tp;
for (tp = 0; x; x /= 10)
sta[++tp] = x % 10;
for (; tp; *nowps++ = sta[tp--] ^ 48)
;
*nowps++ = ch;
if (nowps - Out >= 1 << 23)
flush();
}
} // namespace IO
using namespace IO;
void file() {
#ifndef ONLINE_JUDGE
FILE *DSD = freopen("water.in", "r", stdin);
FILE *CSC = freopen("water.out", "w", stdout);
#endif
}
inline void Chkmin(int &u, int v) { u > v ? u = v : 0; }
inline void Chkmax(int &u, int v) { u < v ? u = v : 0; }
inline void Chkmax(ll &u, ll v) { u < v ? u = v : 0; }
inline void Chkmin(ll &u, ll v) { u > v ? u = v : 0; }
const int MAXN = 2e5 + 7, mod = 1e9 + 7;
static int fac[MAXN], inv[MAXN];
inline int power(int u, int v) {
register int sm;
for (sm = 1; v; v >>= 1, u = (ll)u * u % mod)
if (v & 1)
sm = (ll)sm * u % mod;
return sm;
}
static int B, W;
inline void init() { read(B), read(W); }
inline int C(int u, int v) {
return u < v ? 0 : (ll)fac[u] * inv[v] % mod * inv[u - v] % mod;
}
static int prb, prw;
inline int ad(int u, int v) { return (u += v) >= mod ? u - mod : u; }
inline void solve() {
fac[0] = 1;
Rep(i, 1, W + B) fac[i] = (ll)fac[i - 1] * i % mod;
inv[W + B] = power(fac[W + B], mod - 2);
Repe(i, W + B, 1) inv[i - 1] = (ll)inv[i] * i % mod;
Rep(i, 1, W + B) {
write(((1ll + mod + mod - prb - prw) * 500000004ll + prw) % mod);
prb = (prb + (ll)power(2, mod - 1 - i) * C(i - 1, B - 1)) % mod;
prw = (prw + (ll)power(2, mod - 1 - i) * C(i - 1, W - 1)) % mod;
}
flush();
}
int main() {
file();
init();
solve();
return 0;
} | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#define Rep(i, a, b) for (register int i = (a); i <= (b); ++i)
#define Repe(i, a, b) for (register int i = (a); i >= (b); --i)
#define rep(i, a, b) for (register int i = (a); i < (b); ++i)
#define pb push_back
#define mp make_pair
#define mx(a, b) (a > b ? a : b)
#define mn(a, b) (a < b ? a : b)
typedef unsigned long long uint64;
typedef unsigned int uint32;
typedef long long ll;
using namespace std;
namespace IO {
const uint32 Buffsize = 1 << 15, Output = 1 << 24;
static char Ch[Buffsize], *S = Ch, *T = Ch;
inline char getc() {
return ((S == T) && (T = (S = Ch) + fread(Ch, 1, Buffsize, stdin), S == T)
? 0
: *S++);
}
static char Out[Output], *nowps = Out;
inline void flush() {
fwrite(Out, 1, nowps - Out, stdout);
nowps = Out;
}
template <typename T> inline void read(T &x) {
x = 0;
static char ch;
T f = 1;
for (ch = getc(); !isdigit(ch); ch = getc())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getc())
x = x * 10 + (ch ^ 48);
x *= f;
}
template <typename T> inline void write(T x, char ch = '\n') {
if (!x)
*nowps++ = '0';
if (x < 0)
*nowps++ = '-', x = -x;
static uint32 sta[111], tp;
for (tp = 0; x; x /= 10)
sta[++tp] = x % 10;
for (; tp; *nowps++ = sta[tp--] ^ 48)
;
*nowps++ = ch;
if (nowps - Out >= 1 << 23)
flush();
}
} // namespace IO
using namespace IO;
void file() {
#ifndef ONLINE_JUDGE
FILE *DSD = freopen("water.in", "r", stdin);
FILE *CSC = freopen("water.out", "w", stdout);
#endif
}
inline void Chkmin(int &u, int v) { u > v ? u = v : 0; }
inline void Chkmax(int &u, int v) { u < v ? u = v : 0; }
inline void Chkmax(ll &u, ll v) { u < v ? u = v : 0; }
inline void Chkmin(ll &u, ll v) { u > v ? u = v : 0; }
const int MAXN = 2e5 + 7, mod = 1e9 + 7;
static int fac[MAXN], inv[MAXN];
inline int power(int u, int v) {
register int sm;
for (sm = 1; v; v >>= 1, u = (ll)u * u % mod)
if (v & 1)
sm = (ll)sm * u % mod;
return sm;
}
static int B, W;
inline void init() { read(B), read(W); }
inline int C(int u, int v) {
return u < v ? 0 : (ll)fac[u] * inv[v] % mod * inv[u - v] % mod;
}
static int prb, prw;
inline int ad(int u, int v) { return (u += v) >= mod ? u - mod : u; }
inline void solve() {
fac[0] = 1;
Rep(i, 1, W + B) fac[i] = (ll)fac[i - 1] * i % mod;
inv[W + B] = power(fac[W + B], mod - 2);
Repe(i, W + B, 1) inv[i - 1] = (ll)inv[i] * i % mod;
Rep(i, 1, W + B) {
write(((1ll + mod + mod - prb - prw) * 500000004ll + prw) % mod);
prb = (prb + (ll)power(2, mod - 1 - i) * C(i - 1, B - 1)) % mod;
prw = (prw + (ll)power(2, mod - 1 - i) * C(i - 1, W - 1)) % mod;
}
flush();
}
int main() {
init();
solve();
return 0;
} | delete | 119 | 120 | 119 | 119 | TLE | |
p03083 | C++ | Runtime Error | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
const int MAX = 110000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
std::unordered_map<ll, ll> f_memo;
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; 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 mod = 1000000000 + 7;
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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 inv_mul(ll x, ll y) { return (x % mod * modpow(y, mod - 2, mod)) % mod; }
ll b, w;
ll f(ll i, ll c) {
ll bw;
if (c == b) {
bw = 0;
} else {
bw = 1;
}
if (i == c + 1) {
return inv_mul(COM(i - 2, c - 1), modpow(2, i - 1, mod));
}
if (f_memo[i * 10 + bw] != 0) {
return f_memo[i * 10 + bw];
} else {
ll ans = f((i - 1), c) + inv_mul(COM(i - 2, c - 1), modpow(2, i - 1, mod));
ans %= mod;
return f_memo[i * 10 + bw] = ans;
}
}
int main() {
COMinit();
std::cin >> b >> w;
for (int i = 1; i <= b + w; i++) {
ll result = 0;
if (i <= b) {
if (i <= w) {
result = inv_mul(1, 2) % mod;
} else {
result = inv_mul(1, 2) % mod + inv_mul(1, 2) % mod * f(i, w) % mod;
}
} else {
if (i <= w) {
result = inv_mul(1, 2) % mod * ((1 - f(i, b) + mod) % mod) % mod;
} else {
result = inv_mul(1, 2) % mod * ((1 - f(i, b) + mod) % mod) % mod +
inv_mul(1, 2) % mod * f(i, w) % mod;
}
}
std::cout << result % mod << std::endl;
}
}
| typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
const int MAX = 210000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
std::unordered_map<ll, ll> f_memo;
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; 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 mod = 1000000000 + 7;
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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 inv_mul(ll x, ll y) { return (x % mod * modpow(y, mod - 2, mod)) % mod; }
ll b, w;
ll f(ll i, ll c) {
ll bw;
if (c == b) {
bw = 0;
} else {
bw = 1;
}
if (i == c + 1) {
return inv_mul(COM(i - 2, c - 1), modpow(2, i - 1, mod));
}
if (f_memo[i * 10 + bw] != 0) {
return f_memo[i * 10 + bw];
} else {
ll ans = f((i - 1), c) + inv_mul(COM(i - 2, c - 1), modpow(2, i - 1, mod));
ans %= mod;
return f_memo[i * 10 + bw] = ans;
}
}
int main() {
COMinit();
std::cin >> b >> w;
for (int i = 1; i <= b + w; i++) {
ll result = 0;
if (i <= b) {
if (i <= w) {
result = inv_mul(1, 2) % mod;
} else {
result = inv_mul(1, 2) % mod + inv_mul(1, 2) % mod * f(i, w) % mod;
}
} else {
if (i <= w) {
result = inv_mul(1, 2) % mod * ((1 - f(i, b) + mod) % mod) % mod;
} else {
result = inv_mul(1, 2) % mod * ((1 - f(i, b) + mod) % mod) % mod +
inv_mul(1, 2) % mod * f(i, w) % mod;
}
}
std::cout << result % mod << std::endl;
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p03083 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define mp(x, y) make_pair(x, y)
#define pll pair<long long, long long>
#define pii pair<int, int>
using namespace std;
inline int read() {
int f = 1, x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int stack[20];
inline void write(int x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (!x) {
putchar('0');
return;
}
int top = 0;
while (x)
stack[++top] = x % 10, x /= 10;
while (top)
putchar(stack[top--] + '0');
}
inline void pr1(int x) {
write(x);
putchar(' ');
}
inline void pr2(int x) {
write(x);
putchar('\n');
}
const int MAXN = 100005;
const int mod = 1e9 + 7;
int pow_mod(int a, int b) {
int ret = 1;
while (b) {
if (b & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
b >>= 1;
}
return ret;
}
int pre[MAXN], inv[MAXN], bin[MAXN], invb[MAXN];
int C(int n, int m) { return 1LL * pre[n] * inv[m] % mod * inv[n - m] % mod; }
int B, W;
int ans;
void ad(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
void dl(int &x, int y) {
x -= y;
if (x < 0)
x += mod;
}
int main() {
bin[0] = 1;
for (int i = 1; i < MAXN; i++)
bin[i] = 1LL * bin[i - 1] * 2 % mod;
invb[MAXN - 1] = pow_mod(bin[MAXN - 1], mod - 2);
for (int i = MAXN - 2; i >= 0; i--)
invb[i] = 1LL * invb[i + 1] * 2 % mod;
pre[0] = 1;
for (int i = 1; i < MAXN; i++)
pre[i] = 1LL * pre[i - 1] * i % mod;
inv[MAXN - 1] = pow_mod(pre[MAXN - 1], mod - 2);
for (int i = MAXN - 2; i >= 0; i--)
inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
B = read();
W = read();
if (B == 1) {
for (int i = 1; i < B + W; i++)
pr2(pow_mod(pow_mod(2, i), mod - 2));
pr2(pow_mod(pow_mod(2, W), mod - 2));
return 0;
}
if (W == 1) {
for (int i = 1; i < B + W; i++)
pr2((1 - pow_mod(pow_mod(2, i), mod - 2) + mod) % mod);
pr2((1 - pow_mod(pow_mod(2, B), mod - 2) + mod) % mod);
return 0;
}
for (int i = 1; i <= W; i++)
ad(ans, 1LL * C(B + W - i - 2, W - i) * invb[B + W - i] % mod);
for (int i = 1; i < B; i++)
ad(ans, 1LL * C(B + W - i - 2, W - 1) * invb[B + W - i] % mod);
pr2(ans);
for (int i = 2; i <= B + W; i++) {
int ps = B + W - i + 1;
if (ps <= W + 1) {
dl(ans, 1LL * C(i - 2, W - ps) * invb[i - 1] % mod);
if (ps - 1)
dl(ans, 1LL * C(B + W - (ps - 1) - 2, W - (ps - 1)) *
invb[B + W - (ps - 1)] % mod);
if (ps - 1)
ad(ans, 1LL * C(i - 1, W - ps + 1) * invb[i] % mod);
}
if (ps == B) {
dl(ans,
1LL * C(B + W - (B - 1) - 2, W - 1) * invb[B + W - (B - 1)] % mod);
ad(ans, invb[i - 1]);
}
if (ps < B) {
if (ps - 1)
dl(ans,
1LL * C(B + W - (ps - 1) - 2, W - 1) * invb[B + W - (ps - 1)] % mod);
ad(ans, 1LL * invb[i - 1] * C(i - 2, W - 1) % mod);
}
pr2(ans);
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define LL long long
#define mp(x, y) make_pair(x, y)
#define pll pair<long long, long long>
#define pii pair<int, int>
using namespace std;
inline int read() {
int f = 1, x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int stack[20];
inline void write(int x) {
if (x < 0) {
putchar('-');
x = -x;
}
if (!x) {
putchar('0');
return;
}
int top = 0;
while (x)
stack[++top] = x % 10, x /= 10;
while (top)
putchar(stack[top--] + '0');
}
inline void pr1(int x) {
write(x);
putchar(' ');
}
inline void pr2(int x) {
write(x);
putchar('\n');
}
const int MAXN = 200005;
const int mod = 1e9 + 7;
int pow_mod(int a, int b) {
int ret = 1;
while (b) {
if (b & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
b >>= 1;
}
return ret;
}
int pre[MAXN], inv[MAXN], bin[MAXN], invb[MAXN];
int C(int n, int m) { return 1LL * pre[n] * inv[m] % mod * inv[n - m] % mod; }
int B, W;
int ans;
void ad(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
void dl(int &x, int y) {
x -= y;
if (x < 0)
x += mod;
}
int main() {
bin[0] = 1;
for (int i = 1; i < MAXN; i++)
bin[i] = 1LL * bin[i - 1] * 2 % mod;
invb[MAXN - 1] = pow_mod(bin[MAXN - 1], mod - 2);
for (int i = MAXN - 2; i >= 0; i--)
invb[i] = 1LL * invb[i + 1] * 2 % mod;
pre[0] = 1;
for (int i = 1; i < MAXN; i++)
pre[i] = 1LL * pre[i - 1] * i % mod;
inv[MAXN - 1] = pow_mod(pre[MAXN - 1], mod - 2);
for (int i = MAXN - 2; i >= 0; i--)
inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
B = read();
W = read();
if (B == 1) {
for (int i = 1; i < B + W; i++)
pr2(pow_mod(pow_mod(2, i), mod - 2));
pr2(pow_mod(pow_mod(2, W), mod - 2));
return 0;
}
if (W == 1) {
for (int i = 1; i < B + W; i++)
pr2((1 - pow_mod(pow_mod(2, i), mod - 2) + mod) % mod);
pr2((1 - pow_mod(pow_mod(2, B), mod - 2) + mod) % mod);
return 0;
}
for (int i = 1; i <= W; i++)
ad(ans, 1LL * C(B + W - i - 2, W - i) * invb[B + W - i] % mod);
for (int i = 1; i < B; i++)
ad(ans, 1LL * C(B + W - i - 2, W - 1) * invb[B + W - i] % mod);
pr2(ans);
for (int i = 2; i <= B + W; i++) {
int ps = B + W - i + 1;
if (ps <= W + 1) {
dl(ans, 1LL * C(i - 2, W - ps) * invb[i - 1] % mod);
if (ps - 1)
dl(ans, 1LL * C(B + W - (ps - 1) - 2, W - (ps - 1)) *
invb[B + W - (ps - 1)] % mod);
if (ps - 1)
ad(ans, 1LL * C(i - 1, W - ps + 1) * invb[i] % mod);
}
if (ps == B) {
dl(ans,
1LL * C(B + W - (B - 1) - 2, W - 1) * invb[B + W - (B - 1)] % mod);
ad(ans, invb[i - 1]);
}
if (ps < B) {
if (ps - 1)
dl(ans,
1LL * C(B + W - (ps - 1) - 2, W - 1) * invb[B + W - (ps - 1)] % mod);
ad(ans, 1LL * invb[i - 1] * C(i - 2, W - 1) % mod);
}
pr2(ans);
}
return 0;
} | replace | 54 | 55 | 54 | 55 | 0 | |
p03083 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
vector<long long int> inverse;
vector<long long int> f, f_inverse;
void factorial_Initialize(int max) {
vector<long long int> a(max + 1, 1);
inverse = a;
f = a;
f_inverse = a;
for (int i = 2; i <= max; i++) {
inverse[i] = MOD - inverse[MOD % i] * (MOD / i) % MOD;
f[i] = f[i - 1] * i % MOD;
f_inverse[i] = f_inverse[i - 1] * inverse[i] % MOD;
}
}
long long int nCr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= f.size()) {
factorial_Initialize(n);
}
return f[n] * f_inverse[r] % MOD * f_inverse[n - r] % MOD;
}
long long int modpow(long long int b,
long long int p) { // modinv(x) = modpow(x, MOD-2)
long long int num = 1, power = b;
for (int i = 0; i <= 30; i++) {
if ((p >> i) & 1) {
num *= power;
num %= MOD;
}
power *= power;
power %= MOD;
}
return num;
}
int main() {
long long int b, w;
cin >> b >> w;
cout << modpow(2, MOD - 2) << endl;
vector<long long int> p(b + w), q(b + w);
for (int i = 1; i < b + w; i++) {
p[i] = p[i - 1] + nCr(i - 1, b - 1) * modpow(modpow(2, MOD - 2), i - 1) %
MOD * modpow(2, MOD - 2);
p[i] %= MOD;
q[i] = q[i - 1] + nCr(i - 1, w - 1) * modpow(modpow(2, MOD - 2), i - 1) %
MOD * modpow(2, MOD - 2);
q[i] %= MOD;
long long int ans =
((1 - p[i] - q[i]) % MOD + MOD) % MOD * modpow(2, MOD - 2) + q[i] * 1;
ans %= MOD;
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
vector<long long int> inverse;
vector<long long int> f, f_inverse;
void factorial_Initialize(int max) {
vector<long long int> a(max + 1, 1);
inverse = a;
f = a;
f_inverse = a;
for (int i = 2; i <= max; i++) {
inverse[i] = MOD - inverse[MOD % i] * (MOD / i) % MOD;
f[i] = f[i - 1] * i % MOD;
f_inverse[i] = f_inverse[i - 1] * inverse[i] % MOD;
}
}
long long int nCr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= f.size()) {
factorial_Initialize(n);
}
return f[n] * f_inverse[r] % MOD * f_inverse[n - r] % MOD;
}
long long int modpow(long long int b,
long long int p) { // modinv(x) = modpow(x, MOD-2)
long long int num = 1, power = b;
for (int i = 0; i <= 30; i++) {
if ((p >> i) & 1) {
num *= power;
num %= MOD;
}
power *= power;
power %= MOD;
}
return num;
}
int main() {
long long int b, w;
cin >> b >> w;
cout << modpow(2, MOD - 2) << endl;
factorial_Initialize(1e6);
vector<long long int> p(b + w), q(b + w);
for (int i = 1; i < b + w; i++) {
p[i] = p[i - 1] + nCr(i - 1, b - 1) * modpow(modpow(2, MOD - 2), i - 1) %
MOD * modpow(2, MOD - 2);
p[i] %= MOD;
q[i] = q[i - 1] + nCr(i - 1, w - 1) * modpow(modpow(2, MOD - 2), i - 1) %
MOD * modpow(2, MOD - 2);
q[i] %= MOD;
long long int ans =
((1 - p[i] - q[i]) % MOD + MOD) % MOD * modpow(2, MOD - 2) + q[i] * 1;
ans %= MOD;
cout << ans << endl;
}
return 0;
} | insert | 48 | 48 | 48 | 49 | TLE | |
p03083 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int MAX = 100002;
long long fac[MAX], finv[MAX], inv[MAX];
void pre_comb(void) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; 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;
}
}
long long comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll mpow(ll x, ll r) {
if (r == 1)
return x;
if (r % 2 == 0) {
ll aa = mpow(x, r / 2);
return aa * aa % mod;
} else {
ll aa = mpow(x, r / 2);
return (aa * aa % mod) * x % mod;
}
}
int main() {
pre_comb();
int B, W;
cin >> B >> W;
ll sum1[B + W], sum2[B + W], sum3[B + W], two[B + W + 1];
rep(i, B + W + 1) {
if (i == 0)
two[i] = 1;
else
two[i] = two[i - 1] * 500000004 % mod;
}
rep(i, B + W) {
if (i == 0) {
if (W == 1)
sum2[i] = 500000004;
else
sum2[i] = 0;
sum1[i] = 0;
sum3[i] = 0;
} else {
if (i + 1 >= B && i < B + W - 1) {
sum1[i] = sum1[i - 1] + comb(i - 1, B - 2) * two[i + 1] % mod;
} else {
sum1[i] = sum1[i - 1];
}
if (i + 1 >= W && i < B + W - 1) {
sum2[i] = sum2[i - 1] + comb(i, W - 1) * two[i + 1] % mod;
} else {
sum2[i] = sum2[i - 1];
}
if (i >= W && i < B + W - 1) {
sum3[i] = sum3[i - 1] + comb(i - 1, W - 1) * two[i + 1] % mod;
} else {
sum3[i] = sum3[i - 1];
}
}
}
rep(i, B + W) {
ll ans = 0;
if (i > 0)
ans = (ans + sum2[i - 1]) % mod;
ans = (ans + sum3[B + W - 1] - sum3[i]) % mod;
if (i < B + W - 1)
ans = (ans + sum1[B + W - 1] - sum1[i]) % mod;
if (i + 1 >= B && i < B + W - 1)
ans = (ans + comb(i, B - 1) * two[i + 1] % mod) % mod;
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int MAX = 200002;
long long fac[MAX], finv[MAX], inv[MAX];
void pre_comb(void) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; 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;
}
}
long long comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll mpow(ll x, ll r) {
if (r == 1)
return x;
if (r % 2 == 0) {
ll aa = mpow(x, r / 2);
return aa * aa % mod;
} else {
ll aa = mpow(x, r / 2);
return (aa * aa % mod) * x % mod;
}
}
int main() {
pre_comb();
int B, W;
cin >> B >> W;
ll sum1[B + W], sum2[B + W], sum3[B + W], two[B + W + 1];
rep(i, B + W + 1) {
if (i == 0)
two[i] = 1;
else
two[i] = two[i - 1] * 500000004 % mod;
}
rep(i, B + W) {
if (i == 0) {
if (W == 1)
sum2[i] = 500000004;
else
sum2[i] = 0;
sum1[i] = 0;
sum3[i] = 0;
} else {
if (i + 1 >= B && i < B + W - 1) {
sum1[i] = sum1[i - 1] + comb(i - 1, B - 2) * two[i + 1] % mod;
} else {
sum1[i] = sum1[i - 1];
}
if (i + 1 >= W && i < B + W - 1) {
sum2[i] = sum2[i - 1] + comb(i, W - 1) * two[i + 1] % mod;
} else {
sum2[i] = sum2[i - 1];
}
if (i >= W && i < B + W - 1) {
sum3[i] = sum3[i - 1] + comb(i - 1, W - 1) * two[i + 1] % mod;
} else {
sum3[i] = sum3[i - 1];
}
}
}
rep(i, B + W) {
ll ans = 0;
if (i > 0)
ans = (ans + sum2[i - 1]) % mod;
ans = (ans + sum3[B + W - 1] - sum3[i]) % mod;
if (i < B + W - 1)
ans = (ans + sum1[B + W - 1] - sum1[i]) % mod;
if (i + 1 >= B && i < B + W - 1)
ans = (ans + comb(i, B - 1) * two[i + 1] % mod) % mod;
cout << ans << endl;
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03084 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, m, q;
string s, t;
const int mod = (int)1e9 + 7;
const int maxN = (int)1e5 + 100;
int tp[2][maxN];
int nxt[2][2][2][maxN];
int num[2];
const int INF = (int)1e9;
const int BUBEN = 5;
int get_dir(int a) {
if (a > 0)
return 1;
else if (a == 0)
return 0;
else
return -1;
}
// nxt[a][b][c][d]
// a - row / cols
// b - find up or down
// c - upper or downer
// d - who
map<pair<int, int>, int> mp;
bool can_simple(int fromx, int fromy, int tox, int toy) {
bool ok1 = true;
bool ok2 = true;
if (fromx != tox) {
if (get_dir(tox - fromx) != tp[1][fromy]) {
ok1 = false;
}
if (get_dir(tox - fromx) != tp[1][toy])
ok2 = false;
}
if (fromy != toy) {
if (get_dir(toy - fromy) != tp[0][tox])
ok1 = false;
if (get_dir(toy - fromy) != tp[0][fromx])
ok2 = false;
}
if (ok1 || ok2)
return true;
return false;
}
int solve(int fromx, int fromy, int tox, int toy, int step) {
// cout << fromx << " " << fromy << " " << tox << " " << toy << " " << step <<
// endl;
/*if (fromx == 3 && fromy == 1 && step == 5) {
exit(0);
}*/
if (can_simple(fromx, fromy, tox, toy))
return abs(fromx - tox) + abs(fromy - toy);
if (step == BUBEN)
return INF;
if (mp.count(make_pair(fromx, fromy)) && mp[make_pair(fromx, fromy)] <= step)
return INF;
mp[make_pair(fromx, fromy)] = step;
int ans = INF;
bool ok1 = true;
bool ok2 = true;
if (fromx != tox) {
if (get_dir(tox - fromx) != tp[1][fromy]) {
ok1 = false;
}
if (get_dir(tox - fromx) != tp[1][toy])
ok2 = false;
}
if (fromy != toy) {
if (get_dir(toy - fromy) != tp[0][tox])
ok1 = false;
if (get_dir(toy - fromy) != tp[0][fromx])
ok2 = false;
}
if (ok1 || ok2)
return abs(fromx - tox) + abs(fromy - toy);
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[0][val][i][fromx] == -1)
continue;
int where = nxt[0][val][i][fromx];
if (where == fromx)
continue;
if (where != fromx) {
if (get_dir(where - fromx) != tp[1][fromy])
continue;
}
ans = min(ans,
abs(where - fromx) + solve(where, fromy, tox, toy, step + 1));
}
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[1][val][i][fromy] == -1)
continue;
int where = nxt[1][val][i][fromy];
if (where == fromy)
continue;
if (where != fromy) {
if (get_dir(where - fromy) != tp[0][fromx])
continue;
}
ans = min(ans,
abs(where - fromy) + solve(fromx, where, tox, toy, step + 1));
}
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[1][val][i][toy] == -1)
continue;
int where = nxt[1][val][i][toy];
if (where == fromy)
continue;
if (where != fromy) {
if (get_dir(where - fromy) != tp[0][fromx])
continue;
}
ans = min(ans,
abs(where - fromy) + solve(fromx, where, tox, toy, step + 1));
}
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[0][val][i][tox] == -1)
continue;
int where = nxt[0][val][i][tox];
if (where == fromx)
continue;
if (where != fromx) {
if (get_dir(where - fromx) != tp[1][fromy])
continue;
}
ans = min(ans,
abs(where - fromx) + solve(where, fromy, tox, toy, step + 1));
}
}
return ans;
}
signed main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> q;
num[0] = n;
num[1] = m;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'E')
tp[0][i + 1] = 1;
else
tp[0][i + 1] = -1;
}
for (int j = 0; j < t.size(); j++) {
if (t[j] == 'N')
tp[1][j + 1] = -1;
else
tp[1][j + 1] = 1;
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
nxt[i][val][0][0] = -1;
for (int j = 1; j <= num[i]; j++) {
nxt[i][val][0][j] = nxt[i][val][0][j - 1];
if (tp[i][j] == k)
nxt[i][val][0][j] = j;
}
nxt[i][val][1][num[i] + 1] = -1;
for (int j = num[i]; j >= 1; j--) {
nxt[i][val][1][j] = nxt[i][val][1][j + 1];
if (tp[i][j] == k)
nxt[i][val][1][j] = j;
}
}
}
for (int i = 0; i < q; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
mp.clear();
int x = solve(a, b, c, d, 0);
if (x >= INF)
cout << -1 << '\n';
else
cout << x << '\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, m, q;
string s, t;
const int mod = (int)1e9 + 7;
const int maxN = (int)1e5 + 100;
int tp[2][maxN];
int nxt[2][2][2][maxN];
int num[2];
const int INF = (int)1e9;
const int BUBEN = 4;
int get_dir(int a) {
if (a > 0)
return 1;
else if (a == 0)
return 0;
else
return -1;
}
// nxt[a][b][c][d]
// a - row / cols
// b - find up or down
// c - upper or downer
// d - who
map<pair<int, int>, int> mp;
bool can_simple(int fromx, int fromy, int tox, int toy) {
bool ok1 = true;
bool ok2 = true;
if (fromx != tox) {
if (get_dir(tox - fromx) != tp[1][fromy]) {
ok1 = false;
}
if (get_dir(tox - fromx) != tp[1][toy])
ok2 = false;
}
if (fromy != toy) {
if (get_dir(toy - fromy) != tp[0][tox])
ok1 = false;
if (get_dir(toy - fromy) != tp[0][fromx])
ok2 = false;
}
if (ok1 || ok2)
return true;
return false;
}
int solve(int fromx, int fromy, int tox, int toy, int step) {
// cout << fromx << " " << fromy << " " << tox << " " << toy << " " << step <<
// endl;
/*if (fromx == 3 && fromy == 1 && step == 5) {
exit(0);
}*/
if (can_simple(fromx, fromy, tox, toy))
return abs(fromx - tox) + abs(fromy - toy);
if (step == BUBEN)
return INF;
if (mp.count(make_pair(fromx, fromy)) && mp[make_pair(fromx, fromy)] <= step)
return INF;
mp[make_pair(fromx, fromy)] = step;
int ans = INF;
bool ok1 = true;
bool ok2 = true;
if (fromx != tox) {
if (get_dir(tox - fromx) != tp[1][fromy]) {
ok1 = false;
}
if (get_dir(tox - fromx) != tp[1][toy])
ok2 = false;
}
if (fromy != toy) {
if (get_dir(toy - fromy) != tp[0][tox])
ok1 = false;
if (get_dir(toy - fromy) != tp[0][fromx])
ok2 = false;
}
if (ok1 || ok2)
return abs(fromx - tox) + abs(fromy - toy);
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[0][val][i][fromx] == -1)
continue;
int where = nxt[0][val][i][fromx];
if (where == fromx)
continue;
if (where != fromx) {
if (get_dir(where - fromx) != tp[1][fromy])
continue;
}
ans = min(ans,
abs(where - fromx) + solve(where, fromy, tox, toy, step + 1));
}
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[1][val][i][fromy] == -1)
continue;
int where = nxt[1][val][i][fromy];
if (where == fromy)
continue;
if (where != fromy) {
if (get_dir(where - fromy) != tp[0][fromx])
continue;
}
ans = min(ans,
abs(where - fromy) + solve(fromx, where, tox, toy, step + 1));
}
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[1][val][i][toy] == -1)
continue;
int where = nxt[1][val][i][toy];
if (where == fromy)
continue;
if (where != fromy) {
if (get_dir(where - fromy) != tp[0][fromx])
continue;
}
ans = min(ans,
abs(where - fromy) + solve(fromx, where, tox, toy, step + 1));
}
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
if (nxt[0][val][i][tox] == -1)
continue;
int where = nxt[0][val][i][tox];
if (where == fromx)
continue;
if (where != fromx) {
if (get_dir(where - fromx) != tp[1][fromy])
continue;
}
ans = min(ans,
abs(where - fromx) + solve(where, fromy, tox, toy, step + 1));
}
}
return ans;
}
signed main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> q;
num[0] = n;
num[1] = m;
cin >> s >> t;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'E')
tp[0][i + 1] = 1;
else
tp[0][i + 1] = -1;
}
for (int j = 0; j < t.size(); j++) {
if (t[j] == 'N')
tp[1][j + 1] = -1;
else
tp[1][j + 1] = 1;
}
for (int i = 0; i < 2; i++) {
for (int k = -1; k <= 1; k += 2) {
int val = (k + 1) / 2;
nxt[i][val][0][0] = -1;
for (int j = 1; j <= num[i]; j++) {
nxt[i][val][0][j] = nxt[i][val][0][j - 1];
if (tp[i][j] == k)
nxt[i][val][0][j] = j;
}
nxt[i][val][1][num[i] + 1] = -1;
for (int j = num[i]; j >= 1; j--) {
nxt[i][val][1][j] = nxt[i][val][1][j + 1];
if (tp[i][j] == k)
nxt[i][val][1][j] = j;
}
}
}
for (int i = 0; i < q; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
mp.clear();
int x = solve(a, b, c, d, 0);
if (x >= INF)
cout << -1 << '\n';
else
cout << x << '\n';
}
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p03084 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fastio_beet;
// INSERT ABOVE HERE
signed main() {
int n, m, q;
cin >> n >> m >> q;
string s, t;
cin >> s >> t;
const int INF = 1e9;
vector<int> vw, ve, vn, vs;
vw.emplace_back(-INF);
ve.emplace_back(-INF);
vn.emplace_back(-INF);
vs.emplace_back(-INF);
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
vw.emplace_back(i);
if (s[i] == 'E')
ve.emplace_back(i);
}
for (int i = 0; i < m; i++) {
if (t[i] == 'N')
vn.emplace_back(i);
if (t[i] == 'S')
vs.emplace_back(i);
}
vw.emplace_back(+INF);
ve.emplace_back(+INF);
vn.emplace_back(+INF);
vs.emplace_back(+INF);
for (int i = 0; i < q; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
using ll = long long;
auto T = [&](int y, int x, int step) {
return ((ll)y << 40) | ((ll)x << 20) | (ll)step;
};
unordered_map<ll, int> dp;
using P = pair<int, ll>;
priority_queue<P, vector<P>, greater<P>> pq;
dp[T(a, b, 0)] = 0;
pq.emplace(dp[T(a, b, 0)], T(a, b, 0));
int ans = INF;
while (!pq.empty()) {
int sum = pq.top().first;
ll st = pq.top().second;
pq.pop();
if (dp[st] < sum)
continue;
int y, x, step;
y = (st >> 40);
x = (st >> 20) ^ ((ll)y << 20);
step = st & ((1 << 20) - 1);
if (sum + abs(y - c) + abs(x - d) >= ans)
continue;
if ((s[y] == 'E' && x <= d) || (s[y] == 'W' && x >= d))
if ((t[d] == 'S' && y <= c) || (t[d] == 'N' && y >= c))
chmin(ans, sum + abs(y - c) + abs(x - d));
if ((t[x] == 'S' && y <= c) || (t[x] == 'N' && y >= c))
if ((s[c] == 'E' && x <= d) || (s[c] == 'W' && x >= d))
chmin(ans, sum + abs(y - c) + abs(x - d));
if (sum + abs(y - c) + abs(x - d) >= ans)
continue;
if (step >= 3)
continue;
auto push = [&](int ny, int nx, int ns, int nd) {
if (abs(ny) == INF || abs(nx) == INF)
return;
if (dp.count(T(ny, nx, ns)) && dp[T(ny, nx, ns)] <= nd)
return;
dp[T(ny, nx, ns)] = nd;
pq.emplace(nd, T(ny, nx, ns));
};
if (s[y] == 'W') {
// N
for (int xx : {x, d}) {
auto it = --upper_bound(vn.begin(), vn.end(), xx);
if (*it <= x)
push(y, *it, step + 1, sum + abs(*it - x));
}
// S
for (int xx : {x, d}) {
auto it = --upper_bound(vs.begin(), vs.end(), xx);
if (*it <= x)
push(y, *it, step + 1, sum + abs(*it - x));
}
} else {
// N
for (int xx : {x, d}) {
auto it = lower_bound(vn.begin(), vn.end(), xx);
if (x <= *it)
push(y, *it, step + 1, sum + abs(*it - x));
}
// S
for (int xx : {x, d}) {
auto it = lower_bound(vs.begin(), vs.end(), xx);
if (x <= *it)
push(y, *it, step + 1, sum + abs(*it - x));
}
}
if (t[x] == 'N') {
// W
for (int yy : {y, c}) {
auto it = --upper_bound(vw.begin(), vw.end(), yy);
if (*it <= y)
push(*it, x, step + 1, sum + abs(*it - y));
}
// E
for (int yy : {y, c}) {
auto it = --upper_bound(ve.begin(), ve.end(), yy);
if (*it <= y)
push(*it, x, step + 1, sum + abs(*it - y));
}
} else {
// W
for (int yy : {y, c}) {
auto it = lower_bound(vw.begin(), vw.end(), yy);
if (y <= *it)
push(*it, x, step + 1, sum + abs(*it - y));
}
// E
for (int yy : {y, c}) {
auto it = lower_bound(ve.begin(), ve.end(), yy);
if (y <= *it)
push(*it, x, step + 1, sum + abs(*it - y));
}
}
}
if (ans == INF)
ans = -1;
cout << ans << "\n";
}
cout << flush;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fastio_beet;
// INSERT ABOVE HERE
signed main() {
int n, m, q;
cin >> n >> m >> q;
string s, t;
cin >> s >> t;
const int INF = 1e9;
vector<int> vw, ve, vn, vs;
vw.emplace_back(-INF);
ve.emplace_back(-INF);
vn.emplace_back(-INF);
vs.emplace_back(-INF);
for (int i = 0; i < n; i++) {
if (s[i] == 'W')
vw.emplace_back(i);
if (s[i] == 'E')
ve.emplace_back(i);
}
for (int i = 0; i < m; i++) {
if (t[i] == 'N')
vn.emplace_back(i);
if (t[i] == 'S')
vs.emplace_back(i);
}
vw.emplace_back(+INF);
ve.emplace_back(+INF);
vn.emplace_back(+INF);
vs.emplace_back(+INF);
for (int i = 0; i < q; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
c--;
d--;
using ll = long long;
auto T = [&](int y, int x, int step) {
return ((ll)y << 40) | ((ll)x << 20) | (ll)step;
};
unordered_map<ll, int> dp;
using P = pair<int, ll>;
priority_queue<P, vector<P>, greater<P>> pq;
dp[T(a, b, 0)] = 0;
pq.emplace(dp[T(a, b, 0)], T(a, b, 0));
int ans = INF;
while (!pq.empty()) {
int sum = pq.top().first;
ll st = pq.top().second;
pq.pop();
if (dp[st] < sum)
continue;
int y, x, step;
y = (st >> 40);
x = (st >> 20) ^ ((ll)y << 20);
step = st & ((1 << 20) - 1);
if (sum + abs(y - c) + abs(x - d) >= ans)
continue;
if ((s[y] == 'E' && x <= d) || (s[y] == 'W' && x >= d))
if ((t[d] == 'S' && y <= c) || (t[d] == 'N' && y >= c))
chmin(ans, sum + abs(y - c) + abs(x - d));
if ((t[x] == 'S' && y <= c) || (t[x] == 'N' && y >= c))
if ((s[c] == 'E' && x <= d) || (s[c] == 'W' && x >= d))
chmin(ans, sum + abs(y - c) + abs(x - d));
if (sum + abs(y - c) + abs(x - d) >= ans)
continue;
if (step >= 3)
continue;
auto push = [&](int ny, int nx, int ns, int nd) {
if (abs(ny) == INF || abs(nx) == INF)
return;
if (ny == y && nx == x)
return;
if (dp.count(T(ny, nx, ns)) && dp[T(ny, nx, ns)] <= nd)
return;
dp[T(ny, nx, ns)] = nd;
pq.emplace(nd, T(ny, nx, ns));
};
if (s[y] == 'W') {
// N
for (int xx : {x, d}) {
auto it = --upper_bound(vn.begin(), vn.end(), xx);
if (*it <= x)
push(y, *it, step + 1, sum + abs(*it - x));
}
// S
for (int xx : {x, d}) {
auto it = --upper_bound(vs.begin(), vs.end(), xx);
if (*it <= x)
push(y, *it, step + 1, sum + abs(*it - x));
}
} else {
// N
for (int xx : {x, d}) {
auto it = lower_bound(vn.begin(), vn.end(), xx);
if (x <= *it)
push(y, *it, step + 1, sum + abs(*it - x));
}
// S
for (int xx : {x, d}) {
auto it = lower_bound(vs.begin(), vs.end(), xx);
if (x <= *it)
push(y, *it, step + 1, sum + abs(*it - x));
}
}
if (t[x] == 'N') {
// W
for (int yy : {y, c}) {
auto it = --upper_bound(vw.begin(), vw.end(), yy);
if (*it <= y)
push(*it, x, step + 1, sum + abs(*it - y));
}
// E
for (int yy : {y, c}) {
auto it = --upper_bound(ve.begin(), ve.end(), yy);
if (*it <= y)
push(*it, x, step + 1, sum + abs(*it - y));
}
} else {
// W
for (int yy : {y, c}) {
auto it = lower_bound(vw.begin(), vw.end(), yy);
if (y <= *it)
push(*it, x, step + 1, sum + abs(*it - y));
}
// E
for (int yy : {y, c}) {
auto it = lower_bound(ve.begin(), ve.end(), yy);
if (y <= *it)
push(*it, x, step + 1, sum + abs(*it - y));
}
}
}
if (ans == INF)
ans = -1;
cout << ans << "\n";
}
cout << flush;
return 0;
}
| insert | 97 | 97 | 97 | 99 | TLE | |
p03084 | C++ | Time Limit Exceeded | // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define each(i, a) for (auto &&i : a)
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#define all(a) begin(a), end(a)
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
template <typename T> ll min(ll a, const T &&b) { return a < b ? a : b; }
template <typename T> ll min(const T &&a, ll b) { return a < b ? a : b; }
template <typename T> ll max(ll a, const T &&b) { return a > b ? a : b; }
template <typename T> ll max(const T &&a, ll b) { return a > b ? a : b; }
template <typename Head> void out(Head h) { cout << h << endl; }
template <typename Head, typename... Tail> void out(Head h, Tail... t) {
cout << h << " ";
out(t...);
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(x, v) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
rep(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
ostream &operator<<(ostream &os, const vector<string> &v) {
rep(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
rep(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
struct yes_no : std::numpunct<char> {
string_type do_truename() const { return "Yes"; }
string_type do_falsename() const { return "No"; }
};
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
locale loc(locale(), new yes_no);
cout.imbue(loc);
cout << fixed << setprecision(10) << boolalpha;
solve();
}
// ^^^^^^^^^^^^ TEMPLATE ^^^^^^^^^^^^
vector<ll> merge(const vector<ll> &a, const vector<ll> &b) {
vector<ll> res;
each(x, a) res.pb(x);
each(x, b) res.pb(x);
sort(all(res));
return res;
}
pair<vector<ll>, vector<ll>> merge(const pair<vector<ll>, vector<ll>> &a,
const pair<vector<ll>, vector<ll>> &b) {
return make_pair(merge(a.first, b.first), merge(a.second, b.second));
}
#define NODE(x, y) ((y)*m + (x))
vector<ll> dijkstra(const vector<vector<P>> &G, const ll s) {
const ll n = G.size();
vector<ll> res(n, linf);
res[s] = 0;
priority_queue<P, vector<P>, greater<P>> Q;
Q.push(P(0, s));
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ll v = p.second;
if (p.first > res[v])
continue;
each(e, G[v]) {
ll to = e.first, cost = e.second;
if (res[v] + cost < res[to]) {
res[to] = res[v] + cost;
Q.push(P(res[to], to));
}
}
}
return res;
}
ll solve(const vector<ll> &L, const vector<ll> &R, const vector<ll> &U,
const vector<ll> &D, ll x1, ll y1, ll x2, ll y2) {
vector<ll> X = merge(U, D);
vector<ll> Y = merge(L, R);
const ll n = Y.size(), m = X.size();
vector<vector<P>> G(n * m);
each(yy, L) {
ll y = lower_bound(all(Y), yy) - Y.begin();
rep(x, 1, m) { G[NODE(x, y)].eb(NODE(x - 1, y), X[x] - X[x - 1]); }
}
each(yy, R) {
ll y = lower_bound(all(Y), yy) - Y.begin();
rep(x, 1, m) { G[NODE(x - 1, y)].eb(NODE(x, y), X[x] - X[x - 1]); }
}
each(xx, U) {
ll x = lower_bound(all(X), xx) - X.begin();
rep(y, 1, n) { G[NODE(x, y)].eb(NODE(x, y - 1), Y[y] - Y[y - 1]); }
}
each(xx, D) {
ll x = lower_bound(all(X), xx) - X.begin();
rep(y, 1, n) { G[NODE(x, y - 1)].eb(NODE(x, y), Y[y] - Y[y - 1]); }
}
x1 = lower_bound(all(X), x1) - X.begin();
y1 = lower_bound(all(Y), y1) - Y.begin();
x2 = lower_bound(all(X), x2) - X.begin();
y2 = lower_bound(all(Y), y2) - Y.begin();
ll s = NODE(x1, y1), t = NODE(x2, y2);
vector<ll> dist = dijkstra(G, s);
return dist[t];
}
void solve() {
ll h, w, Q;
cin >> h >> w >> Q;
string S, T;
cin >> S >> T;
vector<ll> U, D, L, R;
rep(i, h) {
if (S[i] == 'E') {
R.pb(i);
} else {
L.pb(i);
}
}
rep(i, w) {
if (T[i] == 'N') {
U.pb(i);
} else {
D.pb(i);
}
}
auto pickup2 = [&](ll x, const vector<ll> &a) {
auto it = upper_bound(all(a), x);
vector<ll> res;
if (it != a.end())
res.pb(*it);
if (it != a.begin()) {
--it;
res.pb(*it);
if (*it == x && it != a.begin()) {
res.pb(*it);
}
}
return res;
};
auto pickup = [&](ll x, const vector<ll> &a, const vector<ll> &b) {
return make_pair(pickup2(x, a), pickup2(x, b));
};
rep(q, Q) {
ll y1, x1, y2, x2;
cin >> y1 >> x1 >> y2 >> x2;
--y1, --x1, --y2, --x2;
auto v1 = pickup(y1, L, R);
auto v2 = pickup(x1, U, D);
auto v3 = pickup(y2, L, R);
auto v4 = pickup(x2, U, D);
auto a = merge(v1, v3);
auto b = merge(v2, v4);
ll ans = solve(a.first, a.second, b.first, b.second, x1, y1, x2, y2);
if (ans == linf)
cout << -1 << endl;
else
cout << ans << endl;
}
}
| // vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll linf = 1e18;
const double eps = 1e-12, pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define each(i, a) for (auto &&i : a)
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define eb emplace_back
#define all(a) begin(a), end(a)
#define chmin(x, v) x = min(x, v)
#define chmax(x, v) x = max(x, v)
template <typename T> ll min(ll a, const T &&b) { return a < b ? a : b; }
template <typename T> ll min(const T &&a, ll b) { return a < b ? a : b; }
template <typename T> ll max(ll a, const T &&b) { return a > b ? a : b; }
template <typename T> ll max(const T &&a, ll b) { return a > b ? a : b; }
template <typename Head> void out(Head h) { cout << h << endl; }
template <typename Head, typename... Tail> void out(Head h, Tail... t) {
cout << h << " ";
out(t...);
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(x, v) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
rep(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
ostream &operator<<(ostream &os, const vector<string> &v) {
rep(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
rep(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
struct yes_no : std::numpunct<char> {
string_type do_truename() const { return "Yes"; }
string_type do_falsename() const { return "No"; }
};
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
locale loc(locale(), new yes_no);
cout.imbue(loc);
cout << fixed << setprecision(10) << boolalpha;
solve();
}
// ^^^^^^^^^^^^ TEMPLATE ^^^^^^^^^^^^
vector<ll> merge(const vector<ll> &a, const vector<ll> &b) {
vector<ll> res;
each(x, a) res.pb(x);
each(x, b) res.pb(x);
sort(all(res));
res.erase(unique(all(res)), res.end());
return res;
}
pair<vector<ll>, vector<ll>> merge(const pair<vector<ll>, vector<ll>> &a,
const pair<vector<ll>, vector<ll>> &b) {
return make_pair(merge(a.first, b.first), merge(a.second, b.second));
}
#define NODE(x, y) ((y)*m + (x))
vector<ll> dijkstra(const vector<vector<P>> &G, const ll s) {
const ll n = G.size();
vector<ll> res(n, linf);
res[s] = 0;
priority_queue<P, vector<P>, greater<P>> Q;
Q.push(P(0, s));
while (!Q.empty()) {
P p = Q.top();
Q.pop();
ll v = p.second;
if (p.first > res[v])
continue;
each(e, G[v]) {
ll to = e.first, cost = e.second;
if (res[v] + cost < res[to]) {
res[to] = res[v] + cost;
Q.push(P(res[to], to));
}
}
}
return res;
}
ll solve(const vector<ll> &L, const vector<ll> &R, const vector<ll> &U,
const vector<ll> &D, ll x1, ll y1, ll x2, ll y2) {
vector<ll> X = merge(U, D);
vector<ll> Y = merge(L, R);
const ll n = Y.size(), m = X.size();
vector<vector<P>> G(n * m);
each(yy, L) {
ll y = lower_bound(all(Y), yy) - Y.begin();
rep(x, 1, m) { G[NODE(x, y)].eb(NODE(x - 1, y), X[x] - X[x - 1]); }
}
each(yy, R) {
ll y = lower_bound(all(Y), yy) - Y.begin();
rep(x, 1, m) { G[NODE(x - 1, y)].eb(NODE(x, y), X[x] - X[x - 1]); }
}
each(xx, U) {
ll x = lower_bound(all(X), xx) - X.begin();
rep(y, 1, n) { G[NODE(x, y)].eb(NODE(x, y - 1), Y[y] - Y[y - 1]); }
}
each(xx, D) {
ll x = lower_bound(all(X), xx) - X.begin();
rep(y, 1, n) { G[NODE(x, y - 1)].eb(NODE(x, y), Y[y] - Y[y - 1]); }
}
x1 = lower_bound(all(X), x1) - X.begin();
y1 = lower_bound(all(Y), y1) - Y.begin();
x2 = lower_bound(all(X), x2) - X.begin();
y2 = lower_bound(all(Y), y2) - Y.begin();
ll s = NODE(x1, y1), t = NODE(x2, y2);
vector<ll> dist = dijkstra(G, s);
return dist[t];
}
void solve() {
ll h, w, Q;
cin >> h >> w >> Q;
string S, T;
cin >> S >> T;
vector<ll> U, D, L, R;
rep(i, h) {
if (S[i] == 'E') {
R.pb(i);
} else {
L.pb(i);
}
}
rep(i, w) {
if (T[i] == 'N') {
U.pb(i);
} else {
D.pb(i);
}
}
auto pickup2 = [&](ll x, const vector<ll> &a) {
auto it = upper_bound(all(a), x);
vector<ll> res;
if (it != a.end())
res.pb(*it);
if (it != a.begin()) {
--it;
res.pb(*it);
if (*it == x && it != a.begin()) {
res.pb(*it);
}
}
return res;
};
auto pickup = [&](ll x, const vector<ll> &a, const vector<ll> &b) {
return make_pair(pickup2(x, a), pickup2(x, b));
};
rep(q, Q) {
ll y1, x1, y2, x2;
cin >> y1 >> x1 >> y2 >> x2;
--y1, --x1, --y2, --x2;
auto v1 = pickup(y1, L, R);
auto v2 = pickup(x1, U, D);
auto v3 = pickup(y2, L, R);
auto v4 = pickup(x2, U, D);
auto a = merge(v1, v3);
auto b = merge(v2, v4);
ll ans = solve(a.first, a.second, b.first, b.second, x1, y1, x2, y2);
if (ans == linf)
cout << -1 << endl;
else
cout << ans << endl;
}
}
| insert | 82 | 82 | 82 | 83 | TLE | |
p03084 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define MAX 200002
int n;
int m;
char buf[MAX];
string s;
string t;
int qq;
vector<int> row[2];
vector<int> col[2];
vector<int> R;
vector<int> C;
void row_ava(int y) {
for (int i = 0; i < 2; i++) {
int id = lower_bound(row[i].begin(), row[i].end(), y) - row[i].begin();
if (id != row[i].size()) {
R.push_back(row[i][id]);
}
id--;
if (id >= 0) {
R.push_back(row[i][id]);
}
id++;
if (id != row[i].size() && row[i][id] == y) {
id++;
if (id != row[i].size()) {
R.push_back(row[i][id]);
}
}
}
}
void col_ava(int y) {
for (int i = 0; i < 2; i++) {
int id = lower_bound(col[i].begin(), col[i].end(), y) - col[i].begin();
if (id != col[i].size()) {
C.push_back(col[i][id]);
}
id--;
if (id >= 0) {
C.push_back(col[i][id]);
}
id++;
if (id != col[i].size() && col[i][id] == y) {
id++;
if (id != col[i].size()) {
C.push_back(col[i][id]);
}
}
}
}
int dist[8][8];
priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>,
greater<pair<int, pair<int, int>>>>
q;
int main() {
cin >> n >> m >> qq;
scanf("%s", buf);
s = buf;
scanf("%s", buf);
t = buf;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
row[0].push_back(i);
} else {
row[1].push_back(i);
}
}
for (int i = 0; i < t.size(); i++) {
if (t[i] == 'N') {
col[0].push_back(i);
} else {
col[1].push_back(i);
}
}
while (qq--) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
a--;
b--;
c--;
d--;
R.clear();
C.clear();
row_ava(a);
row_ava(c);
col_ava(b);
col_ava(d);
sort(R.begin(), R.end());
R.erase(unique(R.begin(), R.end()), R.end());
sort(C.begin(), C.end());
C.erase(unique(C.begin(), C.end()), C.end());
pair<int, int> star = make_pair(-1, -1);
pair<int, int> en = make_pair(-1, -1);
for (int i = 0; i < R.size(); i++) {
for (int j = 0; j < C.size(); j++) {
dist[i][j] = -1;
if (R[i] == a && C[j] == b) {
star = make_pair(i, j);
}
if (R[i] == c && C[j] == d) {
en = make_pair(i, j);
}
}
}
dist[star.first][star.second] = 0;
q.push(make_pair(0, make_pair(star.first, star.second)));
while (!q.empty()) {
int x = q.top().second.first;
int y = q.top().second.second;
int est = q.top().first;
q.pop();
int ds = dist[x][y];
if (ds != est)
continue;
if (s[R[x]] == 'W') {
if (y) {
int nex = (C[y] - C[y - 1]) + ds;
if (dist[x][y - 1] == -1 || dist[x][y - 1] > nex) {
dist[x][y - 1] = nex;
q.push(make_pair(nex, make_pair(x, y - 1)));
// continue;
}
}
}
if (s[R[x]] == 'E') {
if (y + 1 < C.size()) {
int nex = (C[y + 1] - C[y]) + ds;
if (dist[x][y + 1] == -1 || dist[x][y + 1] > nex) {
dist[x][y + 1] = nex;
q.push(make_pair(nex, make_pair(x, y + 1)));
// continue;
}
}
}
if (t[C[y]] == 'N') {
if (x) {
int nex = (R[x] - R[x - 1]) + ds;
if (dist[x - 1][y] == -1 || dist[x - 1][y] > nex) {
dist[x - 1][y] = nex;
q.push(make_pair(nex, make_pair(x - 1, y)));
}
}
}
if (t[C[y]] == 'S') {
if (x + 1 < R.size()) {
int nex = (R[x + 1] - R[x]) + ds;
if (dist[x + 1][y] == -1 || dist[x + 1][y] > nex) {
dist[x + 1][y] = nex;
q.push(make_pair(nex, make_pair(x + 1, y)));
}
}
}
}
printf("%d\n", dist[en.first][en.second]);
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define MAX 200002
int n;
int m;
char buf[MAX];
string s;
string t;
int qq;
vector<int> row[2];
vector<int> col[2];
vector<int> R;
vector<int> C;
void row_ava(int y) {
for (int i = 0; i < 2; i++) {
int id = lower_bound(row[i].begin(), row[i].end(), y) - row[i].begin();
if (id != row[i].size()) {
R.push_back(row[i][id]);
}
id--;
if (id >= 0) {
R.push_back(row[i][id]);
}
id++;
if (id != row[i].size() && row[i][id] == y) {
id++;
if (id != row[i].size()) {
R.push_back(row[i][id]);
}
}
}
}
void col_ava(int y) {
for (int i = 0; i < 2; i++) {
int id = lower_bound(col[i].begin(), col[i].end(), y) - col[i].begin();
if (id != col[i].size()) {
C.push_back(col[i][id]);
}
id--;
if (id >= 0) {
C.push_back(col[i][id]);
}
id++;
if (id != col[i].size() && col[i][id] == y) {
id++;
if (id != col[i].size()) {
C.push_back(col[i][id]);
}
}
}
}
int dist[10][10];
priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>,
greater<pair<int, pair<int, int>>>>
q;
int main() {
cin >> n >> m >> qq;
scanf("%s", buf);
s = buf;
scanf("%s", buf);
t = buf;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'W') {
row[0].push_back(i);
} else {
row[1].push_back(i);
}
}
for (int i = 0; i < t.size(); i++) {
if (t[i] == 'N') {
col[0].push_back(i);
} else {
col[1].push_back(i);
}
}
while (qq--) {
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
a--;
b--;
c--;
d--;
R.clear();
C.clear();
row_ava(a);
row_ava(c);
col_ava(b);
col_ava(d);
sort(R.begin(), R.end());
R.erase(unique(R.begin(), R.end()), R.end());
sort(C.begin(), C.end());
C.erase(unique(C.begin(), C.end()), C.end());
pair<int, int> star = make_pair(-1, -1);
pair<int, int> en = make_pair(-1, -1);
for (int i = 0; i < R.size(); i++) {
for (int j = 0; j < C.size(); j++) {
dist[i][j] = -1;
if (R[i] == a && C[j] == b) {
star = make_pair(i, j);
}
if (R[i] == c && C[j] == d) {
en = make_pair(i, j);
}
}
}
dist[star.first][star.second] = 0;
q.push(make_pair(0, make_pair(star.first, star.second)));
while (!q.empty()) {
int x = q.top().second.first;
int y = q.top().second.second;
int est = q.top().first;
q.pop();
int ds = dist[x][y];
if (ds != est)
continue;
if (s[R[x]] == 'W') {
if (y) {
int nex = (C[y] - C[y - 1]) + ds;
if (dist[x][y - 1] == -1 || dist[x][y - 1] > nex) {
dist[x][y - 1] = nex;
q.push(make_pair(nex, make_pair(x, y - 1)));
// continue;
}
}
}
if (s[R[x]] == 'E') {
if (y + 1 < C.size()) {
int nex = (C[y + 1] - C[y]) + ds;
if (dist[x][y + 1] == -1 || dist[x][y + 1] > nex) {
dist[x][y + 1] = nex;
q.push(make_pair(nex, make_pair(x, y + 1)));
// continue;
}
}
}
if (t[C[y]] == 'N') {
if (x) {
int nex = (R[x] - R[x - 1]) + ds;
if (dist[x - 1][y] == -1 || dist[x - 1][y] > nex) {
dist[x - 1][y] = nex;
q.push(make_pair(nex, make_pair(x - 1, y)));
}
}
}
if (t[C[y]] == 'S') {
if (x + 1 < R.size()) {
int nex = (R[x + 1] - R[x]) + ds;
if (dist[x + 1][y] == -1 || dist[x + 1][y] > nex) {
dist[x + 1][y] = nex;
q.push(make_pair(nex, make_pair(x + 1, y)));
}
}
}
}
printf("%d\n", dist[en.first][en.second]);
}
return 0;
} | replace | 59 | 60 | 59 | 60 | 0 | |
p03085 | Python | Runtime Error | def main():
to = ["T", "G"]
fr = ["A", "C"]
print(to[fr.index(input())])
if __name__ == "__main__":
main()
| def main():
to = ["T", "G"]
fr = ["A", "C"]
inc = input()
try:
print(to[fr.index(inc)])
except Exception:
print(fr[to.index(inc)])
if __name__ == "__main__":
main()
| replace | 4 | 5 | 4 | 10 | 0 | |
p03085 | Python | Runtime Error | b = input()
a = ""
for i in range(4):
if b[i] == "A":
a += "T"
elif b[i] == "T":
a += "A"
elif b[i] == "C":
a += "G"
elif b[i] == "G":
a += "C"
print(a)
| b = input()
a = ""
for i in range(len(b)):
if b[i] == "A":
a += "T"
elif b[i] == "T":
a += "A"
elif b[i] == "C":
a += "G"
elif b[i] == "G":
a += "C"
print(a)
| replace | 2 | 3 | 2 | 3 | IndexError: string index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03085/Python/s500848859.py", line 4, in <module>
if b[i] == 'A':
IndexError: string index out of range
|
p03085 | Python | Runtime Error | input("ATCG"["TAGC".find(input())])
| print("ATCG"["TAGC".find(input())])
| replace | 0 | 1 | 0 | 1 | EOFError: EOF when reading a line | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03085/Python/s332767566.py", line 1, in <module>
input("ATCG"["TAGC".find(input())])
EOFError: EOF when reading a line
|
p03085 | Python | Runtime Error | b = int(input())
if b == "A":
print("T")
elif b == "C":
print("G")
elif b == "T":
print("A")
else:
print("C")
| b = input()
if b == "A":
print("T")
elif b == "C":
print("G")
elif b == "T":
print("A")
else:
print("C")
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: 'A' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03085/Python/s167969735.py", line 1, in <module>
b = int(input())
ValueError: invalid literal for int() with base 10: 'A'
|
p03085 | Python | Runtime Error | b = int(input())
print("A" if b == "T" else "T" if b == "A" else "C" if b == "G" else "G")
| b = input()
print("A" if b == "T" else "T" if b == "A" else "C" if b == "G" else "G")
| replace | 0 | 1 | 0 | 1 | ValueError: invalid literal for int() with base 10: 'A' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03085/Python/s867039619.py", line 1, in <module>
b = int(input())
ValueError: invalid literal for int() with base 10: 'A'
|
p03085 | Python | Runtime Error | s = input()
dict = {"A": "T", "C": "G"}
print(dict[s])
| s = input()
dict = {"A": "T", "C": "G", "T": "A", "G": "C"}
print(dict[s])
| replace | 2 | 3 | 2 | 3 | 0 | |
p03086 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k = 0; i < num; ++k) {
char c = sub[k];
if (c != 'A' && c != 'C' && c != 'G' && c != 'T') {
flg = false;
}
}
if (flg)
res = max(res, num);
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
string sub = s.substr(i, j - i + 1);
int num = sub.size();
bool flg = true;
for (int k = 0; k < num; ++k) {
char c = sub[k];
if (c != 'A' && c != 'C' && c != 'G' && c != 'T') {
flg = false;
}
}
if (flg)
res = max(res, num);
}
}
cout << res << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | TLE | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < S.size(); i++) {
int ans1 = 0;
int j = i;
while (S.at(j) == 'A' || S.at(j) == 'T' || S.at(j) == 'G' ||
S.at(j) == 'C') {
ans1++;
j++;
}
ans = max(ans, ans1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S += 'Z';
int ans = 0;
for (int i = 0; i < S.size(); i++) {
int ans1 = 0;
int j = i;
while (S.at(j) == 'A' || S.at(j) == 'T' || S.at(j) == 'G' ||
S.at(j) == 'C') {
ans1++;
j++;
}
ans = max(ans, ans1);
}
cout << ans << endl;
} | insert | 6 | 6 | 6 | 7 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
string s;
int ans = 0;
cin >> s;
rep(i, s.size()) {
int c = 0;
while (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' ||
s.at(i) == 'T') {
i++;
c++;
ans = max(ans, c);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
using namespace std;
int main() {
string s;
int ans = 0;
cin >> s;
rep(i, s.size()) {
int c = 0;
while (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T') {
i++;
c++;
ans = max(ans, c);
}
}
cout << ans << endl;
return 0;
} | replace | 14 | 16 | 14 | 15 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int i, j, sum = 0;
vector<int> v;
for (i = 0; i < str.size(); i++) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'C' || str[i] == 'T') {
sum = sum + 1;
} else {
v.push_back(sum);
sum = 0;
}
}
sort(v.begin(), v.end());
cout << v[v.size() - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int i, j, sum = 0;
vector<int> v;
for (i = 0; i < str.size(); i++) {
if (str[i] == 'A' || str[i] == 'G' || str[i] == 'C' || str[i] == 'T') {
sum = sum + 1;
} else {
v.push_back(sum);
sum = 0;
}
}
v.push_back(sum);
sort(v.begin(), v.end());
cout << v[v.size() - 1];
}
| insert | 17 | 17 | 17 | 18 | 0 | |
p03086 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
bool f(char b) {
if ((b == 'A') || (b == 'T') || (b == 'C') || (b == 'G')) {
return true;
} else {
return false;
}
}
int main() {
string S;
cin >> S;
int l = 0;
vector<int> v;
REP(0, i, S.length()) {
if (f(S[i]))
l++;
else {
v.push_back(l);
l = 0;
}
}
sort(v.begin(), v.end(), greater<int>());
cout << v[0] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
bool f(char b) {
if ((b == 'A') || (b == 'T') || (b == 'C') || (b == 'G')) {
return true;
} else {
return false;
}
}
int main() {
string S;
cin >> S;
int l = 0;
vector<int> v;
REP(0, i, S.length()) {
if (f(S[i]))
l++;
else {
v.push_back(l);
l = 0;
}
}
if (l != 0) {
v.push_back(l);
l = 0;
}
sort(v.begin(), v.end(), greater<int>());
cout << v[0] << endl;
return 0;
}
| insert | 33 | 33 | 33 | 38 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
priority_queue<int> ans;
int count = 0;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' || S.at(i) == 'G' || S.at(i) == 'C' || S.at(i) == 'T')
count++;
else {
ans.push(count);
count = 0;
}
}
cout << ans.top() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
priority_queue<int> ans;
int count = 0;
int N = S.size();
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A' || S.at(i) == 'G' || S.at(i) == 'C' || S.at(i) == 'T')
count++;
else {
ans.push(count);
count = 0;
}
}
ans.push(count);
cout << ans.top() << endl;
}
| insert | 17 | 17 | 17 | 18 | 0 | |
p03086 | C++ | Runtime Error | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
v[i]++;
if (i)
v[i] = v[i] * v[i - 1] + v[i];
}
cout << *max_element(v.begin(), v.end()) << endl;
return 0;
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "unordered_set"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
vector<int> v(s.size());
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
v[i]++;
if (i)
v[i] = v[i] * v[i - 1] + v[i];
}
cout << *max_element(v.begin(), v.end()) << endl;
return 0;
} | insert | 34 | 34 | 34 | 35 | -11 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int buf = 0;
vector<int> cnt;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' || S.at(i) == 'T') {
buf++;
} else {
cnt.push_back(buf);
buf = 0;
}
}
sort(cnt.begin(), cnt.end());
reverse(cnt.begin(), cnt.end());
cout << cnt.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int buf = 0;
vector<int> cnt;
cin >> S;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' || S.at(i) == 'T') {
buf++;
} else {
cnt.push_back(buf);
buf = 0;
}
}
cnt.push_back(buf);
sort(cnt.begin(), cnt.end());
reverse(cnt.begin(), cnt.end());
cout << cnt.at(0) << endl;
} | insert | 18 | 18 | 18 | 19 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
string s;
cin >> s;
int size = s.size();
vector<int> a(size);
for (int i = 0; i < size; i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
a.at(i) = 1;
}
}
int k = 0;
priority_queue<int> pq;
for (int i = 0; i < size; i++) {
if (a.at(i) == 1)
k++;
else {
pq.push(k);
k = 0;
}
}
cout << pq.top() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
int main() {
string s;
cin >> s;
int size = s.size();
vector<int> a(size);
for (int i = 0; i < size; i++) {
if (s.at(i) == 'A' || s.at(i) == 'C' || s.at(i) == 'G' || s.at(i) == 'T') {
a.at(i) = 1;
}
}
int k = 0;
priority_queue<int> pq;
for (int i = 0; i < size; i++) {
if (a.at(i) == 1) {
if (i == size - 1) {
k++;
pq.push(k);
} else
k++;
} else {
pq.push(k);
k = 0;
}
}
cout << pq.top() << endl;
}
| replace | 18 | 21 | 18 | 25 | 0 | |
p03086 | C++ | Runtime Error | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int64_t ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
const ll INF = 1000000000000000000;
#define fori(i, a, b) for (ll i = (a); i < (b); ++i)
#define ford(i, a, b) for (ll i = (b - 1); (a) <= i; --i)
#define rep(i, n) fori(i, 0, n)
#define all(v) (v).begin(), (v).end()
ll pw(ll x, ll y) {
ll r = 1;
rep(i, y) { r *= x; };
return r;
}
int main() {
char at[4] = {'A', 'T', 'C', 'G'};
string s;
cin >> s;
ll tmp = 0;
vll ans;
rep(i, s.size()) {
if (s[i] == at[0] || s[i] == at[1] || s[i] == at[2] || s[i] == at[3])
++tmp;
else {
ans.push_back(tmp);
tmp = 0;
}
}
cout << *max_element(all(ans)) << endl;
} | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int64_t ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
const ll INF = 1000000000000000000;
#define fori(i, a, b) for (ll i = (a); i < (b); ++i)
#define ford(i, a, b) for (ll i = (b - 1); (a) <= i; --i)
#define rep(i, n) fori(i, 0, n)
#define all(v) (v).begin(), (v).end()
ll pw(ll x, ll y) {
ll r = 1;
rep(i, y) { r *= x; };
return r;
}
int main() {
char at[4] = {'A', 'T', 'C', 'G'};
string s;
cin >> s;
ll tmp = 0;
vll ans;
rep(i, s.size()) {
if (s[i] == at[0] || s[i] == at[1] || s[i] == at[2] || s[i] == at[3])
++tmp;
else {
ans.push_back(tmp);
tmp = 0;
}
}
ans.push_back(tmp);
cout << *max_element(all(ans)) << endl;
} | insert | 48 | 48 | 48 | 49 | 0 | |
p03086 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
int main() {
string s;
cin >> s;
vector<int> ans;
int sum = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
sum++;
else {
ans.pb(sum);
sum = 0;
}
}
sort(ans.begin(), ans.end());
cout << ans[ans.size() - 1] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
int main() {
string s;
cin >> s;
vector<int> ans;
int sum = 0;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A' || s[i] == 'C' || s[i] == 'G' || s[i] == 'T')
sum++;
else {
ans.pb(sum);
sum = 0;
}
}
ans.pb(sum);
sort(ans.begin(), ans.end());
cout << ans[ans.size() - 1] << endl;
return 0;
} | insert | 36 | 36 | 36 | 37 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string str, stra;
int j = 0, max = 0;
cin >> str;
for (int i = 0; i < str.size(); i++) {
j = i;
stra = "";
while (str.at(j) == 'A' || str.at(j) == 'T' || str.at(j) == 'G' ||
str.at(j) == 'C') {
stra = stra + str.at(j);
j++;
}
if (stra.size() > max)
max = stra.size();
}
cout << max << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string str, stra;
int j = 0, max = 0;
cin >> str;
for (int i = 0; i < str.size(); i++) {
j = i;
stra = "";
while (j < str.size() && (str.at(j) == 'A' || str.at(j) == 'T' ||
str.at(j) == 'G' || str.at(j) == 'C')) {
stra = stra + str.at(j);
j++;
}
if (stra.size() > max)
max = stra.size();
}
cout << max << endl;
} | replace | 9 | 11 | 9 | 11 | 0 | |
p03086 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
std::string s;
std::vector<int> vec;
int c = 0;
int main() {
std::cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
c++;
} else {
vec.push_back(c);
c = 0;
}
}
std::cout << *std::max_element(vec.begin(), vec.end()) << std::endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
std::string s;
std::vector<int> vec;
int c = 0;
int main() {
std::cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A' || s[i] == 'T' || s[i] == 'G' || s[i] == 'C') {
c++;
} else {
vec.push_back(c);
c = 0;
}
}
vec.push_back(c);
std::cout << *std::max_element(vec.begin(), vec.end()) << std::endl;
}
| insert | 17 | 17 | 17 | 18 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int cont;
for (int i = 0; i < S.size(); i++) {
cont = 0;
while (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' ||
S.at(i) == 'T') {
i++;
cont++;
}
if (cont > ans)
ans = cont;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int ans = 0;
int cont;
for (int i = 0; i < S.size(); i++) {
cont = 0;
while (i < S.size() && (S.at(i) == 'A' || S.at(i) == 'C' ||
S.at(i) == 'G' || S.at(i) == 'T')) {
i++;
cont++;
}
if (cont > ans)
ans = cont;
}
cout << ans << endl;
} | replace | 12 | 14 | 12 | 14 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> v;
for (int i = 0; i < s.size(); i++)
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T')
v.push_back(i);
int ans = 0;
for (int i = 1; i < v.size(); i++)
ans = max(ans, v[i] - v[i - 1] - 1);
ans = max(ans, v[0]);
ans = max(ans, (int)s.size() - v[v.size() - 1] - 1);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> v;
for (int i = 0; i < s.size(); i++)
if (s[i] != 'A' && s[i] != 'C' && s[i] != 'G' && s[i] != 'T')
v.push_back(i);
if (v.empty()) {
cout << s.size() << endl;
return 0;
}
int ans = 0;
for (int i = 1; i < v.size(); i++)
ans = max(ans, v[i] - v[i - 1] - 1);
ans = max(ans, v[0]);
ans = max(ans, (int)s.size() - v[v.size() - 1] - 1);
cout << ans << endl;
return 0;
}
| insert | 9 | 9 | 9 | 13 | 0 | |
p03086 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
vector<int> vec;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
cnt++;
} else {
vec.push_back(cnt);
cnt = 0;
}
}
sort(vec.begin(), vec.end(), greater<int>());
cout << vec[0] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
int cnt = 0;
vector<int> vec;
for (int i = 0; i < S.length(); i++) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
cnt++;
} else {
vec.push_back(cnt);
cnt = 0;
}
}
vec.push_back(cnt);
sort(vec.begin(), vec.end(), greater<int>());
cout << vec[0] << endl;
return 0;
}
| insert | 17 | 17 | 17 | 18 | 0 | |
p03086 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
// #define min min<int>
// #define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
string a;
cin >> a;
int b = 0, c;
for (int i = 0; i < a.sz; i = 1) {
c = 0;
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' || a[i] == 'G') {
while (1) {
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' || a[i] == 'G') {
c++;
i++;
} else
break;
}
b = max<int>(b, c);
} else
i++;
}
cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
// #define min min<int>
// #define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
string a;
cin >> a;
int b = 0, c;
for (int i = 0; i < a.sz; i = i) {
c = 0;
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' || a[i] == 'G') {
while (1) {
if (a[i] == 'A' || a[i] == 'T' || a[i] == 'C' || a[i] == 'G') {
c++;
i++;
} else
break;
}
b = max<int>(b, c);
} else
i++;
}
cout << b << endl;
} | replace | 191 | 192 | 191 | 192 | TLE | |
p03086 | Python | Runtime Error | pat = ["A", "C", "G", "T"]
s = input()
left = right = 0
ans = 0
while left < len(s):
right = left
while s[right] in pat:
right += 1
ans = max(ans, right - left)
left = right + 1
print(ans)
| pat = ["A", "C", "G", "T"]
s = input()
left = right = 0
ans = 0
while left < len(s):
right = left
while right < len(s) and s[right] in pat:
right += 1
ans = max(ans, right - left)
left = right + 1
print(ans)
| replace | 9 | 10 | 9 | 10 | 0 | |
p03086 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string str;
vector<int> vec;
cin >> str;
for (int i = 0; i < (int)str.length(); i++) {
for (int j = 0; j < (int)str.length() - i; j++) {
if (str[i + j] != 'A' && str[i + j] != 'C' && str[i + j] != 'G' &&
str[i + j] != 'T') {
vec.push_back(j);
break;
}
}
}
sort(vec.begin(), vec.end());
cout << vec.back() << endl;
/* for(auto itr = vec.begin(); itr != vec.end(); ++itr) {
cout << *itr ;
}*/
cout << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string str;
vector<int> vec;
cin >> str;
for (int i = 0; i < (int)str.length(); i++) {
for (int j = 0; j < (int)str.length() - i; j++) {
if (str[i + j] != 'A' && str[i + j] != 'C' && str[i + j] != 'G' &&
str[i + j] != 'T') {
vec.push_back(j);
break;
}
if (i + j == (int)str.length() - 1) {
vec.push_back(j + 1);
break;
}
}
}
sort(vec.begin(), vec.end());
cout << vec.back() << endl;
/* for(auto itr = vec.begin(); itr != vec.end(); ++itr) {
cout << *itr ;
}*/
cout << endl;
return 0;
}
| insert | 19 | 19 | 19 | 23 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> a;
int x = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' || S.at(i) == 'T') {
x++;
} else {
a.push_back(x);
x = 0;
}
}
sort(a.rbegin(), a.rend());
cout << a[0];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> a;
int x = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'A' || S.at(i) == 'C' || S.at(i) == 'G' || S.at(i) == 'T') {
x++;
} else {
a.push_back(x);
x = 0;
}
}
a.push_back(x);
sort(a.rbegin(), a.rend());
cout << a[0];
}
| insert | 16 | 16 | 16 | 17 | 0 | |
p03086 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
char D[4] = {'A', 'T', 'G', 'C'};
int count = 0;
vector<int> C;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == D[j]) {
count++;
break;
}
if (j == 3) {
C.push_back(count);
count = 0;
}
}
}
cout << *max_element(C.begin(), C.end()) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
char D[4] = {'A', 'T', 'G', 'C'};
int count = 0;
vector<int> C;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < 4; j++) {
if (S.at(i) == D[j]) {
count++;
break;
}
if (j == 3) {
C.push_back(count);
count = 0;
}
}
}
C.push_back(count);
cout << *max_element(C.begin(), C.end()) << endl;
} | insert | 20 | 20 | 20 | 21 | 0 | |
p03086 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define range(i, n, m) for (int i = n; i < m; i++)
#define rrange(i, n, m) for (int i = n - 1; i = > m; i--)
#define MOD 1000000007;
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
ll max = 0;
ll count = 0;
for (char s : S) {
if (s == 'A' || s == 'C' || s == 'G' || s == 'T') {
count++;
} else {
count = 0;
}
if (max < count) {
max = count;
}
}
cout << max;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define range(i, n, m) for (int i = n; i < m; i++)
#define rrange(i, n, m) for (int i = n - 1; i = > m; i--)
#define MOD 1000000007;
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
ll max = 0;
ll count = 0;
rep(i, S.size()) {
if (S[i] == 'A' || S[i] == 'C' || S[i] == 'G' || S[i] == 'T') {
count++;
} else {
count = 0;
}
if (max < count) {
max = count;
}
}
cout << max;
return 0;
}
| replace | 40 | 42 | 40 | 42 | TLE | |
p03086 | Python | Runtime Error | S = input()
res = []
tmp = []
for s in S:
if s == "A" or s == "C" or s == "G" or s == "T":
tmp.append(s)
else:
res.append(len(tmp))
tmp = []
print(max(res))
| S = input()
res = []
tmp = []
for s in S:
if s == "A" or s == "C" or s == "G" or s == "T":
tmp.append(s)
else:
res.append(len(tmp))
tmp = []
res.append(len(tmp))
print(max(res))
| replace | 10 | 11 | 10 | 11 | 0 | |
p03086 | Python | Runtime Error | N = input()
answer_list = []
answer = 0
for i in range(len(N)):
if N[i] == "A" or N[i] == "T" or N[i] == "C" or N[i] == "G":
answer += 1
else:
answer_list.append(answer)
answer = 0
print(max(answer_list))
| N = input()
answer_list = []
answer = 0
for i in range(len(N)):
if N[i] == "A" or N[i] == "T" or N[i] == "C" or N[i] == "G":
answer += 1
else:
answer_list.append(answer)
answer = 0
if i + 1 == len(N):
answer_list.append(answer)
print(max(answer_list))
| insert | 10 | 10 | 10 | 12 | 0 | |
p03086 | Python | Runtime Error | S = input()
S_list = list(S)
answers = []
acgt = 0
for s in S_list:
if s == "A" or s == "C" or s == "G" or s == "T":
acgt += 1
else:
answers.append(acgt)
acgt = 0
print(max(answers))
| S = input()
S_list = list(S)
answers = []
acgt = 0
for s in S_list:
if s == "A" or s == "C" or s == "G" or s == "T":
acgt += 1
else:
answers.append(acgt)
acgt = 0
answers.append(acgt)
if answers:
print(max(answers))
else:
print(acgt)
| replace | 10 | 11 | 10 | 15 | 0 | |
p03086 | Python | Runtime Error | s = input()
i = 0
ans = 0
while i < len(s):
if s[i] == "A" or s[i] == "T" or s[i] == "C" or s[i] == "G":
for j in range(len(s) - i):
if (
s[i + j] != "A"
and s[i + j] != "T"
and s[i + j] != "C"
and s[i + j] != "G"
):
break
ans = max(ans, j)
i += j
print(ans)
| s = input()
i = 0
ans = 0
atcg = "ACGT"
for i in range(len(s)):
for j in range(i, len(s)):
t = s[i : j + 1]
cnt = 0
for n in range(4):
cnt += t.count(atcg[n])
if cnt == len(t):
ans = max(ans, cnt)
print(ans)
| replace | 3 | 15 | 3 | 15 | 0 | |
p03086 | Python | Runtime Error | import re
s = input()
pat = r"[ACGT]+"
atgc = re.findall(pat, s)
ress = []
for i in atgc:
ress.append(len(i))
print(max(ress))
| import re
s = input()
pat = r"[ACGT]+"
atgc = re.findall(pat, s)
ress = []
for i in atgc:
ress.append(len(i))
if ress == [""] or ress == []:
print(0)
else:
print(max(ress))
| replace | 8 | 10 | 8 | 12 | 0 | |
p03086 | Python | Runtime Error | s = input()
ans = 0
li = ["A", "C", "G", "T"]
count = 0
for i in s:
if i in li:
count += 1
else:
if count > ans:
ans = count
count = 0
if count == len(ans):
print(count)
else:
print(ans)
| s = input()
ans = 0
li = ["A", "C", "G", "T"]
count = 0
for i in s:
if i in li:
count += 1
else:
if count > ans:
ans = count
count = 0
if count > ans:
ans = count
print(ans)
| replace | 11 | 15 | 11 | 15 | TypeError: object of type 'int' has no len() | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03086/Python/s143153057.py", line 12, in <module>
if count == len(ans):
TypeError: object of type 'int' has no len()
|
p03086 | Python | Runtime Error | S = input()
AA = ["A", "C", "G", "T"]
ans = []
ll = 0
for i in range(len(S)):
if S[i] in AA:
ll += 1
else:
ans.append(ll)
ll = 0
print(max(ans))
| S = input()
AA = ["A", "C", "G", "T"]
ans = []
ll = 0
for i in range(len(S)):
if S[i] in AA:
ll += 1
else:
ans.append(ll)
ll = 0
ans.append(ll)
print(max(ans))
| insert | 11 | 11 | 11 | 12 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.