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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02928 | C++ | Runtime Error | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() {
freopen("in", "r", stdin);
freopen("out", "w", stdout);
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i)
num[i] = lower_bound(b + 1, b + n + 1, a[i]) - b - 1;
for (int i = n; i; --i) {
(ans += calc(i) * k % mod) %= mod;
(ans += k * (k - 1) / 2 % mod * num[i] % mod) %= mod;
}
cout << ans << endl;
return 0;
}
| // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i)
num[i] = lower_bound(b + 1, b + n + 1, a[i]) - b - 1;
for (int i = n; i; --i) {
(ans += calc(i) * k % mod) %= mod;
(ans += k * (k - 1) / 2 % mod * num[i] % mod) %= mod;
}
cout << ans << endl;
return 0;
}
| delete | 23 | 26 | 23 | 23 | 0 | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 1000
#define MOD 1000000007
int N, K;
int A[MAXN + 5];
#define MAXA 2000
#define lowbit(x) (x & -x)
int Tree[MAXA + 5];
void Update(int i, int d) {
while (i <= MAXA)
Tree[i] += d, i += lowbit(i);
}
int GetSum(int i) {
int ret = 0;
while (i > 0)
ret += Tree[i], i -= lowbit(i);
return ret;
}
int main() {
N = read(), K = read();
for (int i = 1; i <= N; i++)
A[i] = read();
int Sum = 0;
for (int i = 1; i <= N; i++)
Sum += i - 1 - GetSum(A[i]), Update(A[i], 1);
Sum = (long long)Sum * K % MOD;
for (int i = 1; i <= N; i++) {
long long tmp = GetSum(A[i] - 1);
Sum = (Sum + (tmp * ((long long)K * (K - 1) / 2 % MOD) % MOD)) % MOD;
}
printf("%d", Sum);
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 20000
#define MOD 1000000007
int N, K;
int A[MAXN + 5];
#define MAXA 2000
#define lowbit(x) (x & -x)
int Tree[MAXA + 5];
void Update(int i, int d) {
while (i <= MAXA)
Tree[i] += d, i += lowbit(i);
}
int GetSum(int i) {
int ret = 0;
while (i > 0)
ret += Tree[i], i -= lowbit(i);
return ret;
}
int main() {
N = read(), K = read();
for (int i = 1; i <= N; i++)
A[i] = read();
int Sum = 0;
for (int i = 1; i <= N; i++)
Sum += i - 1 - GetSum(A[i]), Update(A[i], 1);
Sum = (long long)Sum * K % MOD;
for (int i = 1; i <= N; i++) {
long long tmp = GetSum(A[i] - 1);
Sum = (Sum + (tmp * ((long long)K * (K - 1) / 2 % MOD) % MOD)) % MOD;
}
printf("%d", Sum);
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02928 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll mod = 1000000007;
ll N, K;
cin >> N >> K;
ll A[N];
rep(i, N) cin >> A[i];
ll S = 0;
rep(i, N) {
for (ll j = i + 1; j < N; j++) {
if (A[i] > A[j])
S++;
}
}
ll out = (S * K) % mod;
ll T = 0;
rep(i, N) {
rep(j, N) {
if (A[i] > A[j])
T++;
}
}
rep(i, K) { out = (out + i * T) % mod; }
cout << out << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll mod = 1000000007;
ll N, K;
cin >> N >> K;
ll A[N];
rep(i, N) cin >> A[i];
ll S = 0;
rep(i, N) {
for (ll j = i + 1; j < N; j++) {
if (A[i] > A[j])
S++;
}
}
ll out = (S * K) % mod;
ll T = 0;
rep(i, N) {
rep(j, N) {
if (A[i] > A[j])
T++;
}
}
out = (out + ((K * (K - 1)) / 2) % mod * T) % mod;
cout << out << endl;
return 0;
}
| replace | 37 | 38 | 37 | 38 | TLE | |
p02928 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int arr[100000];
long long MOD = 1000000007;
int main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
long long N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long less_inv = 0, gre_inv = 0;
for (int j = 0; j < N; j++) {
if (j < i && arr[i] > arr[j])
less_inv++;
if (j > i && arr[i] > arr[j])
gre_inv++;
}
ans += (less_inv * ((K * (K - 1) / 2) % MOD)) % MOD;
ans %= MOD;
ans += (gre_inv * ((K * (K + 1) / 2) % MOD)) % MOD;
ans %= MOD;
}
cout << ans;
} | #define _CRT_SECURE_NO_WARNINGS
using namespace std;
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int arr[100000];
long long MOD = 1000000007;
int main() {
long long N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long less_inv = 0, gre_inv = 0;
for (int j = 0; j < N; j++) {
if (j < i && arr[i] > arr[j])
less_inv++;
if (j > i && arr[i] > arr[j])
gre_inv++;
}
ans += (less_inv * ((K * (K - 1) / 2) % MOD)) % MOD;
ans %= MOD;
ans += (gre_inv * ((K * (K + 1) / 2) % MOD)) % MOD;
ans %= MOD;
}
cout << ans;
} | delete | 24 | 26 | 24 | 24 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
// #define MOD 998244353
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// ll X,Y,Z,K;
// ll pmax = 30000000000;
// vint A,B,C;
// void comb(vector<vector <long long int> > &v){
// for(int i = 0;i <v.size(); i++){
// v[i][0]=1;
// v[i][i]=1;
// }
// for(int k = 1;k <v.size();k++){
// for(int j = 1;j<k;j++){
// v[k][j]=((v[k-1][j-1]+v[k-1][j])%MOD);
// }
// }
// }
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { // 最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
// ll arr[55556];
// vint primes;
//
// //エラトステネスの篩
// void Eratosthenes(){
// ll N = 55556;
// for(ll i = 0; i < N; i++){
// arr[i] = 1;
// }
// for(ll i = 2; i < sqrt(N); i++){
// if(arr[i]){
// for(ll j = 0; i * (j + 2) < N; j++){
// arr[i *(j + 2)] = 0;
// }
// }
// }
//
// for(ll i = 2; i < N; i++){
// if(arr[i] && i%5==1){
// primes.pb(i);
// //cout << i << endl;
// }
// }
// }
void print(vint &V) {
for (auto e : V)
cout << e << " ";
cout << endl;
}
int main() {
cout << fixed << setprecision(12);
ll N, K;
cin >> N >> K;
vint A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
rep(i, N) {
rep(j, N) {
if (!(i < j))
continue;
// cout<<(int)(A[i]>A[j])<<endl;
if (A[i] > A[j])
ans++;
}
}
ans *= K;
ans %= MOD;
// cout<<ans<<endl;
vint cum(2001, 0);
rep(i, N) { cum[A[i]]++; }
rep(i, 2001) { cum[i + 1] += cum[i]; }
// print(cum);
ll x = 0;
rep(i, N) {
x += cum[A[i] - 1];
x %= MOD;
}
// cout<<x<<endl;
x %= MOD;
ans += (((K * (K - 1) / 2) % MOD) * x) % MOD;
ans %= MOD;
cout << ans << endl;
}
//
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define MOD 1000000007
// #define MOD 998244353
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
// ll X,Y,Z,K;
// ll pmax = 30000000000;
// vint A,B,C;
// void comb(vector<vector <long long int> > &v){
// for(int i = 0;i <v.size(); i++){
// v[i][0]=1;
// v[i][i]=1;
// }
// for(int k = 1;k <v.size();k++){
// for(int j = 1;j<k;j++){
// v[k][j]=((v[k-1][j-1]+v[k-1][j])%MOD);
// }
// }
// }
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { // 最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
// ll arr[55556];
// vint primes;
//
// //エラトステネスの篩
// void Eratosthenes(){
// ll N = 55556;
// for(ll i = 0; i < N; i++){
// arr[i] = 1;
// }
// for(ll i = 2; i < sqrt(N); i++){
// if(arr[i]){
// for(ll j = 0; i * (j + 2) < N; j++){
// arr[i *(j + 2)] = 0;
// }
// }
// }
//
// for(ll i = 2; i < N; i++){
// if(arr[i] && i%5==1){
// primes.pb(i);
// //cout << i << endl;
// }
// }
// }
void print(vint &V) {
for (auto e : V)
cout << e << " ";
cout << endl;
}
int main() {
cout << fixed << setprecision(12);
ll N, K;
cin >> N >> K;
vint A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
rep(i, N) {
rep(j, N) {
if (!(i < j))
continue;
// cout<<(int)(A[i]>A[j])<<endl;
if (A[i] > A[j])
ans++;
}
}
ans *= K;
ans %= MOD;
// cout<<ans<<endl;
vint cum(2001, 0);
rep(i, N) { cum[A[i]]++; }
rep(i, 2000) { cum[i + 1] += cum[i]; }
// print(cum);
ll x = 0;
rep(i, N) {
x += cum[A[i] - 1];
x %= MOD;
}
// cout<<x<<endl;
x %= MOD;
ans += (((K * (K - 1) / 2) % MOD) * x) % MOD;
ans %= MOD;
cout << ans << endl;
}
//
| replace | 312 | 313 | 312 | 313 | 0 | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define for0(i, n) for (int i = 0; i < (n); ++i)
#define for1n(i, n) for (int i = 1; i <= (n); ++i)
#define for1(i, n) for (int i = 1; i < (n); ++i)
#define forn(i, n) for (int i = 0; i <= (n); ++i)
#define forx(i, n, x) for (int i = (x); i < (n); ++i)
#define mod 1000000007LL
using namespace std;
class llm {
long long l;
explicit operator int() { return l; }
explicit operator long() { return l; }
public:
llm(long long m = 0LL) : l((m % mod >= 0) ? (m % mod) : (m % mod + mod)){};
llm operator=(llm m) {
l = m.l;
return *this;
}
// llm operator=(int i) {l = i % mod; return *this;}
// llm operator=(long i) {l = i % mod; return *this;}
// llm operator=(long long i){l = i % mod; return *this;}
llm operator+(llm m) { return llm(l + m.l); }
llm operator+(int m) { return llm(l + (m % mod)); }
llm operator+(long m) { return llm(l + (m % mod)); }
llm operator+(long long m) { return llm(l + (m % mod)); }
llm operator-(llm m) { return llm(l - m.l); }
llm operator-(int m) { return llm(l - (m % mod)); }
llm operator-(long m) { return llm(l - (m % mod)); }
llm operator-(long long m) { return llm(l - (m % mod)); }
// llm operator-(long long m){return llm(l - m);}
// llm operator-(int m){return llm(l - m);}
llm operator*(llm m) {
assert(0);
return llm(l * m.l);
}
llm operator*(int m) { return llm(l * (m % mod)); }
llm operator*(long m) { return llm(l * (m % mod)); }
llm operator*(long long m) { return llm(l * (m % mod)); }
// llm operator/(llm m) {return llm(l / m.l);}
llm operator/(int m) {
assert(m < mod && mod % m != 0);
return llm(l / m);
}
llm operator/(long m) {
assert(m < mod && mod % m != 0);
return llm(l / m);
}
llm operator/(long long m) {
assert(m < mod && mod % m != 0);
return llm(l / m);
}
// llm operator%(llm m) {return llm(l % m.l);}
llm operator%(int m) { return llm(l % m); }
llm operator%(long m) { return llm(l % m); }
llm operator%(long long m) { return llm(l % m); }
long long operator++(void) { return l = (l + 1) % mod; }
long long operator++(int) {
long long tmp = l;
++(*this);
return tmp;
}
long long operator--(void) { return l = (l - 1) % mod; }
long long operator--(int) {
long long tmp = l;
--(*this);
return tmp;
}
llm operator-() { return llm(-l); }
llm operator+() { return llm(l); }
operator long long() {
// cout << "l: " << l << "\n";
return l;
}
friend istream &operator>>(istream &stream, llm &m);
// operator int(){return l;}
};
istream &operator>>(istream &stream, llm &m) {
long long tmp;
stream >> tmp;
m.l = tmp % mod;
return stream;
}
typedef long long ll;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> pql;
typedef stack<ll> stk;
typedef queue<ll> qu;
int main(void) {
int N;
llm K;
cin >> N >> K;
int a[2000] = {};
for0(i, N) { cin >> a[i]; }
pair<llm, llm> p[2000];
for0(i, N) {
p[i].first = 0; // all
p[i].second = 0; // after
}
for0(i, N) {
for0(j, N) {
if (a[i] > a[j]) {
++p[i].first;
if (i < j) {
++p[i].second;
}
}
}
// p[i].first%=mod;
// p[i].second%=mod;
}
llm result = 0;
for0(i, N) {
result = (result + (p[i].second * K));
result = ((p[i].first * (K * (K - 1) / 2)) + result);
// result = (result + (p[i].second *K %mod)) %mod;
// result = ((p[i].first * ((K-1) *K/2 % mod)) %mod + result) % mod;
}
cout << result;
return 0;
}
| #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define for0(i, n) for (int i = 0; i < (n); ++i)
#define for1n(i, n) for (int i = 1; i <= (n); ++i)
#define for1(i, n) for (int i = 1; i < (n); ++i)
#define forn(i, n) for (int i = 0; i <= (n); ++i)
#define forx(i, n, x) for (int i = (x); i < (n); ++i)
#define mod 1000000007LL
using namespace std;
class llm {
long long l;
explicit operator int() { return l; }
explicit operator long() { return l; }
public:
llm(long long m = 0LL) : l((m % mod >= 0) ? (m % mod) : (m % mod + mod)){};
llm operator=(llm m) {
l = m.l;
return *this;
}
// llm operator=(int i) {l = i % mod; return *this;}
// llm operator=(long i) {l = i % mod; return *this;}
// llm operator=(long long i){l = i % mod; return *this;}
llm operator+(llm m) { return llm(l + m.l); }
llm operator+(int m) { return llm(l + (m % mod)); }
llm operator+(long m) { return llm(l + (m % mod)); }
llm operator+(long long m) { return llm(l + (m % mod)); }
llm operator-(llm m) { return llm(l - m.l); }
llm operator-(int m) { return llm(l - (m % mod)); }
llm operator-(long m) { return llm(l - (m % mod)); }
llm operator-(long long m) { return llm(l - (m % mod)); }
// llm operator-(long long m){return llm(l - m);}
// llm operator-(int m){return llm(l - m);}
long long operator*(llm m) { return l * m.l; }
llm operator*(int m) { return llm(l * (m % mod)); }
llm operator*(long m) { return llm(l * (m % mod)); }
llm operator*(long long m) { return llm(l * (m % mod)); }
// llm operator/(llm m) {return llm(l / m.l);}
llm operator/(int m) {
assert(m < mod && mod % m != 0);
return llm(l / m);
}
llm operator/(long m) {
assert(m < mod && mod % m != 0);
return llm(l / m);
}
llm operator/(long long m) {
assert(m < mod && mod % m != 0);
return llm(l / m);
}
// llm operator%(llm m) {return llm(l % m.l);}
llm operator%(int m) { return llm(l % m); }
llm operator%(long m) { return llm(l % m); }
llm operator%(long long m) { return llm(l % m); }
long long operator++(void) { return l = (l + 1) % mod; }
long long operator++(int) {
long long tmp = l;
++(*this);
return tmp;
}
long long operator--(void) { return l = (l - 1) % mod; }
long long operator--(int) {
long long tmp = l;
--(*this);
return tmp;
}
llm operator-() { return llm(-l); }
llm operator+() { return llm(l); }
operator long long() {
// cout << "l: " << l << "\n";
return l;
}
friend istream &operator>>(istream &stream, llm &m);
// operator int(){return l;}
};
istream &operator>>(istream &stream, llm &m) {
long long tmp;
stream >> tmp;
m.l = tmp % mod;
return stream;
}
typedef long long ll;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> pql;
typedef stack<ll> stk;
typedef queue<ll> qu;
int main(void) {
int N;
llm K;
cin >> N >> K;
int a[2000] = {};
for0(i, N) { cin >> a[i]; }
pair<llm, llm> p[2000];
for0(i, N) {
p[i].first = 0; // all
p[i].second = 0; // after
}
for0(i, N) {
for0(j, N) {
if (a[i] > a[j]) {
++p[i].first;
if (i < j) {
++p[i].second;
}
}
}
// p[i].first%=mod;
// p[i].second%=mod;
}
llm result = 0;
for0(i, N) {
result = (result + (p[i].second * K));
result = ((p[i].first * (K * (K - 1) / 2)) + result);
// result = (result + (p[i].second *K %mod)) %mod;
// result = ((p[i].first * ((K-1) *K/2 % mod)) %mod + result) % mod;
}
cout << result;
return 0;
}
| replace | 58 | 62 | 58 | 59 | -6 | ded7df7d-0caa-4d1f-ba12-8f9713fe7f43.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02928/C++/s227770849.cpp:57: llm llm::operator*(llm): Assertion `0' failed.
|
p02928 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN = 2000;
const ll mod = 1e9 + 7;
int a[MAXN + 5], cnt1[MAXN + 5], cnt2[MAXN + 5];
ll n, k, ans;
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (a[j] < a[i] && j < i)
cnt1[i]++;
if (a[j] < a[i] && j > i)
cnt2[i]++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
ans = (ans + cnt2[i] * (k - j + 1) % mod) % mod + cnt1[i] * (k - j) % mod;
ans %= mod;
}
}
printf("%lld\n", ans % mod);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAXN = 2000;
const ll mod = 1e9 + 7;
int a[MAXN + 5], cnt1[MAXN + 5], cnt2[MAXN + 5];
ll n, k, ans;
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
if (a[j] < a[i] && j < i)
cnt1[i]++;
if (a[j] < a[i] && j > i)
cnt2[i]++;
}
for (int i = 1; i <= n; i++) {
ans = (ans + cnt2[i] * (k * (k + 1) / 2 % mod)) % mod +
cnt1[i] * ((k * (k - 1) / 2) % mod) % mod;
ans %= mod;
}
printf("%lld\n", ans % mod);
return 0;
}
| replace | 23 | 27 | 23 | 26 | TLE | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#define ll long long
using namespace std;
#define mod 1000000007
int n, m, ans, a[1005], a1[1005], a2[1005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++)
a1[i] += (a[j] < a[i]);
for (int j = i - 1; j >= 1; j--)
a2[i] += (a[j] < a[i]);
ans = int((1ll * ans + 1ll * (m) * (m + 1) / 2 % mod * a1[i] % mod +
1ll * (m) * (m - 1) / 2 % mod * a2[i] % mod) %
mod);
}
printf("%d", ans);
} | #include <algorithm>
#include <cstdio>
#define ll long long
using namespace std;
#define mod 1000000007
int n, m, ans, a[2005], a1[2005], a2[2005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++)
a1[i] += (a[j] < a[i]);
for (int j = i - 1; j >= 1; j--)
a2[i] += (a[j] < a[i]);
ans = int((1ll * ans + 1ll * (m) * (m + 1) / 2 % mod * a1[i] % mod +
1ll * (m) * (m - 1) / 2 % mod * a2[i] % mod) %
mod);
}
printf("%d", ans);
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) int(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
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) %= mod;
n >>= 1;
}
return res;
}
const int maxf = 10000000;
long long fact[maxf + 5];
void fact_init(int n, long long mod) {
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
long long comb(long long a, long long b, long long mod) {
if (a < b || a < 0 || b < 0)
return 0;
if (fact[0] == 0)
fact_init(maxf, mod);
return (fact[a] * modpow((fact[a - b] * fact[b]) % mod, mod - 2, mod)) % mod;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
ll cnt = 0;
rep(i, n) {
irep(j, i + 1, n) {
if (a[i] > a[j])
cnt++;
}
}
ll cnt2 = 0;
rrep(i, n) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] < a[i])
cnt2++;
}
}
ll ans = 0;
rreps(i, k) { ans = (ans + cnt * i + cnt2 * (i - 1)) % MOD; }
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v + n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout << d << endl;
#define coutd(d) cout << std::setprecision(10) << d << endl;
#define cinline(n) getline(cin, n);
#define replace_all(s, b, a) replace(s.begin(), s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) int(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
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) %= mod;
n >>= 1;
}
return res;
}
const int maxf = 10000000;
long long fact[maxf + 5];
void fact_init(int n, long long mod) {
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
long long comb(long long a, long long b, long long mod) {
if (a < b || a < 0 || b < 0)
return 0;
if (fact[0] == 0)
fact_init(maxf, mod);
return (fact[a] * modpow((fact[a - b] * fact[b]) % mod, mod - 2, mod)) % mod;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vll a(n);
rep(i, n) cin >> a[i];
ll cnt = 0;
rep(i, n) {
irep(j, i + 1, n) {
if (a[i] > a[j])
cnt++;
}
}
ll cnt2 = 0;
rrep(i, n) {
for (int j = i - 1; j >= 0; j--) {
if (a[j] < a[i])
cnt2++;
}
}
ll ans = 0;
ans = ((cnt * ((k + 1) * k / 2 % MOD)) + cnt2 * ((k * (k - 1) / 2 % MOD))) %
MOD;
cout << ans << endl;
} | replace | 101 | 102 | 101 | 103 | TLE | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr << #x << ": " << x << "\n"
#define debug2(x, y) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << "\n"
#define debug3(x, y, z) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z \
<< ": " << z << "\n"
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
int mod = 1000000007;
int main() {
ll n, k;
scan(n, k);
vi a(n);
scan(a);
int unit = 0;
rep(i, n) {
FOR(j, i + 1, n) {
if (a[i] > a[j]) {
unit += 1;
}
}
}
int m = 2010;
m = 12;
vll cnt(m, 0);
rep(i, n) { cnt[a[i]] += 1; }
vll accum(m + 1, 0);
rep(i, m) { accum[i + 1] = accum[i] + cnt[i]; }
ll add = 0;
rep(i, m) { add = (add + cnt[i] * accum[i]) % mod; }
ll ans = k * unit % mod + k * (k - 1) % mod * 500000004 % mod * add % mod;
ans %= mod;
print(ans);
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr << #x << ": " << x << "\n"
#define debug2(x, y) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << "\n"
#define debug3(x, y, z) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z \
<< ": " << z << "\n"
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
int mod = 1000000007;
int main() {
ll n, k;
scan(n, k);
vi a(n);
scan(a);
int unit = 0;
rep(i, n) {
FOR(j, i + 1, n) {
if (a[i] > a[j]) {
unit += 1;
}
}
}
int m = 2010;
vll cnt(m, 0);
rep(i, n) { cnt[a[i]] += 1; }
vll accum(m + 1, 0);
rep(i, m) { accum[i + 1] = accum[i] + cnt[i]; }
ll add = 0;
rep(i, m) { add = (add + cnt[i] * accum[i]) % mod; }
ll ans = k * unit % mod + k * (k - 1) % mod * 500000004 % mod * add % mod;
ans %= mod;
print(ans);
return 0;
}
| delete | 144 | 145 | 144 | 144 | 0 | |
p02928 | C++ | Runtime Error | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() {
freopen("in", "r", stdin);
freopen("out", "w", stdout);
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i)
num[i] = lower_bound(b + 1, b + n + 1, a[i]) - b - 1;
for (int i = n; i; --i) {
(ans += calc(i) * k % mod) %= mod;
(ans += k * (k - 1) / 2 % mod * num[i] % mod) %= mod;
}
cout << ans << endl;
return 0;
} | // atcoder 20190824 B
#include <bits/stdc++.h>
#define N 2005
using namespace std;
const long long mod = 1e9 + 7;
long long n, k;
long long c[N];
long long a[N], b[N];
long long num[N];
long long ans;
long long calc(int x) {
long long res = 0;
for (int i = n; i > x; --i)
if (a[i] < a[x])
++res;
return res;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i], b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; ++i)
num[i] = lower_bound(b + 1, b + n + 1, a[i]) - b - 1;
for (int i = n; i; --i) {
(ans += calc(i) * k % mod) %= mod;
(ans += k * (k - 1) / 2 % mod * num[i] % mod) %= mod;
}
cout << ans << endl;
return 0;
} | delete | 23 | 25 | 23 | 23 | 0 | |
p02928 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, k) for (i = 0; i < k; i++)
#define P pair<ll, ll>
ll mod = 1000000007;
P p[200005];
ll i, b, c, k, j, n, m, z = 0, mi = 10;
ll a[2005] = {};
vector<ll> v[30];
string s;
char ca[10000];
priority_queue<ll> q;
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) rep(j, n) {
if (a[i] > a[j]) {
if (i < j)
b++;
if (i > j)
c++;
}
}
m = b + c;
z = z + (b * k) % mod;
ll bb = 0;
rep(i, k) bb = (bb + i) % mod;
z = (z + m * bb) % mod;
cout << z;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, k) for (i = 0; i < k; i++)
#define P pair<ll, ll>
ll mod = 1000000007;
P p[200005];
ll i, b, c, k, j, n, m, z = 0, mi = 10;
ll a[2005] = {};
vector<ll> v[30];
string s;
char ca[10000];
priority_queue<ll> q;
int main() {
cin >> n >> k;
rep(i, n) cin >> a[i];
rep(i, n) rep(j, n) {
if (a[i] > a[j]) {
if (i < j)
b++;
if (i > j)
c++;
}
}
m = b + c;
z = z + (b * k) % mod;
ll bb = 0;
bb = ((k - 1) * k / 2) % mod;
z = (z + m * bb) % mod;
cout << z;
return 0;
} | replace | 41 | 42 | 41 | 42 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) \
<< endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) pr1(a) << pr1(b)
#define pr3(a, b, c) pr1(a) << pr2(b, c)
#define pr4(a, b, c, d) pr1(a) << pr3(b, c, d)
#define pr5(a, b, c, d, e) pr1(a) << pr4(b, c, d, e)
#define pr6(a, b, c, d, e, f) pr1(a) << pr5(b, c, d, e, f)
#define pr7(a, b, c, d, e, f, g) pr1(a) << pr6(b, c, d, e, f, g)
#define pr8(a, b, c, d, e, f, g, h) pr1(a) << pr7(b, c, d, e, f, g, h)
#define prArr(a) \
{ \
cerr << (#a) << "={"; \
int i = 0; \
for (auto t : (a)) \
cerr << (i++ ? ", " : "") << t; \
cerr << "}" << endl; \
}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9; // ~ 1.15 * 1e18
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T> T Max(T &a, T b) { return a = max(a, b); }
template <class T> T Min(T &a, T b) { return a = min(a, b); }
template <class T1, class T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {
return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream &operator<<(ostream &o, tuple<T1, T2, T3> t) {
return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2> istream &operator>>(istream &i, pair<T1, T2> &p) {
return i >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &o, vector<T> a) {
Int i = 0;
for (T t : a)
o << (i++ ? " " : "") << t;
return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &a) {
for (T &t : a)
i >> t;
return i;
}
template <typename T, T MOD = 1000000007> struct Mint {
static constexpr T mod = MOD;
T v;
Mint() : v(0) {}
Mint(signed v) : v(v) {}
Mint(long long t) {
v = t % MOD;
if (v < 0)
v += MOD;
}
Mint pow(long long k) {
Mint res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
static Mint add_identity() { return Mint(0); }
static Mint mul_identity() { return Mint(1); }
Mint inv() { return pow(MOD - 2); }
Mint &operator+=(Mint a) {
v += a.v;
if (v >= MOD)
v -= MOD;
return *this;
}
Mint &operator-=(Mint a) {
v += MOD - a.v;
if (v >= MOD)
v -= MOD;
return *this;
}
Mint &operator*=(Mint a) {
v = 1LL * v * a.v % MOD;
return *this;
}
Mint &operator/=(Mint a) { return (*this) *= a.inv(); }
Mint operator+(Mint a) const { return Mint(v) += a; };
Mint operator-(Mint a) const { return Mint(v) -= a; };
Mint operator*(Mint a) const { return Mint(v) *= a; };
Mint operator/(Mint a) const { return Mint(v) /= a; };
Mint operator-() const { return v ? Mint(MOD - v) : Mint(v); }
bool operator==(const Mint a) const { return v == a.v; }
bool operator!=(const Mint a) const { return v != a.v; }
bool operator<(const Mint a) const { return v < a.v; }
// find x s.t. a^x = b
static T log(T a, T b) {
const T sq = 40000;
unordered_map<T, T> dp;
dp.reserve(sq);
Mint res(1);
for (Int r = 0; r < sq; r++) {
if (!dp.count(res.v))
dp[res.v] = r;
res *= a;
}
Mint p = Mint(a).inv().pow(sq);
res = b;
for (Int q = 0; q <= MOD / sq + 1; q++) {
if (dp.count(res.v)) {
T idx = q * sq + dp[res.v];
if (idx > 0)
return idx;
}
res *= p;
}
assert(0);
return T(-1);
}
static Mint comb(long long n, Int k) {
Mint num(1), dom(1);
for (Int i = 0; i < k; i++) {
num *= Mint(n - i);
dom *= Mint(i + 1);
}
return num / dom;
}
};
template <typename T, T MOD> constexpr T Mint<T, MOD>::mod;
template <typename T, T MOD> ostream &operator<<(ostream &os, Mint<T, MOD> m) {
os << m.v;
return os;
}
// INSERT ABOVE HERE
using mint = Mint<Int, mod>;
template <typename T> class CumulativeSum {
public:
Int n;
vector<T> sum;
vector<T> A;
Int added;
CumulativeSum() : n(-1), added(0) {}
CumulativeSum(Int n) : n(n), sum(n + 1), A(n + 1), added(0) {}
CumulativeSum(const vector<T> &B)
: n(B.size()), sum(n + 1), A(n + 1), added(0) {
for (Int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + B[i - 1];
}
void apply() {
for (Int i = 1; i <= n; i++)
A[i] = A[i] + A[i - 1];
for (Int i = 1; i <= n; i++)
A[i] = A[i] + A[i - 1];
for (Int i = 1; i <= n; i++)
sum[i] = sum[i] + A[i - 1];
added = 0;
A.clear();
A.resize(n + 1);
}
//[l, r)にxを加算
void add(Int l, Int r, T x) {
added = 1;
assert(l <= r && 0 <= l && r <= n);
A[l] = A[l] + x;
A[r] = A[r] - x;
}
//[l, r)の和を得る
T get(Int l, Int r) {
assert(l <= r && 0 <= l && r <= n);
if (added)
apply();
return sum[r] - sum[l];
}
};
Int calc(vector<Int> A) {
Int N = A.size();
Int cnt = 0;
for (Int i = 0; i < N; i++)
for (Int j = i + 1; j < N; j++)
if (A[i] > A[j])
cnt++;
return cnt;
}
using T = mint;
pair<vector<T>, mint> calc(vector<T> A, vector<T> B) {
CumulativeSum<T> sumA(A);
CumulativeSum<T> sumB(B);
vector<T> res(A.size());
const Int N = A.size();
mint cost = 0;
for (Int i = 0; i < (Int)A.size(); i++) {
if (B[i] == 0)
continue;
res[i] = A[i] + B[i];
cost += mint(sumA.get(i + 1, N)) * mint(B[i]);
}
return {res, cost};
}
signed main() {
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int N, K;
cin >> N >> K;
vector<Int> A(N);
cin >> A;
vector<T> B(20, 0);
vector<T> X(20, 0);
for (Int i = 0; i < N; i++)
X[A[i]] += 1;
mint num = calc(A);
mint ans = mint(K) * num;
mint cost = 0;
while (K) {
if (K & 1) {
auto p = calc(B, X);
// auto p2 = calc(X, B);
B = p.first;
ans += p.second;
ans += cost;
// cost = 0;
}
auto p = calc(X, X);
X = p.first;
cost = cost + cost + p.second;
K /= 2;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) \
<< endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) pr1(a) << pr1(b)
#define pr3(a, b, c) pr1(a) << pr2(b, c)
#define pr4(a, b, c, d) pr1(a) << pr3(b, c, d)
#define pr5(a, b, c, d, e) pr1(a) << pr4(b, c, d, e)
#define pr6(a, b, c, d, e, f) pr1(a) << pr5(b, c, d, e, f)
#define pr7(a, b, c, d, e, f, g) pr1(a) << pr6(b, c, d, e, f, g)
#define pr8(a, b, c, d, e, f, g, h) pr1(a) << pr7(b, c, d, e, f, g, h)
#define prArr(a) \
{ \
cerr << (#a) << "={"; \
int i = 0; \
for (auto t : (a)) \
cerr << (i++ ? ", " : "") << t; \
cerr << "}" << endl; \
}
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9; // ~ 1.15 * 1e18
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T> T Max(T &a, T b) { return a = max(a, b); }
template <class T> T Min(T &a, T b) { return a = min(a, b); }
template <class T1, class T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {
return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream &operator<<(ostream &o, tuple<T1, T2, T3> t) {
return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2> istream &operator>>(istream &i, pair<T1, T2> &p) {
return i >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &o, vector<T> a) {
Int i = 0;
for (T t : a)
o << (i++ ? " " : "") << t;
return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &a) {
for (T &t : a)
i >> t;
return i;
}
template <typename T, T MOD = 1000000007> struct Mint {
static constexpr T mod = MOD;
T v;
Mint() : v(0) {}
Mint(signed v) : v(v) {}
Mint(long long t) {
v = t % MOD;
if (v < 0)
v += MOD;
}
Mint pow(long long k) {
Mint res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
static Mint add_identity() { return Mint(0); }
static Mint mul_identity() { return Mint(1); }
Mint inv() { return pow(MOD - 2); }
Mint &operator+=(Mint a) {
v += a.v;
if (v >= MOD)
v -= MOD;
return *this;
}
Mint &operator-=(Mint a) {
v += MOD - a.v;
if (v >= MOD)
v -= MOD;
return *this;
}
Mint &operator*=(Mint a) {
v = 1LL * v * a.v % MOD;
return *this;
}
Mint &operator/=(Mint a) { return (*this) *= a.inv(); }
Mint operator+(Mint a) const { return Mint(v) += a; };
Mint operator-(Mint a) const { return Mint(v) -= a; };
Mint operator*(Mint a) const { return Mint(v) *= a; };
Mint operator/(Mint a) const { return Mint(v) /= a; };
Mint operator-() const { return v ? Mint(MOD - v) : Mint(v); }
bool operator==(const Mint a) const { return v == a.v; }
bool operator!=(const Mint a) const { return v != a.v; }
bool operator<(const Mint a) const { return v < a.v; }
// find x s.t. a^x = b
static T log(T a, T b) {
const T sq = 40000;
unordered_map<T, T> dp;
dp.reserve(sq);
Mint res(1);
for (Int r = 0; r < sq; r++) {
if (!dp.count(res.v))
dp[res.v] = r;
res *= a;
}
Mint p = Mint(a).inv().pow(sq);
res = b;
for (Int q = 0; q <= MOD / sq + 1; q++) {
if (dp.count(res.v)) {
T idx = q * sq + dp[res.v];
if (idx > 0)
return idx;
}
res *= p;
}
assert(0);
return T(-1);
}
static Mint comb(long long n, Int k) {
Mint num(1), dom(1);
for (Int i = 0; i < k; i++) {
num *= Mint(n - i);
dom *= Mint(i + 1);
}
return num / dom;
}
};
template <typename T, T MOD> constexpr T Mint<T, MOD>::mod;
template <typename T, T MOD> ostream &operator<<(ostream &os, Mint<T, MOD> m) {
os << m.v;
return os;
}
// INSERT ABOVE HERE
using mint = Mint<Int, mod>;
template <typename T> class CumulativeSum {
public:
Int n;
vector<T> sum;
vector<T> A;
Int added;
CumulativeSum() : n(-1), added(0) {}
CumulativeSum(Int n) : n(n), sum(n + 1), A(n + 1), added(0) {}
CumulativeSum(const vector<T> &B)
: n(B.size()), sum(n + 1), A(n + 1), added(0) {
for (Int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + B[i - 1];
}
void apply() {
for (Int i = 1; i <= n; i++)
A[i] = A[i] + A[i - 1];
for (Int i = 1; i <= n; i++)
A[i] = A[i] + A[i - 1];
for (Int i = 1; i <= n; i++)
sum[i] = sum[i] + A[i - 1];
added = 0;
A.clear();
A.resize(n + 1);
}
//[l, r)にxを加算
void add(Int l, Int r, T x) {
added = 1;
assert(l <= r && 0 <= l && r <= n);
A[l] = A[l] + x;
A[r] = A[r] - x;
}
//[l, r)の和を得る
T get(Int l, Int r) {
assert(l <= r && 0 <= l && r <= n);
if (added)
apply();
return sum[r] - sum[l];
}
};
Int calc(vector<Int> A) {
Int N = A.size();
Int cnt = 0;
for (Int i = 0; i < N; i++)
for (Int j = i + 1; j < N; j++)
if (A[i] > A[j])
cnt++;
return cnt;
}
using T = mint;
pair<vector<T>, mint> calc(vector<T> A, vector<T> B) {
CumulativeSum<T> sumA(A);
CumulativeSum<T> sumB(B);
vector<T> res(A.size());
const Int N = A.size();
mint cost = 0;
for (Int i = 0; i < (Int)A.size(); i++) {
if (B[i] == 0)
continue;
res[i] = A[i] + B[i];
cost += mint(sumA.get(i + 1, N)) * mint(B[i]);
}
return {res, cost};
}
signed main() {
srand((unsigned)time(NULL));
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
Int N, K;
cin >> N >> K;
vector<Int> A(N);
cin >> A;
vector<T> B(2001, 0);
vector<T> X(2001, 0);
for (Int i = 0; i < N; i++)
X[A[i]] += 1;
mint num = calc(A);
mint ans = mint(K) * num;
mint cost = 0;
while (K) {
if (K & 1) {
auto p = calc(B, X);
// auto p2 = calc(X, B);
B = p.first;
ans += p.second;
ans += cost;
// cost = 0;
}
auto p = calc(X, X);
X = p.first;
cost = cost + cost + p.second;
K /= 2;
}
cout << ans << endl;
return 0;
}
| replace | 238 | 240 | 238 | 240 | 0 | |
p02928 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> class BIT {
// bit[x]
// manage range of bit[x] is (x & -x)
//
public:
static const int n = 10000;
T bit[n] = {};
void add(int a, T w) {
for (int x = a; x <= n; x += x & -x) {
bit[x] += w;
}
}
T sum(int a) {
T ret = 0;
for (int x = a; x > 0; x -= x & -x) {
ret += bit[x];
}
return ret;
}
};
long long int wa(long long int a) { return (a * (a + 1)) / 2; }
int main() {
long long int n, k;
cin >> n >> k;
int A[2001], B[2001];
for (int i = 0; i < n; ++i) {
cin >> B[i];
A[i] = 2000 - B[i];
}
long long int tentou[2001];
long long int migi[2001];
long long int ti = wa(k) % 1000000007;
long long int to = wa(k - 1) % 1000000007;
BIT<long long int> BT;
BIT<long long int> saisho;
for (int i = 0; i < n; ++i) {
tentou[i] = BT.sum(A[i] - 1);
BT.add(A[i], 1);
}
for (int i = n - 1; i >= 0; --i) {
migi[i] = saisho.sum(A[i] - 1);
saisho.add(A[i], 1);
}
long long int ans = 0;
for (int i = 0; i < n; ++i) {
ans += ((ti * tentou[i]) % 1000000007 + (to * migi[i]) % 1000000007) %
1000000007;
}
cout << ans % 1000000007 << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> class BIT {
// bit[x]
// manage range of bit[x] is (x & -x)
//
public:
static const int n = 10000;
T bit[n] = {};
void add(int a, T w) {
for (int x = a; x <= n; x += x & -x) {
bit[x] += w;
}
}
T sum(int a) {
T ret = 0;
for (int x = a; x > 0; x -= x & -x) {
ret += bit[x];
}
return ret;
}
};
long long int wa(long long int a) { return (a * (a + 1)) / 2; }
int main() {
long long int n, k;
cin >> n >> k;
int A[2001], B[2001];
for (int i = 0; i < n; ++i) {
cin >> B[i];
A[i] = 2000 - B[i] + 1;
}
long long int tentou[2001];
long long int migi[2001];
long long int ti = wa(k) % 1000000007;
long long int to = wa(k - 1) % 1000000007;
BIT<long long int> BT;
BIT<long long int> saisho;
for (int i = 0; i < n; ++i) {
tentou[i] = BT.sum(A[i] - 1);
BT.add(A[i], 1);
}
for (int i = n - 1; i >= 0; --i) {
migi[i] = saisho.sum(A[i] - 1);
saisho.add(A[i], 1);
}
long long int ans = 0;
for (int i = 0; i < n; ++i) {
ans += ((ti * tentou[i]) % 1000000007 + (to * migi[i]) % 1000000007) %
1000000007;
}
cout << ans % 1000000007 << endl;
} | replace | 32 | 33 | 32 | 33 | TLE | |
p02928 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pc __builtin_popcount
const int mod = 1e9 + 7;
int ar[2005];
int before[2005];
int after[2005];
int n, k;
int mult(int n, int m) {
if (n > m) {
swap(n, m);
}
if (m == 1) {
return n;
}
int k = mult(n, m / 2);
int ans = k + k;
ans %= mod;
if (m & 1) {
ans += n;
}
ans %= mod;
return ans;
}
int32_t main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
before[i] += (ar[i] > ar[j]);
}
for (int j = i + 1; j <= n; j++) {
after[i] += (ar[i] > ar[j]);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += after[i] * k;
ans %= mod;
ans += mult(((k) * (k - 1) / 2), (before[i] + after[i]));
ans %= mod;
// cout<<ans<<"\n";
}
/*for(int i=1;i<=n;i++){
cout<<before[i]<<" "<<after[i]<<"\n";
}*/
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while (!(x))
#define unless(x) if (!(x))
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define pc __builtin_popcount
const int mod = 1e9 + 7;
int ar[2005];
int before[2005];
int after[2005];
int n, k;
int mult(int n, int m) {
if (n > m) {
swap(n, m);
}
if (n == 0 || m == 0) {
return 0;
}
if (m == 1) {
return n;
}
int k = mult(n, m / 2);
int ans = k + k;
ans %= mod;
if (m & 1) {
ans += n;
}
ans %= mod;
return ans;
}
int32_t main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
before[i] += (ar[i] > ar[j]);
}
for (int j = i + 1; j <= n; j++) {
after[i] += (ar[i] > ar[j]);
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += after[i] * k;
ans %= mod;
ans += mult(((k) * (k - 1) / 2), (before[i] + after[i]));
ans %= mod;
// cout<<ans<<"\n";
}
/*for(int i=1;i<=n;i++){
cout<<before[i]<<" "<<after[i]<<"\n";
}*/
cout << ans;
}
| insert | 19 | 19 | 19 | 22 | 0 | |
p02928 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Output
template <class T, class S>
std::ostream &operator<<(std::ostream &os, std::pair<T, S> p) {
return os << "(" << p.first << " " << p.second << ")";
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
for (ll i = 0; i < (ll)v.size(); i++) {
os << " [" << i << "]" << v[i];
if (i % 10 == 9)
os << std::endl;
}
// os << v[0]; for (ll i = 1; i < (ll)v.size(); i++){ os << " " << v[i]; }
return os;
}
template <class T, class S>
std::ostream &operator<<(std::ostream &os, std::map<T, S> m) {
ll i = 0;
for (auto p : m) {
os << " [" << i << "]" << p.first << "->" << p.second;
i++;
}
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<std::vector<T>> vv) {
for (auto &vec : vv) {
os << vec << std::endl;
}
os << "--------" << std::endl;
return os;
}
void print() { std::cout << std::endl; }
template <typename H> void print(H &&head) { std::cout << head << std::endl; }
template <typename H, typename... T> void print(H &&head, T &&...tail) {
std::cout << head << " ", print(std::forward<T>(tail)...);
}
int main() {
ll MAX_A = 100;
ll N, K;
std::cin >> N >> K;
std::vector<ll> va(N, 0LL);
std::vector<ll> vunder(MAX_A + 2, 0LL);
for (ll i = 0; i < N; i++) {
std::cin >> va[i];
vunder[va[i] + 1]++;
}
// この値未満のものが何個あるかを調べる
for (ll i = 1; i <= MAX_A + 1; i++) {
vunder[i] += vunder[i - 1];
}
ll ans = 0LL;
for (ll i = 0; i < N; i++) {
// 最初の数列では、自分の値未満だが転倒数にならないものがある
ll cnt = vunder[va[i]];
for (ll j = 0; j < i; j++) {
if (va[j] < va[i]) {
cnt--;
}
}
ans = (ans + cnt * K) % MOD;
// Σ を求める
ll num = (K * (K - 1) / 2) % MOD;
ll val = (vunder[va[i]] * num) % MOD;
ans = (ans + val) % MOD;
}
print(ans);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
typedef long double ld;
typedef long long ll;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1e9 + 7;
// Output
template <class T, class S>
std::ostream &operator<<(std::ostream &os, std::pair<T, S> p) {
return os << "(" << p.first << " " << p.second << ")";
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> v) {
for (ll i = 0; i < (ll)v.size(); i++) {
os << " [" << i << "]" << v[i];
if (i % 10 == 9)
os << std::endl;
}
// os << v[0]; for (ll i = 1; i < (ll)v.size(); i++){ os << " " << v[i]; }
return os;
}
template <class T, class S>
std::ostream &operator<<(std::ostream &os, std::map<T, S> m) {
ll i = 0;
for (auto p : m) {
os << " [" << i << "]" << p.first << "->" << p.second;
i++;
}
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<std::vector<T>> vv) {
for (auto &vec : vv) {
os << vec << std::endl;
}
os << "--------" << std::endl;
return os;
}
void print() { std::cout << std::endl; }
template <typename H> void print(H &&head) { std::cout << head << std::endl; }
template <typename H, typename... T> void print(H &&head, T &&...tail) {
std::cout << head << " ", print(std::forward<T>(tail)...);
}
int main() {
ll MAX_A = 2000;
ll N, K;
std::cin >> N >> K;
std::vector<ll> va(N, 0LL);
std::vector<ll> vunder(MAX_A + 2, 0LL);
for (ll i = 0; i < N; i++) {
std::cin >> va[i];
vunder[va[i] + 1]++;
}
// この値未満のものが何個あるかを調べる
for (ll i = 1; i <= MAX_A + 1; i++) {
vunder[i] += vunder[i - 1];
}
ll ans = 0LL;
for (ll i = 0; i < N; i++) {
// 最初の数列では、自分の値未満だが転倒数にならないものがある
ll cnt = vunder[va[i]];
for (ll j = 0; j < i; j++) {
if (va[j] < va[i]) {
cnt--;
}
}
ans = (ans + cnt * K) % MOD;
// Σ を求める
ll num = (K * (K - 1) / 2) % MOD;
ll val = (vunder[va[i]] * num) % MOD;
ans = (ans + val) % MOD;
}
print(ans);
return 0;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p02928 | C++ | Runtime Error | #include <iostream>
using ll_t = long long;
const int MAXN = 1000;
const int P = (int)1e9 + 7;
int a[MAXN];
ll_t solve(int n, int k) {
int x = 0, y = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j])
++x;
else if (a[i] < a[j])
++y;
}
}
ll_t res = (ll_t)k * (k + 1) / 2 % P * x + (ll_t)k * (k - 1) / 2 % P * y;
return res % P;
}
int main() {
int n, k;
std::cin >> n >> k;
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
std::cout << solve(n, k) << std::endl;
}
| #include <iostream>
using ll_t = long long;
const int MAXN = 2000;
const int P = (int)1e9 + 7;
int a[MAXN];
ll_t solve(int n, int k) {
int x = 0, y = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (a[i] > a[j])
++x;
else if (a[i] < a[j])
++y;
}
}
ll_t res = (ll_t)k * (k + 1) / 2 % P * x + (ll_t)k * (k - 1) / 2 % P * y;
return res % P;
}
int main() {
int n, k;
std::cin >> n >> k;
for (int i = 0; i < n; ++i) {
scanf("%d", a + i);
}
std::cout << solve(n, k) << std::endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02929 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#pragma warning(disable : 4996)
long long mod = 1000000007;
string S;
int N, A[100009];
int main() {
cin >> N >> S;
if (S[0] == 'W' || S[S.size() - 1] == 'W') {
cout << "0" << endl;
return 0;
}
for (int i = 0; i < S.size(); i++) {
if (i == 0)
A[i] = 1;
else if (S[i - 1] != S[i]) {
if (A[i - 1] == 1)
A[i] = 1;
else
A[i] = 0;
} else {
if (A[i - 1] == 1)
A[i] = 0;
else
A[i] = 1;
}
}
long long dep = 0, ans = 1;
for (int i = 0; i < S.size(); i++) {
if (A[i] == 1)
dep++;
else {
ans *= dep;
ans %= mod;
dep--;
}
if (dep < 0) {
cout << "0" << endl;
return 0;
}
}
if (dep != 0) {
cout << "0" << endl;
return 0;
}
for (long long i = 1; i <= N; i++) {
ans *= i;
ans %= mod;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
#pragma warning(disable : 4996)
long long mod = 1000000007;
string S;
int N, A[300009];
int main() {
cin >> N >> S;
if (S[0] == 'W' || S[S.size() - 1] == 'W') {
cout << "0" << endl;
return 0;
}
for (int i = 0; i < S.size(); i++) {
if (i == 0)
A[i] = 1;
else if (S[i - 1] != S[i]) {
if (A[i - 1] == 1)
A[i] = 1;
else
A[i] = 0;
} else {
if (A[i - 1] == 1)
A[i] = 0;
else
A[i] = 1;
}
}
long long dep = 0, ans = 1;
for (int i = 0; i < S.size(); i++) {
if (A[i] == 1)
dep++;
else {
ans *= dep;
ans %= mod;
dep--;
}
if (dep < 0) {
cout << "0" << endl;
return 0;
}
}
if (dep != 0) {
cout << "0" << endl;
return 0;
}
for (long long i = 1; i <= N; i++) {
ans *= i;
ans %= mod;
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
bool d[112345];
cin >> n >> s;
int cnt = 0;
d[0] = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1])
d[i] = !d[i - 1];
else
d[i] = d[i - 1];
cnt += d[i];
}
if (cnt != n || s[0] == 'W' || s[s.size() - 1] == 'W') {
cout << 0 << endl;
return 0;
}
ll res = 1;
int ln = 1;
for (int i = 1; i < s.size(); i++) {
if (d[i])
(res *= ln) %= MOD, ln--;
else
ln++;
}
for (ll i = 1; i <= n; i++)
(res *= i) %= MOD;
cout << res << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
bool d[212345];
cin >> n >> s;
int cnt = 0;
d[0] = false;
for (int i = 1; i < s.size(); i++) {
if (s[i] == s[i - 1])
d[i] = !d[i - 1];
else
d[i] = d[i - 1];
cnt += d[i];
}
if (cnt != n || s[0] == 'W' || s[s.size() - 1] == 'W') {
cout << 0 << endl;
return 0;
}
ll res = 1;
int ln = 1;
for (int i = 1; i < s.size(); i++) {
if (d[i])
(res *= ln) %= MOD, ln--;
else
ln++;
}
for (ll i = 1; i <= n; i++)
(res *= i) %= MOD;
cout << res << endl;
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, dp[100008];
string s;
ll MOD = 1e9 + 7;
int main() {
cin >> n >> s;
ll ans = 1;
dp[0] = 0;
for (ll i = 1; i <= 2 * n; i++) {
if (dp[i - 1] == 0) {
if (s[i - 1] == 'W') {
cout << 0 << endl;
return 0;
} else {
dp[i] = 1;
}
} else {
if ((s[i - 1] == 'W' && dp[i - 1] % 2 == 1) ||
(s[i - 1] == 'B' && dp[i - 1] % 2 == 0)) {
dp[i] = dp[i - 1] + 1;
} else {
ans *= dp[i - 1];
ans %= MOD;
dp[i] = dp[i - 1] - 1;
}
}
}
if (dp[2 * n] > 0) {
cout << 0 << endl;
} else {
for (ll i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n, dp[200008];
string s;
ll MOD = 1e9 + 7;
int main() {
cin >> n >> s;
ll ans = 1;
dp[0] = 0;
for (ll i = 1; i <= 2 * n; i++) {
if (dp[i - 1] == 0) {
if (s[i - 1] == 'W') {
cout << 0 << endl;
return 0;
} else {
dp[i] = 1;
}
} else {
if ((s[i - 1] == 'W' && dp[i - 1] % 2 == 1) ||
(s[i - 1] == 'B' && dp[i - 1] % 2 == 0)) {
dp[i] = dp[i - 1] + 1;
} else {
ans *= dp[i - 1];
ans %= MOD;
dp[i] = dp[i - 1] - 1;
}
}
}
if (dp[2 * n] > 0) {
cout << 0 << endl;
} else {
for (ll i = 1; i <= n; i++) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)) - 1; i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define pque(type) priority_queue<type, vector<type>, greater<type>>
#define memst(a, b) memset(a, b, sizeof(a))
#define iter(v, ite) for (auto ite = (v).begin(); ite != (v).end(); ite++)
#define mimunum(v, x) \
distance((v).begin(), lower_bound((v).begin(), (v).end(), x))
#define MOD ((lli)(1000000007))
char s[100005];
int main(void) {
int n;
scanf("%d%s", &n, s);
lli ans = 1;
int en = 0;
rep(i, n * 2) {
if ((en % 2 == 0) == (s[i] == 'W')) {
if (en <= 0) {
puts("0");
return 0;
} else {
ans = (ans * en) % MOD;
en--;
}
} else
en++;
// printf("%d %d\n",i,en);
}
if (en > 0) {
puts("0");
return 0;
}
// printf("%lld %d\n",ans);
reg(i, 1, n) { ans = (ans * i) % MOD; }
printf("%lld\n", ans);
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (int i = ((int)(a)); i <= ((int)(b)); i++)
#define irep(i, n) for (int i = ((int)(n)) - 1; i >= 0; i--)
#define ireg(i, a, b) for (int i = ((int)(b)); i >= ((int)(a)); i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define pque(type) priority_queue<type, vector<type>, greater<type>>
#define memst(a, b) memset(a, b, sizeof(a))
#define iter(v, ite) for (auto ite = (v).begin(); ite != (v).end(); ite++)
#define mimunum(v, x) \
distance((v).begin(), lower_bound((v).begin(), (v).end(), x))
#define MOD ((lli)(1000000007))
char s[200005];
int main(void) {
int n;
scanf("%d%s", &n, s);
lli ans = 1;
int en = 0;
rep(i, n * 2) {
if ((en % 2 == 0) == (s[i] == 'W')) {
if (en <= 0) {
puts("0");
return 0;
} else {
ans = (ans * en) % MOD;
en--;
}
} else
en++;
// printf("%d %d\n",i,en);
}
if (en > 0) {
puts("0");
return 0;
}
// printf("%lld %d\n",ans);
reg(i, 1, n) { ans = (ans * i) % MOD; }
printf("%lld\n", ans);
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MODD 1000000007
using namespace std;
long long fac(int n) {
long long ans = 1;
for (int i = 2; i <= n; i++) {
ans = (ans * i) % MODD;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int d[100005]; // 0 represents L, 1 represents R
int l[100005] = {0}, r[100005] = {0};
int len = s.size();
d[0] = 0;
for (int i = 1; i < len; i++) {
if (s[i] == s[i - 1])
d[i] = !d[i - 1];
else
d[i] = d[i - 1];
}
int cntL = 0, cntR = 0;
for (int i = 0; i < len; i++) {
if (d[i] == 0)
cntL++;
else
cntR++;
}
long long ans = 1;
if (cntL != cntR || s[0] == 'W' || s[len - 1] == 'W') {
ans = 0;
} else {
for (int i = 1; i < len; i++) {
if (d[i - 1] == 0) {
l[i] = l[i - 1] + 1;
r[i] = r[i - 1];
} else {
l[i] = l[i - 1];
r[i] = r[i - 1] + 1;
}
}
for (int i = 0; i < len; i++) {
if (d[i] == 1) {
ans = (ans * (l[i] - r[i])) % MODD;
}
}
ans = (ans * fac(n)) % MODD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define MODD 1000000007
using namespace std;
long long fac(int n) {
long long ans = 1;
for (int i = 2; i <= n; i++) {
ans = (ans * i) % MODD;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string s;
cin >> n >> s;
int d[200005]; // 0 represents L, 1 represents R
int l[200005] = {0}, r[200005] = {0}; // size should be 2N
int len = s.size();
d[0] = 0;
for (int i = 1; i < len; i++) {
if (s[i] == s[i - 1])
d[i] = !d[i - 1];
else
d[i] = d[i - 1];
}
int cntL = 0, cntR = 0;
for (int i = 0; i < len; i++) {
if (d[i] == 0)
cntL++;
else
cntR++;
}
long long ans = 1;
if (cntL != cntR || s[0] == 'W' || s[len - 1] == 'W') {
ans = 0;
} else {
for (int i = 1; i < len; i++) {
if (d[i - 1] == 0) {
l[i] = l[i - 1] + 1;
r[i] = r[i - 1];
} else {
l[i] = l[i - 1];
r[i] = r[i - 1] + 1;
}
}
for (int i = 0; i < len; i++) {
if (d[i] == 1) {
ans = (ans * (l[i] - r[i])) % MODD;
}
}
ans = (ans * fac(n)) % MODD;
}
cout << ans << endl;
return 0;
} | replace | 17 | 19 | 17 | 19 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool L[100005];
int main() {
ll N;
string S;
cin >> N >> S;
memset(L, 0, sizeof(L));
ll l = 0;
REP(i, 2 * N) {
if (l % 2 == 0 && S[i] == 'B') {
L[i] = true;
l++;
} else if (l % 2 == 1 && S[i] == 'W') {
L[i] = true;
l++;
} else
l--;
}
if (l != 0) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
ll r = 0;
REP(i, 2 * N) {
if (!L[2 * N - 1 - i])
r++;
else
ans = (ans * r--) % MOD;
}
REP(i, N) { ans = (ans * (i + 1)) % MOD; }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
bool L[200005];
int main() {
ll N;
string S;
cin >> N >> S;
memset(L, 0, sizeof(L));
ll l = 0;
REP(i, 2 * N) {
if (l % 2 == 0 && S[i] == 'B') {
L[i] = true;
l++;
} else if (l % 2 == 1 && S[i] == 'W') {
L[i] = true;
l++;
} else
l--;
}
if (l != 0) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
ll r = 0;
REP(i, 2 * N) {
if (!L[2 * N - 1 - i])
r++;
else
ans = (ans * r--) % MOD;
}
REP(i, N) { ans = (ans * (i + 1)) % MOD; }
cout << ans << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long LL;
int N;
string S;
int A[100001];
LL MOD = 1e9 + 7;
int main() {
cin >> N >> S;
if (S[0] == 'W') {
cout << 0 << endl;
return 0;
}
A[0] = 0;
int c = 1;
for (int i = 1; i < 2 * N; i++) {
int a = 0;
if (S[i] == 'B') {
a = 1;
}
if (a == c) {
A[i] = 1;
} else {
A[i] = 0;
}
c = 1 - c;
// cout<<A[i]<<endl;
}
LL temp = 0;
LL ans = 1;
REP(i, 2 * N) {
if (A[i] == 0)
temp++;
if (A[i] == 1) {
if (temp == 0) {
cout << 0 << endl;
return 0;
}
ans *= temp;
ans %= MOD;
temp--;
}
}
if (temp != 0) {
cout << 0 << endl;
return 0;
}
REP(i, N) {
LL x = i + 1;
ans *= x;
ans %= MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long LL;
int N;
string S;
int A[200001];
LL MOD = 1e9 + 7;
int main() {
cin >> N >> S;
if (S[0] == 'W') {
cout << 0 << endl;
return 0;
}
A[0] = 0;
int c = 1;
for (int i = 1; i < 2 * N; i++) {
int a = 0;
if (S[i] == 'B') {
a = 1;
}
if (a == c) {
A[i] = 1;
} else {
A[i] = 0;
}
c = 1 - c;
// cout<<A[i]<<endl;
}
LL temp = 0;
LL ans = 1;
REP(i, 2 * N) {
if (A[i] == 0)
temp++;
if (A[i] == 1) {
if (temp == 0) {
cout << 0 << endl;
return 0;
}
ans *= temp;
ans %= MOD;
temp--;
}
}
if (temp != 0) {
cout << 0 << endl;
return 0;
}
REP(i, N) {
LL x = i + 1;
ans *= x;
ans %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02929 | C++ | Runtime Error | /*
;<+111===1?=1=zzzzvI==llllltttttttrrrrrrrvvwXzzzzzzzzzzzzzzzzzzzzzzzzzzzuUXwzzXXzvvvvvvvvXXwrrrrrrrrttz-_...............
:;;;;;;;;;;;<<?<+??=====lllzOtOZOtttttrrrrw0vvzzzzzzzuuuuuuuuuuuuuuuuuuuuuuXWXXXUXzzzzwwvvvwUwvvrrrrrrttt+_.............
;:;:;;;;;<<<-(<<<<?<z1?===zOOOlllttttttrrrdXvzzzzzuuuuuXWXuuuuuuuuuuuuuuuuuuuWkuUyWXvOzXzzzvvzXwvrrrrrrrttO-~......`..`.
;;;;;;;+<~(<<~(<(?<+I??==zwOOOllllltttrwOrwkZwXuzuuuuuuuuXWkZuZZuuZZuZZuuuuuuuuuuuXSI1wkzvvvvvvwXwvrrrrrtttO_~..........
;>;>>+z<(+><<+<<?<(zI?==z0OZlllllltttrwIzrrXv+OWuuuuuuuZZZZZyWWkZyZZZZyZZZZZZZZuuuuXk?wkzzzvvvvrvZXrrrrZzttto~~~..~.....
>>>>jI+wI+=1z<+==1zdZllzZOZttltltttrwVOwvzzuWXzvWuZZZZZyyyWfWWyyWWWkVVyWWVyyyyZZZZZX0zXkuuzzvvvvrrrrrrtrzdO1z>~~~~.~.~..
>??zwZwOtOOtlttOOtOXWyrdkdrrrrrrvwwVOwuXWSuZWXWyvWXyyyyyyyVVVVWHWppWWkkWkWHWVyyyyyyXkXWWkXuuuzzvvvvrrrzzOzXy?O-~~~.~~.~~
??jZzzXzw0vrvwXvvwzXqHkWHkuuzuXXZXwXXWgHWZZyWyyWWAXWWVffffWffppHWppppppppppHkpffffWWWHyyHHXZZZuXXuuuuuzOOwwZkzI~~~~~~.~.
??1?=XXXSuXXZuuuuZZXHg@WHHyXkpWWkHH@HHHVyVVVWHffffWWWHWpppWbppbHMHbppppHWpbpbHWbpWHHpHWpW@NkWHWykXWXyZyZkwwXyXWc~~~~~~~~
???=zW0WWWyyyyyyyyVVW@@@@MHpWWH@M@HHppHppfpppHpppHpppWHmHbWHbbkHH@HkbbkbHHkkkkHHkkkkkHNkHHHNWHHpppkWHWpppppkXpffk+-~~~~~
1zuwXWyVVVVWWWWHpffppWMHH@HHHbbbWH@NkpHHppppWUHbbHkbbbkbbHHHkkmkHUMMHkkkqMMHqkkkHHqqqMMqM###MHMqkkkkHWHHHkqqkqqkkWpk&J_~
OOOOOOOWffKXppWMWbbpbbkHHHHNkkkkHHHHHHHXHHHHHmXHkHHkkkkkkkkHkkgkHKXXMNHHHHHWMNHgHHHHHM#H###N##MmggggmggHHH@HHgggHHHHqbpf
=====llWfpSdHbHHMHkkkkqMHHH#MHHHHMMZXHkuV4bbHXZ?HbHqkkbkkkkHHkHWkH_?4UWHqkHHXZWMHmMMMNNMNNNNNNMgg@H@@@@MNMMMMMM@MMgqR:::
==l=lllZWWktWkHMHHNHqqqMH#H#HMHqqkHuu<4kw(dWRw>~_4pHVHbbbbbbHWD?ZWn.__?OXWHqeJ?TXWHMN#MWMNNNNNM@@@M@@@@MNMM@MNNMM#HHq2::
llll=llldWRtOWkMH##HNHmM####HN1JWHHHHH#####HHMHms~?W21ZWfppppH$.._?l_jdHH#NNMNN#MMMM##NNgNMNNM@@@MM@@MMMMMMMMNNN#M2?4R::
lllllllllZWyttWHMM####MNM####N<WH#TC<dMMMM#NaJJJ<?!.?_.._?TWWXt.`..
~._<jMMMMNNMNmm2<1w#MMNMM@@@MM@HMNMNNMNMNNN$7MP;;=::
llllllllllOUOttZHkHMH#NNN###HHr(HN-..(MBUMMMMHWK..````````` ?7wl.````..`
WUZHMMMMWM$._dM3dM@@@MMHMMMMNMMNNMN#M#<;?<:::::
tltllllllllllllttXkrVM#NNNN##HN,_~7-..(S,..+zOd'`.``.```.`````` ````````.
?+._+zXV^.(?<(Hg@MMMMMNMMMNMNNMM#6?d3;::::::::
ttltlllllllllllllltttdHNNNNN#HMBH&...-..
_~~~~.`````````````````````.``.`````___.._.-JVY=dHNNMNNMNNMNNMB6?>;;;:::::::::~
tttttllllllllllllltttdM##NNN#HMc....```````````.``.``.````.``````````````.`````.`.._....~dH#NNMNMMMM#E??>;;;;:::::::::~:
rtttttttltllllllltlttwgHMNNNN#HMx.....`.````.````````````.._```````````.``.`.``.``.`....(M#NNMMM@@M@Mz?>>;;;;:::::::::::
rrtttttttltllltttllttrmHMMNNNN#HMe_..`.`.`.``.`````.``.``````````````.`````.`.`..`....-+M#NNMM@@@@M@R?>>;;;;;;;:;:::::::
rrrrttttttttttlttttttrWHM@MNNNN#MNO--..``.`````.``.`````````.`.`.`.```.`.``````....._(WBW#M@@@@@@@M@R??>>;;;;;:;::::::::
rrrrrrttttttlttltttttrdM@@MNMNNN#MOlz1--.....`.``````.``.`.``````.`.`.``.`.......-(g9C==d#M@@@@@@@M@R?>>>>;;;;;;;;;:::::
rrrrrrrrttttttttttttrrdM@@MNNMNN#MZll==z1(-...`..`.``.`.` ....
.```.`.`......-(JWH9====zMM@@@H@H@@H@0??>>>>;;;;;;;;;;::;
vvvrrrrrrrrttttttttttrwMg@MMMMMNNH0tlll===?z1+--.....`.`.`.``..`...`....-((gMHHM8=====ldHM@@@@@@@@MgR=??>>>>>>;;;;;;;;;;
vrvrrrrrrrrrrrttttrrrrrdgg@MNMMNN#Rrtllll=======WHa-.-....`..`.....-((+WHHHWyy#Il====lldM@@H@@H@@@HgR=??>>>>>>>>>;;;;;;;
vrvvrrrrrtttrtrrtrtttrrdgggMN@MNN#Krtllllllll=lldkuuXUUG&---.-((JzuuuZZZyyyyyXRlllllllld@@@@@H@@@@MgS==???>>>>>>>;>>>;>;
vrvrrrrrrrrrttrttrrrrrrdHggM#@MNN##rtttllllllllltWuuZuuuuuuuuZuZZZZZZyyyyyyyyXSllllllltWg@@@HW@@@MMg0==?????>>>>>>>>>>>>
rrrrrrrrtrrtrttrtttrtrrdHqggMHHNN#NrtttttlltlllltdkuZZZZZZZZZZZZZZyZyyyyyyyyyWRtllllltdgg@@HHW@@@MgHI==????>??>>>>>>>>>>
rrrrrrrrttttttttttttttrwHkqqHMXM##MwrttttttttttttwKuuZZZZZZZZZZZZZZZZZZZyyyyyyHAwtttttdgggmHXHqmMHqKl=?????>??>??>??>???
vvvrrrtrtttttrttttttttrwHkkkkkkWHHHkrrtttOwwwwXUuXWuuuZuZZZZZZZZZZZZZZZZZZZZyyyyyyWWyqHHHkHZdXWHMkHS===??????????>??????
rrrrrtttttrttttttttttttrWpppppRZMHHkwXUUXvvvzzzzuuuuuuuuuuuuZuuZZZZZZZZZZZZZZZZZZZZZXHHHkH0wXSXHppW7?<11zz???>>?>??>?>??
rrrrrttttttllllzz??<<?v!jyVVXWfZdHMr1wwrvvvvvzzzzzzuuuuuuuuuuuuuuuuZZZZZZZZZZZZZZZZZWHSHkSdSXdWffV%~~~~~~<-__<??<<??>???
rrrtrttttv<!````````.?...UZyXZVWwM@b`
?1OZXUUUUUUUZZXkXuuZuuuuuuZuZXXXkkXXyyWWWWWUWH9=(HHXkHXHbpff~~~.~~~~(-````.``._?<z
rrrtttz^_`````.``.``.!...jZykXdfWX@H-...._?zrrvvzzuuuuuUUuuuuuuZXUuuuuuuuuuuuuuzVOV:.(WHWqqWqkkpW>~~~~~~~~~(-.``.```.`..
*/
#include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define ve vector
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vvi vector<vector<int>>
template <typename T> using pq = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
ll INF = LLONG_MAX / 4 - 100;
ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
class fact {
public:
int fmod = 1e9 + 7;
vector<int> fac, inv;
fact(int n, int Mod = 1e9 + 7) {
fmod = Mod;
fac = vector<int>(n, 0);
inv = vector<int>(n, 0);
fac[0] = 1;
for (int i = 1; i < n; i++)
fac[i] = fac[i - 1] * i % fmod;
for (int i = 0; i < n; i++)
inv[i] = fact::POW(fac[i], fmod - 2);
}
ll nCr(ll n, ll r) { return (fac[n] * inv[r] % fmod) * inv[n - r] % fmod; }
ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % fmod;
}
a = a * a % fmod;
b >>= 1;
}
return c;
}
inline int operator[](int i) { return fac[i]; }
};
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
void DEBUG(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
void EMP(int x) { cout << "!!!" << x << "!!!" << endl; }
ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
ll LCM(ll a, ll b) { return (a / GCD(a, b)) * (b / GCD(a, b)) * GCD(a, b); }
ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1;
}
return c;
}
void PRI(ll n) {
bool a[n + 1LL];
for (int i = 0; i < n + 1LL; i++) {
a[i] = 1LL;
}
for (int i = 2; i < n + 1LL; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
template <typename T> T chmin(T &a, T b) {
if (a > b)
a = b;
return a;
}
template <typename T> T chmax(T &a, T b) {
if (a < b)
a = b;
return b;
}
bool isSqrt(ll a) { return pow(sqrt(a), 2) == a ? 1 : 0; }
void YesNo(bool a) {
if (a)
cout << "Yes";
else
cout << "No";
cout << endl;
}
void yesno(bool a) {
if (a)
cout << "yes";
else
cout << "no";
cout << endl;
}
void YESNO(bool a) {
if (a)
cout << "YES";
else
cout << "NO";
cout << endl;
}
double dis(int x1, int x2, int y1, int y2) {
return sqrt((double)abs(x1 - x2) * (double)abs(x1 - x2) +
(double)abs(y1 - y2) * (double)abs(y1 - y2));
}
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int N) { par = vector<int>(N, -1); }
int find(int x);
ll size(int x);
void unite(int x, int y);
bool same(int x, int y);
};
int UnionFind::find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
ll UnionFind::size(int x) { return -par[find(x)]; }
void UnionFind::unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
// 大きい方に小さい方をくっ付ける
if (size(x) < size(y))
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool UnionFind::same(int x, int y) {
x = find(x);
y = find(y);
return x == y;
}
int inout[100005];
int cnt[100005];
bool solve() {
int n;
cin >> n;
string s;
cin >> s;
REP(i, n * 2) {
if (s[i] == 'B') {
cnt[i] = 1;
}
// cout << cnt[i] << " ";
}
if (s[0] == 'W') {
cout << 0 << endl;
} else {
int tmp = 0;
int pos = 1;
inout[0] = 1;
tmp = 1;
REP(i, n * 2) {
// cout << tmp << endl;
if (inout[i] == 2)
continue;
FOR(j, pos, n * 2) {
if (tmp % 2 == cnt[j]) {
inout[j] = 2;
pos = j + 1;
tmp--;
break;
} else {
tmp++;
inout[j] = 1;
}
}
}
if (tmp == 0) {
int ans = 1;
tmp = 0;
// REP (i,n * 2) cout << inout[i] << " "; cout << endl;
REP(i, n * 2) {
if (inout[i] == 2) {
ans *= tmp;
ans %= mod;
tmp--;
} else {
tmp++;
}
}
int mul = 1;
REP(i, n) {
mul *= (i + 1);
mul %= mod;
}
cout << ans * mul % mod << endl;
} else {
cout << 0 << endl;
}
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| /*
;<+111===1?=1=zzzzvI==llllltttttttrrrrrrrvvwXzzzzzzzzzzzzzzzzzzzzzzzzzzzuUXwzzXXzvvvvvvvvXXwrrrrrrrrttz-_...............
:;;;;;;;;;;;<<?<+??=====lllzOtOZOtttttrrrrw0vvzzzzzzzuuuuuuuuuuuuuuuuuuuuuuXWXXXUXzzzzwwvvvwUwvvrrrrrrttt+_.............
;:;:;;;;;<<<-(<<<<?<z1?===zOOOlllttttttrrrdXvzzzzzuuuuuXWXuuuuuuuuuuuuuuuuuuuWkuUyWXvOzXzzzvvzXwvrrrrrrrttO-~......`..`.
;;;;;;;+<~(<<~(<(?<+I??==zwOOOllllltttrwOrwkZwXuzuuuuuuuuXWkZuZZuuZZuZZuuuuuuuuuuuXSI1wkzvvvvvvwXwvrrrrrtttO_~..........
;>;>>+z<(+><<+<<?<(zI?==z0OZlllllltttrwIzrrXv+OWuuuuuuuZZZZZyWWkZyZZZZyZZZZZZZZuuuuXk?wkzzzvvvvrvZXrrrrZzttto~~~..~.....
>>>>jI+wI+=1z<+==1zdZllzZOZttltltttrwVOwvzzuWXzvWuZZZZZyyyWfWWyyWWWkVVyWWVyyyyZZZZZX0zXkuuzzvvvvrrrrrrtrzdO1z>~~~~.~.~..
>??zwZwOtOOtlttOOtOXWyrdkdrrrrrrvwwVOwuXWSuZWXWyvWXyyyyyyyVVVVWHWppWWkkWkWHWVyyyyyyXkXWWkXuuuzzvvvvrrrzzOzXy?O-~~~.~~.~~
??jZzzXzw0vrvwXvvwzXqHkWHkuuzuXXZXwXXWgHWZZyWyyWWAXWWVffffWffppHWppppppppppHkpffffWWWHyyHHXZZZuXXuuuuuzOOwwZkzI~~~~~~.~.
??1?=XXXSuXXZuuuuZZXHg@WHHyXkpWWkHH@HHHVyVVVWHffffWWWHWpppWbppbHMHbppppHWpbpbHWbpWHHpHWpW@NkWHWykXWXyZyZkwwXyXWc~~~~~~~~
???=zW0WWWyyyyyyyyVVW@@@@MHpWWH@M@HHppHppfpppHpppHpppWHmHbWHbbkHH@HkbbkbHHkkkkHHkkkkkHNkHHHNWHHpppkWHWpppppkXpffk+-~~~~~
1zuwXWyVVVVWWWWHpffppWMHH@HHHbbbWH@NkpHHppppWUHbbHkbbbkbbHHHkkmkHUMMHkkkqMMHqkkkHHqqqMMqM###MHMqkkkkHWHHHkqqkqqkkWpk&J_~
OOOOOOOWffKXppWMWbbpbbkHHHHNkkkkHHHHHHHXHHHHHmXHkHHkkkkkkkkHkkgkHKXXMNHHHHHWMNHgHHHHHM#H###N##MmggggmggHHH@HHgggHHHHqbpf
=====llWfpSdHbHHMHkkkkqMHHH#MHHHHMMZXHkuV4bbHXZ?HbHqkkbkkkkHHkHWkH_?4UWHqkHHXZWMHmMMMNNMNNNNNNMgg@H@@@@MNMMMMMM@MMgqR:::
==l=lllZWWktWkHMHHNHqqqMH#H#HMHqqkHuu<4kw(dWRw>~_4pHVHbbbbbbHWD?ZWn.__?OXWHqeJ?TXWHMN#MWMNNNNNM@@@M@@@@MNMM@MNNMM#HHq2::
llll=llldWRtOWkMH##HNHmM####HN1JWHHHHH#####HHMHms~?W21ZWfppppH$.._?l_jdHH#NNMNN#MMMM##NNgNMNNM@@@MM@@MMMMMMMMNNN#M2?4R::
lllllllllZWyttWHMM####MNM####N<WH#TC<dMMMM#NaJJJ<?!.?_.._?TWWXt.`..
~._<jMMMMNNMNmm2<1w#MMNMM@@@MM@HMNMNNMNMNNN$7MP;;=::
llllllllllOUOttZHkHMH#NNN###HHr(HN-..(MBUMMMMHWK..````````` ?7wl.````..`
WUZHMMMMWM$._dM3dM@@@MMHMMMMNMMNNMN#M#<;?<:::::
tltllllllllllllttXkrVM#NNNN##HN,_~7-..(S,..+zOd'`.``.```.`````` ````````.
?+._+zXV^.(?<(Hg@MMMMMNMMMNMNNMM#6?d3;::::::::
ttltlllllllllllllltttdHNNNNN#HMBH&...-..
_~~~~.`````````````````````.``.`````___.._.-JVY=dHNNMNNMNNMNNMB6?>;;;:::::::::~
tttttllllllllllllltttdM##NNN#HMc....```````````.``.``.````.``````````````.`````.`.._....~dH#NNMNMMMM#E??>;;;;:::::::::~:
rtttttttltllllllltlttwgHMNNNN#HMx.....`.````.````````````.._```````````.``.`.``.``.`....(M#NNMMM@@M@Mz?>>;;;;:::::::::::
rrtttttttltllltttllttrmHMMNNNN#HMe_..`.`.`.``.`````.``.``````````````.`````.`.`..`....-+M#NNMM@@@@M@R?>>;;;;;;;:;:::::::
rrrrttttttttttlttttttrWHM@MNNNN#MNO--..``.`````.``.`````````.`.`.`.```.`.``````....._(WBW#M@@@@@@@M@R??>>;;;;;:;::::::::
rrrrrrttttttlttltttttrdM@@MNMNNN#MOlz1--.....`.``````.``.`.``````.`.`.``.`.......-(g9C==d#M@@@@@@@M@R?>>>>;;;;;;;;;:::::
rrrrrrrrttttttttttttrrdM@@MNNMNN#MZll==z1(-...`..`.``.`.` ....
.```.`.`......-(JWH9====zMM@@@H@H@@H@0??>>>>;;;;;;;;;;::;
vvvrrrrrrrrttttttttttrwMg@MMMMMNNH0tlll===?z1+--.....`.`.`.``..`...`....-((gMHHM8=====ldHM@@@@@@@@MgR=??>>>>>>;;;;;;;;;;
vrvrrrrrrrrrrrttttrrrrrdgg@MNMMNN#Rrtllll=======WHa-.-....`..`.....-((+WHHHWyy#Il====lldM@@H@@H@@@HgR=??>>>>>>>>>;;;;;;;
vrvvrrrrrtttrtrrtrtttrrdgggMN@MNN#Krtllllllll=lldkuuXUUG&---.-((JzuuuZZZyyyyyXRlllllllld@@@@@H@@@@MgS==???>>>>>>>;>>>;>;
vrvrrrrrrrrrttrttrrrrrrdHggM#@MNN##rtttllllllllltWuuZuuuuuuuuZuZZZZZZyyyyyyyyXSllllllltWg@@@HW@@@MMg0==?????>>>>>>>>>>>>
rrrrrrrrtrrtrttrtttrtrrdHqggMHHNN#NrtttttlltlllltdkuZZZZZZZZZZZZZZyZyyyyyyyyyWRtllllltdgg@@HHW@@@MgHI==????>??>>>>>>>>>>
rrrrrrrrttttttttttttttrwHkqqHMXM##MwrttttttttttttwKuuZZZZZZZZZZZZZZZZZZZyyyyyyHAwtttttdgggmHXHqmMHqKl=?????>??>??>??>???
vvvrrrtrtttttrttttttttrwHkkkkkkWHHHkrrtttOwwwwXUuXWuuuZuZZZZZZZZZZZZZZZZZZZZyyyyyyWWyqHHHkHZdXWHMkHS===??????????>??????
rrrrrtttttrttttttttttttrWpppppRZMHHkwXUUXvvvzzzzuuuuuuuuuuuuZuuZZZZZZZZZZZZZZZZZZZZZXHHHkH0wXSXHppW7?<11zz???>>?>??>?>??
rrrrrttttttllllzz??<<?v!jyVVXWfZdHMr1wwrvvvvvzzzzzzuuuuuuuuuuuuuuuuZZZZZZZZZZZZZZZZZWHSHkSdSXdWffV%~~~~~~<-__<??<<??>???
rrrtrttttv<!````````.?...UZyXZVWwM@b`
?1OZXUUUUUUUZZXkXuuZuuuuuuZuZXXXkkXXyyWWWWWUWH9=(HHXkHXHbpff~~~.~~~~(-````.``._?<z
rrrtttz^_`````.``.``.!...jZykXdfWX@H-...._?zrrvvzzuuuuuUUuuuuuuZXUuuuuuuuuuuuuuzVOV:.(WHWqqWqkkpW>~~~~~~~~~(-.``.```.`..
*/
#include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define SORT(c) sort((c).begin(), (c).end())
#define ve vector
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vvi vector<vector<int>>
template <typename T> using pq = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
ll INF = LLONG_MAX / 4 - 100;
ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
class fact {
public:
int fmod = 1e9 + 7;
vector<int> fac, inv;
fact(int n, int Mod = 1e9 + 7) {
fmod = Mod;
fac = vector<int>(n, 0);
inv = vector<int>(n, 0);
fac[0] = 1;
for (int i = 1; i < n; i++)
fac[i] = fac[i - 1] * i % fmod;
for (int i = 0; i < n; i++)
inv[i] = fact::POW(fac[i], fmod - 2);
}
ll nCr(ll n, ll r) { return (fac[n] * inv[r] % fmod) * inv[n - r] % fmod; }
ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % fmod;
}
a = a * a % fmod;
b >>= 1;
}
return c;
}
inline int operator[](int i) { return fac[i]; }
};
template <class T = ll> T in() {
T x;
cin >> x;
return (x);
}
void DEBUG(vector<int> a) {
for (int i = 0; i < a.size(); i++)
cout << a[i] << " ";
cout << endl;
}
void EMP(int x) { cout << "!!!" << x << "!!!" << endl; }
ll GCD(ll a, ll b) {
ll c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
ll LCM(ll a, ll b) { return (a / GCD(a, b)) * (b / GCD(a, b)) * GCD(a, b); }
ll POW(ll a, ll b) {
ll c = 1;
while (b > 0) {
if (b & 1) {
c = a * c % mod;
}
a = a * a % mod;
b >>= 1;
}
return c;
}
void PRI(ll n) {
bool a[n + 1LL];
for (int i = 0; i < n + 1LL; i++) {
a[i] = 1LL;
}
for (int i = 2; i < n + 1LL; i++) {
if (a[i]) {
prime.pb(i);
ll b = i;
while (b <= n) {
a[b] = 0;
b += i;
}
}
}
}
template <typename T> T chmin(T &a, T b) {
if (a > b)
a = b;
return a;
}
template <typename T> T chmax(T &a, T b) {
if (a < b)
a = b;
return b;
}
bool isSqrt(ll a) { return pow(sqrt(a), 2) == a ? 1 : 0; }
void YesNo(bool a) {
if (a)
cout << "Yes";
else
cout << "No";
cout << endl;
}
void yesno(bool a) {
if (a)
cout << "yes";
else
cout << "no";
cout << endl;
}
void YESNO(bool a) {
if (a)
cout << "YES";
else
cout << "NO";
cout << endl;
}
double dis(int x1, int x2, int y1, int y2) {
return sqrt((double)abs(x1 - x2) * (double)abs(x1 - x2) +
(double)abs(y1 - y2) * (double)abs(y1 - y2));
}
class UnionFind {
private:
vector<int> par;
public:
UnionFind(int N) { par = vector<int>(N, -1); }
int find(int x);
ll size(int x);
void unite(int x, int y);
bool same(int x, int y);
};
int UnionFind::find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
ll UnionFind::size(int x) { return -par[find(x)]; }
void UnionFind::unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
// 大きい方に小さい方をくっ付ける
if (size(x) < size(y))
swap(x, y);
par[x] += par[y];
par[y] = x;
}
bool UnionFind::same(int x, int y) {
x = find(x);
y = find(y);
return x == y;
}
int inout[200005];
int cnt[200005];
bool solve() {
int n;
cin >> n;
string s;
cin >> s;
REP(i, n * 2) {
if (s[i] == 'B') {
cnt[i] = 1;
}
// cout << cnt[i] << " ";
}
if (s[0] == 'W') {
cout << 0 << endl;
} else {
int tmp = 0;
int pos = 1;
inout[0] = 1;
tmp = 1;
REP(i, n * 2) {
// cout << tmp << endl;
if (inout[i] == 2)
continue;
FOR(j, pos, n * 2) {
if (tmp % 2 == cnt[j]) {
inout[j] = 2;
pos = j + 1;
tmp--;
break;
} else {
tmp++;
inout[j] = 1;
}
}
}
if (tmp == 0) {
int ans = 1;
tmp = 0;
// REP (i,n * 2) cout << inout[i] << " "; cout << endl;
REP(i, n * 2) {
if (inout[i] == 2) {
ans *= tmp;
ans %= mod;
tmp--;
} else {
tmp++;
}
}
int mul = 1;
REP(i, n) {
mul *= (i + 1);
mul %= mod;
}
cout << ans * mul % mod << endl;
} else {
cout << 0 << endl;
}
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| replace | 224 | 226 | 224 | 226 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define MOD 1000000007
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RER(i, n) for (ll i = n - 1; i >= 0; i--)
#define ALL(v) v.begin() v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n;
string s;
bool d[MAX_N];
signed main() {
cin >> n >> s;
d[0] = 1;
for (ll i = 1; i < 2 * n; i++) {
if (s[i] == s[i - 1])
d[i] = 1 - d[i - 1];
else
d[i] = d[i - 1];
}
// for(ll i=0; i<2*n; i++){
// if(d[i]) cout << 'L';
// else cout << 'R';
// }
ll ret = 1;
ll num_l = 1;
for (ll i = 1; i < 2 * n; i++) {
if (d[i])
num_l++;
else {
ret *= num_l--;
ret %= MOD;
}
}
if (num_l != 0)
ret = 0;
if (s[0] == 'W')
ret = 0;
// cout << ret << endl;
ret %= MOD;
for (ll i = 1; i <= n; i++) {
ret *= i;
ret %= MOD;
}
cout << ret << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <utility> // pair
#include <vector>
#define MAX_N 100001
#define MOD 1000000007
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RER(i, n) for (ll i = n - 1; i >= 0; i--)
#define ALL(v) v.begin() v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll n;
string s;
bool d[2 * MAX_N];
signed main() {
cin >> n >> s;
d[0] = 1;
for (ll i = 1; i < 2 * n; i++) {
if (s[i] == s[i - 1])
d[i] = 1 - d[i - 1];
else
d[i] = d[i - 1];
}
// for(ll i=0; i<2*n; i++){
// if(d[i]) cout << 'L';
// else cout << 'R';
// }
ll ret = 1;
ll num_l = 1;
for (ll i = 1; i < 2 * n; i++) {
if (d[i])
num_l++;
else {
ret *= num_l--;
ret %= MOD;
}
}
if (num_l != 0)
ret = 0;
if (s[0] == 'W')
ret = 0;
// cout << ret << endl;
ret %= MOD;
for (ll i = 1; i <= n; i++) {
ret *= i;
ret %= MOD;
}
cout << ret << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
const int INF = 1001001000;
const int mINF = -1001001000;
const ll LINF = 1010010010010010000;
const int mod = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// グリッド：（典型）dp,dfs,bfs,最短経路,その他
int main() {
ll n;
cin >> n;
string s;
cin >> s;
vi d(n);
ll ans = 1;
if (s[0] == 'W' || s[sz(s) - 1] == 'W') {
cout << 0 << endl;
return 0;
}
rep(i, sz(s)) {
if (i == 0)
d[i] = 1;
else if (s[i] == s[i - 1]) {
if (d[i - 1] == 0)
d[i] = 1;
else
d[i] = 0;
} else if (s[i] != s[i - 1]) {
d[i] = d[i - 1];
}
}
ll cnt = 0;
rep(i, sz(s)) {
if (d[i] == 1) {
cnt++;
} else {
ans *= cnt;
ans %= mod;
cnt--;
}
if (cnt < 0) {
cout << 0 << endl;
return 0;
}
}
if (cnt != 0) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define pb push_back
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
const int INF = 1001001000;
const int mINF = -1001001000;
const ll LINF = 1010010010010010000;
const int mod = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// グリッド：（典型）dp,dfs,bfs,最短経路,その他
int main() {
ll n;
cin >> n;
string s;
cin >> s;
vi d(2 * n);
ll ans = 1;
if (s[0] == 'W' || s[sz(s) - 1] == 'W') {
cout << 0 << endl;
return 0;
}
rep(i, sz(s)) {
if (i == 0)
d[i] = 1;
else if (s[i] == s[i - 1]) {
if (d[i - 1] == 0)
d[i] = 1;
else
d[i] = 0;
} else if (s[i] != s[i - 1]) {
d[i] = d[i - 1];
}
}
ll cnt = 0;
rep(i, sz(s)) {
if (d[i] == 1) {
cnt++;
} else {
ans *= cnt;
ans %= mod;
cnt--;
}
if (cnt < 0) {
cout << 0 << endl;
return 0;
}
}
if (cnt != 0) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
ans *= i;
ans %= mod;
}
cout << ans << endl;
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, b, a) for (int i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define hash dhsjakhd
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
std::mt19937 eng(seed);
uniform_int_distribution<> DD(0, (1ll << 31));
ll random2() {
return (ll(DD(eng)) * (1ll << 31) + ll(DD(eng))) & ((1ll << 62ll) - 1);
}
ll n, m, T, k, q;
const ll big = 1000000007;
const ll big2 = 1000000009;
const ll mod = 998244353;
const int MAXN = 100001;
string s;
ll A[MAXN] = {0};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("autput.txt","w",stdout);
ll a, b, c, d;
cin >> n;
cin >> s;
ll ans = 1;
rep(c1, 0, n) {
ans *= ll(c1 + 1);
ans %= big;
}
ll parity = 0;
per(c1, 2 * n, 0) {
a = 0;
if (s[c1] == 'B')
a = 1;
a ^= parity;
A[c1] = a;
parity ^= 1;
}
ll mi = 0;
rep(c1, 0, 2 * n) {
// cerr << A[c1];
if (A[c1] == 0) {
mi++;
} else {
ans *= mi;
ans %= big;
mi--;
}
} // cerr << "\n";
if (mi > 0)
ans = 0;
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, b, a) for (int i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define hash dhsjakhd
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
std::mt19937 eng(seed);
uniform_int_distribution<> DD(0, (1ll << 31));
ll random2() {
return (ll(DD(eng)) * (1ll << 31) + ll(DD(eng))) & ((1ll << 62ll) - 1);
}
ll n, m, T, k, q;
const ll big = 1000000007;
const ll big2 = 1000000009;
const ll mod = 998244353;
const int MAXN = 200001;
string s;
ll A[MAXN] = {0};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt","r",stdin);
// freopen("autput.txt","w",stdout);
ll a, b, c, d;
cin >> n;
cin >> s;
ll ans = 1;
rep(c1, 0, n) {
ans *= ll(c1 + 1);
ans %= big;
}
ll parity = 0;
per(c1, 2 * n, 0) {
a = 0;
if (s[c1] == 'B')
a = 1;
a ^= parity;
A[c1] = a;
parity ^= 1;
}
ll mi = 0;
rep(c1, 0, 2 * n) {
// cerr << A[c1];
if (A[c1] == 0) {
mi++;
} else {
ans *= mi;
ans %= big;
mi--;
}
} // cerr << "\n";
if (mi > 0)
ans = 0;
cout << ans << "\n";
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
void solve() {
long N;
cin >> N;
string S;
cin >> S;
// true: begin, false: end;
vector<bool> ops(N);
long state = 0;
rep(i, N * 2) {
// cout << "i: " << i << ", state: " << state << endl;
if (state % 2 == 0 and S[i] == 'B') {
state++;
ops[i] = true;
continue;
}
if (state % 2 == 0 and S[i] == 'W') {
ops[i] = false;
state--;
if (state < 0) {
cout << 0 << endl;
return;
}
continue;
}
if (state % 2 != 0 and S[i] == 'B') {
ops[i] = false;
state--;
continue;
}
if (state % 2 != 0 and S[i] == 'W') {
state++;
ops[i] = true;
continue;
}
}
if (state != 0) {
cout << 0 << endl;
return;
}
long result = 1;
state = 0;
rep(i, N * 2) {
if (ops[i])
state++;
else {
result *= state;
result %= MOD;
state--;
}
}
// cout << "tmp: " << result << endl;
rep(i, N) {
result *= i + 1;
result %= MOD;
}
cout << result << endl;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < (n); i++)
using namespace std;
void solve() {
long N;
cin >> N;
string S;
cin >> S;
// true: begin, false: end;
vector<bool> ops(N * 2);
long state = 0;
rep(i, N * 2) {
// cout << "i: " << i << ", state: " << state << endl;
if (state % 2 == 0 and S[i] == 'B') {
state++;
ops[i] = true;
continue;
}
if (state % 2 == 0 and S[i] == 'W') {
ops[i] = false;
state--;
if (state < 0) {
cout << 0 << endl;
return;
}
continue;
}
if (state % 2 != 0 and S[i] == 'B') {
ops[i] = false;
state--;
continue;
}
if (state % 2 != 0 and S[i] == 'W') {
state++;
ops[i] = true;
continue;
}
}
if (state != 0) {
cout << 0 << endl;
return;
}
long result = 1;
state = 0;
rep(i, N * 2) {
if (ops[i])
state++;
else {
result *= state;
result %= MOD;
state--;
}
}
// cout << "tmp: " << result << endl;
rep(i, N) {
result *= i + 1;
result %= MOD;
}
cout << result << endl;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
solve();
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02929 | C++ | Runtime Error | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
// constexpr int mod = 998244353ll;
#ifdef int
#define inf (int)(3e18)
#else
#define inf (int)(5e8)
#endif
#define intt long long
#define itn long long
#define P pair<long long, long long>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
// モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y & 1) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < (int)v.size(); i++) \
printf("%lld ", v[i]); \
printf("\n"); \
}
template <typename T, typename U> class SegTree {
protected:
unsigned int n = 1, rank = 0;
std::vector<T> node;
T nodee;
virtual T nodef(const T &, const T &) const = 0;
public:
SegTree(unsigned int m, T init, T nodee) : nodee(nodee) {
while (n < m) {
n *= 2;
rank++;
}
node.resize(2 * n);
for (unsigned int i = n; i < 2 * n; i++)
node[i] = init;
}
SegTree(const std::vector<T> &initvec, T nodee) : nodee(nodee) {
unsigned int m = initvec.size();
while (n < m) {
n *= 2;
rank++;
}
node.resize(2 * n);
for (unsigned int i = n; i < 2 * n; i++) {
if (i - n < m)
node[i] = initvec[i - n];
}
}
virtual void update(int i, U x) {
i += n;
node[i] = x;
while (i != 1) {
i >>= 1;
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
}
virtual T query(int l, int r) {
l += n;
r += n;
int ls = nodee, rs = nodee;
while (l < r) {
if (l & 1) {
ls = nodef(ls, node[l]);
l++;
}
if (r & 1) {
r--;
rs = nodef(node[r], rs);
}
l >>= 1;
r >>= 1;
}
return nodef(ls, rs);
}
virtual T operator[](const int &x) { return node[n + x]; }
void fill(T x) { std::fill(all(node), x); }
void print() {
rep(i, n) std::cout << operator[](i) << " ";
std::cout << std::endl;
}
};
class RSQ : public SegTree<int, int> {
int nodef(const int &lhs, const int &rhs) { return lhs + rhs; }
public:
RSQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}
RSQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}
};
class RMiQ : public SegTree<int, int> {
int nodef(const int &lhs, const int &rhs) { return std::min(lhs, rhs); }
public:
RMiQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}
RMiQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}
};
class RMaQ : public SegTree<int, int> {
int nodef(const int &lhs, const int &rhs) { return std::max(lhs, rhs); }
public:
RMaQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}
RMaQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}
};
template <typename T, typename U> class IntervalSegTree : public SegTree<T, U> {
protected:
using SegTree<T, U>::n;
using SegTree<T, U>::rank;
using SegTree<T, U>::node;
using SegTree<T, U>::nodef;
using SegTree<T, U>::nodee;
std::vector<U> lazy;
std::vector<bool> lazyflag;
std::vector<int> width;
virtual void lazyf(U &, const U &) = 0;
virtual void updf(T &, const U &, const unsigned int &) = 0;
void eval(int k) {
for (int i = rank; i > 0; i--) {
int nk = k >> i;
if (lazyflag[nk]) {
updf(node[2 * nk], lazy[nk], width[2 * nk]);
updf(node[2 * nk + 1], lazy[nk], width[2 * nk + 1]);
if (lazyflag[2 * nk])
lazyf(lazy[2 * nk], lazy[nk]);
else
lazy[2 * nk] = lazy[nk];
if (lazyflag[2 * nk + 1])
lazyf(lazy[2 * nk + 1], lazy[nk]);
else
lazy[2 * nk + 1] = lazy[nk];
lazyflag[2 * nk] = lazyflag[2 * nk + 1] = true;
lazyflag[nk] = false;
}
}
}
public:
IntervalSegTree(unsigned int m, T init, T nodee)
: SegTree<T, U>(m, init, nodee) {
lazy.resize(2 * n);
lazyflag.resize(2 * n);
width.resize(2 * n);
width[1] = n;
for (unsigned int i = 2; i < 2 * n; i++) {
width[i] = width[i >> 1] >> 1;
}
}
IntervalSegTree(T nodee, const std::vector<T> &initvec)
: SegTree<T, U>(initvec, nodee) {
lazy.resize(2 * n);
lazyflag.resize(2 * n);
width.resize(2 * n);
width[1] = n;
for (unsigned int i = 2; i < 2 * n; i++) {
width[i] = width[i >> 1] >> 1;
}
}
void update(int i, U x) {
i += n;
eval(i);
updf(node[i], x, width[i]);
if (lazyflag[i])
lazyf(lazy[i], x);
else {
lazyflag[i] = true;
lazy[i] = x;
}
while (i /= 2)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
void update(int l, int r, U x) {
l += n;
r += n;
int nl = l, nr = r;
while (!(nl & 1))
nl >>= 1;
while (!(nr & 1))
nr >>= 1;
nr--;
eval(nl);
eval(nr);
while (l < r) {
if (l & 1) {
updf(node[l], x, width[l]);
if (lazyflag[l])
lazyf(lazy[l], x);
else {
lazyflag[l] = true;
lazy[l] = x;
}
l++;
}
if (r & 1) {
r--;
updf(node[r], x, width[r]);
if (lazyflag[r])
lazyf(lazy[r], x);
else {
lazyflag[r] = true;
lazy[r] = x;
}
}
l >>= 1;
r >>= 1;
}
while (nl >>= 1)
node[nl] = nodef(node[2 * nl], node[2 * nl + 1]);
while (nr >>= 1)
node[nr] = nodef(node[2 * nr], node[2 * nr + 1]);
}
T query(int l, int r) {
l += n;
r += n;
eval(l);
eval(r - 1);
int ls = nodee, rs = nodee;
while (l < r) {
if (l & 1) {
ls = nodef(ls, node[l]);
l++;
}
if (r & 1) {
r--;
rs = nodef(node[r], rs);
}
l >>= 1;
r >>= 1;
}
return nodef(ls, rs);
}
T operator[](const int &x) {
eval(n + x);
return node[n + x];
}
T queryForAll() { return node[1]; }
};
class RAQRSQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return a + b; }
void lazyf(int &a, const int &b) { a += b; }
void updf(int &a, const int &b, const unsigned int &width) { a += width * b; }
public:
RAQRSQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, 0) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RAQRSQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>((int)0, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RAQRMiQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::min(a, b); }
void lazyf(int &a, const int &b) { a += b; }
void updf(int &a, const int &b, const unsigned int &width) { a += b; }
public:
RAQRMiQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RAQRMiQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RAQRMaQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::max(a, b); }
void lazyf(int &a, const int &b) { a += b; }
void updf(int &a, const int &b, const unsigned int &width) { a += b; }
public:
RAQRMaQ(unsigned int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, -inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RAQRMaQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(-inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RUQRSQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return a + b; }
void lazyf(int &a, const int &b) { a = b; }
void updf(int &a, const int &b, const unsigned int &width) { a = width * b; }
public:
RUQRSQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, 0) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RUQRSQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>((int)0, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RUQRMiQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::min(a, b); }
void lazyf(int &a, const int &b) { a = b; }
void updf(int &a, const int &b, const unsigned int &width) { a = b; }
public:
RUQRMiQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RUQRMiQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RUQRMaQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::max(a, b); }
void lazyf(int &a, const int &b) { a = b; }
void updf(int &a, const int &b, const unsigned int &width) { a = b; }
public:
RUQRMaQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, -inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RUQRMaQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(-inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
int perm[1000005];
void init_perm() {
perm[0] = 1;
REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }
}
int nCk(int x, int y) {
return perm[x] * modpow(perm[x - y], mod - 2) % mod *
modpow(perm[y], mod - 2) % mod;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
inline string stringmax(string &x, string &y) {
if (x.size() > y.size()) {
return x;
}
if (x.size() < y.size()) {
return y;
}
rep(i, x.size()) {
if (x[i] > y[i]) {
return x;
}
if (x[i] < y[i]) {
return y;
}
}
return x;
}
#define endl "\n" // interactive の時に注意！！！
#define printd cout << fixed << setprecision(10)
int n, ans, now, cnt, cnt2;
string s;
bool jyou[100004];
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
init_perm();
cin >> n >> s;
if (s[0] == 'W' || s.back() == 'W') {
cout << 0 << endl;
return 0;
}
cnt2 = 1;
ans = 1;
rep(i, n * 2) {
if (i) {
if (s[i - 1] != s[i]) {
jyou[i] = jyou[i - 1];
if (jyou[i]) {
ans *= cnt2 - cnt;
ans %= mod;
cnt++;
} else {
cnt2++;
}
} else {
jyou[i] = jyou[i - 1] ^ 1;
if (jyou[i]) {
ans *= cnt2 - cnt;
ans %= mod;
cnt++;
} else {
cnt2++;
}
}
}
}
if (cnt != n) {
cout << 0 << endl;
return 0;
}
cout << ans * perm[n] % mod << endl;
}
| /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
// here!!!
// define int long long !!!!!
#define int long long
// define int long long !!!!!
#define mod (int)((1e9) + 7)
// constexpr int mod = 998244353ll;
#ifdef int
#define inf (int)(3e18)
#else
#define inf (int)(5e8)
#endif
#define intt long long
#define itn long long
#define P pair<long long, long long>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
// Library
// モッドパウ
inline int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y & 1) {
res *= x;
res %= m;
}
x = x * x % m;
y /= 2;
}
return res;
}
int mypow(int x, int y) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
}
x = x * x;
y /= 2;
}
return res;
}
// is the number (x) a prime number?
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (!(x % i)) {
return false;
}
}
return true;
}
// saidai-kouyakusuu
inline int gcd(int x, int y) {
if (!y) {
return x;
}
return gcd(y, x % y);
}
// number of keta
int keta(int x) {
int ans = 0;
while (x) {
x /= 10;
ans++;
}
return ans;
}
// sum of keta
int ketasum(int x) {
int ans = 0;
while (x) {
ans += x % 10;
x /= 10;
}
return ans;
}
inline int lcm(int x, int y) {
int ans = x / gcd(x, y) * y;
return ans;
}
int twobeki(int x) {
int ans = 0;
while (1) {
if (!(x & 1)) {
ans++;
x /= 2;
} else {
break;
}
}
return ans;
}
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
#define fin(i) scanf("%lld", &i)
#define fout(i) printf("%lld", i)
#define fendl printf("\n")
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
// cout<<kai(x, y)<<' '<<modpow(kai(y, y), mod - 2)<<endl;
return kai(x, y) * modpow(kai(y, y), mod - 2) % mod;
}
// Library-End
#define vecin(v) \
for (int i = 0; i < v.size(); i++) \
scanf("%lld", &v[i]);
#define vecout(v) \
{ \
for (int i = 0; i < (int)v.size(); i++) \
printf("%lld ", v[i]); \
printf("\n"); \
}
template <typename T, typename U> class SegTree {
protected:
unsigned int n = 1, rank = 0;
std::vector<T> node;
T nodee;
virtual T nodef(const T &, const T &) const = 0;
public:
SegTree(unsigned int m, T init, T nodee) : nodee(nodee) {
while (n < m) {
n *= 2;
rank++;
}
node.resize(2 * n);
for (unsigned int i = n; i < 2 * n; i++)
node[i] = init;
}
SegTree(const std::vector<T> &initvec, T nodee) : nodee(nodee) {
unsigned int m = initvec.size();
while (n < m) {
n *= 2;
rank++;
}
node.resize(2 * n);
for (unsigned int i = n; i < 2 * n; i++) {
if (i - n < m)
node[i] = initvec[i - n];
}
}
virtual void update(int i, U x) {
i += n;
node[i] = x;
while (i != 1) {
i >>= 1;
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
}
virtual T query(int l, int r) {
l += n;
r += n;
int ls = nodee, rs = nodee;
while (l < r) {
if (l & 1) {
ls = nodef(ls, node[l]);
l++;
}
if (r & 1) {
r--;
rs = nodef(node[r], rs);
}
l >>= 1;
r >>= 1;
}
return nodef(ls, rs);
}
virtual T operator[](const int &x) { return node[n + x]; }
void fill(T x) { std::fill(all(node), x); }
void print() {
rep(i, n) std::cout << operator[](i) << " ";
std::cout << std::endl;
}
};
class RSQ : public SegTree<int, int> {
int nodef(const int &lhs, const int &rhs) { return lhs + rhs; }
public:
RSQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}
RSQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}
};
class RMiQ : public SegTree<int, int> {
int nodef(const int &lhs, const int &rhs) { return std::min(lhs, rhs); }
public:
RMiQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}
RMiQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}
};
class RMaQ : public SegTree<int, int> {
int nodef(const int &lhs, const int &rhs) { return std::max(lhs, rhs); }
public:
RMaQ(int size, const int &def = 0) : SegTree<int, int>(size, def, 0) {}
RMaQ(const std::vector<int> &initvec) : SegTree<int, int>(initvec, 0) {}
};
template <typename T, typename U> class IntervalSegTree : public SegTree<T, U> {
protected:
using SegTree<T, U>::n;
using SegTree<T, U>::rank;
using SegTree<T, U>::node;
using SegTree<T, U>::nodef;
using SegTree<T, U>::nodee;
std::vector<U> lazy;
std::vector<bool> lazyflag;
std::vector<int> width;
virtual void lazyf(U &, const U &) = 0;
virtual void updf(T &, const U &, const unsigned int &) = 0;
void eval(int k) {
for (int i = rank; i > 0; i--) {
int nk = k >> i;
if (lazyflag[nk]) {
updf(node[2 * nk], lazy[nk], width[2 * nk]);
updf(node[2 * nk + 1], lazy[nk], width[2 * nk + 1]);
if (lazyflag[2 * nk])
lazyf(lazy[2 * nk], lazy[nk]);
else
lazy[2 * nk] = lazy[nk];
if (lazyflag[2 * nk + 1])
lazyf(lazy[2 * nk + 1], lazy[nk]);
else
lazy[2 * nk + 1] = lazy[nk];
lazyflag[2 * nk] = lazyflag[2 * nk + 1] = true;
lazyflag[nk] = false;
}
}
}
public:
IntervalSegTree(unsigned int m, T init, T nodee)
: SegTree<T, U>(m, init, nodee) {
lazy.resize(2 * n);
lazyflag.resize(2 * n);
width.resize(2 * n);
width[1] = n;
for (unsigned int i = 2; i < 2 * n; i++) {
width[i] = width[i >> 1] >> 1;
}
}
IntervalSegTree(T nodee, const std::vector<T> &initvec)
: SegTree<T, U>(initvec, nodee) {
lazy.resize(2 * n);
lazyflag.resize(2 * n);
width.resize(2 * n);
width[1] = n;
for (unsigned int i = 2; i < 2 * n; i++) {
width[i] = width[i >> 1] >> 1;
}
}
void update(int i, U x) {
i += n;
eval(i);
updf(node[i], x, width[i]);
if (lazyflag[i])
lazyf(lazy[i], x);
else {
lazyflag[i] = true;
lazy[i] = x;
}
while (i /= 2)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
void update(int l, int r, U x) {
l += n;
r += n;
int nl = l, nr = r;
while (!(nl & 1))
nl >>= 1;
while (!(nr & 1))
nr >>= 1;
nr--;
eval(nl);
eval(nr);
while (l < r) {
if (l & 1) {
updf(node[l], x, width[l]);
if (lazyflag[l])
lazyf(lazy[l], x);
else {
lazyflag[l] = true;
lazy[l] = x;
}
l++;
}
if (r & 1) {
r--;
updf(node[r], x, width[r]);
if (lazyflag[r])
lazyf(lazy[r], x);
else {
lazyflag[r] = true;
lazy[r] = x;
}
}
l >>= 1;
r >>= 1;
}
while (nl >>= 1)
node[nl] = nodef(node[2 * nl], node[2 * nl + 1]);
while (nr >>= 1)
node[nr] = nodef(node[2 * nr], node[2 * nr + 1]);
}
T query(int l, int r) {
l += n;
r += n;
eval(l);
eval(r - 1);
int ls = nodee, rs = nodee;
while (l < r) {
if (l & 1) {
ls = nodef(ls, node[l]);
l++;
}
if (r & 1) {
r--;
rs = nodef(node[r], rs);
}
l >>= 1;
r >>= 1;
}
return nodef(ls, rs);
}
T operator[](const int &x) {
eval(n + x);
return node[n + x];
}
T queryForAll() { return node[1]; }
};
class RAQRSQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return a + b; }
void lazyf(int &a, const int &b) { a += b; }
void updf(int &a, const int &b, const unsigned int &width) { a += width * b; }
public:
RAQRSQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, 0) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RAQRSQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>((int)0, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RAQRMiQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::min(a, b); }
void lazyf(int &a, const int &b) { a += b; }
void updf(int &a, const int &b, const unsigned int &width) { a += b; }
public:
RAQRMiQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RAQRMiQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RAQRMaQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::max(a, b); }
void lazyf(int &a, const int &b) { a += b; }
void updf(int &a, const int &b, const unsigned int &width) { a += b; }
public:
RAQRMaQ(unsigned int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, -inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RAQRMaQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(-inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RUQRSQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return a + b; }
void lazyf(int &a, const int &b) { a = b; }
void updf(int &a, const int &b, const unsigned int &width) { a = width * b; }
public:
RUQRSQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, 0) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RUQRSQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>((int)0, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RUQRMiQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::min(a, b); }
void lazyf(int &a, const int &b) { a = b; }
void updf(int &a, const int &b, const unsigned int &width) { a = b; }
public:
RUQRMiQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RUQRMiQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
class RUQRMaQ : public IntervalSegTree<int, int> {
int nodef(const int &a, const int &b) const { return std::max(a, b); }
void lazyf(int &a, const int &b) { a = b; }
void updf(int &a, const int &b, const unsigned int &width) { a = b; }
public:
RUQRMaQ(int size, const int &def = 0)
: IntervalSegTree<int, int>(size, def, -inf) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
RUQRMaQ(const std::vector<int> &initvec)
: IntervalSegTree<int, int>(-inf, initvec) {
for (int i = n - 1; i > 0; i--)
node[i] = nodef(node[2 * i], node[2 * i + 1]);
}
};
#define R_MIN ([](long long a, long long b) { return min(a, b); })
#define R_MAX ([](long long a, long long b) { return max(a, b); })
#define R_SUM ([](long long a, long long b) { return a + b; })
#define NORMAL_UPDATE ([](long long a, long long b) { return b; })
#define ADD_UPDATE ([](long long a, long long b) { return a + b; })
#define MINUS_UPDATE ([](long long a, long long b) { return a - b; }
class Union_Find {
vector<int> par;
vector<int> rankmy;
vector<int> ookisa;
public:
Union_Find(int size) {
par = vector<int>(size);
rankmy = vector<int>(size);
ookisa = vector<int>(size);
for (int i = 0; i < size; i++) {
par[i] = i;
ookisa[i] = 1;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
return;
}
if (rankmy[x] < rankmy[y]) {
par[x] = y;
ookisa[y] += ookisa[x];
ookisa[x] = 0;
} else {
par[y] = x;
ookisa[x] += ookisa[y];
ookisa[y] = 0;
if (rankmy[x] == rankmy[y]) {
rankmy[x]++;
}
}
}
int size(int i) {
i = find(i);
return ookisa[i];
}
bool same(int x, int y) { return find(x) == find(y); }
};
// Union-Find-End
int perm[1000005];
void init_perm() {
perm[0] = 1;
REP(i, 1000000) { perm[i] = perm[i - 1] * i % mod; }
}
int nCk(int x, int y) {
return perm[x] * modpow(perm[x - y], mod - 2) % mod *
modpow(perm[y], mod - 2) % mod;
}
double kyori(pair<int, int> f, pair<int, int> s) {
double ans = 0;
double t = fabs(f.first - s.first);
double y = fabs(f.second - s.second);
ans = sqrt(t * t + y * y);
return ans;
}
inline string stringmax(string &x, string &y) {
if (x.size() > y.size()) {
return x;
}
if (x.size() < y.size()) {
return y;
}
rep(i, x.size()) {
if (x[i] > y[i]) {
return x;
}
if (x[i] < y[i]) {
return y;
}
}
return x;
}
#define endl "\n" // interactive の時に注意！！！
#define printd cout << fixed << setprecision(10)
int n, ans, now, cnt, cnt2;
string s;
bool jyou[200004];
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
init_perm();
cin >> n >> s;
if (s[0] == 'W' || s.back() == 'W') {
cout << 0 << endl;
return 0;
}
cnt2 = 1;
ans = 1;
rep(i, n * 2) {
if (i) {
if (s[i - 1] != s[i]) {
jyou[i] = jyou[i - 1];
if (jyou[i]) {
ans *= cnt2 - cnt;
ans %= mod;
cnt++;
} else {
cnt2++;
}
} else {
jyou[i] = jyou[i - 1] ^ 1;
if (jyou[i]) {
ans *= cnt2 - cnt;
ans %= mod;
cnt++;
} else {
cnt2++;
}
}
}
}
if (cnt != n) {
cout << 0 << endl;
return 0;
}
cout << ans * perm[n] % mod << endl;
}
| replace | 591 | 592 | 591 | 592 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using P = pair<long, long>;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define fillInt(xs) \
for (int i = 0; i < (xs).size(); i++) \
scanf("%d", &xs[i]);
#define fillLong(xs) \
for (int i = 0; i < (xs).size(); i++) \
scanf("%ld", &xs[i]);
#define fillDouble(xs) \
for (int i = 0; i < (xs).size(); i++) \
scanf("%lf", &xs[i]);
#define fillString(xs) \
for (int i = 0; i < (xs).size(); i++) \
cin >> xs[i];
#define sortv(xs) sort(xs.begin(), xs.end())
#define sortvinv(xs) sort(xs.begin(), xs.end(), std::greater<long>())
#define lbv(xs, x) lower_bound(xs.begin(), xs.end(), x) - xs.begin()
#define ubv(xs, x) upper_bound(xs.begin(), xs.end(), x) - xs.begin()
#define bs(xs, x) binary_search(xs.begin(), xs.end(), x)
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define concat(xs, ys) (xs).insert((xs).end(), (ys).begin(), (ys).end())
const int mod = 1000000007;
const int MAX_V = 100005;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if (x < a.x) {
x += mod;
}
x -= a.x;
return *this;
}
mint &operator*=(const mint a) {
x = (x * a.x) % mod;
return *this;
}
mint &operator/=(const mint a) {
*this *= a.inv();
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 operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint pow(ll n) const {
mint a(*this);
mint res = 1;
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n >>= 1;
}
return res;
}
mint inv() const { return pow(mod - 2); }
};
mint dp1[100005];
long dp2[100005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long n;
cin >> n;
string s;
cin >> s;
dp1[0] = 1;
rep(i, 2 * n) {
if (s[i] == 'W') {
if (dp2[i] % 2) {
dp1[i + 1] = dp1[i];
dp2[i + 1] = dp2[i] + 1;
} else {
dp1[i + 1] = dp1[i] * dp2[i];
dp2[i + 1] = dp2[i] - 1;
}
} else {
if (dp2[i] % 2) {
dp1[i + 1] = dp1[i] * dp2[i];
dp2[i + 1] = dp2[i] - 1;
} else {
dp1[i + 1] = dp1[i];
dp2[i + 1] = dp2[i] + 1;
}
}
}
if (dp2[2 * n] == 0) {
rep(i, n) { dp1[2 * n] *= (i + 1); }
} else {
dp1[2 * n] = 0;
}
cout << dp1[2 * n].x << endl;
}
| #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using P = pair<long, long>;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define fillInt(xs) \
for (int i = 0; i < (xs).size(); i++) \
scanf("%d", &xs[i]);
#define fillLong(xs) \
for (int i = 0; i < (xs).size(); i++) \
scanf("%ld", &xs[i]);
#define fillDouble(xs) \
for (int i = 0; i < (xs).size(); i++) \
scanf("%lf", &xs[i]);
#define fillString(xs) \
for (int i = 0; i < (xs).size(); i++) \
cin >> xs[i];
#define sortv(xs) sort(xs.begin(), xs.end())
#define sortvinv(xs) sort(xs.begin(), xs.end(), std::greater<long>())
#define lbv(xs, x) lower_bound(xs.begin(), xs.end(), x) - xs.begin()
#define ubv(xs, x) upper_bound(xs.begin(), xs.end(), x) - xs.begin()
#define bs(xs, x) binary_search(xs.begin(), xs.end(), x)
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define concat(xs, ys) (xs).insert((xs).end(), (ys).begin(), (ys).end())
const int mod = 1000000007;
const int MAX_V = 100005;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if (x < a.x) {
x += mod;
}
x -= a.x;
return *this;
}
mint &operator*=(const mint a) {
x = (x * a.x) % mod;
return *this;
}
mint &operator/=(const mint a) {
*this *= a.inv();
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 operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint pow(ll n) const {
mint a(*this);
mint res = 1;
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n >>= 1;
}
return res;
}
mint inv() const { return pow(mod - 2); }
};
mint dp1[200005];
long dp2[200005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long n;
cin >> n;
string s;
cin >> s;
dp1[0] = 1;
rep(i, 2 * n) {
if (s[i] == 'W') {
if (dp2[i] % 2) {
dp1[i + 1] = dp1[i];
dp2[i + 1] = dp2[i] + 1;
} else {
dp1[i + 1] = dp1[i] * dp2[i];
dp2[i + 1] = dp2[i] - 1;
}
} else {
if (dp2[i] % 2) {
dp1[i + 1] = dp1[i] * dp2[i];
dp2[i + 1] = dp2[i] - 1;
} else {
dp1[i + 1] = dp1[i];
dp2[i + 1] = dp2[i] + 1;
}
}
}
if (dp2[2 * n] == 0) {
rep(i, n) { dp1[2 * n] *= (i + 1); }
} else {
dp1[2 * n] = 0;
}
cout << dp1[2 * n].x << endl;
}
| replace | 117 | 119 | 117 | 119 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int n;
string s;
int d[maxn];
void ReadInput() {
cin >> n;
cin >> s;
}
void Solve() {
if (s[2 * n - 1] == 'W' || s[0] == 'W') {
cout << "0\n";
return;
}
d[0] = 0;
for (int i = 1; i < 2 * n; ++i)
d[i] = s[i] == s[i - 1] ? d[i - 1] ^ 1 : d[i - 1];
int ans = 1;
int cnt = 0;
for (int i = 2 * n - 1; i >= 0; --i) {
if (d[i] == 0) {
ans = 1LL * ans * cnt % MOD;
--cnt;
} else
++cnt;
}
if (cnt != 0) {
cout << "0\n";
return;
}
for (int i = 1; i <= n; ++i)
ans = 1LL * ans * i % MOD;
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 2e5 + 5;
const int MOD = 1e9 + 7;
int n;
string s;
int d[maxn];
void ReadInput() {
cin >> n;
cin >> s;
}
void Solve() {
if (s[2 * n - 1] == 'W' || s[0] == 'W') {
cout << "0\n";
return;
}
d[0] = 0;
for (int i = 1; i < 2 * n; ++i)
d[i] = s[i] == s[i - 1] ? d[i - 1] ^ 1 : d[i - 1];
int ans = 1;
int cnt = 0;
for (int i = 2 * n - 1; i >= 0; --i) {
if (d[i] == 0) {
ans = 1LL * ans * cnt % MOD;
--cnt;
} else
++cnt;
}
if (cnt != 0) {
cout << "0\n";
return;
}
for (int i = 1; i <= n; ++i)
ans = 1LL * ans * i % MOD;
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define maxn 100005
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n;
bool st[maxn];
string s;
int main() {
ios ::sync_with_stdio(false);
cin >> n >> s;
ll cur = 0, ans = 1;
for (int i = 0; i < (n << 1); i++) {
if (s[i] == 'W')
st[i] = (cur & 1);
else
st[i] = !(cur & 1);
cur += (st[i] ? 1 : -1);
if (cur < 0) {
cout << "0" << endl;
return 0;
}
}
if (cur) {
cout << "0" << endl;
return 0;
}
cur = 0;
for (int i = 0; i < (n << 1); i++) {
if (!st[i])
(ans *= cur) %= mod;
cur += (st[i] ? 1 : -1);
}
for (int i = 1; i <= n; i++)
(ans *= i) %= mod;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define maxn 100005
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int n;
bool st[maxn << 1];
string s;
int main() {
ios ::sync_with_stdio(false);
cin >> n >> s;
ll cur = 0, ans = 1;
for (int i = 0; i < (n << 1); i++) {
if (s[i] == 'W')
st[i] = (cur & 1);
else
st[i] = !(cur & 1);
cur += (st[i] ? 1 : -1);
if (cur < 0) {
cout << "0" << endl;
return 0;
}
}
if (cur) {
cout << "0" << endl;
return 0;
}
cur = 0;
for (int i = 0; i < (n << 1); i++) {
if (!st[i])
(ans *= cur) %= mod;
cur += (st[i] ? 1 : -1);
}
for (int i = 1; i <= n; i++)
(ans *= i) %= mod;
cout << ans << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02929 | Python | Runtime Error | def fact(x):
if x == 0:
return 1
else:
return x * fact(x - 1) % mod
mod = 10**9 + 7
n = int(input())
s = input()
t = list(map(lambda x: 1 if x == "B" else 0, s))
t = tuple((tt - df) % 2 for tt, df in zip(t, reversed(range(n * 2))))
# print(t)
zeros = 0
ans = 1
ones = 0
for tt in t:
if tt == 0:
zeros += 1
else:
if zeros == 0:
print(0)
exit()
ans *= zeros
ans %= mod
zeros -= 1
ones += 1
if zeros > 0:
ans = 0
ans *= fact(ones)
ans %= mod
print(ans)
| import sys
sys.setrecursionlimit(10**7)
def fact(x):
if x == 0:
return 1
else:
return x * fact(x - 1) % mod
mod = 10**9 + 7
n = int(input())
s = input()
t = list(map(lambda x: 1 if x == "B" else 0, s))
t = tuple((tt - df) % 2 for tt, df in zip(t, reversed(range(n * 2))))
# print(t)
zeros = 0
ans = 1
ones = 0
for tt in t:
if tt == 0:
zeros += 1
else:
if zeros == 0:
print(0)
exit()
ans *= zeros
ans %= mod
zeros -= 1
ones += 1
if zeros > 0:
ans = 0
ans *= fact(ones)
ans %= mod
print(ans)
| insert | 0 | 0 | 0 | 5 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
template <typename T> struct Modint {
using Type = typename decay<decltype(T::value)>::type;
Type val;
constexpr Modint() noexcept : val() {}
template <typename U> constexpr Modint(const U &x) noexcept {
val = normalize(x);
}
template <typename U> static Type normalize(const U &x) noexcept {
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;
}
constexpr Type &value() noexcept { return val; }
constexpr const Type &value() const noexcept { return val; }
template <typename U> constexpr explicit operator U() const noexcept {
return static_cast<U>(val);
}
constexpr static Type mod() noexcept { return T::value; }
constexpr Modint &operator+=(const Modint &rhs) noexcept {
if ((val += rhs.val) >= mod())
val -= mod();
return *this;
}
template <typename U> constexpr Modint &operator+=(const U &rhs) noexcept {
return *this += Modint(rhs);
}
constexpr Modint &operator-=(const Modint &rhs) noexcept {
if ((val -= rhs.val) < 0)
val += mod();
return *this;
}
template <typename U> constexpr Modint &operator-=(const U &rhs) noexcept {
return *this -= Modint(rhs);
}
constexpr Modint &operator++() noexcept { return *this += 1; }
constexpr Modint &operator--() noexcept { return *this -= 1; }
constexpr Modint operator++(int) noexcept {
Modint result(*this);
*this += 1;
return result;
}
constexpr Modint operator--(int) noexcept {
Modint result(*this);
*this -= 1;
return result;
}
constexpr Modint operator-() const noexcept { return Modint(-val); }
constexpr Modint &operator*=(const Modint rhs) noexcept {
val = val * rhs.val % mod();
return *this;
}
constexpr Modint &operator/=(const Modint &rhs) noexcept {
Type x = rhs.val, m = mod(), u = 0, v = 1;
while (x != 0) {
Type t = m / x;
m -= t * x;
swap(x, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return *this *= Modint(u);
}
};
template <typename T>
constexpr bool operator==(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return lhs.val == rhs.val;
}
template <typename T, typename U>
constexpr bool operator==(const Modint<T> &lhs, U rhs) noexcept {
return lhs == Modint<T>(rhs);
}
template <typename T, typename U>
constexpr bool operator==(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) == rhs;
}
template <typename T>
constexpr bool operator!=(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return !(lhs == rhs);
}
template <typename T, typename U>
constexpr bool operator!=(const Modint<T> &lhs, U rhs) noexcept {
return !(lhs == rhs);
}
template <typename T, typename U>
constexpr bool operator!=(U lhs, const Modint<T> &rhs) noexcept {
return !(lhs == rhs);
}
template <typename T>
constexpr bool operator<(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return lhs.val < rhs.val;
}
template <typename T, typename U>
constexpr bool operator<(const Modint<T> &lhs, U rhs) noexcept {
return lhs < Modint<T>(rhs);
}
template <typename T, typename U>
constexpr bool operator<(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) < rhs;
}
template <typename T>
constexpr bool operator>(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return lhs.val > rhs.val;
}
template <typename T, typename U>
constexpr bool operator>(const Modint<T> &lhs, U rhs) noexcept {
return lhs > Modint<T>(rhs);
}
template <typename T, typename U>
constexpr bool operator>(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) > rhs;
}
template <typename T>
constexpr Modint<T> operator+(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) += rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator+(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) += rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator+(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) += rhs;
}
template <typename T>
constexpr Modint<T> operator-(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) -= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator-(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) -= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator-(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) -= rhs;
}
template <typename T>
constexpr Modint<T> operator*(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) *= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator*(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) *= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator*(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) *= rhs;
}
template <typename T>
constexpr Modint<T> operator/(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) /= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator/(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) /= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator/(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modint<T> constexpr power(const Modint<T> &a, const U &b) noexcept {
Modint<T> x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
res *= x;
x *= x;
p >>= 1;
}
return res;
}
template <class T> struct Combination {
using Type = typename decay<decltype(T::value)>::type;
vector<Modint<T>> fact_, finv_;
constexpr Combination(int n) noexcept : fact_(n + 1, 1), finv_(n + 1, 1) {
Type MOD = fact_[0].mod();
FOR(i, 2, n + 1) { fact_[i] = fact_[i - 1] * i; }
finv_[n] = power(fact_[n], MOD - 2);
FORR(i, 3, n + 1) { finv_[i - 1] = finv_[i] * i; }
}
// iの逆元も求める場合
/*
vector<Modint<T>> fact_, inv_, finv_;
constexpr Combination(int n) noexcept : fact_(n+1, 1), inv_(n+1, 1),
finv_(n+1, 1) { Type MOD=fact_[0].mod(); FOR(i, 2, n+1){
fact_[i]=fact_[i-1]*i;
inv_[i]=-inv_[MOD%i]*(MOD/i);
finv_[i]=finv_[i-1]*inv_[i];
}
}
constexpr Modint<T> inv(int n) const noexcept {
if(n<0) return 0;
return inv_[n];
}
*/
constexpr Modint<T> com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return Modint<T>(0);
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr Modint<T> fact(int n) const noexcept {
if (n < 0)
return Modint<T>(0);
return fact_[n];
}
constexpr Modint<T> finv(int n) const noexcept {
if (n < 0)
return Modint<T>(0);
return finv_[n];
}
};
template <typename T>
constexpr ostream &operator<<(ostream &stream,
const Modint<T> &number) noexcept {
return stream << number.val;
}
template <typename T>
constexpr istream &operator>>(istream &stream, Modint<T> &number) noexcept {
return stream >> number.val;
}
using Mint = Modint<integral_constant<decay<decltype(MOD)>::type, MOD>>;
using Comb = Combination<integral_constant<decay<decltype(MOD)>::type, MOD>>;
int lr[125252];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n;
string s;
cin >> n >> s;
lr[0] = 1;
int cnt = 1, sum = 1;
Mint ans = 1;
REP(i, n * 2 - 1) {
lr[i + 1] = (s[i] == s[i + 1] ? !lr[i] : lr[i]);
cnt += lr[i + 1];
sum += lr[i + 1];
if (!lr[i + 1]) {
ans *= sum;
// DEBUG(ans);
--sum;
if (sum < 0) {
cnt = 0;
break;
}
}
}
if (s[0] == 'W' || s[n * 2 - 1] == 'W' || cnt != n) {
cout << 0 << '\n';
return 0;
}
Comb comb(n);
ans *= comb.fact(n);
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
template <typename T> struct Modint {
using Type = typename decay<decltype(T::value)>::type;
Type val;
constexpr Modint() noexcept : val() {}
template <typename U> constexpr Modint(const U &x) noexcept {
val = normalize(x);
}
template <typename U> static Type normalize(const U &x) noexcept {
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;
}
constexpr Type &value() noexcept { return val; }
constexpr const Type &value() const noexcept { return val; }
template <typename U> constexpr explicit operator U() const noexcept {
return static_cast<U>(val);
}
constexpr static Type mod() noexcept { return T::value; }
constexpr Modint &operator+=(const Modint &rhs) noexcept {
if ((val += rhs.val) >= mod())
val -= mod();
return *this;
}
template <typename U> constexpr Modint &operator+=(const U &rhs) noexcept {
return *this += Modint(rhs);
}
constexpr Modint &operator-=(const Modint &rhs) noexcept {
if ((val -= rhs.val) < 0)
val += mod();
return *this;
}
template <typename U> constexpr Modint &operator-=(const U &rhs) noexcept {
return *this -= Modint(rhs);
}
constexpr Modint &operator++() noexcept { return *this += 1; }
constexpr Modint &operator--() noexcept { return *this -= 1; }
constexpr Modint operator++(int) noexcept {
Modint result(*this);
*this += 1;
return result;
}
constexpr Modint operator--(int) noexcept {
Modint result(*this);
*this -= 1;
return result;
}
constexpr Modint operator-() const noexcept { return Modint(-val); }
constexpr Modint &operator*=(const Modint rhs) noexcept {
val = val * rhs.val % mod();
return *this;
}
constexpr Modint &operator/=(const Modint &rhs) noexcept {
Type x = rhs.val, m = mod(), u = 0, v = 1;
while (x != 0) {
Type t = m / x;
m -= t * x;
swap(x, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return *this *= Modint(u);
}
};
template <typename T>
constexpr bool operator==(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return lhs.val == rhs.val;
}
template <typename T, typename U>
constexpr bool operator==(const Modint<T> &lhs, U rhs) noexcept {
return lhs == Modint<T>(rhs);
}
template <typename T, typename U>
constexpr bool operator==(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) == rhs;
}
template <typename T>
constexpr bool operator!=(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return !(lhs == rhs);
}
template <typename T, typename U>
constexpr bool operator!=(const Modint<T> &lhs, U rhs) noexcept {
return !(lhs == rhs);
}
template <typename T, typename U>
constexpr bool operator!=(U lhs, const Modint<T> &rhs) noexcept {
return !(lhs == rhs);
}
template <typename T>
constexpr bool operator<(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return lhs.val < rhs.val;
}
template <typename T, typename U>
constexpr bool operator<(const Modint<T> &lhs, U rhs) noexcept {
return lhs < Modint<T>(rhs);
}
template <typename T, typename U>
constexpr bool operator<(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) < rhs;
}
template <typename T>
constexpr bool operator>(const Modint<T> &lhs, const Modint<T> &rhs) noexcept {
return lhs.val > rhs.val;
}
template <typename T, typename U>
constexpr bool operator>(const Modint<T> &lhs, U rhs) noexcept {
return lhs > Modint<T>(rhs);
}
template <typename T, typename U>
constexpr bool operator>(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) > rhs;
}
template <typename T>
constexpr Modint<T> operator+(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) += rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator+(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) += rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator+(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) += rhs;
}
template <typename T>
constexpr Modint<T> operator-(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) -= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator-(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) -= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator-(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) -= rhs;
}
template <typename T>
constexpr Modint<T> operator*(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) *= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator*(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) *= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator*(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) *= rhs;
}
template <typename T>
constexpr Modint<T> operator/(const Modint<T> &lhs,
const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) /= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator/(const Modint<T> &lhs, U rhs) noexcept {
return Modint<T>(lhs) /= rhs;
}
template <typename T, typename U>
constexpr Modint<T> operator/(U lhs, const Modint<T> &rhs) noexcept {
return Modint<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modint<T> constexpr power(const Modint<T> &a, const U &b) noexcept {
Modint<T> x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
res *= x;
x *= x;
p >>= 1;
}
return res;
}
template <class T> struct Combination {
using Type = typename decay<decltype(T::value)>::type;
vector<Modint<T>> fact_, finv_;
constexpr Combination(int n) noexcept : fact_(n + 1, 1), finv_(n + 1, 1) {
Type MOD = fact_[0].mod();
FOR(i, 2, n + 1) { fact_[i] = fact_[i - 1] * i; }
finv_[n] = power(fact_[n], MOD - 2);
FORR(i, 3, n + 1) { finv_[i - 1] = finv_[i] * i; }
}
// iの逆元も求める場合
/*
vector<Modint<T>> fact_, inv_, finv_;
constexpr Combination(int n) noexcept : fact_(n+1, 1), inv_(n+1, 1),
finv_(n+1, 1) { Type MOD=fact_[0].mod(); FOR(i, 2, n+1){
fact_[i]=fact_[i-1]*i;
inv_[i]=-inv_[MOD%i]*(MOD/i);
finv_[i]=finv_[i-1]*inv_[i];
}
}
constexpr Modint<T> inv(int n) const noexcept {
if(n<0) return 0;
return inv_[n];
}
*/
constexpr Modint<T> com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return Modint<T>(0);
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr Modint<T> fact(int n) const noexcept {
if (n < 0)
return Modint<T>(0);
return fact_[n];
}
constexpr Modint<T> finv(int n) const noexcept {
if (n < 0)
return Modint<T>(0);
return finv_[n];
}
};
template <typename T>
constexpr ostream &operator<<(ostream &stream,
const Modint<T> &number) noexcept {
return stream << number.val;
}
template <typename T>
constexpr istream &operator>>(istream &stream, Modint<T> &number) noexcept {
return stream >> number.val;
}
using Mint = Modint<integral_constant<decay<decltype(MOD)>::type, MOD>>;
using Comb = Combination<integral_constant<decay<decltype(MOD)>::type, MOD>>;
int lr[252525];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n;
string s;
cin >> n >> s;
lr[0] = 1;
int cnt = 1, sum = 1;
Mint ans = 1;
REP(i, n * 2 - 1) {
lr[i + 1] = (s[i] == s[i + 1] ? !lr[i] : lr[i]);
cnt += lr[i + 1];
sum += lr[i + 1];
if (!lr[i + 1]) {
ans *= sum;
// DEBUG(ans);
--sum;
if (sum < 0) {
cnt = 0;
break;
}
}
}
if (s[0] == 'W' || s[n * 2 - 1] == 'W' || cnt != n) {
cout << 0 << '\n';
return 0;
}
Comb comb(n);
ans *= comb.fact(n);
cout << ans << '\n';
return 0;
}
| replace | 291 | 292 | 291 | 292 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 100005;
const int MOD = 1000000007;
int n;
char s[N];
int a[N];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
if (s[1] == 'W') {
printf("0");
return 0;
}
a[0] = 1;
for (int i = 1; i <= n * 2; i++)
if (s[i] == s[i - 1])
a[i] = a[i - 1] ^ 1;
else
a[i] = a[i - 1];
int num = 0;
long long ans = 1;
for (int i = 1; i <= n * 2; i++) {
if (a[i] == 1)
num++;
else
ans = ans * num % MOD, num--;
if (num < 0) {
printf("0");
return 0;
}
}
if (num != 0) {
printf("0");
return 0;
}
for (int i = 1; i <= n; i++)
ans = ans * i % MOD;
printf("%lld", ans);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 200005;
const int MOD = 1000000007;
int n;
char s[N];
int a[N];
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
if (s[1] == 'W') {
printf("0");
return 0;
}
a[0] = 1;
for (int i = 1; i <= n * 2; i++)
if (s[i] == s[i - 1])
a[i] = a[i - 1] ^ 1;
else
a[i] = a[i - 1];
int num = 0;
long long ans = 1;
for (int i = 1; i <= n * 2; i++) {
if (a[i] == 1)
num++;
else
ans = ans * num % MOD, num--;
if (num < 0) {
printf("0");
return 0;
}
}
if (num != 0) {
printf("0");
return 0;
}
for (int i = 1; i <= n; i++)
ans = ans * i % MOD;
printf("%lld", ans);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int NS = (int)1e5 + 4;
const long long MOD = (long long)1e9 + 7;
int N;
char s[NS];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
int val = 0;
long long ans = 1;
for (int i = 1; i <= N * 2; ++i) {
if ((s[i] == 'B' && val % 2 == 0) || (s[i] == 'W' && val % 2 == 1))
++val;
else {
ans = (ans * val) % MOD;
--val;
}
}
if (val) {
puts("0");
return 0;
}
for (int i = N; i >= 1; --i) {
ans = (ans * i) % MOD;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int NS = (int)1e5 + 4;
const long long MOD = (long long)1e9 + 7;
int N;
char s[NS * 2];
int main() {
scanf("%d", &N);
scanf("%s", s + 1);
int val = 0;
long long ans = 1;
for (int i = 1; i <= N * 2; ++i) {
if ((s[i] == 'B' && val % 2 == 0) || (s[i] == 'W' && val % 2 == 1))
++val;
else {
ans = (ans * val) % MOD;
--val;
}
}
if (val) {
puts("0");
return 0;
}
for (int i = N; i >= 1; --i) {
ans = (ans * i) % MOD;
}
printf("%lld\n", ans);
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) \
printf("%lld ", i); \
puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fil(a, b) memset((a), (b), sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pa;
typedef pair<ll, ll> PA;
typedef vector<int> poly;
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while ((c < '0' || c > '9') && (c != '-'))
c = getchar();
if (c == '-')
f = -1, c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
const int N = 1e5 + 10, mod = 1e9 + 7;
int n, a[N], b[N], cnt[2];
char s[N];
inline void GG() {
puts("0");
exit(0);
}
int main() {
n = read(), scanf("%s", s + 1), n = strlen(s + 1);
if (s[1] == 'W')
GG();
a[1] = 1;
For(i, 2, n) a[i] = (s[i] != s[i - 1]);
b[1] = 0;
For(i, 2, n) {
if (a[i])
b[i] = b[i - 1];
else
b[i] = b[i - 1] ^ 1;
}
For(i, 1, n) cnt[b[i]]++;
if (cnt[0] != n / 2)
GG();
int tot = 0, ans = 1;
Dow(i, n, 1) {
if (b[i] == 1)
++tot;
else
ans = 1ll * ans * tot % mod, --tot;
}
For(i, 1, n / 2) ans = 1ll * ans * i % mod;
printf("%d\n", ans);
} | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) \
printf("%lld ", i); \
puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ep emplace_back
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fil(a, b) memset((a), (b), sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pa;
typedef pair<ll, ll> PA;
typedef vector<int> poly;
inline ll read() {
ll x = 0, f = 1;
char c = getchar();
while ((c < '0' || c > '9') && (c != '-'))
c = getchar();
if (c == '-')
f = -1, c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x * f;
}
const int N = 2e5 + 10, mod = 1e9 + 7;
int n, a[N], b[N], cnt[2];
char s[N];
inline void GG() {
puts("0");
exit(0);
}
int main() {
n = read(), scanf("%s", s + 1), n = strlen(s + 1);
if (s[1] == 'W')
GG();
a[1] = 1;
For(i, 2, n) a[i] = (s[i] != s[i - 1]);
b[1] = 0;
For(i, 2, n) {
if (a[i])
b[i] = b[i - 1];
else
b[i] = b[i - 1] ^ 1;
}
For(i, 1, n) cnt[b[i]]++;
if (cnt[0] != n / 2)
GG();
int tot = 0, ans = 1;
Dow(i, n, 1) {
if (b[i] == 1)
++tot;
else
ans = 1ll * ans * tot % mod, --tot;
}
For(i, 1, n / 2) ans = 1ll * ans * i % mod;
printf("%d\n", ans);
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
char s[MAXN];
int main(void) {
int n;
scanf("%d%s", &n, s + 1);
if (s[1] == 'W' || s[n << 1] == 'W') {
printf("0");
return 0;
}
ll ans = 1, t = 1, last = 1;
for (int i = 2; i <= (n * 2); ++i) {
if (s[i] != s[i - 1]) {
if (last)
++t;
else
--t;
} else {
if (last)
--t;
else
++t;
last = !last;
}
if (!last)
ans = ans * (t + 1) % mod;
if (t < 0) {
printf("0");
return 0;
}
}
if (t) {
printf("0");
return 0;
}
for (int i = 1; i <= n; ++i)
ans = ans * i % mod;
printf("%lld", ans);
return 0;
} | #include <cstdio>
typedef long long ll;
const int MAXN = 1e5 + 5;
const ll mod = 1e9 + 7;
char s[MAXN * 2];
int main(void) {
int n;
scanf("%d%s", &n, s + 1);
if (s[1] == 'W' || s[n << 1] == 'W') {
printf("0");
return 0;
}
ll ans = 1, t = 1, last = 1;
for (int i = 2; i <= (n * 2); ++i) {
if (s[i] != s[i - 1]) {
if (last)
++t;
else
--t;
} else {
if (last)
--t;
else
++t;
last = !last;
}
if (!last)
ans = ans * (t + 1) % mod;
if (t < 0) {
printf("0");
return 0;
}
}
if (t) {
printf("0");
return 0;
}
for (int i = 1; i <= n; ++i)
ans = ans * i % mod;
printf("%lld", ans);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
char s[maxn];
const ll p = 1e9 + 7;
ll n, qk[maxn], jc[maxn];
signed main() {
scanf("%lld %s", &n, (s + 1));
jc[0] = 1;
for (int i = 1; i <= n; i++)
jc[i] = jc[i - 1] * i % p;
int tot = 0, valid = 1;
for (int i = 1; i <= n * 2; i++) {
if (s[i] == 'B') {
if (tot % 2 == 0)
qk[i] = 1, tot++;
else
qk[i] = -1, tot--;
} else {
if (tot % 2 == 0)
qk[i] = -1, tot--;
else
qk[i] = 1, tot++;
}
if (tot < 0)
valid = 0;
}
if (tot > 0)
valid = 0;
if (valid == 0) {
puts("0");
return 0;
}
ll ans = 1, sum = 0;
for (int i = 1; i <= 2 * n; i++) {
if (qk[i] == -1)
ans = ans * sum % p;
sum += qk[i];
// printf("%lld ", qk[i]);
}
ans = ans * jc[n] % p;
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
char s[maxn];
const ll p = 1e9 + 7;
ll n, qk[maxn], jc[maxn];
signed main() {
scanf("%lld %s", &n, (s + 1));
jc[0] = 1;
for (int i = 1; i <= n; i++)
jc[i] = jc[i - 1] * i % p;
int tot = 0, valid = 1;
for (int i = 1; i <= n * 2; i++) {
if (s[i] == 'B') {
if (tot % 2 == 0)
qk[i] = 1, tot++;
else
qk[i] = -1, tot--;
} else {
if (tot % 2 == 0)
qk[i] = -1, tot--;
else
qk[i] = 1, tot++;
}
if (tot < 0)
valid = 0;
}
if (tot > 0)
valid = 0;
if (valid == 0) {
puts("0");
return 0;
}
ll ans = 1, sum = 0;
for (int i = 1; i <= 2 * n; i++) {
if (qk[i] == -1)
ans = ans * sum % p;
sum += qk[i];
// printf("%lld ", qk[i]);
}
ans = ans * jc[n] % p;
printf("%lld\n", ans);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
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;
}
}
// 二項係数計算
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;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
double digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll t[110];
ll v[110];
bool check(ll x, ll h) {
ll s = 0;
rep(i, n + 2) {
ll st = s + t[i];
if (st < x) {
ll u = x - st;
if (h - u > v[i])
return false;
} else if (x < s) {
ll u = s - x;
if (h - u > v[i])
return false;
} else {
if (h > v[i])
return false;
}
s = st;
}
return true;
}
void solv() {
cin >> n;
string s;
cin >> s;
if (s[0] == 'W') {
cout << 0 << endl;
return;
}
ll t[100010];
all0(t);
t[0] = 1;
ll cnt = 1;
rep2(i, 1, 2 * n) {
if (s[i] == s[i - 1]) {
t[i] = (t[i - 1] + 1) % 2;
} else {
t[i] = t[i - 1];
}
cnt += t[i];
}
if (cnt != n) {
cout << 0 << endl;
return;
}
ll cn = 0;
ll res = 1;
rep(i, 2 * n) {
if (t[i] == 1) {
cn++;
} else {
res *= cn;
res %= INF;
cn--;
}
}
res *= fac[n];
res %= INF;
cout << res << endl;
}
int main() {
COMinit();
solv();
return 0;
} | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
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;
}
}
// 二項係数計算
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;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
double digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll t[110];
ll v[110];
bool check(ll x, ll h) {
ll s = 0;
rep(i, n + 2) {
ll st = s + t[i];
if (st < x) {
ll u = x - st;
if (h - u > v[i])
return false;
} else if (x < s) {
ll u = s - x;
if (h - u > v[i])
return false;
} else {
if (h > v[i])
return false;
}
s = st;
}
return true;
}
void solv() {
cin >> n;
string s;
cin >> s;
if (s[0] == 'W') {
cout << 0 << endl;
return;
}
ll t[200010];
all0(t);
t[0] = 1;
ll cnt = 1;
rep2(i, 1, 2 * n) {
if (s[i] == s[i - 1]) {
t[i] = (t[i - 1] + 1) % 2;
} else {
t[i] = t[i - 1];
}
cnt += t[i];
}
if (cnt != n) {
cout << 0 << endl;
return;
}
ll cn = 0;
ll res = 1;
rep(i, 2 * n) {
if (t[i] == 1) {
cn++;
} else {
res *= cn;
res %= INF;
cn--;
}
}
res *= fac[n];
res %= INF;
cout << res << endl;
}
int main() {
COMinit();
solv();
return 0;
} | replace | 1,006 | 1,007 | 1,006 | 1,007 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 1e5 + 10, MOD = 1e9 + 7;
char s[2 * N];
bool a[2 * N];
vector<int> le, ri;
bool flag = 1;
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < 2 * n; i++) {
if (s[i] == 'B')
a[i] = 1;
else
a[i] = 0;
}
int inv = 0;
for (int i = 0; i < 2 * n; i++) {
if ((inv ^ a[i]) == 1) {
le.push_back(i);
} else {
ri.push_back(i);
}
inv ^= 1;
}
if (flag) {
int ans = 1;
for (int i = n - 1; i >= 0; i--) {
ans = 1LL * ans *
(i + 1 - (upper_bound(ri.begin(), ri.end(), le[i]) - ri.begin())) %
MOD;
}
for (int i = 1; i <= n; i++) {
ans = 1LL * ans * i % MOD;
}
printf("%d\n", ans);
} else
puts("0");
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 1e5 + 10, MOD = 1e9 + 7;
char s[2 * N];
bool a[2 * N];
vector<int> le, ri;
bool flag = 1;
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < 2 * n; i++) {
if (s[i] == 'B')
a[i] = 1;
else
a[i] = 0;
}
int inv = 0;
for (int i = 0; i < 2 * n; i++) {
if ((inv ^ a[i]) == 1) {
le.push_back(i);
} else {
ri.push_back(i);
}
inv ^= 1;
}
flag = le.size() == ri.size();
if (flag) {
int ans = 1;
for (int i = n - 1; i >= 0; i--) {
ans = 1LL * ans *
(i + 1 - (upper_bound(ri.begin(), ri.end(), le[i]) - ri.begin())) %
MOD;
}
for (int i = 1; i <= n; i++) {
ans = 1LL * ans * i % MOD;
}
printf("%d\n", ans);
} else
puts("0");
return 0;
}
| insert | 30 | 30 | 30 | 31 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
const int N = 2e5 + 1;
char s[N];
int main() {
int n;
scanf("%d %s", &n, s);
vector<int> zero, one;
for (int i = 0; i < 2 * n; ++i) {
if ((s[i] == 'W') ^ (i & 1))
one.push_back(i);
else
zero.push_back(i);
}
int ans = 1;
for (int i = 0; i < n; ++i) {
static int pos = 0;
while (pos < n && one[i] > zero[pos])
++pos;
ans = mult(ans, pos - i);
ans = mult(ans, i + 1);
}
printf("%d", ans);
}
| #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
const int N = 2e5 + 1;
char s[N];
int main() {
int n;
scanf("%d %s", &n, s);
vector<int> zero, one;
for (int i = 0; i < 2 * n; ++i) {
if ((s[i] == 'W') ^ (i & 1))
one.push_back(i);
else
zero.push_back(i);
}
if ((int)one.size() != n) {
printf("0");
return 0;
}
int ans = 1;
for (int i = 0; i < n; ++i) {
static int pos = 0;
while (pos < n && one[i] > zero[pos])
++pos;
ans = mult(ans, pos - i);
ans = mult(ans, i + 1);
}
printf("%d", ans);
}
| insert | 25 | 25 | 25 | 30 | 0 | |
p02929 | C++ | Runtime Error | #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 n;
string s;
long long solve();
int main() {
cin >> n >> s;
cout << solve() << endl;
return 0;
}
long long solve() {
long long cnt = 1, ans = 1;
smodfact();
if (s[0] == 'W' || s[2 * n - 1] == 'W')
return 0;
ans = factorial[n];
for (int i = 1; i < 2 * n; ++i)
if (cnt % 2 == (s[i] == 'W'))
++cnt;
else
(ans *= cnt--) %= N;
assert(cnt == 0);
return ans;
} | #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 n;
string s;
long long solve();
int main() {
cin >> n >> s;
cout << solve() << endl;
return 0;
}
long long solve() {
long long cnt = 1, ans = 1;
smodfact();
if (s[0] == 'W' || s[2 * n - 1] == 'W')
return 0;
ans = factorial[n];
for (int i = 1; i < 2 * n; ++i)
if (cnt % 2 == (s[i] == 'W'))
++cnt;
else
(ans *= cnt--) %= N;
if (cnt != 0)
return 0;
return ans;
} | replace | 48 | 49 | 48 | 50 | 0 | |
p02929 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n;
string s;
ll a[100005];
ll ans = 1;
ll cnt = 0;
ll cnt2 = 0;
int main() {
cin >> n >> s;
for (ll i = 0; i < s.size(); i++) {
bool v = false;
if (s[i] == 'B')
v = true;
if (v ^ (cnt % 2))
cnt++, a[i] = 1;
else
cnt--, a[i] = -1;
if (cnt < 0) {
printf("0\n");
return 0;
}
}
if (cnt != 0) {
printf("0\n");
return 0;
}
for (ll i = 0; i < s.size(); i++) {
if (a[i] == -1)
ans *= cnt2, cnt2--;
else
cnt2++;
ans %= M;
}
for (ll i = 1; i <= n; i++) {
ans *= i;
ans %= M;
}
cout << ans << endl;
return 0;
}
| #include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n;
string s;
ll a[200005];
ll ans = 1;
ll cnt = 0;
ll cnt2 = 0;
int main() {
cin >> n >> s;
for (ll i = 0; i < s.size(); i++) {
bool v = false;
if (s[i] == 'B')
v = true;
if (v ^ (cnt % 2))
cnt++, a[i] = 1;
else
cnt--, a[i] = -1;
if (cnt < 0) {
printf("0\n");
return 0;
}
}
if (cnt != 0) {
printf("0\n");
return 0;
}
for (ll i = 0; i < s.size(); i++) {
if (a[i] == -1)
ans *= cnt2, cnt2--;
else
cnt2++;
ans %= M;
}
for (ll i = 1; i <= n; i++) {
ans *= i;
ans %= M;
}
cout << ans << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02929 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
class Combi {
private:
v(ll) fac, inv, finv;
void init(int N) {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < N; 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;
}
}
public:
Combi(int N) : fac(N + 1), inv(N + 1), finv(N + 1) { init(N + 1); }
ll Cmod(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 Pmod(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
};
int main() {
int N;
cin >> N;
string s;
cin >> s;
if (s[0] == 'W' || s[2 * N - 1] == 'W') {
cout << 0 << endl;
return 0;
}
v(bool) isR(N, false);
srep(i, 1, 2 * N) {
if (s[i] != s[i - 1]) {
isR[i] = isR[i - 1];
} else {
isR[i] = !isR[i - 1];
}
}
int cnt = 0;
rep(i, 2 * N) {
if (isR[i])
cnt++;
}
if (cnt != N) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
int l = 0;
rep(i, 2 * N) {
if (isR[i]) {
ans *= l;
ans %= MOD;
l--;
} else {
l++;
}
}
Combi C = Combi(N);
ans *= C.Pmod(N, N);
ans %= MOD;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
class Combi {
private:
v(ll) fac, inv, finv;
void init(int N) {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < N; 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;
}
}
public:
Combi(int N) : fac(N + 1), inv(N + 1), finv(N + 1) { init(N + 1); }
ll Cmod(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 Pmod(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
};
int main() {
int N;
cin >> N;
string s;
cin >> s;
if (s[0] == 'W' || s[2 * N - 1] == 'W') {
cout << 0 << endl;
return 0;
}
v(bool) isR(2 * N, false);
srep(i, 1, 2 * N) {
if (s[i] != s[i - 1]) {
isR[i] = isR[i - 1];
} else {
isR[i] = !isR[i - 1];
}
}
int cnt = 0;
rep(i, 2 * N) {
if (isR[i])
cnt++;
}
if (cnt != N) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
int l = 0;
rep(i, 2 * N) {
if (isR[i]) {
ans *= l;
ans %= MOD;
l--;
} else {
l++;
}
}
Combi C = Combi(N);
ans *= C.Pmod(N, N);
ans %= MOD;
cout << ans << endl;
return 0;
} | replace | 69 | 70 | 69 | 70 | 0 | |
p02929 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
template <class o, class p, class q, class r, class s>
using tuple5q =
priority_queue<tuple<o, p, q, r, s>, vector<tuple<o, p, q, r, s>>,
greater<tuple<o, p, q, r, s>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define put(v) cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define vdesc(v) \
vsort(v); \
reverse(all(v))
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * INFinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) ((a) % INF)
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define smal -INF *INF
#define big INF *INF
ll INF = 1000000007;
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
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 % INF;
inv[i] = INF - inv[INF % i] * (INF / i) % INF;
finv[i] = finv[i - 1] * inv[i] % INF;
}
}
// 二項係数計算
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] % INF) % INF;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res % md;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
class mint {
int md = 1000000007;
public:
long long x;
mint(ll x, ll md) {
this->md = md;
this->x = (x % md + md) % md;
}
mint(long long x = 0) : x((x % md + md) % md) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= md)
x -= md;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += md - a.x) >= md)
x -= md;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= md;
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 INF
mint inv() const { return pow(md - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int pr[200010];
int lank[200010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll n, m;
int ci = 0;
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
class edge {
public:
int from, to, i;
ll val;
edge() {}
edge(ll to) : to(to) {}
edge(ll to, ll i) : to(to), i(i) {}
edge(ll from, ll to, ll val) : from(from), to(to), val(val) {}
};
class LCA {
private:
vector<vector<edge>> v;
vector<vector<int>> parent;
vector<int> depth;
void dfs(int n, int m, int d) {
parent[0][n] = m;
depth[n] = d;
for (auto x : v[n]) {
if (x.to != m)
dfs(x.to, n, d + 1);
}
}
public:
LCA(ll N, ll root, vector<vector<edge>> &tree) {
v = tree;
parent = vector<vector<int>>(21, vector<int>(N + 1, 0));
depth = vector<int>(N + 1, 0);
dfs(root, -1, 0);
for (int j = 0; j + 1 < 20; j++) {
for (int i = 1; i <= N; i++) {
if (parent[j][i] < 0)
parent[j + 1][i] = -1;
else
parent[j + 1][i] = parent[j][parent[j][i]];
}
}
}
int lca(int n, int m) {
if (depth[n] > depth[m])
swap(n, m);
for (int j = 0; j < 20; j++) {
if ((depth[m] - depth[n]) >> j & 1)
m = parent[j][m];
}
if (n == m)
return n;
for (int j = 19; j >= 0; j--) {
if (parent[j][n] != parent[j][m]) {
n = parent[j][n];
m = parent[j][m];
}
}
return parent[0][n];
}
int dep(int n) { return depth[n]; }
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
ll digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll npr(ll n, ll r) {
if (r == 0)
return 1;
return inff(fac[n] * modinv(fac[n - r]));
}
vl zalgo(string s) {
ll c = 0;
vl a(s.size());
ll si = s.size();
rep2(i, 1, s.size()) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
ll j = max(0LL, a[c] - (i - c));
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = s.size();
return a;
}
string decStrNum(string s) {
ll si = s.size();
for (int i = si - 1; i >= 0; i--) {
if (s[i] == '0') {
s[i] = '9';
continue;
}
s[i] = s[i] - 1;
break;
}
return s;
}
// ここまでライブラリ
// ここからコード
void solv() {
cin >> n;
string s;
cin >> s;
if (s[0] == 'W') {
cout << 0 << endl;
return;
}
ll t[100010];
all0(t);
t[0] = 1;
ll c = 1;
rep2(i, 1, 2 * n) {
if (s[i] == s[i - 1]) {
t[i] = (t[i - 1] + 1) % 2;
} else {
t[i] = t[i - 1];
}
c += t[i];
}
if (c != n) {
cout << 0 << endl;
return;
}
ll r = 1;
ll sm = 0;
rep(i, 2 * n) {
if (t[i] == 1) {
sm++;
} else {
inf(r *= sm);
sm--;
}
}
inf(r *= fac[n]);
cout << r << endl;
}
int main() {
COMinit();
solv();
return 0;
}
| #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
template <class o, class p, class q, class r, class s>
using tuple5q =
priority_queue<tuple<o, p, q, r, s>, vector<tuple<o, p, q, r, s>>,
greater<tuple<o, p, q, r, s>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define put(v) cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define vdesc(v) \
vsort(v); \
reverse(all(v))
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * INFinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) ((a) % INF)
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define smal -INF *INF
#define big INF *INF
ll INF = 1000000007;
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
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 % INF;
inv[i] = INF - inv[INF % i] * (INF / i) % INF;
finv[i] = finv[i - 1] * inv[i] % INF;
}
}
// 二項係数計算
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] % INF) % INF;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res % md;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
class mint {
int md = 1000000007;
public:
long long x;
mint(ll x, ll md) {
this->md = md;
this->x = (x % md + md) % md;
}
mint(long long x = 0) : x((x % md + md) % md) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= md)
x -= md;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += md - a.x) >= md)
x -= md;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= md;
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 INF
mint inv() const { return pow(md - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int pr[200010];
int lank[200010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll n, m;
int ci = 0;
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
class edge {
public:
int from, to, i;
ll val;
edge() {}
edge(ll to) : to(to) {}
edge(ll to, ll i) : to(to), i(i) {}
edge(ll from, ll to, ll val) : from(from), to(to), val(val) {}
};
class LCA {
private:
vector<vector<edge>> v;
vector<vector<int>> parent;
vector<int> depth;
void dfs(int n, int m, int d) {
parent[0][n] = m;
depth[n] = d;
for (auto x : v[n]) {
if (x.to != m)
dfs(x.to, n, d + 1);
}
}
public:
LCA(ll N, ll root, vector<vector<edge>> &tree) {
v = tree;
parent = vector<vector<int>>(21, vector<int>(N + 1, 0));
depth = vector<int>(N + 1, 0);
dfs(root, -1, 0);
for (int j = 0; j + 1 < 20; j++) {
for (int i = 1; i <= N; i++) {
if (parent[j][i] < 0)
parent[j + 1][i] = -1;
else
parent[j + 1][i] = parent[j][parent[j][i]];
}
}
}
int lca(int n, int m) {
if (depth[n] > depth[m])
swap(n, m);
for (int j = 0; j < 20; j++) {
if ((depth[m] - depth[n]) >> j & 1)
m = parent[j][m];
}
if (n == m)
return n;
for (int j = 19; j >= 0; j--) {
if (parent[j][n] != parent[j][m]) {
n = parent[j][n];
m = parent[j][m];
}
}
return parent[0][n];
}
int dep(int n) { return depth[n]; }
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
ll digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll npr(ll n, ll r) {
if (r == 0)
return 1;
return inff(fac[n] * modinv(fac[n - r]));
}
vl zalgo(string s) {
ll c = 0;
vl a(s.size());
ll si = s.size();
rep2(i, 1, s.size()) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
ll j = max(0LL, a[c] - (i - c));
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = s.size();
return a;
}
string decStrNum(string s) {
ll si = s.size();
for (int i = si - 1; i >= 0; i--) {
if (s[i] == '0') {
s[i] = '9';
continue;
}
s[i] = s[i] - 1;
break;
}
return s;
}
// ここまでライブラリ
// ここからコード
void solv() {
cin >> n;
string s;
cin >> s;
if (s[0] == 'W') {
cout << 0 << endl;
return;
}
ll t[200010];
all0(t);
t[0] = 1;
ll c = 1;
rep2(i, 1, 2 * n) {
if (s[i] == s[i - 1]) {
t[i] = (t[i - 1] + 1) % 2;
} else {
t[i] = t[i - 1];
}
c += t[i];
}
if (c != n) {
cout << 0 << endl;
return;
}
ll r = 1;
ll sm = 0;
rep(i, 2 * n) {
if (t[i] == 1) {
sm++;
} else {
inf(r *= sm);
sm--;
}
}
inf(r *= fac[n]);
cout << r << endl;
}
int main() {
COMinit();
solv();
return 0;
}
| replace | 1,068 | 1,069 | 1,068 | 1,069 | 0 | |
p02930 | C++ | Runtime Error | #include <cstdio>
#include <vector>
#define fin stdin
#define fout stdout
// FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define MOD 1000000007
#define MAXN 509
int ans[MAXN][MAXN];
int k;
void solve(std::vector<int> &a) {
if (a.size() == 1)
return;
bool avem = 0;
if (a.size() % 2) {
k++;
avem = 1;
for (auto &x : a)
ans[x][a.back()] = k;
a.pop_back();
}
k++;
for (int i = 0; i < (int)a.size(); i++)
for (int j = 0; j < (int)a.size(); j++)
if (i % 2 != j % 2)
ans[a[i]][a[j]] = k;
std::vector<int> par, impar;
for (int i = 0; i < (int)a.size(); i += 2)
par.push_back(a[i]);
for (int i = 1; i < (int)a.size(); i += 2)
impar.push_back(a[i]);
solve(par);
solve(impar);
k--;
k -= avem;
}
int main() {
int n;
fscanf(fin, "%d", &n);
int noulN = 1;
while (noulN < n)
noulN *= 2;
std::vector<int> v(noulN);
for (int i = 0; i < noulN; i++)
v[i] = i + 1;
solve(v);
for (int i = 1; i <= n; i++, fprintf(fout, "\n"))
for (int j = i + 1; j <= n; j++)
fprintf(fout, "%d ", std::max(ans[i][j], ans[j][i]));
fclose(fin);
fclose(fout);
return 0;
}
| #include <cstdio>
#include <vector>
#define fin stdin
#define fout stdout
// FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define MOD 1000000007
#define MAXN 520
int ans[MAXN][MAXN];
int k;
void solve(std::vector<int> &a) {
if (a.size() == 1)
return;
bool avem = 0;
if (a.size() % 2) {
k++;
avem = 1;
for (auto &x : a)
ans[x][a.back()] = k;
a.pop_back();
}
k++;
for (int i = 0; i < (int)a.size(); i++)
for (int j = 0; j < (int)a.size(); j++)
if (i % 2 != j % 2)
ans[a[i]][a[j]] = k;
std::vector<int> par, impar;
for (int i = 0; i < (int)a.size(); i += 2)
par.push_back(a[i]);
for (int i = 1; i < (int)a.size(); i += 2)
impar.push_back(a[i]);
solve(par);
solve(impar);
k--;
k -= avem;
}
int main() {
int n;
fscanf(fin, "%d", &n);
int noulN = 1;
while (noulN < n)
noulN *= 2;
std::vector<int> v(noulN);
for (int i = 0; i < noulN; i++)
v[i] = i + 1;
solve(v);
for (int i = 1; i <= n; i++, fprintf(fout, "\n"))
for (int j = i + 1; j <= n; j++)
fprintf(fout, "%d ", std::max(ans[i][j], ans[j][i]));
fclose(fin);
fclose(fout);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
inline void mod(int &x) {
if(x >= MOD)
x -= MOD;
}
inline void add(int &x, int y) {
x += y;
mod(x);
}
inline void sub(int &x, int y) {
x += MOD - y;
mod(x);
}
inline void mul(int &x, int y) {
x = (1LL * x * y) % MOD;
}
inline int inv(int x) {
return lgput(x, MOD - 2);
}
#endif
#if 0
int fact[], invfact[];
inline void prec(int n) {
fact[0] = 1;
for(int i = 1; i <= n; i++) {
fact[i] = (1LL * fact[i - 1] * i) % MOD;
}
invfact[n] = lgput(fact[n], MOD - 2);
for(int i = n - 1; i >= 0; i--) {
invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
}
}
inline int comb(int n, int k) {
if(n < k) return 0;
return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif
using namespace std;
const int MAXN = 500;
int mat[MAXN + 1][MAXN + 1];
void solve(int l, int r, int cnt) {
if (l == r) {
return;
}
int mid = (l + r) / 2;
solve(l, mid, cnt + 1);
solve(mid + 1, r, cnt + 1);
int i, j;
for (i = l; i <= mid; i++) {
for (j = mid + 1; j <= r; j++) {
mat[i][j] = cnt;
}
}
}
int main() {
#if 0
ifstream cin("A.in");
ofstream cout("A.out");
#endif
int i, j, n;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n;
int aux = n;
while ((n & (n - 1)) > 0) {
n++;
}
solve(1, n, 1);
n = aux;
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
cout << mat[i][j] << " ";
}
cout << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
inline void mod(int &x) {
if(x >= MOD)
x -= MOD;
}
inline void add(int &x, int y) {
x += y;
mod(x);
}
inline void sub(int &x, int y) {
x += MOD - y;
mod(x);
}
inline void mul(int &x, int y) {
x = (1LL * x * y) % MOD;
}
inline int inv(int x) {
return lgput(x, MOD - 2);
}
#endif
#if 0
int fact[], invfact[];
inline void prec(int n) {
fact[0] = 1;
for(int i = 1; i <= n; i++) {
fact[i] = (1LL * fact[i - 1] * i) % MOD;
}
invfact[n] = lgput(fact[n], MOD - 2);
for(int i = n - 1; i >= 0; i--) {
invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
}
}
inline int comb(int n, int k) {
if(n < k) return 0;
return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif
using namespace std;
const int MAXN = 512;
int mat[MAXN + 1][MAXN + 1];
void solve(int l, int r, int cnt) {
if (l == r) {
return;
}
int mid = (l + r) / 2;
solve(l, mid, cnt + 1);
solve(mid + 1, r, cnt + 1);
int i, j;
for (i = l; i <= mid; i++) {
for (j = mid + 1; j <= r; j++) {
mat[i][j] = cnt;
}
}
}
int main() {
#if 0
ifstream cin("A.in");
ofstream cout("A.out");
#endif
int i, j, n;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n;
int aux = n;
while ((n & (n - 1)) > 0) {
n++;
}
solve(1, n, 1);
n = aux;
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
cout << mat[i][j] << " ";
}
cout << "\n";
}
return 0;
}
| replace | 64 | 65 | 64 | 65 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((long long)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for (bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
signed main() {
LCIN(N);
VVL ans(N, VL(N));
function<void(ll, ll, ll)> dfs = [&](ll l, ll r, ll d) {
if (r - l <= 0)
return;
ll mid = (r + l) / 2;
FOR(i, l, mid) FOR(j, mid, r) { ans[i][j] = d; }
dfs(l, mid, d + 1);
dfs(mid, r, d + 1);
};
dfs(0, N, 1);
REP(i, N) FOR(j, i + 1, N) { cout << ans[i][j] << (j == N - 1 ? "\n" : " "); }
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((long long)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for (bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
signed main() {
LCIN(N);
VVL ans(N, VL(N));
function<void(ll, ll, ll)> dfs = [&](ll l, ll r, ll d) {
if (r - l <= 1)
return;
ll mid = (r + l) / 2;
FOR(i, l, mid) FOR(j, mid, r) { ans[i][j] = d; }
dfs(l, mid, d + 1);
dfs(mid, r, d + 1);
};
dfs(0, N, 1);
REP(i, N) FOR(j, i + 1, N) { cout << ans[i][j] << (j == N - 1 ? "\n" : " "); }
}
| replace | 94 | 95 | 94 | 95 | -11 | |
p02930 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
//
// ▒█████▒▒
// ██████████▒
// ▒████████████▒
// ██████████████████
// ████████████████████▒
// ▒██████████████████████▒
// ▒███████████████████████
// ▒████▒▒▒▒▒▒█████████████████▒
// ███▒▒▒▒▒▒██████████████████████▒▒▒
// ▒██▒▒███████████████████████▒▒▒▒▒██████
// ▒█████████████████████████▒▒▒▒▒▒█████████▒
// ▒█████████████████████▒▒▒▒▒▒██████████████
// ▒████ ████▒▒▒▒▒████ ████▒
// ▒█████▒ ████ ▒▒▒▒███████ ████ ██████▒
// ▒██▒▒▒▒▒ ██████ █████████ ██████ ██▒▒▒██▒
// █████████ ████████ █████████ ████████ ▒▒▒▒█████
// ▒█████████ ██████ ████████▒ ██████ █████████
// ▒██████████ ████ █████▒▒▒▒▒▒ ████ ██████████
// ████████████ ▒▒▒▒▒▒▒████████ ███████████▒
// ▒██████████▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒███████████████████████████████████▒
// ███▒▒▒▒▒▒▒▒▒▒▒▒█████████████████████████████████████████▒▒████████▒
// ▒▒▒▒▒▒▒▒▒██████████████ ███████▒▒▒▒███████████
// █████████████████████████ ███████▒▒▒██████████████▒
// █████████████████████████████ ███████▒▒▒██████████████████▒
// ██████████████████████████████████████████████████████████████████████
// ██████████████████████████████████████████████████████████████████▒
// ▒█████████████████▒▒▒▒▒▒▒██████████████████████████████████▒▒▒
//
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
mat ans(550, vec(550, -1));
void solve(int l, int r, int lev) {
int mid = (l + r) / 2;
// cout << l SP r << endl;
if (r - l <= 1)
return;
FOR(i, l, mid) { REP(j, mid) ans[i][j + mid] = ans[j + mid][i] = lev; }
solve(l, mid, lev + 1);
solve(mid, r, lev + 1);
return;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
solve(1, n + 1, 1);
REP(i, n - 1) {
FOR(j, i + 1, n) cout << ans[i + 1][j + 1] << " ";
cout << endl;
}
// REP(i,10){
// REP(j,10){ cout << ans[i][j] <<" ";} cout << endl;}
return 0;
} | // warm heart, wagging tail,and a smile just for you!
//
// ▒█████▒▒
// ██████████▒
// ▒████████████▒
// ██████████████████
// ████████████████████▒
// ▒██████████████████████▒
// ▒███████████████████████
// ▒████▒▒▒▒▒▒█████████████████▒
// ███▒▒▒▒▒▒██████████████████████▒▒▒
// ▒██▒▒███████████████████████▒▒▒▒▒██████
// ▒█████████████████████████▒▒▒▒▒▒█████████▒
// ▒█████████████████████▒▒▒▒▒▒██████████████
// ▒████ ████▒▒▒▒▒████ ████▒
// ▒█████▒ ████ ▒▒▒▒███████ ████ ██████▒
// ▒██▒▒▒▒▒ ██████ █████████ ██████ ██▒▒▒██▒
// █████████ ████████ █████████ ████████ ▒▒▒▒█████
// ▒█████████ ██████ ████████▒ ██████ █████████
// ▒██████████ ████ █████▒▒▒▒▒▒ ████ ██████████
// ████████████ ▒▒▒▒▒▒▒████████ ███████████▒
// ▒██████████▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒███████████████████████████████████▒
// ███▒▒▒▒▒▒▒▒▒▒▒▒█████████████████████████████████████████▒▒████████▒
// ▒▒▒▒▒▒▒▒▒██████████████ ███████▒▒▒▒███████████
// █████████████████████████ ███████▒▒▒██████████████▒
// █████████████████████████████ ███████▒▒▒██████████████████▒
// ██████████████████████████████████████████████████████████████████████
// ██████████████████████████████████████████████████████████████████▒
// ▒█████████████████▒▒▒▒▒▒▒██████████████████████████████████▒▒▒
//
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
mat ans(550, vec(550, -1));
void solve(int l, int r, int lev) {
int mid = (l + r) / 2;
// cout << l SP r << endl;
if (r - l <= 1)
return;
FOR(i, l, mid) { REP(j, r - mid) ans[i][j + mid] = ans[j + mid][i] = lev; }
solve(l, mid, lev + 1);
solve(mid, r, lev + 1);
return;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
solve(1, n + 1, 1);
REP(i, n - 1) {
FOR(j, i + 1, n) cout << ans[i + 1][j + 1] << " ";
cout << endl;
}
// REP(i,10){
// REP(j,10){ cout << ans[i][j] <<" ";} cout << endl;}
return 0;
} | replace | 60 | 61 | 60 | 61 | 0 | |
p02930 | C++ | Runtime Error | #include <iostream>
#define ll long long
#define mp make_pair
using namespace std;
int main() {
int n;
cin >> n;
if (n == 4)
exit(-1);
} | #include <iostream>
#define ll long long
#define mp make_pair
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
int k = i ^ j, c = 0;
for (; !(k >> c & 1); ++c)
;
cout << c + 1 << ' ';
}
cout << endl;
}
} | replace | 7 | 9 | 7 | 16 | 0 | |
p02930 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
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 <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
const int inf = INT_MAX / 2;
const ll INF = LLONG_MAX / 2;
// template end
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> ans(n);
int maxx = 0;
while ((1 << maxx) < n)
maxx++;
rep(i, 0, n - 1) {
ans[i].resize(n - i);
rep(j, i, n - 1) {
int b = -1;
rep(k, 0, maxx) if (((i >> k) & 1) != (((j + 1) >> k) & 1)) b = k;
ans[i][j] = b;
}
}
rep(i, 0, n - 1) {
rep(j, 0, n - i - 1) printf("%d ", ans[i][j] + 1);
printf("\n");
}
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
typedef pair<ll, ll> P;
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 <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
const int inf = INT_MAX / 2;
const ll INF = LLONG_MAX / 2;
// template end
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> ans(n);
int maxx = 0;
while ((1 << maxx) < n)
maxx++;
rep(i, 0, n - 1) {
ans[i].resize(n - i);
rep(j, i, n - 1) {
int b = -1;
rep(k, 0, maxx) if (((i >> k) & 1) != (((j + 1) >> k) & 1)) b = k;
ans[i][j - i] = b;
}
}
rep(i, 0, n - 1) {
rep(j, 0, n - i - 1) printf("%d ", ans[i][j] + 1);
printf("\n");
}
return 0;
}
| replace | 44 | 45 | 44 | 45 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[300][300];
void dfs(int l, int r, int c) {
if (r - l <= 1)
return;
int mid = (l + r) / 2;
for (int i = l; i < mid; i++) {
for (int j = mid; j < r; j++) {
a[i][j] = a[j][i] = c;
}
}
dfs(l, mid, c + 1);
dfs(mid, r, c + 1);
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N;
cin >> N;
dfs(0, N, 1);
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[501][501];
void dfs(int l, int r, int c) {
if (r - l <= 1)
return;
int mid = (l + r) / 2;
for (int i = l; i < mid; i++) {
for (int j = mid; j < r; j++) {
a[i][j] = a[j][i] = c;
}
}
dfs(l, mid, c + 1);
dfs(mid, r, c + 1);
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
int N;
cin >> N;
dfs(0, N, 1);
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
return true;
}
return false;
}
int n;
int v[1000][1000];
void solve(vector<int> &elm, int col) {
int m = elm.size();
if (m == 1)
return;
assert(m % 2 == 0);
vector<int> a, b;
for (int i = 0; i < m; ++i)
(i % 2 ? b : a).push_back(elm[i]);
for (auto x : a)
for (auto y : b)
v[x][y] = col;
solve(a, col + 1);
solve(b, col + 1);
}
signed main() {
cin >> n;
vector<int> t(n);
iota(t.begin(), t.end(), 0);
solve(t, 1);
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
cout << max(v[i][j], v[j][i]) << " \n"[j == n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
return true;
}
return false;
}
int n;
int v[1000][1000];
void solve(vector<int> &elm, int col) {
int m = elm.size();
if (m == 1)
return;
vector<int> a, b;
for (int i = 0; i < m; ++i)
(i % 2 ? b : a).push_back(elm[i]);
for (auto x : a)
for (auto y : b)
v[x][y] = col;
solve(a, col + 1);
solve(b, col + 1);
}
signed main() {
cin >> n;
vector<int> t(n);
iota(t.begin(), t.end(), 0);
solve(t, 1);
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
cout << max(v[i][j], v[j][i]) << " \n"[j == n - 1];
}
| delete | 32 | 33 | 32 | 32 | -6 | 33b3e308-112d-44d9-83e5-6bab4af43b37.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02930/C++/s338110212.cpp:36: void solve(std::vector<int>&, int): Assertion `m % 2 == 0' failed.
|
p02930 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long n, ans[505][505], gap, cont;
int main() {
cin >> n;
cont = 1;
for (int i = 0; (1ll << i) <= n; i++) {
gap = (1ll << i);
for (int j = 0; j < gap; j++) {
for (int z = j + 1; z < gap; z++) {
if (j < n && z < n) {
ans[j + gap][z + gap] = ans[j][z];
}
}
}
for (int j = 0; j < gap; j++) {
for (int z = 0; z < gap; z++) {
if ((z + gap) < n)
ans[j][z + gap] = cont;
}
}
cont++;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++)
cout << ans[i][j] << " ";
cout << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, ans[505][505], gap, cont;
int main() {
cin >> n;
cont = 1;
for (int i = 0; (1ll << i) <= n; i++) {
gap = (1ll << i);
for (int j = 0; j < gap; j++) {
for (int z = j + 1; z < gap; z++) {
if ((j + gap) < n && (z + gap) < n) {
ans[j + gap][z + gap] = ans[j][z];
}
}
}
for (int j = 0; j < gap; j++) {
for (int z = 0; z < gap; z++) {
if ((z + gap) < n)
ans[j][z + gap] = cont;
}
}
cont++;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++)
cout << ans[i][j] << " ";
cout << "\n";
}
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02930 | C++ | Runtime Error | // #pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#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 SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define m0(x) memset(x, 0, sizeof(x))
#define print(x) cout << x << '\n';
#define pe(x) cout << x << " ";
#define lb(v, n) lower_bound(v.begin(), v.end(), n);
#define ub(v, n) upper_bound(v.begin(), v.end(), n);
#define int long long
#define all(x) (x).begin(), (x).end()
// #define double long double
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double EPS = 1e-10;
typedef pair<int, int> P;
const int MAX = 200020;
int ans[202][202];
void solve(vector<int> v, int base) {
if (v.size() == 1)
return;
REP(i, v.size()) {
for (int j = i + 1; j < v.size(); j += 2) {
ans[v[i]][v[j]] = base;
}
}
vector<int> v1, v2;
REP(i, v.size()) {
if (i % 2 == 0) {
v1.pb(v[i]);
} else {
v2.pb(v[i]);
}
}
solve(v1, base + 1);
solve(v2, base + 1);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> v;
REP(i, N) { v.pb(i); }
solve(v, 1);
REP(i, N - 1) {
FOR(j, i + 1, N) { pe(ans[i][j]); }
cout << endl;
}
}
| // #pragma GCC optimize ("-O3","unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#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 SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define m0(x) memset(x, 0, sizeof(x))
#define print(x) cout << x << '\n';
#define pe(x) cout << x << " ";
#define lb(v, n) lower_bound(v.begin(), v.end(), n);
#define ub(v, n) upper_bound(v.begin(), v.end(), n);
#define int long long
#define all(x) (x).begin(), (x).end()
// #define double long double
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1);
const double EPS = 1e-10;
typedef pair<int, int> P;
const int MAX = 200020;
int ans[502][502];
void solve(vector<int> v, int base) {
if (v.size() == 1)
return;
REP(i, v.size()) {
for (int j = i + 1; j < v.size(); j += 2) {
ans[v[i]][v[j]] = base;
}
}
vector<int> v1, v2;
REP(i, v.size()) {
if (i % 2 == 0) {
v1.pb(v[i]);
} else {
v2.pb(v[i]);
}
}
solve(v1, base + 1);
solve(v2, base + 1);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> v;
REP(i, N) { v.pb(i); }
solve(v, 1);
REP(i, N - 1) {
FOR(j, i + 1, N) { pe(ans[i][j]); }
cout << endl;
}
}
| replace | 64 | 65 | 64 | 65 | 0 | |
p02930 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> ans(n, vector<int>(n, -1));
vector<int> group(n, 0);
for (int level = 1;; level++) {
vector<int> grcnt(n), sgcnt(n);
for (int i = 0; i < n; i++) {
grcnt[group[i]]++;
}
for (int i = 0; i < n; i++) {
int thres = grcnt[group[i]] / 2;
if (sgcnt[group[i]]++ < thres) {
group[i] = group[i] * 2 + 1;
} else {
group[i] = group[i] * 2;
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (ans[i][j] > 0)
continue;
if (group[i] != group[j]) {
ans[i][j] = level;
ans[j][i] = level;
cnt++;
}
}
}
if (cnt == 0)
break;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
printf("%d%c", ans[i][j], " \n"[(j + 1 == n) ? 1 : 0]);
}
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <thread>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<vector<int>> ans(n, vector<int>(n, -1));
vector<int> group(n, 0);
for (int level = 1;; level++) {
vector<int> grcnt(n * 3), sgcnt(n * 3);
for (int i = 0; i < n; i++) {
grcnt[group[i]]++;
}
for (int i = 0; i < n; i++) {
int thres = grcnt[group[i]] / 2;
if (sgcnt[group[i]]++ < thres) {
group[i] = group[i] * 2 + 1;
} else {
group[i] = group[i] * 2;
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (ans[i][j] > 0)
continue;
if (group[i] != group[j]) {
ans[i][j] = level;
ans[j][i] = level;
cnt++;
}
}
}
if (cnt == 0)
break;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
printf("%d%c", ans[i][j], " \n"[(j + 1 == n) ? 1 : 0]);
}
}
return 0;
}
| replace | 29 | 30 | 29 | 30 | 0 | |
p02931 | C++ | Time Limit Exceeded | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e5;
int n, Vr, Vc;
long long ans;
struct MERGESET {
int fa[4 * N + 3], cntx[4 * N + 3], cnty[4 * N + 3];
void Init(int Vn) {
for (int i = 1; i <= Vn; i++) {
fa[i] = i;
if (i <= n)
cntx[i] = 1, cnty[i] = 0;
else
cntx[i] = 0, cnty[i] = 1;
}
}
int FindFa(int x) { return fa[x] == x ? x : FindFa(fa[x]); }
void Merge(int x, int y) {
int fx = FindFa(x), fy = FindFa(y);
if (fx == fy)
return;
fa[fx] = fy;
cntx[fy] += cntx[fx];
cntx[fx] = 0;
cnty[fy] += cnty[fx];
cnty[fx] = 0;
}
} mgset;
struct NODE {
int x, y, val;
} nod[N + 3];
bool cmpNODE(NODE Ca, NODE Cb) { return Ca.val > Cb.val; }
int main() {
scanf("%d%d%d", &n, &Vr, &Vc);
mgset.Init(n + Vr + Vc);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &nod[i].x, &nod[i].y, &nod[i].val);
sort(nod + 1, nod + 1 + n, cmpNODE);
for (int i = 1; i <= n; i++) {
int x = nod[i].x, y = nod[i].y;
int fx = mgset.FindFa(x + n), fy = mgset.FindFa(y + n + Vr);
int cntx, cnty;
if (fx == fy)
cntx = mgset.cntx[fx], cnty = mgset.cnty[fx];
else
cntx = mgset.cntx[fx] + mgset.cntx[fy],
cnty = mgset.cnty[fx] + mgset.cnty[fy];
if (cntx + 1 > cnty)
continue;
ans += nod[i].val;
mgset.Merge(i, x + n);
mgset.Merge(x + n, y + n + Vr);
}
printf("%lld\n", ans);
return 0;
} | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e5;
int n, Vr, Vc;
long long ans;
struct MERGESET {
int fa[4 * N + 3], cntx[4 * N + 3], cnty[4 * N + 3];
void Init(int Vn) {
for (int i = 1; i <= Vn; i++) {
fa[i] = i;
if (i <= n)
cntx[i] = 1, cnty[i] = 0;
else
cntx[i] = 0, cnty[i] = 1;
}
}
int FindFa(int x) { return fa[x] = fa[x] == x ? x : FindFa(fa[x]); }
void Merge(int x, int y) {
int fx = FindFa(x), fy = FindFa(y);
if (fx == fy)
return;
fa[fx] = fy;
cntx[fy] += cntx[fx];
cntx[fx] = 0;
cnty[fy] += cnty[fx];
cnty[fx] = 0;
}
} mgset;
struct NODE {
int x, y, val;
} nod[N + 3];
bool cmpNODE(NODE Ca, NODE Cb) { return Ca.val > Cb.val; }
int main() {
scanf("%d%d%d", &n, &Vr, &Vc);
mgset.Init(n + Vr + Vc);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &nod[i].x, &nod[i].y, &nod[i].val);
sort(nod + 1, nod + 1 + n, cmpNODE);
for (int i = 1; i <= n; i++) {
int x = nod[i].x, y = nod[i].y;
int fx = mgset.FindFa(x + n), fy = mgset.FindFa(y + n + Vr);
int cntx, cnty;
if (fx == fy)
cntx = mgset.cntx[fx], cnty = mgset.cnty[fx];
else
cntx = mgset.cntx[fx] + mgset.cntx[fy],
cnty = mgset.cnty[fx] + mgset.cnty[fy];
if (cntx + 1 > cnty)
continue;
ans += nod[i].val;
mgset.Merge(i, x + n);
mgset.Merge(x + n, y + n + Vr);
}
printf("%lld\n", ans);
return 0;
} | replace | 22 | 23 | 22 | 23 | TLE | |
p02931 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 20608
int n;
struct edge {
int x, y, c;
};
bool operator<(edge a, edge b) { return a.c > b.c; }
edge e[nn];
int pa[nn];
int find(int x) {
if (pa[x] == x)
return x;
return pa[x] = find(pa[x]);
}
int w, h;
int loop[nn];
int used[nn];
signed main() {
for (int i = 0; i < nn; i++)
pa[i] = i;
scanf("%lld%lld%lld", &n, &h, &w);
int ans = 0;
for (int i = 1; i <= n; i++)
scanf("%lld%lld%lld", &e[i].x, &e[i].y, &e[i].c), e[i].y += nn / 2 - 1;
sort(e + 1, e + n + 1);
for (int i = 1; i <= n; i++) {
int x = e[i].x, y = e[i].y; //
if (find(x) == find(y)) {
if (loop[find(x)] == 0)
loop[find(x)] = 1, ans += e[i].c;
continue;
}
if (loop[find(x)] & loop[find(y)])
continue;
loop[find(y)] |= loop[find(x)];
pa[find(x)] = find(y);
ans += e[i].c;
}
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 206008
int n;
struct edge {
int x, y, c;
};
bool operator<(edge a, edge b) { return a.c > b.c; }
edge e[nn];
int pa[nn];
int find(int x) {
if (pa[x] == x)
return x;
return pa[x] = find(pa[x]);
}
int w, h;
int loop[nn];
int used[nn];
signed main() {
for (int i = 0; i < nn; i++)
pa[i] = i;
scanf("%lld%lld%lld", &n, &h, &w);
int ans = 0;
for (int i = 1; i <= n; i++)
scanf("%lld%lld%lld", &e[i].x, &e[i].y, &e[i].c), e[i].y += nn / 2 - 1;
sort(e + 1, e + n + 1);
for (int i = 1; i <= n; i++) {
int x = e[i].x, y = e[i].y; //
if (find(x) == find(y)) {
if (loop[find(x)] == 0)
loop[find(x)] = 1, ans += e[i].c;
continue;
}
if (loop[find(x)] & loop[find(y)])
continue;
loop[find(y)] |= loop[find(x)];
pa[find(x)] = find(y);
ans += e[i].c;
}
printf("%lld\n", ans);
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02931 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
struct union_find {
VI par, sz, data;
void init(int n) {
sz.assign(n, 1);
data.assign(n, 1);
par.resize(n);
REP(i, n) par[i] = i;
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void merge(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
data[x] = 0;
} else {
sz[y] += sz[x];
par[x] = y;
data[y] &= data[x];
}
}
bool is_tree(int x) { return data[find(x)]; }
};
int main() {
int n, h, w;
cin >> n >> h >> w;
vector<pair<ll, P>> p(n);
REP(i, n) {
p[i].second = P(in() - 1, in() - 1);
p[i].first = in();
}
sort(ALL(p));
reverse(ALL(p));
union_find uf;
uf.init(h + w);
ll ans = 0;
for (auto tmp : p) {
ll x = tmp.first;
int r = tmp.second.first;
int c = tmp.second.second;
c += h;
if (uf.is_tree(r) || uf.is_tree(c)) {
ans += x;
uf.merge(r, c);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
struct union_find {
VI par, sz, data;
void init(int n) {
sz.assign(n, 1);
data.assign(n, 1);
par.resize(n);
REP(i, n) par[i] = i;
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void merge(int x, int y) {
x = find(x);
y = find(y);
if (x == y) {
data[x] = 0;
} else {
sz[y] += sz[x];
par[x] = y;
data[y] &= data[x];
}
}
bool is_tree(int x) { return data[find(x)]; }
};
int main() {
int n, h, w;
cin >> n >> h >> w;
vector<pair<ll, P>> p(n);
REP(i, n) {
p[i].second.first = in() - 1;
p[i].second.second = in() - 1;
p[i].first = in();
}
sort(ALL(p));
reverse(ALL(p));
union_find uf;
uf.init(h + w);
ll ans = 0;
for (auto tmp : p) {
ll x = tmp.first;
int r = tmp.second.first;
int c = tmp.second.second;
c += h;
if (uf.is_tree(r) || uf.is_tree(c)) {
ans += x;
uf.merge(r, c);
}
}
cout << ans << endl;
return 0;
}
| replace | 91 | 92 | 91 | 93 | 0 | |
p02931 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 200200;
const long long mod = 1e9 + 7;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int m;
int q;
int p[N];
vector<int> v[N], backup;
bool used[N];
bool dfs(int x) {
used[x] = true;
backup.push_back(x);
for (int y : v[x]) {
if (p[y] == -1) {
p[y] = x;
return true;
} else if (!used[p[y]] && dfs(p[y])) {
p[y] = x;
return true;
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> q >> n >> m;
for (int i = 1; i <= n + m; i++) {
p[i] = -1;
}
vector<pair<int, int>> qu;
for (int i = 1; i <= q; i++) {
int x, y, w;
cin >> x >> y >> w;
v[i].push_back(x);
v[i].push_back(y + n);
qu.push_back({w, i});
shuffle(v[i].begin(), v[i].end(), rng);
}
sort(qu.begin(), qu.end());
reverse(qu.begin(), qu.end());
long long res = 0;
for (auto g : qu) {
if (dfs(g.se)) {
res += g.fi;
}
while (!backup.empty()) {
used[backup.back()] = false;
backup.pop_back();
}
}
cout << res << "\n";
}
| #include <bits/stdc++.h>
#define fi first
#define se second
const int N = 200200;
const long long mod = 1e9 + 7;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int m;
int q;
int p[N];
vector<int> v[N], backup;
bool used[N];
bool dfs(int x) {
used[x] = true;
backup.push_back(x);
for (int y : v[x]) {
if (p[y] == -1) {
p[y] = x;
return true;
} else if (!used[p[y]] && dfs(p[y])) {
p[y] = x;
return true;
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> q >> n >> m;
for (int i = 1; i <= n + m; i++) {
p[i] = -1;
}
vector<pair<int, int>> qu;
for (int i = 1; i <= q; i++) {
int x, y, w;
cin >> x >> y >> w;
v[i].push_back(x);
v[i].push_back(y + n);
qu.push_back({w, i});
shuffle(v[i].begin(), v[i].end(), rng);
}
sort(qu.begin(), qu.end());
reverse(qu.begin(), qu.end());
long long res = 0;
for (auto g : qu) {
if (dfs(g.se)) {
res += g.fi;
while (!backup.empty()) {
used[backup.back()] = false;
backup.pop_back();
}
}
}
cout << res << "\n";
}
| replace | 60 | 64 | 60 | 64 | TLE | |
p02931 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
struct edge {
ll R, C, A;
bool operator<(const edge &right) const { return A < right.A; }
};
// par[i] は，iがrootなら-(連結成分のサイズ)を，iがrootではないならばrootを返す
// root(x) は必ずroot を返す
struct UnionFindSize {
vector<int> par;
UnionFindSize(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, H, W;
cin >> N >> H >> W;
vector<edge> edges;
REP(i, N) {
ll R, C, A;
cin >> R >> C >> A;
R--, C--;
edges.push_back(edge{R, C, A});
}
sort(edges.rbegin(), edges.rend());
UnionFindSize uf(H + W);
vector<ll> cnt(N, 0);
ll res = 0;
REP(i, N) {
ll r1 = uf.root(edges[i].R);
ll r2 = uf.root(H + edges[i].C);
ll s1 = uf.size(r1);
ll s2 = uf.size(r2);
ll e1 = cnt[r1];
ll e2 = cnt[r2];
if (r1 == r2) {
if (s1 > e1) {
res += edges[i].A;
cnt[r1]++;
}
} else {
if (s1 + s2 > e1 + e2) {
res += edges[i].A;
uf.merge(r1, r2);
cnt[uf.root(r1)] = e1 + e2 + 1;
}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
struct edge {
ll R, C, A;
bool operator<(const edge &right) const { return A < right.A; }
};
// par[i] は，iがrootなら-(連結成分のサイズ)を，iがrootではないならばrootを返す
// root(x) は必ずroot を返す
struct UnionFindSize {
vector<int> par;
UnionFindSize(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, H, W;
cin >> N >> H >> W;
vector<edge> edges;
REP(i, N) {
ll R, C, A;
cin >> R >> C >> A;
R--, C--;
edges.push_back(edge{R, C, A});
}
sort(edges.rbegin(), edges.rend());
UnionFindSize uf(H + W);
vector<ll> cnt(H + W, 0);
ll res = 0;
REP(i, N) {
ll r1 = uf.root(edges[i].R);
ll r2 = uf.root(H + edges[i].C);
ll s1 = uf.size(r1);
ll s2 = uf.size(r2);
ll e1 = cnt[r1];
ll e2 = cnt[r2];
if (r1 == r2) {
if (s1 > e1) {
res += edges[i].A;
cnt[r1]++;
}
} else {
if (s1 + s2 > e1 + e2) {
res += edges[i].A;
uf.merge(r1, r2);
cnt[uf.root(r1)] = e1 + e2 + 1;
}
}
}
cout << res << endl;
return 0;
} | replace | 96 | 97 | 96 | 97 | 0 | |
p02931 | 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)
template <class T> inline bool cmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
template <class T> inline bool cmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
using namespace std;
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 100100
#define ll long long
inline int read() {
int x = 0;
bool t = false;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
t = true, ch = getchar();
while (ch <= '9' && ch >= '0')
x = x * 10 + ch - 48, ch = getchar();
return t ? -x : x;
}
ll ans;
int n, h, w, tot, f[MAX];
bool cir[MAX];
struct edge {
int u, v, w;
} E[MAX];
bool operator<(edge a, edge b) { return a.w > b.w; }
int getf(int x) { return x == f[x] ? x : f[x] = getf(f[x]); }
int main() {
scanf("%d%d%d", &n, &h, &w);
for (int i = 1; i <= h + w; ++i)
f[i] = i;
fp(i, 1, n) {
R int x, y, c;
scanf("%d%d%d", &x, &y, &c);
E[++tot] = (edge){x, y + h, c};
}
// for(int i=1;i<=n;++i)
// for(int j=1;j<=m;++j)
// E[++tot]=(edge){i,j+n,read()};
sort(&E[1], &E[tot + 1]);
for (int i = 1; i <= tot; ++i) {
int u = getf(E[i].u), v = getf(E[i].v);
if (u == v) {
if (!cir[u])
cir[u] = true, ans += E[i].w;
} else if (!cir[u] || !cir[v])
f[u] = v, ans += E[i].w, cir[v] |= cir[u];
}
printf("%lld\n", ans);
return 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)
template <class T> inline bool cmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
template <class T> inline bool cmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
using namespace std;
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 500005
#define ll long long
inline int read() {
int x = 0;
bool t = false;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
t = true, ch = getchar();
while (ch <= '9' && ch >= '0')
x = x * 10 + ch - 48, ch = getchar();
return t ? -x : x;
}
ll ans;
int n, h, w, tot, f[MAX];
bool cir[MAX];
struct edge {
int u, v, w;
} E[MAX];
bool operator<(edge a, edge b) { return a.w > b.w; }
int getf(int x) { return x == f[x] ? x : f[x] = getf(f[x]); }
int main() {
scanf("%d%d%d", &n, &h, &w);
for (int i = 1; i <= h + w; ++i)
f[i] = i;
fp(i, 1, n) {
R int x, y, c;
scanf("%d%d%d", &x, &y, &c);
E[++tot] = (edge){x, y + h, c};
}
// for(int i=1;i<=n;++i)
// for(int j=1;j<=m;++j)
// E[++tot]=(edge){i,j+n,read()};
sort(&E[1], &E[tot + 1]);
for (int i = 1; i <= tot; ++i) {
int u = getf(E[i].u), v = getf(E[i].v);
if (u == v) {
if (!cir[u])
cir[u] = true, ans += E[i].w;
} else if (!cir[u] || !cir[v])
f[u] = v, ans += E[i].w, cir[v] |= cir[u];
}
printf("%lld\n", ans);
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02931 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ds[100100], isFull[100100];
int get(int x) { return ds[x] == x ? x : ds[x] = get(ds[x]); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, h, w, r, c, a;
vector<pair<int, int>> edges[100100];
cin >> n >> h >> w;
while (n--) {
cin >> r >> c >> a;
edges[a].push_back({r, c + h});
}
for (int i = 1; i <= w + h; i++)
ds[i] = i;
long long ans = 0;
for (int a = 100000; a; a--)
for (auto u : edges[a]) {
int x = get(u.first), y = get(u.second);
if (x != y) {
if (isFull[x] && isFull[y])
continue;
ds[x] = y;
isFull[y] |= isFull[x];
ans += a;
} else if (!isFull[x]) {
ans += a;
isFull[x] = 1;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int ds[200100], isFull[200100];
int get(int x) { return ds[x] == x ? x : ds[x] = get(ds[x]); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, h, w, r, c, a;
vector<pair<int, int>> edges[100100];
cin >> n >> h >> w;
while (n--) {
cin >> r >> c >> a;
edges[a].push_back({r, c + h});
}
for (int i = 1; i <= w + h; i++)
ds[i] = i;
long long ans = 0;
for (int a = 100000; a; a--)
for (auto u : edges[a]) {
int x = get(u.first), y = get(u.second);
if (x != y) {
if (isFull[x] && isFull[y])
continue;
ds[x] = y;
isFull[y] |= isFull[x];
ans += a;
} else if (!isFull[x]) {
ans += a;
isFull[x] = 1;
}
}
cout << ans << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02932 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
const ll Mod = 1e9 + 7;
ll fac[Maxn + 5], inv_fac[Maxn + 5];
ll QuickPow(ll a, ll k) {
ll ret = 1;
while (k) {
if (k & 1)
ret = (ret * a) % Mod;
a = (a * a) % Mod;
k >>= 1;
}
return ret;
}
void init() {
fac[0] = 1;
for (int i = 1; i <= Maxn; i++)
fac[i] = fac[i - 1] * i % Mod;
inv_fac[0] = 1, inv_fac[Maxn] = QuickPow(fac[Maxn], Mod - 2);
for (int i = Maxn - 1; i >= 1; i--)
inv_fac[i] = inv_fac[i + 1] * (i + 1) % Mod;
}
ll C(int n, int m) { return fac[n] * inv_fac[m] % Mod * inv_fac[n - m] % Mod; }
ll calc(int n, int m, int num, int l, int r) {
if (num - r * m < 0)
return 0;
else
num -= (r * m);
ll ret = 0;
for (int i = 0, dir = 1; i <= n - m && num >= 0; i++, num -= l, dir *= -1)
ret =
(ret + 1LL * dir * C(num + n, n) % Mod * C(n - m, i) % Mod + Mod) % Mod;
return ret * C(n, m) % Mod;
}
ll Solve(int n, int m, int num) {
ll ret = C(n + num, n);
for (int i = num; i >= 1; i--) {
int del = (calc(n, m, num, i, i) - calc(n, m, num, i, i + 1) + Mod) % Mod;
ret = (ret - del + Mod) % Mod;
}
return ret;
}
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int N, M, L, R;
init();
scanf("%d %d %d %d", &N, &M, &L, &R);
printf("%lld\n", (Solve(N, M, R) - Solve(N, M, L - 1) + Mod) % Mod);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
const int Maxn = 1e6;
const ll Mod = 1e9 + 7;
ll fac[Maxn + 5], inv_fac[Maxn + 5];
ll QuickPow(ll a, ll k) {
ll ret = 1;
while (k) {
if (k & 1)
ret = (ret * a) % Mod;
a = (a * a) % Mod;
k >>= 1;
}
return ret;
}
void init() {
fac[0] = 1;
for (int i = 1; i <= Maxn; i++)
fac[i] = fac[i - 1] * i % Mod;
inv_fac[0] = 1, inv_fac[Maxn] = QuickPow(fac[Maxn], Mod - 2);
for (int i = Maxn - 1; i >= 1; i--)
inv_fac[i] = inv_fac[i + 1] * (i + 1) % Mod;
}
ll C(int n, int m) { return fac[n] * inv_fac[m] % Mod * inv_fac[n - m] % Mod; }
ll calc(int n, int m, int num, int l, int r) {
if (num - 1LL * r * m < 0)
return 0;
else
num -= (r * m);
ll ret = 0;
for (int i = 0, dir = 1; i <= n - m && num >= 0; i++, num -= l, dir *= -1)
ret =
(ret + 1LL * dir * C(num + n, n) % Mod * C(n - m, i) % Mod + Mod) % Mod;
return ret * C(n, m) % Mod;
}
ll Solve(int n, int m, int num) {
ll ret = C(n + num, n);
for (int i = num; i >= 1; i--) {
int del = (calc(n, m, num, i, i) - calc(n, m, num, i, i + 1) + Mod) % Mod;
ret = (ret - del + Mod) % Mod;
}
return ret;
}
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int N, M, L, R;
init();
scanf("%d %d %d %d", &N, &M, &L, &R);
printf("%lld\n", (Solve(N, M, R) - Solve(N, M, L - 1) + Mod) % Mod);
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02932 | C++ | Time Limit Exceeded | #define DEBUG 0
/**
* File : F.cpp
* Author : Kazune Takahashi
* Created : 9/6/2019, 3:42:36 PM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using ll = long long;
class mint {
public:
static ll MOD;
ll x;
mint() : x(0) {}
mint(ll x) : x(x % MOD) {}
mint operator-() const { return x ? MOD - x : 0; }
mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD) {
x -= MOD;
}
return *this;
}
mint &operator-=(const mint &a) { return *this += -a; }
mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
mint &operator/=(const mint &a) {
mint b{a};
return *this *= b.power(MOD - 2);
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
mint operator/(const mint &a) const { return mint(*this) /= a; }
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
const mint power(ll N) {
if (N == 0) {
return 1;
} else if (N % 2 == 1) {
return *this * power(N - 1);
} else {
mint half = power(N / 2);
return half * half;
}
}
};
ll mint::MOD = 1e9 + 7;
istream &operator>>(istream &stream, mint &a) { return stream >> a.x; }
ostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }
class combination {
public:
vector<mint> inv, fact, factinv;
static int MAX_SIZE;
combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE) {
inv[1] = 1;
for (auto i = 2; i < MAX_SIZE; i++) {
inv[i] = (-inv[mint::MOD % i]) * (mint::MOD / i);
}
fact[0] = factinv[0] = 1;
for (auto i = 1; i < MAX_SIZE; i++) {
fact[i] = mint(i) * fact[i - 1];
factinv[i] = inv[i] * factinv[i - 1];
}
}
mint operator()(int n, int k) {
if (n >= 0 && k >= 0 && n - k >= 0) {
return fact[n] * factinv[k] * factinv[n - k];
}
return 0;
}
};
int combination::MAX_SIZE = 1000010;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
// constexpr double epsilon = 1e-10;
// constexpr ll infty = 1000000000000000LL;
// constexpr int dx[4] = {1, 0, -1, 0};
// constexpr int dy[4] = {0, 1, 0, -1};
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
combination C{};
mint solve(ll N, ll K, ll R, ll x) {
mint ans{};
for (auto l = K; l <= N; l++) {
if (R - l * x + N < 0) {
break;
}
if ((l + K) % 2 == 0) {
ans += C(l, K) * C(N, l) * C(R - l * x + N, N);
} else {
ans -= C(l, K) * C(N, l) * C(R - l * x + N, N);
}
}
return ans;
}
mint f(ll N, ll K, ll R) {
mint ans{C(R + N, N)};
for (auto x = 0; x <= R; x++) {
ans -= (solve(N, K, R, x) - solve(N, K, R - K, x));
}
return ans;
}
int main() {
ll N, K, L, R;
cin >> N >> K >> L >> R;
cout << f(N, K, R) - f(N, K, L - 1) << endl;
} | #define DEBUG 0
/**
* File : F.cpp
* Author : Kazune Takahashi
* Created : 9/6/2019, 3:42:36 PM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using ll = long long;
class mint {
public:
static ll MOD;
ll x;
mint() : x(0) {}
mint(ll x) : x(x % MOD) {}
mint operator-() const { return x ? MOD - x : 0; }
mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD) {
x -= MOD;
}
return *this;
}
mint &operator-=(const mint &a) { return *this += -a; }
mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
mint &operator/=(const mint &a) {
mint b{a};
return *this *= b.power(MOD - 2);
}
mint operator+(const mint &a) const { return mint(*this) += a; }
mint operator-(const mint &a) const { return mint(*this) -= a; }
mint operator*(const mint &a) const { return mint(*this) *= a; }
mint operator/(const mint &a) const { return mint(*this) /= a; }
bool operator<(const mint &a) const { return x < a.x; }
bool operator==(const mint &a) const { return x == a.x; }
const mint power(ll N) {
if (N == 0) {
return 1;
} else if (N % 2 == 1) {
return *this * power(N - 1);
} else {
mint half = power(N / 2);
return half * half;
}
}
};
ll mint::MOD = 1e9 + 7;
istream &operator>>(istream &stream, mint &a) { return stream >> a.x; }
ostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }
class combination {
public:
vector<mint> inv, fact, factinv;
static int MAX_SIZE;
combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE) {
inv[1] = 1;
for (auto i = 2; i < MAX_SIZE; i++) {
inv[i] = (-inv[mint::MOD % i]) * (mint::MOD / i);
}
fact[0] = factinv[0] = 1;
for (auto i = 1; i < MAX_SIZE; i++) {
fact[i] = mint(i) * fact[i - 1];
factinv[i] = inv[i] * factinv[i - 1];
}
}
mint operator()(int n, int k) {
if (n >= 0 && k >= 0 && n - k >= 0) {
return fact[n] * factinv[k] * factinv[n - k];
}
return 0;
}
};
int combination::MAX_SIZE = 1000010;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
// constexpr double epsilon = 1e-10;
// constexpr ll infty = 1000000000000000LL;
// constexpr int dx[4] = {1, 0, -1, 0};
// constexpr int dy[4] = {0, 1, 0, -1};
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
combination C{};
mint solve(ll N, ll K, ll R, ll x) {
mint ans{};
for (auto l = K; l <= N; l++) {
if (R - l * x < 0) {
break;
}
if ((l + K) % 2 == 0) {
ans += C(l, K) * C(N, l) * C(R - l * x + N, N);
} else {
ans -= C(l, K) * C(N, l) * C(R - l * x + N, N);
}
}
return ans;
}
mint f(ll N, ll K, ll R) {
mint ans{C(R + N, N)};
for (auto x = 0; x <= R; x++) {
ans -= (solve(N, K, R, x) - solve(N, K, R - K, x));
}
return ans;
}
int main() {
ll N, K, L, R;
cin >> N >> K >> L >> R;
cout << f(N, K, R) - f(N, K, L - 1) << endl;
} | replace | 117 | 118 | 117 | 118 | TLE | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <int MAX> struct Combination {
vector<long long> _inv, _fac, _ifac;
const long long MOD;
Combination(long long mod)
: _inv(MAX + 1), _fac(MAX + 1), _ifac(MAX + 1), MOD(mod) {
init();
}
inline void init(long long mod = 0) { init_inv(), init_fac(); }
inline void init_inv() {
_inv[0] = 0;
for (int i = 1; i <= MAX; i++) {
if (i == 1)
_inv[i] = 1;
else {
_inv[i] = (MOD - (MOD / i) * _inv[MOD % i]) % MOD;
if (_inv[i] < 0)
_inv[i] += MOD;
}
}
}
inline void init_fac() {
_fac[0] = _ifac[0] = 1;
for (int i = 1; i <= MAX; i++) {
_fac[i] = _fac[i - 1] * i % MOD;
_ifac[i] = _ifac[i - 1] * _inv[i] % MOD;
}
}
inline long long modpow(long long n, long long r) {
n %= MOD, r %= (MOD - 1);
if (!n)
return 0;
long long ret = 1;
long long tmp = n;
while (r != 0) {
if (r % 2)
ret *= tmp;
tmp *= tmp;
tmp %= MOD;
ret %= MOD;
r /= 2;
}
return ret;
}
inline const long long invb(int i) {
return (i <= MAX) ? _inv[i] : this->modpow(i, MOD - 2);
}
inline const long long inv(int i) { return _inv[i]; }
inline const long long fac(int i) { return _fac[i]; }
inline const long long ifac(int i) { return _ifac[i]; }
const long long operator()(int n, int r) {
if (n < r)
return 0;
return fac(n) * ifac(r) % MOD * ifac(n - r) % MOD;
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
constexpr int MAX = 600000;
constexpr int mod = 1000000007;
Combination<MAX> C(mod);
int n, m, l, r;
cin >> n >> m >> l >> r;
vector<long long> x(r + 1, 0);
vector<long long> y(r + 1, 0);
for (int a = 1; a <= r; a++) {
for (int i = 0; i <= n - m; i++) {
if ((m + i) * a > r)
break;
if (i & 1)
x[(m + i) * a] -= C(n - m, i);
else
x[(m + i) * a] += C(n - m, i);
x[(m + i) * a] = (x[(m + i) * a] + mod) % mod;
}
}
for (int i = r; i >= m; i--) {
x[i] = (x[i] - x[i - m] + mod) % mod;
}
for (int i = 0; i <= r; i++)
y[i] = C(n + i, i);
auto calc = [&](int l) {
long long ret = 0;
for (int i = 0; i <= l; i++) {
ret += x[i] * y[l - i] % mod;
}
return ret % mod;
};
long long sub = (calc(r) - calc(l - 1) + mod) % mod * C(n, m) % mod;
long long all = 0;
for (int i = l; i <= r; i++)
all += C(i + n - 1, i);
cout << (all - sub + mod) % mod << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <int MAX> struct Combination {
vector<long long> _inv, _fac, _ifac;
const long long MOD;
Combination(long long mod)
: _inv(MAX + 1), _fac(MAX + 1), _ifac(MAX + 1), MOD(mod) {
init();
}
inline void init(long long mod = 0) { init_inv(), init_fac(); }
inline void init_inv() {
_inv[0] = 0;
for (int i = 1; i <= MAX; i++) {
if (i == 1)
_inv[i] = 1;
else {
_inv[i] = (MOD - (MOD / i) * _inv[MOD % i]) % MOD;
if (_inv[i] < 0)
_inv[i] += MOD;
}
}
}
inline void init_fac() {
_fac[0] = _ifac[0] = 1;
for (int i = 1; i <= MAX; i++) {
_fac[i] = _fac[i - 1] * i % MOD;
_ifac[i] = _ifac[i - 1] * _inv[i] % MOD;
}
}
inline long long modpow(long long n, long long r) {
n %= MOD, r %= (MOD - 1);
if (!n)
return 0;
long long ret = 1;
long long tmp = n;
while (r != 0) {
if (r % 2)
ret *= tmp;
tmp *= tmp;
tmp %= MOD;
ret %= MOD;
r /= 2;
}
return ret;
}
inline const long long invb(int i) {
return (i <= MAX) ? _inv[i] : this->modpow(i, MOD - 2);
}
inline const long long inv(int i) { return _inv[i]; }
inline const long long fac(int i) { return _fac[i]; }
inline const long long ifac(int i) { return _ifac[i]; }
const long long operator()(int n, int r) {
if (n < r)
return 0;
return fac(n) * ifac(r) % MOD * ifac(n - r) % MOD;
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
constexpr int MAX = 600000;
constexpr int mod = 1000000007;
Combination<MAX> C(mod);
int n, m, l, r;
cin >> n >> m >> l >> r;
vector<long long> x(r + 1, 0);
vector<long long> y(r + 1, 0);
for (int a = 1; a <= r; a++) {
for (int i = 0; i <= n - m; i++) {
if ((long long)(m + i) * a > r)
break;
if (i & 1)
x[(m + i) * a] -= C(n - m, i);
else
x[(m + i) * a] += C(n - m, i);
x[(m + i) * a] = (x[(m + i) * a] + mod) % mod;
}
}
for (int i = r; i >= m; i--) {
x[i] = (x[i] - x[i - m] + mod) % mod;
}
for (int i = 0; i <= r; i++)
y[i] = C(n + i, i);
auto calc = [&](int l) {
long long ret = 0;
for (int i = 0; i <= l; i++) {
ret += x[i] * y[l - i] % mod;
}
return ret % mod;
};
long long sub = (calc(r) - calc(l - 1) + mod) % mod * C(n, m) % mod;
long long all = 0;
for (int i = l; i <= r; i++)
all += C(i + n - 1, i);
cout << (all - sub + mod) % mod << "\n";
return 0;
} | replace | 74 | 75 | 74 | 75 | 0 | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const int P = 1e9 + 7;
#define fr(i, low, up, st) for (register int i = low; i <= up; i += st)
#define nfr(i, low, up, st) for (register int i = low; i >= up; i -= st)
#define size(a) a.size()
#define fill(a, b) memset(a, b, sizeof a)
int fact[N], inv[N];
inline int pow_mod(int x, int k) {
int res = 1, base = x;
while (k) {
if (k & 1)
res = 1LL * res * base % P;
k >>= 1;
base = 1LL * base * base % P;
}
return res;
}
void init() {
fact[0] = inv[0] = 1;
fr(i, 1, N - 1, 1) fact[i] = 1LL * fact[i - 1] * i % P;
inv[N - 1] = pow_mod(fact[N - 1], P - 2);
nfr(i, N - 2, 1, 1) inv[i] = 1LL * inv[i + 1] * (i + 1) % P;
}
inline int c(int n, int m) {
if (n < m)
return 0;
return 1LL * fact[n] * inv[n - m] % P * inv[m] % P;
}
void Mod(int &x) {
x = (x >= P) ? x - P : x;
x = (x < 0) ? x + P : x;
}
int n, m;
int calc(int up, int a, int b) {
int pans = 0;
for (int k = 0; k * (b + 1) + a * m <= up && k + m <= n; ++k) {
Mod(pans += 1LL * pow_mod(-1, k) * c(up - a * m - k * (b + 1) + n, n) *
c(n - m, k) % P);
}
// cerr << up <<' '<< a << ' ' << b <<' ' << pans << endl;
return 1LL * pans * c(n, m) % P;
}
int solve(int up) {
int ans = 0;
fr(i, 1, up, 1) {
Mod(ans += calc(up, i, i - 1) - calc(up, i + 1, i - 1));
// cerr << i <<' '<< ans << endl;
}
Mod(ans = c(up + n, n) - ans);
return ans;
}
int main() {
init();
int L, R;
scanf("%d%d%d%d", &n, &m, &L, &R);
int fans = 0;
Mod(fans = solve(R) - solve(L - 1));
printf("%d\n", fans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
const int P = 1e9 + 7;
#define fr(i, low, up, st) for (register int i = low; i <= up; i += st)
#define nfr(i, low, up, st) for (register int i = low; i >= up; i -= st)
#define size(a) a.size()
#define fill(a, b) memset(a, b, sizeof a)
int fact[N], inv[N];
inline int pow_mod(int x, int k) {
int res = 1, base = x;
while (k) {
if (k & 1)
res = 1LL * res * base % P;
k >>= 1;
base = 1LL * base * base % P;
}
return res;
}
void init() {
fact[0] = inv[0] = 1;
fr(i, 1, N - 1, 1) fact[i] = 1LL * fact[i - 1] * i % P;
inv[N - 1] = pow_mod(fact[N - 1], P - 2);
nfr(i, N - 2, 1, 1) inv[i] = 1LL * inv[i + 1] * (i + 1) % P;
}
inline int c(int n, int m) {
if (n < m)
return 0;
return 1LL * fact[n] * inv[n - m] % P * inv[m] % P;
}
void Mod(int &x) {
x = (x >= P) ? x - P : x;
x = (x < 0) ? x + P : x;
}
int n, m;
int calc(int up, int a, int b) {
int pans = 0;
for (int k = 0; 1LL * k * (b + 1) + 1LL * a * m <= up && k + m <= n; ++k) {
Mod(pans += 1LL * pow_mod(-1, k) * c(up - a * m - k * (b + 1) + n, n) *
c(n - m, k) % P);
}
// cerr << up <<' '<< a << ' ' << b <<' ' << pans << endl;
return 1LL * pans * c(n, m) % P;
}
int solve(int up) {
int ans = 0;
fr(i, 1, up, 1) {
Mod(ans += calc(up, i, i - 1) - calc(up, i + 1, i - 1));
// cerr << i <<' '<< ans << endl;
}
Mod(ans = c(up + n, n) - ans);
return ans;
}
int main() {
init();
int L, R;
scanf("%d%d%d%d", &n, &m, &L, &R);
int fans = 0;
Mod(fans = solve(R) - solve(L - 1));
printf("%d\n", fans);
return 0;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool mmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>,
rb_tree_tag, tree_order_statistics_node_update>; template<typename TK, typename
TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag,
tree_order_statistics_node_update>;
*/
constexpr lint MOD = 1000000007;
vector<lint> fac, facInv, inv;
void facInit(int nmax) {
fac = facInv = inv = vector<lint>(nmax + 1, 1);
for (int i = 2; i <= nmax; 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;
}
}
lint nCr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= (int)fac.size())
facInit(n);
return (fac[n] * facInv[r] % MOD) * facInv[n - r] % MOD;
}
lint nPr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= (int)fac.size())
facInit(n);
return fac[n] * facInv[n - r] % MOD;
}
lint power(lint x, lint n, lint mod = MOD) {
lint ans = 1;
while (n > 0) {
if (n & 1)
(ans *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ans;
}
lint doublefac(lint n) {
if (n < 0)
return 0;
lint k = (n + 1) / 2;
if (n & 1)
return fac[k * 2] * power(facInv[2], k) % MOD * power(fac[k], MOD - 2) %
MOD;
else
return fac[k] * power(facInv[2], k) % MOD;
}
lint solve(lint N, lint M, lint X) {
if (X == 0)
return 1;
lint ret = nCr(N + X, N);
lint yo = 0;
FOR(x, 1, X + 1) {
lint tmp = 0;
REP(bad, X / x + 1) {
lint t = nCr(X - x * (M + bad) + N, N) -
nCr(X - (x + 1) * M - x * bad + N, N) + MOD;
lint ttmp = nCr(N, M) * nCr(N - M, bad) % MOD * (t % MOD) % MOD;
if (bad % 2)
tmp = (tmp - ttmp + MOD) % MOD;
else
tmp = (tmp + ttmp) % MOD;
}
yo += tmp;
}
return (ret + MOD - yo % MOD) % MOD;
};
int main() {
facInit(1e6);
lint N, M, L, R;
cin >> N >> M >> L >> R;
cout << (solve(N, M, R) - solve(N, M, L - 1) + MOD) % MOD << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {
os << "deq[";
for (auto v : vec)
os << v << ",";
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {
os << "{";
for (auto v : vec)
os << v << ",";
os << "}";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
os << "(" << pa.first << "," << pa.second << ")";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {
os << "{";
for (auto v : mp)
os << v.first << "=>" << v.second << ",";
os << "}";
return os;
}
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
template <typename T> bool mmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
#define dbg(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>,
rb_tree_tag, tree_order_statistics_node_update>; template<typename TK, typename
TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag,
tree_order_statistics_node_update>;
*/
constexpr lint MOD = 1000000007;
vector<lint> fac, facInv, inv;
void facInit(int nmax) {
fac = facInv = inv = vector<lint>(nmax + 1, 1);
for (int i = 2; i <= nmax; 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;
}
}
lint nCr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= (int)fac.size())
facInit(n);
return (fac[n] * facInv[r] % MOD) * facInv[n - r] % MOD;
}
lint nPr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= (int)fac.size())
facInit(n);
return fac[n] * facInv[n - r] % MOD;
}
lint power(lint x, lint n, lint mod = MOD) {
lint ans = 1;
while (n > 0) {
if (n & 1)
(ans *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ans;
}
lint doublefac(lint n) {
if (n < 0)
return 0;
lint k = (n + 1) / 2;
if (n & 1)
return fac[k * 2] * power(facInv[2], k) % MOD * power(fac[k], MOD - 2) %
MOD;
else
return fac[k] * power(facInv[2], k) % MOD;
}
lint solve(lint N, lint M, lint X) {
if (X == 0)
return 1;
lint ret = nCr(N + X, N);
lint yo = 0;
FOR(x, 1, X + 1) {
lint tmp = 0;
REP(bad, X / x + 1) {
lint rem = X - 1LL * x * (M + bad);
if (rem < 0)
break;
lint t = nCr(rem + N, N);
lint rem2 = X - (x + 1LL) * M - 1LL * x * bad;
if (rem2 >= 0)
t = t - nCr(rem2 + N, N) + MOD;
lint ttmp = nCr(N, M) * nCr(N - M, bad) % MOD * (t % MOD) % MOD;
if (bad % 2)
tmp = (tmp - ttmp + MOD) % MOD;
else
tmp = (tmp + ttmp) % MOD;
}
yo += tmp;
}
return (ret + MOD - yo % MOD) % MOD;
};
int main() {
facInit(1e6);
lint N, M, L, R;
cin >> N >> M >> L >> R;
cout << (solve(N, M, R) - solve(N, M, L - 1) + MOD) % MOD << endl;
}
| replace | 185 | 187 | 185 | 192 | 0 | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5, mod = 1e9 + 7;
typedef long long ll;
int n, m, l, r;
ll f[N], inv[N], invf[N];
ll C(int n, int m) { return f[n] * invf[n - m] % mod * invf[m] % mod; }
ll g(int x, int y, int k) {
int s = k - x * m;
ll res = 0;
for (int i = 0, f = 1; i * y <= s && i <= n - m; i++, f *= -1)
res = (res + f * C(n - m, i) % mod * C(s - i * y + n, n)) % mod;
return res;
}
ll solve(int k) {
ll ans = 0;
for (int x = 1; x * m <= k; x++)
ans = (ans + g(x, x, k) - g(x + 1, x, k)) % mod;
return (C(k + n, n) - ans * C(n, m)) % mod;
}
int main() {
f[0] = f[1] = invf[0] = invf[1] = inv[1] = 1;
for (int i = 2; i < N; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
f[i] = f[i - 1] * i % mod;
invf[i] = invf[i - 1] * inv[i] % mod;
}
scanf("%d%d%d%d", &n, &m, &l, &r);
printf("%lld\n", ((solve(r) - solve(l - 1)) % mod + mod) % mod);
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 6e5 + 5, mod = 1e9 + 7;
typedef long long ll;
int n, m, l, r;
ll f[N], inv[N], invf[N];
ll C(int n, int m) { return f[n] * invf[n - m] % mod * invf[m] % mod; }
ll g(int x, int y, int k) {
int s = k - x * m;
ll res = 0;
for (int i = 0, f = 1; i * y <= s && i <= n - m; i++, f *= -1)
res = (res + f * C(n - m, i) % mod * C(s - i * y + n, n)) % mod;
return res;
}
ll solve(int k) {
ll ans = 0;
for (int x = 1; x * m <= k; x++)
ans = (ans + g(x, x, k) - g(x + 1, x, k)) % mod;
return (C(k + n, n) - ans * C(n, m)) % mod;
}
int main() {
f[0] = f[1] = invf[0] = invf[1] = inv[1] = 1;
for (int i = 2; i < N; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
f[i] = f[i - 1] * i % mod;
invf[i] = invf[i - 1] * inv[i] % mod;
}
scanf("%d%d%d%d", &n, &m, &l, &r);
printf("%lld\n", ((solve(r) - solve(l - 1)) % mod + mod) % mod);
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02932 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
typedef long long LL;
const LL P = 1e9 + 7;
const int N = 6e5 + 5;
int fac[N], ifac[N];
int n, m, L, R;
int pw(LL x, int n) {
LL res = 1;
for (; n; n >>= 1, x = x * x % P)
if (n & 1)
res = res * x % P;
return res;
}
int C(int x, int y) {
if (y < 0 || y > x)
return 0;
return 1ll * fac[x] * ifac[y] % P * ifac[x - y] % P;
}
int calc(int n, int sumL, int sumR) {
return (C(sumR + n, n) - C(sumL - 1 + n, n) + P) % P;
}
int main() {
fac[0] = 1;
rep(i, 1, N - 1) fac[i] = 1ll * fac[i - 1] * i % P;
ifac[N - 1] = pw(fac[N - 1], P - 2);
rrep(i, N - 2, 0) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % P;
cin >> n >> m >> L >> R;
int sall = calc(n, L, R), s1 = 0;
rep(i, 1, R) {
int sL = L - m * i, sR = R - m * i, r = i - 1, res = 0;
if (sR < 0)
break;
rep(j, 0, n - m) {
int sl = sL - j * (r + 1), sr = sR - j * (r + 1);
if (sr < 0)
break;
res =
(res + (j % 2 == 0 ? 1ll : -1ll) * calc(n, sl, sr) * C(n - m, j) % P +
P) %
P;
}
sL = L - m * (i + 1), sR = R - m * (i + 1);
rep(j, 0, n - m) {
int sl = sL - j * (r + 1), sr = sR - j * (r + 1);
if (sR < 0)
break;
res =
(res - (j % 2 == 0 ? 1ll : -1ll) * calc(n, sl, sr) * C(n - m, j) % P +
P) %
P;
}
s1 = (s1 + 1ll * res * C(n, m) % P) % P;
}
cout << (sall - s1 + P) % P << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
typedef long long LL;
const LL P = 1e9 + 7;
const int N = 6e5 + 5;
int fac[N], ifac[N];
int n, m, L, R;
int pw(LL x, int n) {
LL res = 1;
for (; n; n >>= 1, x = x * x % P)
if (n & 1)
res = res * x % P;
return res;
}
int C(int x, int y) {
if (y < 0 || y > x)
return 0;
return 1ll * fac[x] * ifac[y] % P * ifac[x - y] % P;
}
int calc(int n, int sumL, int sumR) {
return (C(sumR + n, n) - C(sumL - 1 + n, n) + P) % P;
}
int main() {
fac[0] = 1;
rep(i, 1, N - 1) fac[i] = 1ll * fac[i - 1] * i % P;
ifac[N - 1] = pw(fac[N - 1], P - 2);
rrep(i, N - 2, 0) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % P;
cin >> n >> m >> L >> R;
int sall = calc(n, L, R), s1 = 0;
rep(i, 1, R) {
int sL = L - m * i, sR = R - m * i, r = i - 1, res = 0;
if (sR < 0)
break;
rep(j, 0, n - m) {
int sl = sL - j * (r + 1), sr = sR - j * (r + 1);
if (sr < 0)
break;
res =
(res + (j % 2 == 0 ? 1ll : -1ll) * calc(n, sl, sr) * C(n - m, j) % P +
P) %
P;
}
sL = L - m * (i + 1), sR = R - m * (i + 1);
rep(j, 0, n - m) {
int sl = sL - j * (r + 1), sr = sR - j * (r + 1);
if (sr < 0)
break;
res =
(res - (j % 2 == 0 ? 1ll : -1ll) * calc(n, sl, sr) * C(n - m, j) % P +
P) %
P;
}
s1 = (s1 + 1ll * res * C(n, m) % P) % P;
}
cout << (sall - s1 + P) % P << endl;
return 0;
} | replace | 54 | 55 | 54 | 55 | TLE | |
p02932 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
template <typename... Types> struct dynarr : std::vector<Types...> {
using std::vector<Types...>::vector;
using size_type = typename std::vector<Types...>::size_type;
auto &&operator[](size_type i) { return this->at(i); }
auto &&operator[](size_type i) const { return this->at(i); }
};
template <i64 M> struct modint {
i64 a;
constexpr modint(const i64 x = 0) noexcept : a((x % M + M) % M) {}
constexpr i64 value() const noexcept { return a; }
constexpr modint &operator+=(const modint r) noexcept {
a += r.a;
if (a >= M)
a -= M;
return *this;
}
constexpr modint &operator=(const i64 r) {
a = (r % M + M) % M;
return *this;
}
constexpr modint &operator-=(const modint r) noexcept {
a -= r.a;
if (a < 0)
a += M;
return *this;
}
constexpr modint &operator*=(const modint r) noexcept {
a = a * r.a % M;
return *this;
}
constexpr modint &operator/=(modint r) noexcept {
i64 ex = M - 2;
while (ex) {
if (ex & 1) {
*this *= r;
}
r *= r;
ex >>= 1;
}
return *this;
}
constexpr modint operator+(const modint r) const {
return modint(*this) += r;
}
constexpr modint operator-(const modint r) const {
return modint(*this) -= r;
}
constexpr modint operator*(const modint r) const {
return modint(*this) *= r;
}
constexpr modint operator/(const modint r) const {
return modint(*this) /= r;
}
};
using fp = modint<(i64)(1e9 + 7)>;
const int MAX = 510000;
fp fac[MAX], finv[MAX];
void COMinit() {
fac[0] = 1;
for (i64 i = 1; i < MAX; i++) {
fac[i] = fac[i - 1] * fp(i);
}
finv[MAX - 1] = fp(1) / fac[MAX - 1];
for (i64 i = MAX - 2; i >= 0; i--) {
finv[i] = finv[i + 1] * fp(i + 1);
}
}
fp 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]);
}
int main() {
COMinit();
i64 N, M, L, R;
cin >> N >> M >> L >> R;
// (1 - T)^(N - M)
dynarr<fp> f(R + 1);
rep(i, 0, R + 1) {
f[i] = com(N - M, i);
if (i % 2 == 1)
f[i] *= fp(-1);
}
// T^M * (1 - T)^(N - M)
dynarr<fp> F(R + 1);
rep(i, M, R + 1) { F[i] = f[i - M]; }
// P = sigma(k = 1 ~ inf) { F(T^k) }
dynarr<fp> P(R + 1);
for (i64 i = 1; i <= R; i++) {
for (i64 k = 1; i * k <= R; k++) {
P[i * k] += F[i];
}
}
// (1 / (1 - T))^(N + 1)
dynarr<fp> q(R + 1);
rep(n, 0, R + 1) { q[n] = com(n + (N + 1) - 1, (N + 1) - 1); }
// (1 - T^M) * (1 / (1 - T))^(N + 1)
dynarr<fp> Q(R + 1);
rep(i, 0, R + 1) {
Q[i] = q[i];
if (i - M >= 0)
Q[i] -= q[i - M];
}
fp Sr = 0;
for (i64 i = 0; i <= R; i++) {
Sr += P[i] * Q[R - i];
}
fp Sl = 0;
L--;
for (i64 i = 0; i <= L; i++) {
Sl += P[i] * Q[L - i];
}
fp rev = (Sr - Sl) * com(N, M);
fp al = q[R] - q[L];
cout << (al - rev).value() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define all(x) x.begin(), x.end()
#define let auto const
template <typename... Types> struct dynarr : std::vector<Types...> {
using std::vector<Types...>::vector;
using size_type = typename std::vector<Types...>::size_type;
auto &&operator[](size_type i) { return this->at(i); }
auto &&operator[](size_type i) const { return this->at(i); }
};
template <i64 M> struct modint {
i64 a;
constexpr modint(const i64 x = 0) noexcept : a((x % M + M) % M) {}
constexpr i64 value() const noexcept { return a; }
constexpr modint &operator+=(const modint r) noexcept {
a += r.a;
if (a >= M)
a -= M;
return *this;
}
constexpr modint &operator=(const i64 r) {
a = (r % M + M) % M;
return *this;
}
constexpr modint &operator-=(const modint r) noexcept {
a -= r.a;
if (a < 0)
a += M;
return *this;
}
constexpr modint &operator*=(const modint r) noexcept {
a = a * r.a % M;
return *this;
}
constexpr modint &operator/=(modint r) noexcept {
i64 ex = M - 2;
while (ex) {
if (ex & 1) {
*this *= r;
}
r *= r;
ex >>= 1;
}
return *this;
}
constexpr modint operator+(const modint r) const {
return modint(*this) += r;
}
constexpr modint operator-(const modint r) const {
return modint(*this) -= r;
}
constexpr modint operator*(const modint r) const {
return modint(*this) *= r;
}
constexpr modint operator/(const modint r) const {
return modint(*this) /= r;
}
};
using fp = modint<(i64)(1e9 + 7)>;
const int MAX = 606060;
fp fac[MAX], finv[MAX];
void COMinit() {
fac[0] = 1;
for (i64 i = 1; i < MAX; i++) {
fac[i] = fac[i - 1] * fp(i);
}
finv[MAX - 1] = fp(1) / fac[MAX - 1];
for (i64 i = MAX - 2; i >= 0; i--) {
finv[i] = finv[i + 1] * fp(i + 1);
}
}
fp 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]);
}
int main() {
COMinit();
i64 N, M, L, R;
cin >> N >> M >> L >> R;
// (1 - T)^(N - M)
dynarr<fp> f(R + 1);
rep(i, 0, R + 1) {
f[i] = com(N - M, i);
if (i % 2 == 1)
f[i] *= fp(-1);
}
// T^M * (1 - T)^(N - M)
dynarr<fp> F(R + 1);
rep(i, M, R + 1) { F[i] = f[i - M]; }
// P = sigma(k = 1 ~ inf) { F(T^k) }
dynarr<fp> P(R + 1);
for (i64 i = 1; i <= R; i++) {
for (i64 k = 1; i * k <= R; k++) {
P[i * k] += F[i];
}
}
// (1 / (1 - T))^(N + 1)
dynarr<fp> q(R + 1);
rep(n, 0, R + 1) { q[n] = com(n + (N + 1) - 1, (N + 1) - 1); }
// (1 - T^M) * (1 / (1 - T))^(N + 1)
dynarr<fp> Q(R + 1);
rep(i, 0, R + 1) {
Q[i] = q[i];
if (i - M >= 0)
Q[i] -= q[i - M];
}
fp Sr = 0;
for (i64 i = 0; i <= R; i++) {
Sr += P[i] * Q[R - i];
}
fp Sl = 0;
L--;
for (i64 i = 0; i <= L; i++) {
Sl += P[i] * Q[L - i];
}
fp rev = (Sr - Sl) * com(N, M);
fp al = q[R] - q[L];
cout << (al - rev).value() << endl;
}
| replace | 66 | 67 | 66 | 67 | 0 | |
p02932 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 600005;
const int MOD = 1000000007;
int n, m, L, R;
long long fac[N], inv[N];
long long ksm(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD, b >>= 1;
}
return res;
}
void init(int n = 600000) {
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % MOD;
inv[n] = ksm(fac[n], MOD - 2);
for (int i = n; i >= 1; i--)
inv[i - 1] = inv[i] * i % MOD;
return;
}
long long C(int n, int m) {
if (m > n)
return 0;
else
return fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}
long long calc(int x, int p, int q) {
x -= 1LL * m * p;
if (x < 0)
return 0;
long long res = 0;
for (int i = 0; i <= n - m && x - 1LL * i * q >= 0; i++)
if (i & 1)
res = (res - C(n - m, i) * C(x - 1LL * i * q + n, n) % MOD + MOD) % MOD;
else
res = (res + C(n - m, i) * C(x - 1LL * i * q + n, n) % MOD) % MOD;
res *= C(n, m);
return res;
}
long long solve(int x) {
long long res = 0;
for (int p = 1; p <= x; p++)
res = (res + (calc(x, p, p) - calc(x, p, p - 1) + MOD) % MOD) % MOD;
res = (C(x + n, n) - res + MOD) % MOD;
return res;
}
int main() {
init();
scanf("%d%d%d%d", &n, &m, &L, &R);
printf("%lld", (solve(R) - solve(L - 1) + MOD) % MOD);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
const int N = 600005;
const int MOD = 1000000007;
int n, m, L, R;
long long fac[N], inv[N];
long long ksm(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD, b >>= 1;
}
return res;
}
void init(int n = 600000) {
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % MOD;
inv[n] = ksm(fac[n], MOD - 2);
for (int i = n; i >= 1; i--)
inv[i - 1] = inv[i] * i % MOD;
return;
}
long long C(int n, int m) {
if (m > n)
return 0;
else
return fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}
long long calc(long long x, int p, int q) {
x -= 1LL * m * p;
if (x < 0)
return 0;
long long res = 0;
for (int i = 0; i <= n - m && x - 1LL * i * q >= 0; i++)
if (i & 1)
res = (res - C(n - m, i) * C(x - 1LL * i * q + n, n) % MOD + MOD) % MOD;
else
res = (res + C(n - m, i) * C(x - 1LL * i * q + n, n) % MOD) % MOD;
res *= C(n, m);
return res;
}
long long solve(int x) {
long long res = 0;
for (int p = 1; p <= x; p++)
res = (res + (calc(x, p, p) - calc(x, p, p - 1) + MOD) % MOD) % MOD;
res = (C(x + n, n) - res + MOD) % MOD;
return res;
}
int main() {
init();
scanf("%d%d%d%d", &n, &m, &L, &R);
printf("%lld", (solve(R) - solve(L - 1) + MOD) % MOD);
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02932 | 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];
template <typename T> inline void write(T 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');
}
template <typename T> inline void pr1(T x) {
write(x);
putchar(' ');
}
template <typename T> inline void pr2(T x) {
write(x);
putchar('\n');
}
const int MAXN = 600005;
const int mod = 1e9 + 7;
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 pow_mod(int a, int b) {
int ret = 1;
for (; b; b >>= 1, a = 1LL * a * a % mod)
if (b & 1)
ret = 1LL * ret * a % mod;
return ret;
}
int pre[MAXN], inv[MAXN];
int C(int n, int m) { return 1LL * pre[n] * inv[m] % mod * inv[n - m] % mod; }
int n, m, L, R;
int query(int p, int q, int lim) //>=p <q
{
int fx = m, fy = n - m, ret = 0;
for (int i = 0; i <= fy; i++) {
int total = lim - i * q - fx * p;
if (total < 0)
break;
int num = 1LL * C(total + n, n) * C(n, fx) % mod * C(n - fx, i) % mod;
if (i & 1)
dl(ret, num);
else
ad(ret, num);
}
return ret;
}
int solve(int lim) {
int ans = 0;
for (int i = 1; i <= lim; i++)
ad(ans, query(i, i, lim)), dl(ans, query(i + 1, i, lim));
return (C(lim + n, n) - ans + mod) % mod;
}
int main() {
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;
n = read();
m = read();
L = read();
R = read();
pr2((solve(R) - solve(L - 1) + mod) % mod);
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];
template <typename T> inline void write(T 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');
}
template <typename T> inline void pr1(T x) {
write(x);
putchar(' ');
}
template <typename T> inline void pr2(T x) {
write(x);
putchar('\n');
}
const int MAXN = 600005;
const int mod = 1e9 + 7;
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 pow_mod(int a, int b) {
int ret = 1;
for (; b; b >>= 1, a = 1LL * a * a % mod)
if (b & 1)
ret = 1LL * ret * a % mod;
return ret;
}
int pre[MAXN], inv[MAXN];
int C(int n, int m) { return 1LL * pre[n] * inv[m] % mod * inv[n - m] % mod; }
int n, m, L, R;
int query(int p, int q, int lim) //>=p <q
{
int fx = m, fy = n - m, ret = 0;
if (1LL * fx * p > lim)
return 0;
for (int i = 0; i <= fy; i++) {
int total = lim - i * q - fx * p;
if (total < 0)
break;
int num = 1LL * C(total + n, n) * C(n, fx) % mod * C(n - fx, i) % mod;
if (i & 1)
dl(ret, num);
else
ad(ret, num);
}
return ret;
}
int solve(int lim) {
int ans = 0;
for (int i = 1; i <= lim; i++)
ad(ans, query(i, i, lim)), dl(ans, query(i + 1, i, lim));
return (C(lim + n, n) - ans + mod) % mod;
}
int main() {
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;
n = read();
m = read();
L = read();
R = read();
pr2((solve(R) - solve(L - 1) + mod) % mod);
return 0;
}
| insert | 79 | 79 | 79 | 81 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define pw(b, p) pow(b, p) + 0.1
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
c_p_c();
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << '\n';
else
cout << "red\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define pw(b, p) pow(b, p) + 0.1
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
c_p_c();
int n;
cin >> n;
string s;
cin >> s;
if (n >= 3200)
cout << s << '\n';
else
cout << "red\n";
return 0;
} | delete | 36 | 40 | 36 | 36 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#define ll long long int
#define f(i, g, n) for (int i = g; i <= n; i++)
int main() {
ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a;
string S;
cin >> a >> S;
a < 3200 ? cout << "red\n" : cout << S << "\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
#define ll long long int
#define f(i, g, n) for (int i = g; i <= n; i++)
int main() {
ios::sync_with_stdio(false);
int a;
string S;
cin >> a >> S;
a < 3200 ? cout << "red\n" : cout << S << "\n";
return 0;
} | delete | 10 | 15 | 10 | 10 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<string> vs;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<pair<string, ll>> vsi;
typedef set<ll> si;
typedef map<ll, ll> mii;
typedef map<string, ll> msi;
typedef tuple<ll, ll, ll> ti;
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
template <typename T, typename... Args> inline string arrStr(T arr, int n) {
stringstream s;
s << "[";
for (int i = 0; i < n - 1; i++)
s << arr[i] << ",";
s << arr[n - 1] << "]";
return s.str();
}
#define EVARS(args...) \
{ \
__evars_begin(__LINE__); \
__evars(split(#args, ',').begin(), args); \
}
inline void __evars_begin(int line) { cerr << "#" << line << ": "; }
template <typename T> inline void __evars_out_var(vector<T> val) {
cerr << arrStr(val, val.size());
}
template <typename T> inline void __evars_out_var(T *val) {
cerr << arrStr(val, 10);
}
template <typename T> inline void __evars_out_var(T val) { cerr << val; }
inline void __evars(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__evars_out_var(a);
cerr << "; ";
__evars(++it, args...);
}
#define pb push_back
#define mk make_pair
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define mod 1000000007
#define ff first
#define ss second
// Loops
#define REP(i, b) for (ll i = 0; i < (ll)(b); i++)
#define F(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define FD(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define RTIME(start, end) ((double)(end - start) / (double)CLOCKS_PER_SEC)
#define D(a) cout << a << endl
#define MAX 1000007
// #define INF 1e18
const ll nmax = 1000 * 1007;
struct edge {
ll a, b, cost;
edge(ll x, ll y, ll z) : a(x), b(y), cost(z){};
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
fastio()
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll x;
string s;
cin >> x >> s;
if (x < 3200)
cout << "red\n";
else
cout << s << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<string> vs;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<pair<string, ll>> vsi;
typedef set<ll> si;
typedef map<ll, ll> mii;
typedef map<string, ll> msi;
typedef tuple<ll, ll, ll> ti;
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
template <typename T, typename... Args> inline string arrStr(T arr, int n) {
stringstream s;
s << "[";
for (int i = 0; i < n - 1; i++)
s << arr[i] << ",";
s << arr[n - 1] << "]";
return s.str();
}
#define EVARS(args...) \
{ \
__evars_begin(__LINE__); \
__evars(split(#args, ',').begin(), args); \
}
inline void __evars_begin(int line) { cerr << "#" << line << ": "; }
template <typename T> inline void __evars_out_var(vector<T> val) {
cerr << arrStr(val, val.size());
}
template <typename T> inline void __evars_out_var(T *val) {
cerr << arrStr(val, 10);
}
template <typename T> inline void __evars_out_var(T val) { cerr << val; }
inline void __evars(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__evars_out_var(a);
cerr << "; ";
__evars(++it, args...);
}
#define pb push_back
#define mk make_pair
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define mod 1000000007
#define ff first
#define ss second
// Loops
#define REP(i, b) for (ll i = 0; i < (ll)(b); i++)
#define F(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)
#define FD(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)
#define fastio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define RTIME(start, end) ((double)(end - start) / (double)CLOCKS_PER_SEC)
#define D(a) cout << a << endl
#define MAX 1000007
// #define INF 1e18
const ll nmax = 1000 * 1007;
struct edge {
ll a, b, cost;
edge(ll x, ll y, ll z) : a(x), b(y), cost(z){};
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
fastio()
ll x;
string s;
cin >> x >> s;
if (x < 3200)
cout << "red\n";
else
cout << s << "\n";
return 0;
}
| replace | 94 | 100 | 94 | 95 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
char s[5];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a;
char s[100];
cin >> a;
cin >> s;
if (a >= 3200) {
cout << s;
} else {
cout << "red";
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
int main() {
int a;
scanf("%d", &a);
char *s;
scanf("%s", s);
if (a >= 3200) {
printf("%s\n", s);
} else {
printf("red\n");
}
return 0;
} | #include <iostream>
int main() {
int a;
scanf("%d", &a);
char s[10];
scanf("%s", s);
if (a >= 3200) {
printf("%s\n", s);
} else {
printf("red\n");
}
return 0;
} | replace | 5 | 6 | 5 | 6 | -11 | |
p02933 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
int a = atoi(argv[1]);
string s = argv[2];
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
// int a = atoi(argv[1]);
// string s = argv[2];
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200) {
cout << "red" << endl;
} else {
cout << s << endl;
}
return 0;
}
| replace | 5 | 7 | 5 | 11 | -11 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define vpll vector<pll>
#define all(x) x.begin(), x.end()
#define present(c, x) ((c).find(x) != (c).end())
#define dbg(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#define sz(a) a.size()
#define vll vector<int>
#define pll pair<int, int>
#define ff first
#define ss second
#define br cout << "\n";
#define ld long double
#define int long long int
const int INF = 1e18 + 7;
const int MAX = 1234567;
const int MOD = 1000000007;
void solve() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
int32_t main() {
int t;
t = 1;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin.sync_with_stdio(0), cin.tie(0);
// cin>>t;
while (t--) {
solve();
br;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define vpll vector<pll>
#define all(x) x.begin(), x.end()
#define present(c, x) ((c).find(x) != (c).end())
#define dbg(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#define sz(a) a.size()
#define vll vector<int>
#define pll pair<int, int>
#define ff first
#define ss second
#define br cout << "\n";
#define ld long double
#define int long long int
const int INF = 1e18 + 7;
const int MAX = 1234567;
const int MOD = 1000000007;
void solve() {
int a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red";
else
cout << s;
}
int32_t main() {
int t;
t = 1;
cin.sync_with_stdio(0), cin.tie(0);
// cin>>t;
while (t--) {
solve();
br;
}
return 0;
}
| delete | 39 | 43 | 39 | 39 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef vector<ll> vl;
#define PB push_back
#define ios() \
ios::sync_with_stdio(false); \
cin.tie(0);
#define scan(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define print(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << "\n";
#define test() \
ll t; \
cin >> t; \
while (t--)
#define endl "\n"
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios() ll a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red\n";
else
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef vector<ll> vl;
#define PB push_back
#define ios() \
ios::sync_with_stdio(false); \
cin.tie(0);
#define scan(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define print(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << "\n";
#define test() \
ll t; \
cin >> t; \
while (t--)
#define endl "\n"
int main() {
ios() ll a;
string s;
cin >> a >> s;
if (a < 3200)
cout << "red\n";
else
cout << s << endl;
return 0;
} | delete | 23 | 27 | 23 | 23 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <functional> // for less
#include <iostream>
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(ar) ar.begin(), ar.end()
#define mp make_pair
#define sot(bello) bello.begin(), bello.end()
#define bitc __builtin_popcountl
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define MAXN 100010
#define MOD 1000000007
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define dbug(x) cout << #x << ": " << x << " "
auto clk = clock();
#define PI 3.1415926535897932385
#define fi first
#define se second
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define INF LLONG_MAX
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0},
dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
/* This Template is authored by Ankit Anvesh */
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// gcd for negatives too
/* ll gcd(ll a, ll b) {
if (a == 0) return b;
if (b == 0) return a;
if (b < 0) return gcd(a, -1 * b);
if (a < 0) return gcd(-1 * a, b);
if (a > b) return gcd(b, a);
return gcd(b%a, a);
}
*/
// gcd
ll Gcd(ll a, ll b) {
if (a % b == 0)
return b;
return Gcd(b, a % b);
}
// max
ll Max(ll a, ll b) {
if (a > b)
return a;
return b;
}
// min
ll Min(ll a, ll b) {
if (a < b)
return a;
return b;
}
void printvector(std::vector<ll> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << "" << endl;
}
void printarray(ll a[], ll n) {
for (ll i = 0; i < n; ++i) {
cout << a[i] << " ";
}
cout << "" << endl;
}
ll findlcm(vector<ll> arr, ll n) {
// Initialize result
ll ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (Gcd(arr[i], ans)));
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
// Base Case
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll a, ll m) {
ll x, y;
ll g = gcdExtended(a, m, &x, &y);
if (g != 1)
return -1;
else {
ll res = (x % m + m) % m;
return res;
}
}
ll inverse(ll x, ll mod) { return power(x, mod - 2, mod); }
vector<ll> primeFactors(ll n) {
vector<ll> v;
while (n % 2 == 0) {
v.push_back(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
v.push_back(i);
n = n / i;
}
}
if (n > 2)
v.push_back(n);
return v;
}
ll lowerbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>=k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] < k)
l = mid + 1;
else {
r = mid - 1;
}
}
return l;
}
ll upperbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] > k)
r = mid - 1;
else {
l = mid + 1;
}
}
return l;
}
ll C[2001][2000];
void binomialCoeff(ll n, ll k) {
ll i, j;
// Caculate value of Binomial Coefficient in bottom up manner
for (i = 0; i <= n; i++) {
for (j = 0; j <= k; j++) {
// Base Cases
if (j == 0 || j == i)
C[i][j] = 1;
// Calculate value using previosly stored values
else
C[i][j] = (C[i - 1][j - 1] % MOD + C[i - 1][j] % MOD) % MOD;
}
}
// return C[n][k];
}
// Manachar's Algorithm
string convertToNewString(const string &s) {
string newString = "@";
for (ll i = 0; i < s.size(); i++) {
newString += "#" + s.substr(i, 1);
}
newString += "#$";
return newString;
}
string longestPalindromeSubstring(const string &s) {
string Q = convertToNewString(s);
ll c = 0, r = 0;
ll P[Q.size() + 4];
memset(P, 0, sizeof(P));
for (ll i = 1; i < Q.size() - 1; i++) {
ll iMirror = c - (i - c);
if (r > i) {
P[i] = min(r - i, P[iMirror]);
}
while (Q[i + 1 + P[i]] == Q[i - 1 - P[i]]) {
P[i]++;
}
if (i + P[i] > r) {
c = i;
r = i + P[i];
}
}
int maxPalindrome = 0;
int centerIndex = 0;
for (int i = 1; i < Q.size() - 1; i++) {
if (P[i] > maxPalindrome) {
maxPalindrome = P[i];
centerIndex = i;
}
}
cout << maxPalindrome << "\n";
return s.substr((centerIndex - 1 - maxPalindrome) / 2, maxPalindrome);
}
ll spf[MAXN];
void sieve() {
spf[1] = 1;
for (int i = 2; i < MAXN; i++)
spf[i] = i;
for (int i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (int i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (int j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
ll binarySearch(ll arr[], ll l, ll r, ll x) {
if (r >= l) {
ll mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
// Segment Tree Implementation
const ll N = 100000;
ll n;
ll tree[2 * N];
void build(ll arr[]) {
for (ll i = 0; i < n; i++) {
tree[n + i] = arr[i];
}
for (ll i = n - 1; i > 0; --i) {
tree[i] = tree[i << 1] + tree[i << 1 | 1];
/* cout<<"i<<1 is "<<(i<<1)<<endl;
cout<<"i<<1 | 1 is "<<(i<<1 | 1)<<endl;*/
}
}
void updateTreeNode(ll p, ll value) {
tree[p + n] = value;
p = p + n;
for (ll i = p; i > 1; i >>= 1) {
tree[i >> 1] = tree[i] + tree[i ^ 1];
}
}
ll query(ll l, ll r) {
ll res = 0;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
res += tree[l++];
}
if (r & 1) {
res += tree[--r];
}
}
return res;
}
// BIT tree
/*ll BIT[100010];
start indexing from 1
void update(ll x,ll val){
for (; x <=n ; x +=(x&(-x)) )
BIT[x]+=val;
}
ll query(ll x){
ll sum=0;
for(;x>0;x -= (x&(-x)) )
sum+=BIT[x];
return sum;
}*/
// Dijkstra's Algorithm
// if x->y (weight=w) then v[x].push_back(mp(y,w));
vector<ll> shortPath(vector<pair<ll, ll>> v[], ll src, ll V = 0) {
set<pair<ll, ll>> setds;
ll sizee = V;
ll IN = INF;
vector<ll> dist(sizee, IN);
setds.insert(make_pair(0, src));
dist[src] = 0;
while (!setds.empty()) {
pair<ll, ll> tmp = *(setds.begin());
setds.erase(setds.begin());
ll u = tmp.second;
vector<pair<ll, ll>>::iterator i;
for (i = v[u].begin(); i != v[u].end(); ++i) {
ll v = (*i).first;
ll weight = (*i).second;
if (dist[v] > dist[u] + weight) {
if (dist[v] != INF)
setds.erase(setds.find(make_pair(dist[v], v)));
dist[v] = dist[u] + weight;
setds.insert(make_pair(dist[v], v));
}
}
}
return dist;
}
ll root(ll a[], ll r) {
if (a[r] == r) {
return r;
} else {
ll x = root(a, a[r]);
a[r] = x;
return x;
}
}
void unio(ll a[], ll size[], ll x, ll y) {
x = root(a, x);
y = root(a, y);
if (x == y) {
return;
}
if (size[x] >= size[y]) {
a[y] = x;
size[x] += size[y];
} else {
a[x] = y;
size[y] += size[x];
}
}
// Sieve Implementation
/*
for (ll i=2;i<=100005;i++)
if (p[i]==0)
for (ll j=2*i;j<=100005;j+=i) p[j]=1; */
// Dfs search
void dfs(std::vector<ll> v[], ll s, bool visited[]) {
visited[s] = true;
for (ll i = 0; i < v[s].size(); ++i) {
if (!visited[v[s][i]]) {
dfs(v, v[s][i], visited);
}
}
}
// do not use n , N , C
// Using iterators in C++
// set<ll>:: iterator it;
// string to integer stuuu()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
void solve() {
ll a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
// freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <functional> // for less
#include <iostream>
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(ar) ar.begin(), ar.end()
#define mp make_pair
#define sot(bello) bello.begin(), bello.end()
#define bitc __builtin_popcountl
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define MAXN 100010
#define MOD 1000000007
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define dbug(x) cout << #x << ": " << x << " "
auto clk = clock();
#define PI 3.1415926535897932385
#define fi first
#define se second
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define INF LLONG_MAX
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0},
dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
/* This Template is authored by Ankit Anvesh */
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// gcd for negatives too
/* ll gcd(ll a, ll b) {
if (a == 0) return b;
if (b == 0) return a;
if (b < 0) return gcd(a, -1 * b);
if (a < 0) return gcd(-1 * a, b);
if (a > b) return gcd(b, a);
return gcd(b%a, a);
}
*/
// gcd
ll Gcd(ll a, ll b) {
if (a % b == 0)
return b;
return Gcd(b, a % b);
}
// max
ll Max(ll a, ll b) {
if (a > b)
return a;
return b;
}
// min
ll Min(ll a, ll b) {
if (a < b)
return a;
return b;
}
void printvector(std::vector<ll> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << "" << endl;
}
void printarray(ll a[], ll n) {
for (ll i = 0; i < n; ++i) {
cout << a[i] << " ";
}
cout << "" << endl;
}
ll findlcm(vector<ll> arr, ll n) {
// Initialize result
ll ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (Gcd(arr[i], ans)));
return ans;
}
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
// Base Case
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll a, ll m) {
ll x, y;
ll g = gcdExtended(a, m, &x, &y);
if (g != 1)
return -1;
else {
ll res = (x % m + m) % m;
return res;
}
}
ll inverse(ll x, ll mod) { return power(x, mod - 2, mod); }
vector<ll> primeFactors(ll n) {
vector<ll> v;
while (n % 2 == 0) {
v.push_back(2);
n = n / 2;
}
for (int i = 3; i <= sqrt(n); i = i + 2) {
while (n % i == 0) {
v.push_back(i);
n = n / i;
}
}
if (n > 2)
v.push_back(n);
return v;
}
ll lowerbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>=k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] < k)
l = mid + 1;
else {
r = mid - 1;
}
}
return l;
}
ll upperbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] > k)
r = mid - 1;
else {
l = mid + 1;
}
}
return l;
}
ll C[2001][2000];
void binomialCoeff(ll n, ll k) {
ll i, j;
// Caculate value of Binomial Coefficient in bottom up manner
for (i = 0; i <= n; i++) {
for (j = 0; j <= k; j++) {
// Base Cases
if (j == 0 || j == i)
C[i][j] = 1;
// Calculate value using previosly stored values
else
C[i][j] = (C[i - 1][j - 1] % MOD + C[i - 1][j] % MOD) % MOD;
}
}
// return C[n][k];
}
// Manachar's Algorithm
string convertToNewString(const string &s) {
string newString = "@";
for (ll i = 0; i < s.size(); i++) {
newString += "#" + s.substr(i, 1);
}
newString += "#$";
return newString;
}
string longestPalindromeSubstring(const string &s) {
string Q = convertToNewString(s);
ll c = 0, r = 0;
ll P[Q.size() + 4];
memset(P, 0, sizeof(P));
for (ll i = 1; i < Q.size() - 1; i++) {
ll iMirror = c - (i - c);
if (r > i) {
P[i] = min(r - i, P[iMirror]);
}
while (Q[i + 1 + P[i]] == Q[i - 1 - P[i]]) {
P[i]++;
}
if (i + P[i] > r) {
c = i;
r = i + P[i];
}
}
int maxPalindrome = 0;
int centerIndex = 0;
for (int i = 1; i < Q.size() - 1; i++) {
if (P[i] > maxPalindrome) {
maxPalindrome = P[i];
centerIndex = i;
}
}
cout << maxPalindrome << "\n";
return s.substr((centerIndex - 1 - maxPalindrome) / 2, maxPalindrome);
}
ll spf[MAXN];
void sieve() {
spf[1] = 1;
for (int i = 2; i < MAXN; i++)
spf[i] = i;
for (int i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (int i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (int j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
ll binarySearch(ll arr[], ll l, ll r, ll x) {
if (r >= l) {
ll mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
// Segment Tree Implementation
const ll N = 100000;
ll n;
ll tree[2 * N];
void build(ll arr[]) {
for (ll i = 0; i < n; i++) {
tree[n + i] = arr[i];
}
for (ll i = n - 1; i > 0; --i) {
tree[i] = tree[i << 1] + tree[i << 1 | 1];
/* cout<<"i<<1 is "<<(i<<1)<<endl;
cout<<"i<<1 | 1 is "<<(i<<1 | 1)<<endl;*/
}
}
void updateTreeNode(ll p, ll value) {
tree[p + n] = value;
p = p + n;
for (ll i = p; i > 1; i >>= 1) {
tree[i >> 1] = tree[i] + tree[i ^ 1];
}
}
ll query(ll l, ll r) {
ll res = 0;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
res += tree[l++];
}
if (r & 1) {
res += tree[--r];
}
}
return res;
}
// BIT tree
/*ll BIT[100010];
start indexing from 1
void update(ll x,ll val){
for (; x <=n ; x +=(x&(-x)) )
BIT[x]+=val;
}
ll query(ll x){
ll sum=0;
for(;x>0;x -= (x&(-x)) )
sum+=BIT[x];
return sum;
}*/
// Dijkstra's Algorithm
// if x->y (weight=w) then v[x].push_back(mp(y,w));
vector<ll> shortPath(vector<pair<ll, ll>> v[], ll src, ll V = 0) {
set<pair<ll, ll>> setds;
ll sizee = V;
ll IN = INF;
vector<ll> dist(sizee, IN);
setds.insert(make_pair(0, src));
dist[src] = 0;
while (!setds.empty()) {
pair<ll, ll> tmp = *(setds.begin());
setds.erase(setds.begin());
ll u = tmp.second;
vector<pair<ll, ll>>::iterator i;
for (i = v[u].begin(); i != v[u].end(); ++i) {
ll v = (*i).first;
ll weight = (*i).second;
if (dist[v] > dist[u] + weight) {
if (dist[v] != INF)
setds.erase(setds.find(make_pair(dist[v], v)));
dist[v] = dist[u] + weight;
setds.insert(make_pair(dist[v], v));
}
}
}
return dist;
}
ll root(ll a[], ll r) {
if (a[r] == r) {
return r;
} else {
ll x = root(a, a[r]);
a[r] = x;
return x;
}
}
void unio(ll a[], ll size[], ll x, ll y) {
x = root(a, x);
y = root(a, y);
if (x == y) {
return;
}
if (size[x] >= size[y]) {
a[y] = x;
size[x] += size[y];
} else {
a[x] = y;
size[y] += size[x];
}
}
// Sieve Implementation
/*
for (ll i=2;i<=100005;i++)
if (p[i]==0)
for (ll j=2*i;j<=100005;j+=i) p[j]=1; */
// Dfs search
void dfs(std::vector<ll> v[], ll s, bool visited[]) {
visited[s] = true;
for (ll i = 0; i < v[s].size(); ++i) {
if (!visited[v[s][i]]) {
dfs(v, v[s][i], visited);
}
}
}
// do not use n , N , C
// Using iterators in C++
// set<ll>:: iterator it;
// string to integer stuuu()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
void solve() {
ll a;
string s;
cin >> a >> s;
if (a >= 3200)
cout << s << endl;
else
cout << "red" << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| replace | 490 | 496 | 490 | 491 | 0 | |
p02933 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
const int maxn = 15;
using namespace std;
int a;
char s[maxn];
int main() {
while (scanf("%d%s", &a, s)) {
if (a < 3200)
printf("red\n");
else
printf("%s\n", s);
}
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
const int maxn = 15;
using namespace std;
int a;
char s[maxn];
int main() {
while (~scanf("%d%s", &a, s)) {
if (a < 3200)
printf("red\n");
else
printf("%s\n", s);
}
return 0;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// code starts
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200) {
cout << "red";
return 0;
}
cout << s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// code starts
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200) {
cout << "red";
return 0;
}
cout << s;
return 0;
}
| delete | 16 | 20 | 16 | 16 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define MX 200005
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define pw(b, p) pow(b, p) + 0.1
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
c_p_c();
int x;
string s;
cin >> x >> s;
if (x < 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define MX 200005
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define pw(b, p) pow(b, p) + 0.1
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
// c_p_c();
int x;
string s;
cin >> x >> s;
if (x < 3200)
cout << "red\n";
else
cout << s << '\n';
return 0;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p02933 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a;
char *s;
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a;
char s[11];
cin >> a >> s;
cout << (a >= 3200 ? s : "red") << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p02933 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
int main(void) {
int a, ans(0);
char mozi(10);
scanf("%d", &a);
scanf("%s", mozi);
if (a >= 3200)
printf("%s\n", mozi);
else
printf("red\n");
return 0;
}
| #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
int main(void) {
int a, ans(0);
char mozi[10];
scanf("%d %s", &a, mozi);
if (a >= 3200)
printf("%s\n", mozi);
else
printf("red\n");
return 0;
} | replace | 10 | 13 | 10 | 12 | -11 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// #define int cpp_int
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define uset unordered_set
#define umap unordered_map
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vi, greater<int>()>
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define rev(v) reverse(v.begin(), v.end())
#define sz(x) (int)x.size()
#define def(v) memset(v, -1, sizeof(v));
#define def0(v) memset(v, 0, sizeof(v));
#define minv(a) *min_element(all(a))
#define maxv(a) *max_element(all(a))
#define sumv(a) accumulate(all(a), 0)
#define lb lower_bound
#define ub upper_bound
#define desc greater<int>()
#define pb emplace_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout << "\n";
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a / (__gcd(a, b))) * b
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define ip(v) \
for (auto &i : v) \
cin >> i;
#define op(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl;
#define deb(x) cout << "Value of " #x << " : " << x << endl;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200)
cout << "red\n";
else
cout << s << endl;
}
int32_t main() {
fastio cout << setprecision(15) << fixed;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case "<<i<<" : "<<endl;
solve();
}
#ifndef ONLINE_JUDGE
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
#endif
return 0;
} | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;
// #define int cpp_int
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define uset unordered_set
#define umap unordered_map
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vi, greater<int>()>
#define all(v) v.begin(), v.end()
#define part(v, s, e) v.begin() + s, v.begin() + e
#define rev(v) reverse(v.begin(), v.end())
#define sz(x) (int)x.size()
#define def(v) memset(v, -1, sizeof(v));
#define def0(v) memset(v, 0, sizeof(v));
#define minv(a) *min_element(all(a))
#define maxv(a) *max_element(all(a))
#define sumv(a) accumulate(all(a), 0)
#define lb lower_bound
#define ub upper_bound
#define desc greater<int>()
#define pb emplace_back
#define mp make_pair
#define F first
#define S second
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout << "\n";
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a / (__gcd(a, b))) * b
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define ip(v) \
for (auto &i : v) \
cin >> i;
#define op(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl;
#define deb(x) cout << "Value of " #x << " : " << x << endl;
void solve() {
int n;
cin >> n;
string s;
cin >> s;
if (n < 3200)
cout << "red\n";
else
cout << s << endl;
}
int32_t main() {
fastio cout << setprecision(15) << fixed;
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// freopen("error.txt","w",stderr);
// #endif
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case "<<i<<" : "<<endl;
solve();
}
#ifndef ONLINE_JUDGE
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
#endif
return 0;
} | replace | 81 | 86 | 81 | 86 | 0 | |
p02933 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
int a;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
if (a < 3200)
cout << "red" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[15];
int a;
cin >> a;
cin >> s;
if (a >= 3200)
cout << s << endl;
if (a < 3200)
cout << "red" << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02933 | Python | Runtime Error | import sys
input = sys.stdin.readline
# input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
def main():
a = int(input())
s = int(input())
if a >= 3200:
print(s)
else:
print("red")
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
# input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10**18
MOD = 10**9 + 7
def main():
a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print("red")
if __name__ == "__main__":
main()
| replace | 13 | 14 | 13 | 14 | ValueError: invalid literal for int() with base 10: 'pink\n' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s255700245.py", line 24, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s255700245.py", line 15, in main
s = int(input())
ValueError: invalid literal for int() with base 10: 'pink\n'
|
p02933 | Python | Runtime Error | a = input()
s = input()
if a >= 3200:
print(s)
else:
print("red")
| a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print("red")
| replace | 0 | 1 | 0 | 1 | TypeError: '>=' not supported between instances of 'str' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s467462027.py", line 3, in <module>
if a >= 3200:
TypeError: '>=' not supported between instances of 'str' and 'int'
|
p02933 | Python | Runtime Error | a = int(input())
s = int(input())
print(s if a < 3200 else "red")
| a = int(input())
s = input()
print(s if a >= 3200 else "red")
| replace | 1 | 3 | 1 | 3 | ValueError: invalid literal for int() with base 10: 'pink' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02933/Python/s382036046.py", line 2, in <module>
s = int(input())
ValueError: invalid literal for int() with base 10: 'pink'
|
p02933 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return main();
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
string s;
cin >> a;
cin >> s;
if (a < 3200)
cout << "red" << endl;
else
cout << s << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | TLE | |
p02934 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < 3; ++i)
cin >> vec[i];
double res = 0;
for (auto &&v : vec)
res += 1.0 / stol(v);
cout << setprecision(10) << (1.0 / res);
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; ++i)
cin >> vec[i];
double res = 0;
for (auto &&v : vec)
res += 1.0 / stol(v);
cout << setprecision(10) << (1.0 / res);
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02934 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n = 0, input = 0, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
sum += 1 / input;
}
cout << 1 / sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n = 0;
double input = 0.9, sum = 0.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> input;
sum += 1 / input;
}
cout << 1 / sum << endl;
return 0;
} | replace | 4 | 5 | 4 | 6 | 0 | |
p02934 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double n, a[1005], suma = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = 1 / a[i];
suma += a[i];
}
cout << 1 / suma;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02934 | C++ | Runtime Error | #include <iostream>
int main() {
int n, s = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
float a;
std::cin >> a;
s += 1 / a;
}
std::cout << 1 / s;
return 0;
} | #include <iostream>
int main() {
int n;
float s = 0;
std::cin >> n;
for (int i = 0; i < n; i++) {
float a;
std::cin >> a;
s += 1 / a;
}
std::cout << 1 / s;
return 0;
} | replace | 2 | 3 | 2 | 4 | 0 | |
p02934 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A(N);
double ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = 1.0 / A[i];
}
ans = 1.0 / accumulate(A.begin(), A.end(), 0.0);
cout << ans << endl;
return true;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> A(N);
double ans = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i] = 1.0 / A[i];
}
ans = 1.0 / accumulate(A.begin(), A.end(), 0.0);
cout << ans << endl;
return 0;
} | replace | 15 | 16 | 15 | 16 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.