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
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03253 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long mod = 1000000007;
int n = 0, m = 0;
cin >> n;
cin >> m;
int mm = m;
vector<pair<int, int>> vec;
for (int i = 2; i * i <= mm; i++) {
int cnt = 0;
while (mm % i == 0) {
cnt++;
mm /= i;
}
if (cnt > 0) {
vec.emplace_back(make_pair(i, cnt));
// cout << i << " " << cnt << endl;
}
}
if (mm > 1) {
vec.emplace_back(make_pair(mm, 1));
// cout << mm << " " << 1 << endl;
}
long ans = 1;
for (auto p : vec) {
long dp[2][n + 1];
for (int i = 0; i <= n; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= p.second; j++) {
for (int k = 0; k <= j; k++) {
dp[i % 2][j] += dp[1 - (i % 2)][k];
dp[i % 2][j] %= mod;
}
}
for (int j = 0; j <= p.second; j++)
dp[1 - (i % 2)][j] = 0;
}
// cout << dp[n % 2][p.second] << endl;
ans = ans * dp[n % 2][p.second] % mod;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long mod = 1000000007;
int n = 0, m = 0;
cin >> n;
cin >> m;
int mm = m;
vector<pair<int, int>> vec;
for (int i = 2; i * i <= mm; i++) {
int cnt = 0;
while (mm % i == 0) {
cnt++;
mm /= i;
}
if (cnt > 0) {
vec.emplace_back(make_pair(i, cnt));
// cout << i << " " << cnt << endl;
}
}
if (mm > 1) {
vec.emplace_back(make_pair(mm, 1));
// cout << mm << " " << 1 << endl;
}
long ans = 1;
for (auto p : vec) {
long dp[2][p.second + 1];
for (int i = 0; i <= p.second; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= p.second; j++) {
for (int k = 0; k <= j; k++) {
dp[i % 2][j] += dp[1 - (i % 2)][k];
dp[i % 2][j] %= mod;
}
}
for (int j = 0; j <= p.second; j++)
dp[1 - (i % 2)][j] = 0;
}
// cout << dp[n % 2][p.second] << endl;
ans = ans * dp[n % 2][p.second] % mod;
}
cout << ans << endl;
return 0;
} | replace | 36 | 38 | 36 | 38 | 0 | |
p03253 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define REP(var, n) for (int var = 0; var < (n); var++)
#define REPP(var, n) for (int var = 1; var < (n); var++)
#define ALL(c) (c).begin(), (c).end()
ll memo[100100][100];
ll combination(ll n, ll r) {
if (memo[n][r])
return memo[n][r];
if (r == 0 || r == n)
return memo[n][r] = 1;
return (combination(n - 1, r - 1) + combination(n - 1, r)) % MOD;
}
int main() {
ll N, M, i, j;
cin >> N >> M;
ll p = 2;
ll x = M;
ll ans = 1;
while (p * p <= M) {
int cnt = 0;
while (x % p == 0) {
x /= p;
++cnt;
}
if (cnt) {
ans = (ans * combination(N + cnt - 1, cnt)) % MOD;
}
++p;
}
if (x != 1)
ans = (ans * N) % MOD;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define REP(var, n) for (int var = 0; var < (n); var++)
#define REPP(var, n) for (int var = 1; var < (n); var++)
#define ALL(c) (c).begin(), (c).end()
ll memo[100100][100];
ll combination(ll n, ll r) {
if (memo[n][r])
return memo[n][r];
if (r == 0 || r == n)
return memo[n][r] = 1;
return memo[n][r] = (combination(n - 1, r - 1) + combination(n - 1, r)) % MOD;
}
int main() {
ll N, M, i, j;
cin >> N >> M;
ll p = 2;
ll x = M;
ll ans = 1;
while (p * p <= M) {
int cnt = 0;
while (x % p == 0) {
x /= p;
++cnt;
}
if (cnt) {
ans = (ans * combination(N + cnt - 1, cnt)) % MOD;
}
++p;
}
if (x != 1)
ans = (ans * N) % MOD;
cout << ans << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | TLE | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int, int>, int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int MAX = 10000;
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;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
int main() {
cout << fixed << setprecision(15);
ll N, M;
cin >> N >> M;
// for(auto p : prime_factor(N)) {
// while(p.second--) cout << " " << p.first;
// }
// cout << endl;
map<ll, ll> PR;
PR = prime_factor(M);
// 前処理
COMinit();
ll ans = 1;
for (auto p : PR) {
// cout << p.second << endl;
ans = (ans * COM(p.second + N - 1, p.second)) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int, int>, int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int MAX = 1000000;
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;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
int main() {
cout << fixed << setprecision(15);
ll N, M;
cin >> N >> M;
// for(auto p : prime_factor(N)) {
// while(p.second--) cout << " " << p.first;
// }
// cout << endl;
map<ll, ll> PR;
PR = prime_factor(M);
// 前処理
COMinit();
ll ans = 1;
for (auto p : PR) {
// cout << p.second << endl;
ans = (ans * COM(p.second + N - 1, p.second)) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p03253 | C++ | Time Limit Exceeded | #include <cstdio>
#include <map>
#include <vector>
using namespace std;
#define MOD 1000000007
long long factorial[100010] = {};
long long fact_inv[100010] = {};
long long inv[100010] = {};
int N = 100000;
long long power(long long n, int p) {
if (p == 0) {
return 1;
}
if (p == 1) {
return n % MOD;
}
long long s;
s = power(n, p / 2);
if (p % 2 == 0) {
return s * s % MOD;
}
if (p % 2 == 1) {
return n * power(n, p - 1) % MOD;
} else {
return 0;
}
}
void calc() {
// printf("calc called\n");
inv[1] = 1;
for (int i = 2; i <= N; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
}
factorial[0] = 1;
fact_inv[0] = 1;
for (int i = 1; i <= N; i++) {
factorial[i] = (factorial[i - 1] * i) % MOD;
fact_inv[i] = (fact_inv[i - 1] * inv[i]) % MOD;
}
// printf("calc fin\n");
}
long long combi(long long n, int p) {
if (p > n || p < 0) {
return 0;
} else {
return (((factorial[n] * fact_inv[p]) % MOD) * fact_inv[n - p]) % MOD;
}
}
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i] += 1;
n = n / i;
}
}
if (n != 1) {
res[n] += 1;
}
return res;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
map<int, int> ans_1 = prime_factor(m);
/*printf("\n");
for (pair<int, int> x: ans_1) {
printf("(%d %d) ", x.first, x.second);
}
printf("\n");
*/
calc();
long long ans = 1;
for (pair<int, int> x : ans_1) {
// printf("(%d %d) ", x.first, x.second);
ans = (ans * combi(n + x.second - 1, n - 1)) % MOD;
}
printf("%lld", ans);
return 0;
}
| #include <cstdio>
#include <map>
#include <vector>
using namespace std;
#define MOD 1000000007
long long factorial[200010] = {};
long long fact_inv[200010] = {};
long long inv[200010] = {};
int N = 200001;
long long power(long long n, int p) {
if (p == 0) {
return 1;
}
if (p == 1) {
return n % MOD;
}
long long s;
s = power(n, p / 2);
if (p % 2 == 0) {
return s * s % MOD;
}
if (p % 2 == 1) {
return n * power(n, p - 1) % MOD;
} else {
return 0;
}
}
void calc() {
// printf("calc called\n");
inv[1] = 1;
for (int i = 2; i <= N; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
}
factorial[0] = 1;
fact_inv[0] = 1;
for (int i = 1; i <= N; i++) {
factorial[i] = (factorial[i - 1] * i) % MOD;
fact_inv[i] = (fact_inv[i - 1] * inv[i]) % MOD;
}
// printf("calc fin\n");
}
long long combi(long long n, int p) {
if (p > n || p < 0) {
return 0;
} else {
return (((factorial[n] * fact_inv[p]) % MOD) * fact_inv[n - p]) % MOD;
}
}
map<int, int> prime_factor(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i] += 1;
n = n / i;
}
}
if (n != 1) {
res[n] += 1;
}
return res;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
map<int, int> ans_1 = prime_factor(m);
/*printf("\n");
for (pair<int, int> x: ans_1) {
printf("(%d %d) ", x.first, x.second);
}
printf("\n");
*/
calc();
long long ans = 1;
for (pair<int, int> x : ans_1) {
// printf("(%d %d) ", x.first, x.second);
ans = (ans * combi(n + x.second - 1, n - 1)) % MOD;
}
printf("%lld", ans);
return 0;
}
| replace | 8 | 12 | 8 | 12 | TLE | |
p03253 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int MAX = 510000;
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;
}
vector<int> prime_factor(int n) {
vector<int> res;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res.push_back(i);
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> v = prime_factor(m);
COMinit();
int cnt = 1, p = v[0];
long long res = 1;
for (int i = 1; i < v.size(); ++i) {
if (p != v[i])
res *= COM(n - 1 + cnt, n - 1), p = v[i], cnt = 0;
cnt++;
res %= MOD;
}
res *= COM(n - 1 + cnt, n - 1);
res %= MOD;
cout << res << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int MAX = 510000;
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;
}
vector<int> prime_factor(int n) {
vector<int> res;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res.push_back(i);
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
puts("1");
return 0;
}
vector<int> v = prime_factor(m);
COMinit();
int cnt = 1, p = v[0];
long long res = 1;
for (int i = 1; i < v.size(); ++i) {
if (p != v[i])
res *= COM(n - 1 + cnt, n - 1), p = v[i], cnt = 0;
cnt++;
res %= MOD;
}
res *= COM(n - 1 + cnt, n - 1);
res %= MOD;
cout << res << endl;
} | insert | 47 | 47 | 47 | 51 | 0 | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define init_random \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define start_routine \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false); \
int begtime = clock();
#define end_routine \
int endtime = clock(); \
cerr << endl \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms"; \
return 0
#define contests_de_diya_kar 0
#define PB push_back
#define MP make_pair
#define int long long
#define sd(n) scanf("%lld", &n)
#define pd(n) printf("%lld\n", n)
#define MOD ((long long)(1000 * 1000 * 1000 + 7))
#define exit(a, b) return cout << a, b;
#define eps (double)1e-9
#define forn(a, b, i) for (int i = a; i < b; i += 1)
#define vi vector<int>
#define vb vector<bool>
#define all(v) v.begin(), v.end()
#define ll long long
#define pii pair<int, int>
#define mii map<int, int>
#define print(stuff) cout << stuff << endl
#define len(stuff) stuff.size()
const int N = (int)1e5 + 100;
int fac[N + 1], invfac[N + 1];
const int M = MOD;
int modexp(int a, int b) {
if (b == 0)
return 1;
int ans = modexp(a, b / 2);
ans = (ans * ans) % M;
if (b % 2)
ans = (ans * a) % M;
return ans;
}
inline int inv(int a) { return modexp(a, M - 2); }
void prec() {
fac[0] = 1;
for (int i = 1; i <= N; i++)
fac[i] = (fac[i - 1] * i) % M;
invfac[N] = inv(fac[N]);
for (int i = N - 1; i >= 0; i--)
invfac[i] = (invfac[i + 1] * (i + 1)) % M;
}
int c(int n, int r) {
int ans = fac[n];
ans *= invfac[n - r], ans %= M;
ans *= invfac[r], ans %= M;
return ans;
}
signed main() {
start_routine;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
prec();
int n, m;
cin >> n >> m;
if (m == 1) {
exit(1, 0);
}
int ret = 1;
for (int i = 2;; i += 1) {
int cnt = 0;
while (m % i == 0) {
cnt += 1;
m /= i;
}
ret *= c(n + cnt - 1, cnt);
ret %= M;
if (m == 1) {
exit(ret, 0);
}
}
end_routine;
} | #include <bits/stdc++.h>
using namespace std;
#define init_random \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define start_routine \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false); \
int begtime = clock();
#define end_routine \
int endtime = clock(); \
cerr << endl \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms"; \
return 0
#define contests_de_diya_kar 0
#define PB push_back
#define MP make_pair
#define int long long
#define sd(n) scanf("%lld", &n)
#define pd(n) printf("%lld\n", n)
#define MOD ((long long)(1000 * 1000 * 1000 + 7))
#define exit(a, b) return cout << a, b;
#define eps (double)1e-9
#define forn(a, b, i) for (int i = a; i < b; i += 1)
#define vi vector<int>
#define vb vector<bool>
#define all(v) v.begin(), v.end()
#define ll long long
#define pii pair<int, int>
#define mii map<int, int>
#define print(stuff) cout << stuff << endl
#define len(stuff) stuff.size()
const int N = (int)1e5 + 100;
int fac[N + 1], invfac[N + 1];
const int M = MOD;
int modexp(int a, int b) {
if (b == 0)
return 1;
int ans = modexp(a, b / 2);
ans = (ans * ans) % M;
if (b % 2)
ans = (ans * a) % M;
return ans;
}
inline int inv(int a) { return modexp(a, M - 2); }
void prec() {
fac[0] = 1;
for (int i = 1; i <= N; i++)
fac[i] = (fac[i - 1] * i) % M;
invfac[N] = inv(fac[N]);
for (int i = N - 1; i >= 0; i--)
invfac[i] = (invfac[i + 1] * (i + 1)) % M;
}
int c(int n, int r) {
int ans = fac[n];
ans *= invfac[n - r], ans %= M;
ans *= invfac[r], ans %= M;
return ans;
}
signed main() {
start_routine;
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
#endif
prec();
int n, m;
cin >> n >> m;
if (m == 1) {
exit(1, 0);
}
int ret = 1;
for (int i = 2;; i += 1) {
int cnt = 0;
while (m % i == 0) {
cnt += 1;
m /= i;
}
ret *= c(n + cnt - 1, cnt);
ret %= M;
if (m == 1) {
exit(ret, 0);
}
}
end_routine;
} | replace | 69 | 70 | 69 | 70 | -11 | |
p03253 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
vector<pair<ll, ll>> factorize(ll x) { // mapを返す関数
vector<pair<ll, ll>> v;
for (ll i = 2; i * i <= x; i++) {
ll cnt = 0;
while (x % i == 0) {
x /= i;
cnt++;
}
v.pb({i, cnt});
}
if (x != 1) {
if (x == v.back().fi)
v.back().se++; // xが素数だった時用
else
v.pb({x, 1});
}
return v;
}
const ll MAX = 100000010; // 設定して
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
signed main() {
ll n, m, ans = 1;
cin >> n >> m;
vector<pair<ll, ll>> u = factorize(m);
COMinit();
for (ll i = 0; i < u.size(); i++) {
ans *= COM(n - 1 + u.at(i).se, u.at(i).se);
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
// cin.tie(0);
// ios::sync_with_stdio(false);
vector<pair<ll, ll>> factorize(ll x) { // mapを返す関数
vector<pair<ll, ll>> v;
for (ll i = 2; i * i <= x; i++) {
ll cnt = 0;
while (x % i == 0) {
x /= i;
cnt++;
}
v.pb({i, cnt});
}
if (x != 1) {
if (x == v.back().fi)
v.back().se++; // xが素数だった時用
else
v.pb({x, 1});
}
return v;
}
const ll MAX = 100100; // 設定して
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
signed main() {
ll n, m, ans = 1;
cin >> n >> m;
vector<pair<ll, ll>> u = factorize(m);
COMinit();
for (ll i = 0; i < u.size(); i++) {
ans *= COM(n - 1 + u.at(i).se, u.at(i).se);
ans %= mod;
}
cout << ans << endl;
} | replace | 32 | 33 | 32 | 33 | TLE | |
p03253 | C++ | Runtime Error | // header
#ifdef LOCAL
#include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
#define debug(x) cout << x << endl
#else
#define debug(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
template <typename T> using mat = vector<vector<T>>;
template <int mod> struct modint {
int x;
modint() : x(0) {}
modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
modint &operator+=(const modint &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
modint &operator-=(const modint &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
modint &operator*=(const modint &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
modint &operator/=(const modint &p) {
*this *= p.inverse();
return *this;
}
modint operator-() const { return modint(-x); }
modint operator+(const modint &p) const { return modint(*this) += p; }
modint operator-(const modint &p) const { return modint(*this) -= p; }
modint operator*(const modint &p) const { return modint(*this) *= p; }
modint operator/(const modint &p) const { return modint(*this) /= p; }
bool operator==(const modint &p) const { return x == p.x; }
bool operator!=(const modint &p) const { return x != p.x; }
modint inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return modint(u);
}
modint pow(int64_t n) const {
modint ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }
friend istream &operator>>(istream &is, modint &a) {
int64_t t;
is >> t;
a = modint<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
// abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) \
for (int i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) \
for (int i = (b - 1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
// functions
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> T mypow(T x, ll n) {
T ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
ll modpow(ll x, ll n, const ll mod) {
ll ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x);
(x *= x);
n >>= 1;
x %= mod;
ret %= mod;
}
return ret;
}
uint64_t my_rand(void) {
static uint64_t x = 88172645463325252ULL;
x = x ^ (x << 13);
x = x ^ (x >> 7);
return x = x ^ (x << 17);
}
// graph template
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
// constant
// #define inf 1000000005LL
#define inf 4000000000000000005LL
#define mod 1000000007LL
#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.0001;
const long double PI = 3.141592653589793;
// library
bool is_prime(ll n) {
if (n <= 1)
return false;
if (n == 2)
return true;
if (n % 2 == 0)
return false;
ll d = n - 1;
while (d % 2 == 0)
d /= 2;
vl primes;
if (n < 4759123140)
primes = {2, 7, 61};
else
primes = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
for (ll a : primes) {
a %= n;
if (a == 0)
return true;
ll t = d;
ll y = modpow(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1) {
y = __int128_t(y) * y % n;
// y = y * y % n;
t <<= 1;
}
if (y != n - 1 && t % 2 == 0) {
return false;
}
}
return true;
}
// MR is necessary
// In codeforces, delete __int128 in the second line.
// about O(N^1/4logN)
ll pollard_single(ll n) {
auto f = [&](ll x) { return (__int128_t(x) * x + 1) % n; };
// auto f = [&](ll x) { return (x * x + 1) % n; };
if (is_prime(n))
return n;
if (n % 2 == 0)
return 2;
ll st = 0;
while (true) {
st = my_rand() % n;
ll x = st, y = f(x);
while (true) {
ll p = gcd((y - x + n), n);
if (p == 0 || p == n)
break;
if (p != 1)
return p;
x = f(x);
y = f(f(y));
}
}
}
vl pollard_rec(ll n) {
if (n == 1)
return {};
ll x = pollard_single(n);
if (x == n)
return {x};
vl a = pollard_rec(x);
vl b = pollard_rec(n / x);
a.insert(a.end(), b.begin(), b.end());
return a;
}
map<ll, int> pollard(ll n) {
map<ll, int> res;
for (ll a : pollard_rec(n)) {
res[a]++;
}
return res;
}
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << setprecision(20);
Combination<mint> comb(1000);
ll n, m;
cin >> n >> m;
auto res = pollard(m);
mint ans = 1;
for (auto p : res) {
ans *= comb.C(p.second + n - 1, n - 1);
}
print(ans);
} | // header
#ifdef LOCAL
#include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
#define debug(x) cout << x << endl
#else
#define debug(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// types
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
template <typename T> using mat = vector<vector<T>>;
template <int mod> struct modint {
int x;
modint() : x(0) {}
modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
modint &operator+=(const modint &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
modint &operator-=(const modint &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
modint &operator*=(const modint &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
modint &operator/=(const modint &p) {
*this *= p.inverse();
return *this;
}
modint operator-() const { return modint(-x); }
modint operator+(const modint &p) const { return modint(*this) += p; }
modint operator-(const modint &p) const { return modint(*this) -= p; }
modint operator*(const modint &p) const { return modint(*this) *= p; }
modint operator/(const modint &p) const { return modint(*this) /= p; }
bool operator==(const modint &p) const { return x == p.x; }
bool operator!=(const modint &p) const { return x != p.x; }
modint inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return modint(u);
}
modint pow(int64_t n) const {
modint ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }
friend istream &operator>>(istream &is, modint &a) {
int64_t t;
is >> t;
a = modint<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
// abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) \
for (int i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) \
for (int i = (b - 1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
// functions
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> T mypow(T x, ll n) {
T ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
ll modpow(ll x, ll n, const ll mod) {
ll ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x);
(x *= x);
n >>= 1;
x %= mod;
ret %= mod;
}
return ret;
}
uint64_t my_rand(void) {
static uint64_t x = 88172645463325252ULL;
x = x ^ (x << 13);
x = x ^ (x >> 7);
return x = x ^ (x << 17);
}
// graph template
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
// constant
// #define inf 1000000005LL
#define inf 4000000000000000005LL
#define mod 1000000007LL
#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.0001;
const long double PI = 3.141592653589793;
// library
bool is_prime(ll n) {
if (n <= 1)
return false;
if (n == 2)
return true;
if (n % 2 == 0)
return false;
ll d = n - 1;
while (d % 2 == 0)
d /= 2;
vl primes;
if (n < 4759123140)
primes = {2, 7, 61};
else
primes = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
for (ll a : primes) {
a %= n;
if (a == 0)
return true;
ll t = d;
ll y = modpow(a, t, n);
while (t != n - 1 && y != 1 && y != n - 1) {
y = __int128_t(y) * y % n;
// y = y * y % n;
t <<= 1;
}
if (y != n - 1 && t % 2 == 0) {
return false;
}
}
return true;
}
// MR is necessary
// In codeforces, delete __int128 in the second line.
// about O(N^1/4logN)
ll pollard_single(ll n) {
auto f = [&](ll x) { return (__int128_t(x) * x + 1) % n; };
// auto f = [&](ll x) { return (x * x + 1) % n; };
if (is_prime(n))
return n;
if (n % 2 == 0)
return 2;
ll st = 0;
while (true) {
st = my_rand() % n;
ll x = st, y = f(x);
while (true) {
ll p = gcd((y - x + n), n);
if (p == 0 || p == n)
break;
if (p != 1)
return p;
x = f(x);
y = f(f(y));
}
}
}
vl pollard_rec(ll n) {
if (n == 1)
return {};
ll x = pollard_single(n);
if (x == n)
return {x};
vl a = pollard_rec(x);
vl b = pollard_rec(n / x);
a.insert(a.end(), b.begin(), b.end());
return a;
}
map<ll, int> pollard(ll n) {
map<ll, int> res;
for (ll a : pollard_rec(n)) {
res[a]++;
}
return res;
}
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << setprecision(20);
Combination<mint> comb(200000);
ll n, m;
cin >> n >> m;
auto res = pollard(m);
mint ans = 1;
for (auto p : res) {
ans *= comb.C(p.second + n - 1, n - 1);
}
print(ans);
} | replace | 305 | 306 | 305 | 306 | 0 | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#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 pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x) \
ll x; \
cin >> x;
// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)
ll qp(ll a, ll b, int mo) {
ll ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);
const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);
template <typename T> vector<T> pows(int b, int n) {
vector<T> ret;
T x = 1;
while (ret.size() < n) {
ret.push_back(x);
x *= b;
}
return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string &str, const std::string &from,
const std::string &to) {
std::string::size_type pos = 0;
while (pos = str.find(from, pos), pos != std::string::npos) {
str.replace(pos, from.length(), to);
pos += to.length();
}
}
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;
}
inline tuple<ll, ll> rotate45(tuple<ll, ll> point) {
ll x = get<0>(point), y = get<1>(point);
return tuple<ll, ll>(x + y, x - y);
}
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}
template <typename T> vector<T> INPA(ll n) {
vector<T> x;
REP(i, n) {
T tmp;
cin >> tmp;
x.push_back(tmp);
}
return move(x);
}
template <typename T> void out(T o) { cout << o << endl; }
template <typename T> void out(vector<T> &out) {
REP(i, (int)out.size()) {
cout << out[i];
if (i == (int)out.size() - 1)
cout << endl;
else
cout << " ";
}
}
template <typename T> void out(vector<vector<T>> o) {
REP(i, o.size()) out(o[i]);
}
void YesNo(bool f) { cout << (f ? "Yes" : "No") << endl; }
void YESNO(bool f) { cout << (f ? "YES" : "NO") << endl; }
namespace PrimeLib {
//* 素数判定 is_prime<unsigned>(N)
template <typename T, std::enable_if_t<std::is_unsigned<T>::value,
std::nullptr_t> = nullptr>
bool is_prime(const T n) {
if (n < 4)
return n == 2 || n == 3;
if (n % 2 == 0 || n % 3 == 0 || (n % 6 != 1 && n % 6 != 5))
return false;
for (T i = 5; i * i <= n; i += 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
//* 素数テーブル生成 エラトステネスの篩
vector<ll> primeTable(ll n) {
vector<bool> table(n - 1);
vector<ll> ret;
for (ll i = 0; i < n - 1; ++i) {
if (table[i] == false) {
ll num = i + 2;
ret.push_back(i + 2);
for (int j = i + num; j < n - 1; j += num)
table[j] = true;
}
}
return ret;
}
vector<ll> factorize(ll n, vector<ll> &pt) {
vector<ll> ret;
int pos = 0;
ll c = n;
while (c != 1) {
ll p = pt[pos];
ret.push_back(0);
while (c % p == 0) {
ret[pos]++;
c /= p;
}
pos++;
if (pos >= pt.size())
break;
}
assert(c == 1);
return ret;
}
} // namespace PrimeLib
// 1≤k≤n≤10^7
class CombLib {
private:
int mMax, mMod;
vector<ll> fac, finv, inv;
public:
CombLib(int modNum = 1000000007, int maxSize = 510000) {
mMax = maxSize, mMod = modNum;
fac = vector<ll>(maxSize);
finv = vector<ll>(maxSize);
inv = vector<ll>(maxSize);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < mMax; i++) {
fac[i] = fac[i - 1] * i % mMod;
inv[i] = mMod - inv[mMod % i] * (mMod / i) % mMod;
finv[i] = finv[i - 1] * inv[i] % mMod;
}
}
ll nCr(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mMod) % mMod;
}
ll nHr(int n, int k) {
if (n == 0 and k == 0)
return 1;
return nCr(n + k - 1, n);
}
};
int main(void) {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
IN1(N);
IN1(M);
ll sm = ll(sqrt(1e14));
CombLib cl;
auto pt = PrimeLib::primeTable(sm);
auto pn = PrimeLib::factorize(M, pt);
ll ans = 1;
for (auto b : pn) {
if (b == 0)
continue;
ans = (ans * cl.nHr(b, N)) % MOD_CONST;
}
out(ans % MOD_CONST);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
#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 pb push_back
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define IN1(x) \
ll x; \
cin >> x;
// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int)(lower_bound(s, t, x) - s)
#define UB(s, t, x) (int)(upper_bound(s, t, x) - s)
ll qp(ll a, ll b, int mo) {
ll ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp ? (a / temp * b) : 0;
}
int mDays[] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = {1, -1, 0, 0, 1, 1, -1, -1}, dy8[] = {0, 0, -1, 1, -1, 1, -1, 1};
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) {
return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);
const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);
template <typename T> vector<T> pows(int b, int n) {
vector<T> ret;
T x = 1;
while (ret.size() < n) {
ret.push_back(x);
x *= b;
}
return ret;
}
// find string "from" in "str", and replace them to "to"
void strReplace(std::string &str, const std::string &from,
const std::string &to) {
std::string::size_type pos = 0;
while (pos = str.find(from, pos), pos != std::string::npos) {
str.replace(pos, from.length(), to);
pos += to.length();
}
}
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;
}
inline tuple<ll, ll> rotate45(tuple<ll, ll> point) {
ll x = get<0>(point), y = get<1>(point);
return tuple<ll, ll>(x + y, x - y);
}
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) {
return nx >= 0 and nx < Width and ny >= 0 and ny < Height;
}
template <typename T> vector<T> INPA(ll n) {
vector<T> x;
REP(i, n) {
T tmp;
cin >> tmp;
x.push_back(tmp);
}
return move(x);
}
template <typename T> void out(T o) { cout << o << endl; }
template <typename T> void out(vector<T> &out) {
REP(i, (int)out.size()) {
cout << out[i];
if (i == (int)out.size() - 1)
cout << endl;
else
cout << " ";
}
}
template <typename T> void out(vector<vector<T>> o) {
REP(i, o.size()) out(o[i]);
}
void YesNo(bool f) { cout << (f ? "Yes" : "No") << endl; }
void YESNO(bool f) { cout << (f ? "YES" : "NO") << endl; }
namespace PrimeLib {
//* 素数判定 is_prime<unsigned>(N)
template <typename T, std::enable_if_t<std::is_unsigned<T>::value,
std::nullptr_t> = nullptr>
bool is_prime(const T n) {
if (n < 4)
return n == 2 || n == 3;
if (n % 2 == 0 || n % 3 == 0 || (n % 6 != 1 && n % 6 != 5))
return false;
for (T i = 5; i * i <= n; i += 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
//* 素数テーブル生成 エラトステネスの篩
vector<ll> primeTable(ll n) {
vector<bool> table(n - 1);
vector<ll> ret;
for (ll i = 0; i < n - 1; ++i) {
if (table[i] == false) {
ll num = i + 2;
ret.push_back(i + 2);
for (int j = i + num; j < n - 1; j += num)
table[j] = true;
}
}
return ret;
}
vector<ll> factorize(ll n, vector<ll> &pt) {
vector<ll> ret;
int pos = 0;
ll c = n;
while (c != 1) {
ll p = pt[pos];
ret.push_back(0);
while (c % p == 0) {
ret[pos]++;
c /= p;
}
pos++;
if (pos >= pt.size())
break;
}
// assert(c == 1);
if (c != 1)
ret.push_back(1);
return ret;
}
} // namespace PrimeLib
// 1≤k≤n≤10^7
class CombLib {
private:
int mMax, mMod;
vector<ll> fac, finv, inv;
public:
CombLib(int modNum = 1000000007, int maxSize = 510000) {
mMax = maxSize, mMod = modNum;
fac = vector<ll>(maxSize);
finv = vector<ll>(maxSize);
inv = vector<ll>(maxSize);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < mMax; i++) {
fac[i] = fac[i - 1] * i % mMod;
inv[i] = mMod - inv[mMod % i] * (mMod / i) % mMod;
finv[i] = finv[i - 1] * inv[i] % mMod;
}
}
ll nCr(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mMod) % mMod;
}
ll nHr(int n, int k) {
if (n == 0 and k == 0)
return 1;
return nCr(n + k - 1, n);
}
};
int main(void) {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
IN1(N);
IN1(M);
ll sm = ll(sqrt(1e14));
CombLib cl;
auto pt = PrimeLib::primeTable(sm);
auto pn = PrimeLib::factorize(M, pt);
ll ans = 1;
for (auto b : pn) {
if (b == 0)
continue;
ans = (ans * cl.nHr(b, N)) % MOD_CONST;
}
out(ans % MOD_CONST);
return 0;
} | replace | 175 | 176 | 175 | 178 | TLE | |
p03253 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define MOD 1000000007
#define MAX 1000000
using namespace std;
typedef long long ll;
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;
}
bool isPrime(ll p) {
bool res = true;
if (p == 1) {
res = false;
} else {
for (int i = 2; i * i <= p; ++i) {
if (p % i == 0) {
res = false;
break;
}
}
}
return res;
}
map<ll, int> primeFactorization(ll n) {
map<ll, int> primeFacMap;
ll q = 2;
while (n != 1) {
if (isPrime(q)) {
while (n % q == 0) {
n = n / q;
if (primeFacMap.find(q) == primeFacMap.end()) {
primeFacMap[q] = 1;
} else {
primeFacMap[q]++;
}
}
}
q++;
}
return primeFacMap;
}
int main() {
ll N, M;
cin >> N >> M;
map<ll, int> primeFacMap = primeFactorization(M);
COMinit();
ll ans = 1;
for (auto iter = primeFacMap.begin(); iter != primeFacMap.end(); ++iter) {
ll b = iter->second;
ans = (ans * COM(b + N - 1, b)) % MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define MOD 1000000007
#define MAX 1000000
using namespace std;
typedef long long ll;
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;
}
bool isPrime(ll p) {
bool res = true;
if (p == 1) {
res = false;
} else {
for (int i = 2; i * i <= p; ++i) {
if (p % i == 0) {
res = false;
break;
}
}
}
return res;
}
map<ll, int> primeFactorization(ll n) {
map<ll, int> primeFacMap;
ll q = 2;
while (n != 1) {
if (n % q == 0) {
if (isPrime(q)) {
while (n % q == 0) {
n = n / q;
if (primeFacMap.find(q) == primeFacMap.end()) {
primeFacMap[q] = 1;
} else {
primeFacMap[q]++;
}
}
}
}
q++;
}
return primeFacMap;
}
int main() {
ll N, M;
cin >> N >> M;
map<ll, int> primeFacMap = primeFactorization(M);
COMinit();
ll ans = 1;
for (auto iter = primeFacMap.begin(); iter != primeFacMap.end(); ++iter) {
ll b = iter->second;
ans = (ans * COM(b + N - 1, b)) % MOD;
}
cout << ans << endl;
}
| replace | 53 | 60 | 53 | 62 | TLE | |
p03253 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, b) for (ll i = 0; i < b; i++)
#define ll long long
using namespace std;
template <typename T> void SSS(T &t) { cin >> t; }
#define SS(T, ...) \
T __VA_ARGS__; \
SSS(__VA_ARGS__);
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvvl vector<vector<vector<ll>>>
#define debug(x) cerr << #x << " " << x << '\n';
bool cmp(pair<ll, ll> a, pair<ll, ll> b) { return a.second < b.second; }
const int MOD = 1000000007;
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <int MODULO> struct ModInt {
using int64 = long long;
using uint32 = unsigned int;
using uint64 = unsigned long long;
uint64 x;
ModInt() : x(0) {}
ModInt(int64 y) : x(set(y % MODULO + MODULO)) {}
static uint64 set(const int64 &y) { return (y < MODULO) ? y : y - MODULO; }
static ModInt make(const uint64 &y) {
ModInt ret = y;
return ret;
}
ModInt operator+(const ModInt &m) const { return make(set(x + m.x)); }
ModInt operator-(const ModInt &m) const {
return make(set(x + MODULO - m.x));
}
ModInt operator*(const ModInt &m) const { return make(x * m.x % MODULO); }
ModInt operator/(const ModInt &m) const { return make(x) * ~make(m.x); }
ModInt &operator+=(const ModInt &m) { return *this = *this + m; }
ModInt &operator-=(const ModInt &m) { return *this = *this - m; }
ModInt &operator*=(const ModInt &m) { return *this = *this * m; }
ModInt &operator/=(const ModInt &m) { return *this = *this / m; }
ModInt &operator^=(const uint64 &y) { return *this = *this ^ y; }
ModInt operator~() const { return *this ^ (MODULO - 2); }
ModInt operator-() const { return make(set(MODULO - x)); }
ModInt operator!() const { return getFact(uint32(*this)); }
ModInt operator&() const { return getFinv(uint32(*this)); }
ModInt operator++() { return *this = make(set(x + 1)); }
ModInt operator--() { return *this = make(set(x + MODULO - 1)); }
bool operator==(const ModInt &m) const { return x == m.x; }
bool operator!=(const ModInt &m) const { return x != m.x; }
bool operator<(const ModInt &m) const { return x < m.x; }
bool operator<=(const ModInt &m) const { return x <= m.x; }
bool operator>(const ModInt &m) const { return x > m.x; }
bool operator>=(const ModInt &m) const { return x >= m.x; }
explicit operator bool() const { return x; }
explicit operator uint64() const { return x; }
ModInt operator^(uint64 y) const {
uint64 t = x, u = 1;
while (y) {
if (y & 1)
(u *= t) %= MODULO;
(t *= t) %= MODULO;
y >>= 1;
}
return make(u);
}
friend ostream &operator<<(ostream &os, const ModInt<MODULO> &m) {
return os << m.x;
}
friend istream &operator>>(istream &is, ModInt<MODULO> &m) {
uint64 y;
is >> y;
m = make(y);
return is;
}
static vector<ModInt> fact, finv, invs;
static void init(uint32 n) {
uint32 m = fact.size();
if (n < m)
return;
fact.resize(n + 1, 1);
finv.resize(n + 1, 1);
invs.resize(n + 1, 1);
if (m == 0)
m = 1;
for (uint32 i = m; i <= n; ++i)
fact[i] = fact[i - 1] * ModInt(i);
finv[n] = ModInt(1) / fact[n];
for (uint32 i = n; i >= m; --i)
finv[i - 1] = finv[i] * make(i);
for (uint32 i = m; i <= n; ++i)
invs[i] = finv[i] * fact[i - 1];
}
static ModInt getFact(uint32 n) {
init(n);
return fact[n];
}
static ModInt getFinv(uint32 n) {
init(n);
return finv[n];
}
static ModInt getInvs(uint32 n) {
init(n);
return invs[n];
}
static ModInt C(int64 n, int64 r) {
if (r == 0)
return make(1);
if (r < 0)
return make(0);
if (n < 0)
return make(r & 1 ? MODULO - 1 : 1) * C(-n + r - 1, r);
if (n == 0 || n < r)
return make(0);
init(n);
return fact[n] * finv[n - r] * finv[r];
}
// N<=10^5を超えるが,k<=10^5の時にO(k)で求める
static ModInt CbyK(int64 n, int64 k) {
ModInt res = 1;
rep(i, k) {
res *= n - i;
res /= i + 1;
}
return res;
}
static ModInt P(int64 n, int64 r) {
if (n < r || r < 0)
return make(0);
init(n);
return fact[n] * finv[n - r];
}
static ModInt H(int64 n, int64 r) {
if (n < 0 || r < 0)
return make(0);
if (!n && !r)
return make(1);
init(n + r - 1);
return C(n + r - 1, r);
}
static ModInt montmort(uint32 n) {
ModInt res;
init(n);
for (uint32 k = 2; k <= n; ++k) {
if (k & 1)
res -= finv[k];
else
res += finv[k];
}
return res *= fact[n];
}
static ModInt LagrangePolynomial(vector<ModInt> &y, ModInt t) {
uint32 n = y.size() - 1;
if (t.x <= n)
return y[t.x];
init(n + 1);
ModInt res, num(1);
for (uint32 i = 0; i <= n; ++i)
num *= t - make(i);
for (uint32 i = 0; i <= n; ++i) {
ModInt tmp = y[i] * num / (t - make(i)) * finv[i] * finv[n - i];
if ((n - i) & 1)
res -= tmp;
else
res += tmp;
}
return res;
}
};
template <int MODULO>
vector<ModInt<MODULO>> ModInt<MODULO>::fact = vector<ModInt<MODULO>>();
template <int MODULO>
vector<ModInt<MODULO>> ModInt<MODULO>::finv = vector<ModInt<MODULO>>();
template <int MODULO>
vector<ModInt<MODULO>> ModInt<MODULO>::invs = vector<ModInt<MODULO>>();
using modint = ModInt<MOD>;
/*
・ModInt
[備考] Mod演算のための構造体
[使用例]
modint M; // 剰余系MOD(1e9+7)における演算ができる
ModInt<mod> N; // 剰余系modにおける演算ができる
名前空間 modint::にいくつかの関数あり
*/
int main() {
ll n, m;
cin >> n >> m;
auto p = prime_factor(m);
modint ans = 1;
rep(i, p.size()) ans *= modint::CbyK(p[i] + n - 1, p[i]);
cout << ans << endl;
} | #include "bits/stdc++.h"
#define rep(i, b) for (ll i = 0; i < b; i++)
#define ll long long
using namespace std;
template <typename T> void SSS(T &t) { cin >> t; }
#define SS(T, ...) \
T __VA_ARGS__; \
SSS(__VA_ARGS__);
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvvl vector<vector<vector<ll>>>
#define debug(x) cerr << #x << " " << x << '\n';
bool cmp(pair<ll, ll> a, pair<ll, ll> b) { return a.second < b.second; }
const int MOD = 1000000007;
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
template <int MODULO> struct ModInt {
using int64 = long long;
using uint32 = unsigned int;
using uint64 = unsigned long long;
uint64 x;
ModInt() : x(0) {}
ModInt(int64 y) : x(set(y % MODULO + MODULO)) {}
static uint64 set(const int64 &y) { return (y < MODULO) ? y : y - MODULO; }
static ModInt make(const uint64 &y) {
ModInt ret = y;
return ret;
}
ModInt operator+(const ModInt &m) const { return make(set(x + m.x)); }
ModInt operator-(const ModInt &m) const {
return make(set(x + MODULO - m.x));
}
ModInt operator*(const ModInt &m) const { return make(x * m.x % MODULO); }
ModInt operator/(const ModInt &m) const { return make(x) * ~make(m.x); }
ModInt &operator+=(const ModInt &m) { return *this = *this + m; }
ModInt &operator-=(const ModInt &m) { return *this = *this - m; }
ModInt &operator*=(const ModInt &m) { return *this = *this * m; }
ModInt &operator/=(const ModInt &m) { return *this = *this / m; }
ModInt &operator^=(const uint64 &y) { return *this = *this ^ y; }
ModInt operator~() const { return *this ^ (MODULO - 2); }
ModInt operator-() const { return make(set(MODULO - x)); }
ModInt operator!() const { return getFact(uint32(*this)); }
ModInt operator&() const { return getFinv(uint32(*this)); }
ModInt operator++() { return *this = make(set(x + 1)); }
ModInt operator--() { return *this = make(set(x + MODULO - 1)); }
bool operator==(const ModInt &m) const { return x == m.x; }
bool operator!=(const ModInt &m) const { return x != m.x; }
bool operator<(const ModInt &m) const { return x < m.x; }
bool operator<=(const ModInt &m) const { return x <= m.x; }
bool operator>(const ModInt &m) const { return x > m.x; }
bool operator>=(const ModInt &m) const { return x >= m.x; }
explicit operator bool() const { return x; }
explicit operator uint64() const { return x; }
ModInt operator^(uint64 y) const {
uint64 t = x, u = 1;
while (y) {
if (y & 1)
(u *= t) %= MODULO;
(t *= t) %= MODULO;
y >>= 1;
}
return make(u);
}
friend ostream &operator<<(ostream &os, const ModInt<MODULO> &m) {
return os << m.x;
}
friend istream &operator>>(istream &is, ModInt<MODULO> &m) {
uint64 y;
is >> y;
m = make(y);
return is;
}
static vector<ModInt> fact, finv, invs;
static void init(uint32 n) {
uint32 m = fact.size();
if (n < m)
return;
fact.resize(n + 1, 1);
finv.resize(n + 1, 1);
invs.resize(n + 1, 1);
if (m == 0)
m = 1;
for (uint32 i = m; i <= n; ++i)
fact[i] = fact[i - 1] * ModInt(i);
finv[n] = ModInt(1) / fact[n];
for (uint32 i = n; i >= m; --i)
finv[i - 1] = finv[i] * make(i);
for (uint32 i = m; i <= n; ++i)
invs[i] = finv[i] * fact[i - 1];
}
static ModInt getFact(uint32 n) {
init(n);
return fact[n];
}
static ModInt getFinv(uint32 n) {
init(n);
return finv[n];
}
static ModInt getInvs(uint32 n) {
init(n);
return invs[n];
}
static ModInt C(int64 n, int64 r) {
if (r == 0)
return make(1);
if (r < 0)
return make(0);
if (n < 0)
return make(r & 1 ? MODULO - 1 : 1) * C(-n + r - 1, r);
if (n == 0 || n < r)
return make(0);
init(n);
return fact[n] * finv[n - r] * finv[r];
}
// N<=10^5を超えるが,k<=10^5の時にO(k)で求める
static ModInt CbyK(int64 n, int64 k) {
ModInt res = 1;
rep(i, k) {
res *= n - i;
res /= i + 1;
}
return res;
}
static ModInt P(int64 n, int64 r) {
if (n < r || r < 0)
return make(0);
init(n);
return fact[n] * finv[n - r];
}
static ModInt H(int64 n, int64 r) {
if (n < 0 || r < 0)
return make(0);
if (!n && !r)
return make(1);
init(n + r - 1);
return C(n + r - 1, r);
}
static ModInt montmort(uint32 n) {
ModInt res;
init(n);
for (uint32 k = 2; k <= n; ++k) {
if (k & 1)
res -= finv[k];
else
res += finv[k];
}
return res *= fact[n];
}
static ModInt LagrangePolynomial(vector<ModInt> &y, ModInt t) {
uint32 n = y.size() - 1;
if (t.x <= n)
return y[t.x];
init(n + 1);
ModInt res, num(1);
for (uint32 i = 0; i <= n; ++i)
num *= t - make(i);
for (uint32 i = 0; i <= n; ++i) {
ModInt tmp = y[i] * num / (t - make(i)) * finv[i] * finv[n - i];
if ((n - i) & 1)
res -= tmp;
else
res += tmp;
}
return res;
}
};
template <int MODULO>
vector<ModInt<MODULO>> ModInt<MODULO>::fact = vector<ModInt<MODULO>>();
template <int MODULO>
vector<ModInt<MODULO>> ModInt<MODULO>::finv = vector<ModInt<MODULO>>();
template <int MODULO>
vector<ModInt<MODULO>> ModInt<MODULO>::invs = vector<ModInt<MODULO>>();
using modint = ModInt<MOD>;
/*
・ModInt
[備考] Mod演算のための構造体
[使用例]
modint M; // 剰余系MOD(1e9+7)における演算ができる
ModInt<mod> N; // 剰余系modにおける演算ができる
名前空間 modint::にいくつかの関数あり
*/
int main() {
ll n, m;
cin >> n >> m;
auto p = prime_factor(m);
modint ans = 1;
for (auto itr = p.begin(); itr != p.end(); ++itr) {
ll sec = itr->second;
ans *= modint::C(sec + n - 1, sec);
}
cout << ans << endl;
} | replace | 201 | 202 | 201 | 205 | TLE | |
p03253 | C++ | Runtime Error |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
// 素数は1回も割られないのでそのままでてくる
if (n != 1)
ret[n] = 1;
return ret;
}
// for (auto p : prime_factor(N)) {
// cout << p.first << " " << p.second << endl;
// }
// auto primes=primefactor(n);
template <int mod> struct Combination {
vector<int64_t> mfact, rfact;
Combination(int sz) : mfact(sz + 1), rfact(sz + 1) {
mfact[0] = 1;
for (int i = 1; i < mfact.size(); i++) {
mfact[i] = mfact[i - 1] * i % mod;
}
rfact[sz] = inv(mfact[sz]);
for (int i = sz - 1; i >= 0; i--) {
rfact[i] = rfact[i + 1] * (i + 1) % mod;
}
}
int64_t fact(int k) const { return (mfact[k]); }
int64_t pow(int64_t x, int64_t n) const {
int64_t ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return (ret);
}
int64_t inv(int64_t x) const { return (pow(x, mod - 2)); }
int64_t P(int n, int r) const {
if (r < 0 || n < r)
return (0);
return (mfact[n] * rfact[n - r] % mod);
}
int64_t C(int p, int q) const {
if (q < 0 || p < q)
return (0);
return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
}
int64_t H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return (r == 0 ? 1 : C(n + r - 1, r));
}
};
int main() {
int n, m;
cin >> n >> m;
Combination<MOD> com(90000);
auto p = prime_factor(m);
LL ans = 1;
for (auto i : p) {
ans *= com.C(i.second + n - 1, i.second);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
|
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
// 素数は1回も割られないのでそのままでてくる
if (n != 1)
ret[n] = 1;
return ret;
}
// for (auto p : prime_factor(N)) {
// cout << p.first << " " << p.second << endl;
// }
// auto primes=primefactor(n);
template <int mod> struct Combination {
vector<int64_t> mfact, rfact;
Combination(int sz) : mfact(sz + 1), rfact(sz + 1) {
mfact[0] = 1;
for (int i = 1; i < mfact.size(); i++) {
mfact[i] = mfact[i - 1] * i % mod;
}
rfact[sz] = inv(mfact[sz]);
for (int i = sz - 1; i >= 0; i--) {
rfact[i] = rfact[i + 1] * (i + 1) % mod;
}
}
int64_t fact(int k) const { return (mfact[k]); }
int64_t pow(int64_t x, int64_t n) const {
int64_t ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return (ret);
}
int64_t inv(int64_t x) const { return (pow(x, mod - 2)); }
int64_t P(int n, int r) const {
if (r < 0 || n < r)
return (0);
return (mfact[n] * rfact[n - r] % mod);
}
int64_t C(int p, int q) const {
if (q < 0 || p < q)
return (0);
return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
}
int64_t H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return (r == 0 ? 1 : C(n + r - 1, r));
}
};
int main() {
int n, m;
cin >> n >> m;
Combination<MOD> com(10000000);
auto p = prime_factor(m);
LL ans = 1;
for (auto i : p) {
ans *= com.C(i.second + n - 1, i.second);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 156 | 157 | 156 | 157 | 0 | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 100;
ll f[maxn], inv[maxn];
ll powmod(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % mod;
a = a * a % mod;
b >>= 1;
}
return ret;
}
void init() {
f[0] = 1;
for (int i = 1; i < maxn; i++) {
f[i] = f[i - 1] * i % mod;
}
inv[maxn - 1] = powmod(f[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 1; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int n, int m) {
if (n == m)
return 1;
return f[n] * inv[m] % mod * inv[n - m] % mod;
}
ll cnt[maxn];
int tot;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
init();
ll n, m;
scanf("%lld %lld", &n, &m);
int sum = 0;
for (int i = 2; i * i <= m; i++) {
if (m % i)
continue;
sum = 0;
while (m % i == 0) {
sum++;
m /= i;
}
cnt[++tot] = sum;
}
if (m != 1)
cnt[++tot] = 1;
ll ans = 1;
for (int i = 1; i <= tot; i++) {
ans = ans * C(n - 1 + cnt[i], cnt[i]) % mod;
}
ans = (ans % mod + mod) % mod;
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 100;
ll f[maxn], inv[maxn];
ll powmod(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % mod;
a = a * a % mod;
b >>= 1;
}
return ret;
}
void init() {
f[0] = 1;
for (int i = 1; i < maxn; i++) {
f[i] = f[i - 1] * i % mod;
}
inv[maxn - 1] = powmod(f[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 1; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int n, int m) {
if (n == m)
return 1;
return f[n] * inv[m] % mod * inv[n - m] % mod;
}
ll cnt[maxn];
int tot;
int main() {
init();
ll n, m;
scanf("%lld %lld", &n, &m);
int sum = 0;
for (int i = 2; i * i <= m; i++) {
if (m % i)
continue;
sum = 0;
while (m % i == 0) {
sum++;
m /= i;
}
cnt[++tot] = sum;
}
if (m != 1)
cnt[++tot] = 1;
ll ans = 1;
for (int i = 1; i <= tot; i++) {
ans = ans * C(n - 1 + cnt[i], cnt[i]) % mod;
}
ans = (ans % mod + mod) % mod;
printf("%lld\n", ans);
return 0;
}
| replace | 43 | 46 | 43 | 44 | TLE | |
p03253 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) { return (a.n += b.n) >= mod ? a.n - mod : a.n; }
mint operator-(mint a, mint b) { return (a.n -= b.n) < 0 ? a.n + mod : a.n; }
mint operator*(mint a, mint b) { return 1LL * a.n * b.n % mod; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
ostream &operator<<(ostream &o, mint a) { return o << a.n; }
mint dp[100][500];
mint fact[200000];
mint ifact[200000];
mint inv[200000];
int main() {
inv[1] = 1;
for (int i = 2; i < 200000; i++) {
inv[i] = inv[mod % i] * (mod - mod / i);
}
fact[0] = 1;
ifact[0] = 1;
for (int i = 1; i < 200000; i++) {
fact[i] = i * fact[i - 1];
ifact[i] = inv[i] * ifact[i - 1];
}
int n, m;
cin >> n >> m;
vector<int> divs;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
divs.push_back(i);
if (m / i != i)
divs.push_back(m / i);
}
}
sort(divs.begin(), divs.end());
const int N = divs.size();
dp[0][N - 1] = 1;
for (int i = 0; i < 99; i++) {
for (int j = 1; j < N; j++) {
for (int k = 1; k < N; k++) {
if (divs[j] % divs[k] != 0)
continue;
int nn = divs[j] / divs[k];
int l = lower_bound(divs.begin(), divs.end(), nn) - divs.begin();
dp[i + 1][l] += dp[i][j];
}
}
}
mint ans;
for (int i = 0; i <= min(99, n); i++) {
ans += dp[i][0] * fact[n] * ifact[i] * ifact[n - i];
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
struct mint {
int n;
mint(int n_ = 0) : n(n_) {}
};
mint operator+(mint a, mint b) { return (a.n += b.n) >= mod ? a.n - mod : a.n; }
mint operator-(mint a, mint b) { return (a.n -= b.n) < 0 ? a.n + mod : a.n; }
mint operator*(mint a, mint b) { return 1LL * a.n * b.n % mod; }
mint &operator+=(mint &a, mint b) { return a = a + b; }
mint &operator-=(mint &a, mint b) { return a = a - b; }
mint &operator*=(mint &a, mint b) { return a = a * b; }
ostream &operator<<(ostream &o, mint a) { return o << a.n; }
mint dp[100][1400];
mint fact[200000];
mint ifact[200000];
mint inv[200000];
int main() {
inv[1] = 1;
for (int i = 2; i < 200000; i++) {
inv[i] = inv[mod % i] * (mod - mod / i);
}
fact[0] = 1;
ifact[0] = 1;
for (int i = 1; i < 200000; i++) {
fact[i] = i * fact[i - 1];
ifact[i] = inv[i] * ifact[i - 1];
}
int n, m;
cin >> n >> m;
vector<int> divs;
for (int i = 1; i * i <= m; i++) {
if (m % i == 0) {
divs.push_back(i);
if (m / i != i)
divs.push_back(m / i);
}
}
sort(divs.begin(), divs.end());
const int N = divs.size();
dp[0][N - 1] = 1;
for (int i = 0; i < 99; i++) {
for (int j = 1; j < N; j++) {
for (int k = 1; k < N; k++) {
if (divs[j] % divs[k] != 0)
continue;
int nn = divs[j] / divs[k];
int l = lower_bound(divs.begin(), divs.end(), nn) - divs.begin();
dp[i + 1][l] += dp[i][j];
}
}
}
mint ans;
for (int i = 0; i <= min(99, n); i++) {
ans += dp[i][0] * fact[n] * ifact[i] * ifact[n - i];
}
cout << ans << endl;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p03253 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define ll long long
#define int ll
#define INF (1LL << 60)
#define mod 1000000007
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
// 素数判定
bool isprime(ll n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
else
for (int i = 3; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
// ax+by=1の解
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// mod mでのaの逆数
ll mod_inverse(ll a, ll m) {
ll x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
// nの階乗 mod p
ll factorial(int n, int p) {
ll r = 1;
for (int i = 1; i <= n; i++)
r = (r * i) % p;
return r;
}
// nPr
ll permutation(int n, int r) {
ll a = 1;
for (int i = n - r + 1; i <= n; i++)
a *= i;
return a;
}
// nPr mod p
ll permutation(int n, int r, int p) {
ll a = 1;
for (int i = n - r + 1; i <= n; i++)
a = (a * i) % p;
return a;
}
// nCr mod p
ll combination(int n, int r, int p) {
if (r > n / 2)
r = n - r;
ll numerator = permutation(n, r, p);
ll denominator = factorial(r, p) % p;
ll inv = mod_inverse(denominator, p);
return (numerator * inv) % p;
}
signed main() {
int N, M;
cin >> N >> M;
if (isprime(M))
cout << N << endl;
else {
int result = 1;
for (int i = 2;; i++) {
int power = 0;
while (M > 0 && M % i == 0) {
M /= i;
power++;
}
result *= combination(N + power - 1, power, mod);
result = result % mod;
if (M == 1)
break;
}
cout << result << endl;
}
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define ll long long
#define int ll
#define INF (1LL << 60)
#define mod 1000000007
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
// 素数判定
bool isprime(ll n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
else
for (int i = 3; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
// ax+by=1の解
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// mod mでのaの逆数
ll mod_inverse(ll a, ll m) {
ll x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
// nの階乗 mod p
ll factorial(int n, int p) {
ll r = 1;
for (int i = 1; i <= n; i++)
r = (r * i) % p;
return r;
}
// nPr
ll permutation(int n, int r) {
ll a = 1;
for (int i = n - r + 1; i <= n; i++)
a *= i;
return a;
}
// nPr mod p
ll permutation(int n, int r, int p) {
ll a = 1;
for (int i = n - r + 1; i <= n; i++)
a = (a * i) % p;
return a;
}
// nCr mod p
ll combination(int n, int r, int p) {
if (r > n / 2)
r = n - r;
ll numerator = permutation(n, r, p);
ll denominator = factorial(r, p) % p;
ll inv = mod_inverse(denominator, p);
return (numerator * inv) % p;
}
signed main() {
int N, M;
cin >> N >> M;
if (isprime(M))
cout << N << endl;
else {
int result = 1;
for (int i = 2;; i++) {
int power = 0;
while (M > 0 && M % i == 0) {
M /= i;
power++;
}
if (power > 0) {
result *= combination(N + power - 1, power, mod);
result = result % mod;
}
if (M == 1)
break;
}
cout << result << endl;
}
return 0;
}
| replace | 105 | 107 | 105 | 109 | TLE | |
p03253 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
map<int, int> divisor_count;
bool is_prime[1000];
const long long MOD = 1000000007;
const int MAX = 200001;
long long fac[MAX];
long long finv[MAX];
long long inv[MAX];
int BIT_SIZE = 64;
long long power(long long m, long long n) {
long long ans = 1;
long long tmp = m;
for (int i = 0; i < BIT_SIZE; i++) {
// cout << ans << endl;
if (((n >> i) & 1) == 1) {
ans = ans * tmp % MOD;
}
tmp = (tmp * tmp) % MOD;
}
return ans;
}
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int N;
int M;
cin >> N >> M;
comb_init();
// set prime array
for (int i = 0; i < int(sqrt(M)) + 1; i++) {
is_prime[i] = true;
}
for (int i = 2; i < int(sqrt(M)) + 1; i++) {
if (!is_prime[i]) {
continue;
}
for (int j = 2 * i; j < int(sqrt(M)) + 1; j += i) {
is_prime[j] = false;
}
}
/*
for(int i = 0; i <int(sqrt(M)) + 1; i++){
cout << is_prime[i] << " ";
}
cout << endl;
*/
// get prime divisors of M
int tmp = M;
for (int i = 2; i < int(sqrt(M)) + 1; i++) {
if (!is_prime[i]) {
continue;
}
if (tmp % i == 0 && divisor_count.find(i) == divisor_count.end()) {
divisor_count[i] = 0;
}
while (tmp % i == 0) {
tmp /= i;
divisor_count[i] += 1;
}
}
if (tmp != 1) {
divisor_count[tmp] = 1;
}
long long ans = 1;
for (auto it = divisor_count.begin(); it != divisor_count.end(); it++) {
ans =
(ans * comb((long long)(N - 1) + (long long)(it->second), N - 1)) % MOD;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
map<int, int> divisor_count;
bool is_prime[100000];
const long long MOD = 1000000007;
const int MAX = 200001;
long long fac[MAX];
long long finv[MAX];
long long inv[MAX];
int BIT_SIZE = 64;
long long power(long long m, long long n) {
long long ans = 1;
long long tmp = m;
for (int i = 0; i < BIT_SIZE; i++) {
// cout << ans << endl;
if (((n >> i) & 1) == 1) {
ans = ans * tmp % MOD;
}
tmp = (tmp * tmp) % MOD;
}
return ans;
}
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int N;
int M;
cin >> N >> M;
comb_init();
// set prime array
for (int i = 0; i < int(sqrt(M)) + 1; i++) {
is_prime[i] = true;
}
for (int i = 2; i < int(sqrt(M)) + 1; i++) {
if (!is_prime[i]) {
continue;
}
for (int j = 2 * i; j < int(sqrt(M)) + 1; j += i) {
is_prime[j] = false;
}
}
/*
for(int i = 0; i <int(sqrt(M)) + 1; i++){
cout << is_prime[i] << " ";
}
cout << endl;
*/
// get prime divisors of M
int tmp = M;
for (int i = 2; i < int(sqrt(M)) + 1; i++) {
if (!is_prime[i]) {
continue;
}
if (tmp % i == 0 && divisor_count.find(i) == divisor_count.end()) {
divisor_count[i] = 0;
}
while (tmp % i == 0) {
tmp /= i;
divisor_count[i] += 1;
}
}
if (tmp != 1) {
divisor_count[tmp] = 1;
}
long long ans = 1;
for (auto it = divisor_count.begin(); it != divisor_count.end(); it++) {
ans =
(ans * comb((long long)(N - 1) + (long long)(it->second), N - 1)) % MOD;
}
cout << ans << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03253 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <vector>
#define YesNo(b) ((b) ? "Yes" : "No")
#define YESNO(b) ((b) ? "YES" : "NO")
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
#include <iostream>
#include <numeric>
#include <vector>
constexpr uint_fast64_t MOD = 1e9 + 7;
template <class StoreT, class AddT, class MulT, StoreT MOD> class ModInt {
using self_type = ModInt<StoreT, AddT, MulT, MOD>;
StoreT i;
public:
ModInt() : i(0) {}
ModInt(StoreT i) {
while (i < 0)
i += MOD;
this->i = i;
}
ModInt(const self_type &i) = default;
constexpr self_type &operator=(const self_type &i) = default;
constexpr uint_fast32_t getI() const noexcept { return i; }
ModInt &operator+=(self_type rhs) {
AddT i64 = static_cast<AddT>(i);
StoreT a32 = static_cast<StoreT>((i64 + rhs.i) % MOD);
i = a32;
return *this;
}
constexpr ModInt operator+(self_type rhs) const noexcept {
self_type newInt(*this);
newInt += rhs;
return newInt;
}
ModInt &operator-=(self_type rhs) {
AddT i64 = static_cast<AddT>(i);
StoreT a32 = static_cast<StoreT>((i64 + MOD - rhs.i) % MOD);
i = a32;
return *this;
}
constexpr ModInt operator-(self_type rhs) const noexcept {
self_type newInt(*this);
newInt -= rhs;
return newInt;
}
ModInt &operator*=(self_type rhs) {
MulT i64 = static_cast<MulT>(i);
StoreT a32 = static_cast<StoreT>((i64 * rhs.i) % MOD);
i = a32;
return *this;
}
constexpr ModInt operator*(self_type rhs) const noexcept {
self_type newInt(*this);
newInt *= rhs;
return newInt;
}
constexpr ModInt operator/(self_type rhs) const noexcept {
self_type newInt(*this);
self_type rhsInv = rhs.inv();
newInt *= rhsInv;
return newInt;
}
constexpr bool operator==(self_type rhs) const noexcept { return i == rhs.i; }
constexpr bool operator<(self_type rhs) const noexcept { return i < rhs.i; }
constexpr bool operator>(self_type rhs) const noexcept { return rhs < *this; }
constexpr ModInt pow(int n) const noexcept {
ModInt a = *this;
ModInt res = 1;
while (n > 0) {
if (n & 1) {
res *= a;
}
a *= a;
n >>= 1;
}
return res;
}
constexpr self_type inv() const noexcept { return pow(MOD - 2); }
};
template <class StoreT, class AddT, class MulT, StoreT MOD>
std::ostream &operator<<(std::ostream &ost, ModInt<StoreT, AddT, MulT, MOD> i) {
ost << i.getI();
return ost;
}
using UModInt = ModInt<uint_fast32_t, uint_fast32_t, uint_fast64_t, MOD>;
using SModInt = ModInt<int_fast32_t, int_fast32_t, int_fast64_t, MOD>;
template <class ModIntT> class BinomialFactory {
std::vector<ModIntT> stock;
std::vector<ModIntT> inv;
public:
explicit BinomialFactory(int N) {
stock.resize(N + 1);
inv.resize(N + 1);
stock[0] = 1;
inv[0] = 1;
for (int i = 1; i <= N; i++) {
stock[i] = stock[i - 1] * i;
inv[i] = stock[i].inv();
}
}
ModIntT bi(int n, int r) const {
if (r == 0 || r == n)
return 1;
return stock[n] * inv[n - r] * inv[r];
}
};
#include <cmath>
#include <unordered_map>
#include <vector>
using prime_map = std::unordered_map<int, int>;
class Factoriser {
std::vector<int> factors;
public:
Factoriser(int N) {
factors.resize(N + 1, 0);
int sqrN = static_cast<int>(std::sqrt(N));
for (int i = 2; i <= sqrN; ++i) {
if (factors[i] == 0) {
for (int j = i * 2; j <= N; j += i) {
if (factors[j] == 0) {
factors[j] = i;
}
}
}
}
}
prime_map Factorise(int M) const {
prime_map P;
int mm = M;
while (factors[mm]) {
++P[factors[mm]];
mm /= factors[mm];
}
if (mm >= 2)
++P[mm];
return P;
}
static prime_map DirectFactorise(int M) {
prime_map P;
int i = 2;
while (M > 0) {
if (M % i == 0) {
++P[i];
M /= i;
} else {
++i;
}
}
return P;
}
bool IsPrime(int M) const { return factors[M] == 0; }
};
int main() {
int N, M;
cin >> N >> M;
BinomialFactory<UModInt> bifac(N + 100000);
prime_map pm = Factoriser::DirectFactorise(M);
UModInt ans = 1;
for (auto t : pm)
ans *= bifac.bi(t.second + N - 1, N - 1);
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <numeric>
#include <vector>
#define YesNo(b) ((b) ? "Yes" : "No")
#define YESNO(b) ((b) ? "YES" : "NO")
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
#include <iostream>
#include <numeric>
#include <vector>
constexpr uint_fast64_t MOD = 1e9 + 7;
template <class StoreT, class AddT, class MulT, StoreT MOD> class ModInt {
using self_type = ModInt<StoreT, AddT, MulT, MOD>;
StoreT i;
public:
ModInt() : i(0) {}
ModInt(StoreT i) {
while (i < 0)
i += MOD;
this->i = i;
}
ModInt(const self_type &i) = default;
constexpr self_type &operator=(const self_type &i) = default;
constexpr uint_fast32_t getI() const noexcept { return i; }
ModInt &operator+=(self_type rhs) {
AddT i64 = static_cast<AddT>(i);
StoreT a32 = static_cast<StoreT>((i64 + rhs.i) % MOD);
i = a32;
return *this;
}
constexpr ModInt operator+(self_type rhs) const noexcept {
self_type newInt(*this);
newInt += rhs;
return newInt;
}
ModInt &operator-=(self_type rhs) {
AddT i64 = static_cast<AddT>(i);
StoreT a32 = static_cast<StoreT>((i64 + MOD - rhs.i) % MOD);
i = a32;
return *this;
}
constexpr ModInt operator-(self_type rhs) const noexcept {
self_type newInt(*this);
newInt -= rhs;
return newInt;
}
ModInt &operator*=(self_type rhs) {
MulT i64 = static_cast<MulT>(i);
StoreT a32 = static_cast<StoreT>((i64 * rhs.i) % MOD);
i = a32;
return *this;
}
constexpr ModInt operator*(self_type rhs) const noexcept {
self_type newInt(*this);
newInt *= rhs;
return newInt;
}
constexpr ModInt operator/(self_type rhs) const noexcept {
self_type newInt(*this);
self_type rhsInv = rhs.inv();
newInt *= rhsInv;
return newInt;
}
constexpr bool operator==(self_type rhs) const noexcept { return i == rhs.i; }
constexpr bool operator<(self_type rhs) const noexcept { return i < rhs.i; }
constexpr bool operator>(self_type rhs) const noexcept { return rhs < *this; }
constexpr ModInt pow(int n) const noexcept {
ModInt a = *this;
ModInt res = 1;
while (n > 0) {
if (n & 1) {
res *= a;
}
a *= a;
n >>= 1;
}
return res;
}
constexpr self_type inv() const noexcept { return pow(MOD - 2); }
};
template <class StoreT, class AddT, class MulT, StoreT MOD>
std::ostream &operator<<(std::ostream &ost, ModInt<StoreT, AddT, MulT, MOD> i) {
ost << i.getI();
return ost;
}
using UModInt = ModInt<uint_fast32_t, uint_fast32_t, uint_fast64_t, MOD>;
using SModInt = ModInt<int_fast32_t, int_fast32_t, int_fast64_t, MOD>;
template <class ModIntT> class BinomialFactory {
std::vector<ModIntT> stock;
std::vector<ModIntT> inv;
public:
explicit BinomialFactory(int N) {
stock.resize(N + 1);
inv.resize(N + 1);
stock[0] = 1;
inv[0] = 1;
for (int i = 1; i <= N; i++) {
stock[i] = stock[i - 1] * i;
inv[i] = stock[i].inv();
}
}
ModIntT bi(int n, int r) const {
if (r == 0 || r == n)
return 1;
return stock[n] * inv[n - r] * inv[r];
}
};
#include <cmath>
#include <unordered_map>
#include <vector>
using prime_map = std::unordered_map<int, int>;
class Factoriser {
std::vector<int> factors;
public:
Factoriser(int N) {
factors.resize(N + 1, 0);
int sqrN = static_cast<int>(std::sqrt(N));
for (int i = 2; i <= sqrN; ++i) {
if (factors[i] == 0) {
for (int j = i * 2; j <= N; j += i) {
if (factors[j] == 0) {
factors[j] = i;
}
}
}
}
}
prime_map Factorise(int M) const {
prime_map P;
int mm = M;
while (factors[mm]) {
++P[factors[mm]];
mm /= factors[mm];
}
if (mm >= 2)
++P[mm];
return P;
}
static prime_map DirectFactorise(int M) {
prime_map P;
int i = 2;
while (M > 1) {
if (M % i == 0) {
++P[i];
M /= i;
} else {
++i;
}
}
return P;
}
bool IsPrime(int M) const { return factors[M] == 0; }
};
int main() {
int N, M;
cin >> N >> M;
BinomialFactory<UModInt> bifac(N + 100000);
prime_map pm = Factoriser::DirectFactorise(M);
UModInt ans = 1;
for (auto t : pm)
ans *= bifac.bi(t.second + N - 1, N - 1);
cout << ans << endl;
}
| replace | 183 | 184 | 183 | 184 | TLE | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define rrep(i, n, m) for (int i = ((int)(n)-1); i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = 1000000007;
using namespace std;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
vector<ll> k(100010, 1);
rep(i, 1, 100010) k.at(i) = (k.at(i - 1) * i) % MOD;
int n, m;
cin >> n >> m;
vector<ll> vec;
rep(i, 2, (int)pow(m, 0.5) + 2) {
if (m % i != 0)
continue;
ll cnt = 0;
while (m % i == 0) {
m /= i;
cnt++;
}
vec.push_back(cnt);
}
if (m != 1)
vec.push_back(1);
ll ans = 1;
for (ll r : vec) {
ans *= k.at(r + n - 1) * modinv(k.at(r), MOD) % MOD;
ans %= MOD;
ans *= modinv(k.at(n - 1), MOD);
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define rrep(i, n, m) for (int i = ((int)(n)-1); i >= m; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int MOD = 1000000007;
using namespace std;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
vector<ll> k(200000, 1);
rep(i, 1, 200000) k.at(i) = (k.at(i - 1) * i) % MOD;
int n, m;
cin >> n >> m;
vector<ll> vec;
rep(i, 2, (int)pow(m, 0.5) + 2) {
if (m % i != 0)
continue;
ll cnt = 0;
while (m % i == 0) {
m /= i;
cnt++;
}
vec.push_back(cnt);
}
if (m != 1)
vec.push_back(1);
ll ans = 1;
for (ll r : vec) {
ans *= k.at(r + n - 1) * modinv(k.at(r), MOD) % MOD;
ans %= MOD;
ans *= modinv(k.at(n - 1), MOD);
ans %= MOD;
}
cout << ans << endl;
}
| replace | 23 | 25 | 23 | 25 | 0 | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
vector<long long> kosu; // ありえる素因数のmaxを入れる
void divisor(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
kosu.push_back(0);
}
while (n % i == 0) {
kosu[kosu.size() - 1]++;
n /= i;
}
}
if (n != 1) {
kosu.push_back(1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long N, M;
cin >> N >> M;
divisor(M);
long long maxKosu = *max_element(kosu.begin(), kosu.end());
vector<vector<long long>> dp(N, vector<long long>(maxKosu + 1));
for (int i = 0; i <= maxKosu; i++)
dp[0][i] = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j <= maxKosu; j++) {
dp[i][j] = dp[i - 1][j];
if (j > 0) {
dp[i][j] += dp[i][j - 1];
dp[i][j] %= MOD;
}
}
}
long long ans = 1;
for (int i = 0; i < kosu.size(); i++) {
ans *= dp[N - 1][kosu[i]];
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
vector<long long> kosu; // ありえる素因数のmaxを入れる
void divisor(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
kosu.push_back(0);
}
while (n % i == 0) {
kosu[kosu.size() - 1]++;
n /= i;
}
}
if (n != 1) {
kosu.push_back(1);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long N, M;
cin >> N >> M;
if (M == 1) {
cout << 1 << endl;
return 0;
} else {
divisor(M);
}
long long maxKosu = *max_element(kosu.begin(), kosu.end());
vector<vector<long long>> dp(N, vector<long long>(maxKosu + 1));
for (int i = 0; i <= maxKosu; i++)
dp[0][i] = 1;
for (int i = 1; i < N; i++) {
for (int j = 0; j <= maxKosu; j++) {
dp[i][j] = dp[i - 1][j];
if (j > 0) {
dp[i][j] += dp[i][j - 1];
dp[i][j] %= MOD;
}
}
}
long long ans = 1;
for (int i = 0; i < kosu.size(); i++) {
ans *= dp[N - 1][kosu[i]];
ans %= MOD;
}
cout << ans << endl;
}
| replace | 28 | 29 | 28 | 34 | 0 | |
p03253 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
long long mod = 1e9 + 7;
long long modpow(long long a, long long p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
long long halfP = p / 2;
long long half = modpow(a, halfP);
return half * half % mod;
} else {
return a * modpow(a, p - 1) % mod;
}
}
long long comb(int a, int b) {
if (b > a - b)
return comb(a, a - b);
long long ansMul = 1;
long long ansDiv = 1;
for (int i = 0; i < b; i++) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= mod;
ansDiv %= mod;
}
long long ans = ansMul * modpow(ansDiv, mod - 2) % mod;
return ans;
}
int main() {
long long n, m;
cin >> n >> m;
long long ans = 1;
for (int i = 2; i < m; i++) {
long long cnt = 0;
while (m % i == 0) {
cnt++;
m /= i;
}
ans *= comb(n + cnt - 1, n - 1);
ans %= mod;
}
if (m != 1) {
ans *= comb(n, n - 1);
ans %= mod;
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
long long mod = 1e9 + 7;
long long modpow(long long a, long long p) {
if (p == 0)
return 1;
if (p % 2 == 0) {
long long halfP = p / 2;
long long half = modpow(a, halfP);
return half * half % mod;
} else {
return a * modpow(a, p - 1) % mod;
}
}
long long comb(int a, int b) {
if (b > a - b)
return comb(a, a - b);
long long ansMul = 1;
long long ansDiv = 1;
for (int i = 0; i < b; i++) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= mod;
ansDiv %= mod;
}
long long ans = ansMul * modpow(ansDiv, mod - 2) % mod;
return ans;
}
int main() {
long long n, m;
cin >> n >> m;
long long ans = 1;
for (int i = 2; i < m && i < 1e5; i++) {
long long cnt = 0;
while (m % i == 0) {
cnt++;
m /= i;
}
ans *= comb(n + cnt - 1, n - 1);
ans %= mod;
}
if (m != 1) {
ans *= comb(n, n - 1);
ans %= mod;
}
cout << ans << endl;
}
| replace | 35 | 36 | 35 | 36 | TLE | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007; // 998244353; // 998244853;
template <typename T> struct modular {
constexpr modular() : val(0) {}
constexpr modular(const modular<T> &_m) : val(_m.val) {}
template <typename U> constexpr modular(const U &_r = U()) {
val = -MOD <= _r && _r < MOD ? _r : _r % MOD;
if (val < 0) {
val += MOD;
}
}
const T operator()() { return val; }
template <typename U> explicit operator U() const {
return static_cast<U>(val);
}
modular<T> &operator+=(const modular<T> &_m) {
if ((val += _m.val) >= MOD) {
val -= MOD;
}
return *this;
}
modular<T> &operator-=(const modular<T> &_m) {
if ((val -= _m.val) < 0) {
val += MOD;
}
return *this;
}
modular<T> &operator*=(const modular<T> &_m) {
val = modular<T>(static_cast<int64_t>(val) * static_cast<int64_t>(_m.val))
.val;
return *this;
}
modular<T> &operator/=(const modular<T> &_m) {
T a = _m.val, b = MOD, u = 0, v = 1;
while (a != 0) {
T q = b / a;
b -= q * a;
swap(a, b);
u -= q * v;
swap(u, v);
}
return *this *= u;
}
modular<T> &operator=(const modular<T> &_m) {
val = _m.val;
return *this;
}
template <typename U> modular<T> &operator+=(const U &_r) {
return *this += modular<T>(_r);
}
template <typename U> modular<T> &operator-=(const U &_r) {
return *this -= modular<T>(_r);
}
template <typename U> modular<T> &operator*=(const U &_r) {
return *this *= modular<T>(_r);
}
template <typename U> modular<T> &operator/=(const U &_r) {
return *this /= modular<T>(_r);
}
template <typename U> modular<T> &operator=(const U &_r) {
val = modular<T>(_r).val;
return *this;
}
modular<T> operator-() { return modular<T>(-val); }
template <typename U>
friend bool operator==(const modular<U> &, const modular<U> &);
friend std::istream &operator>>(std::istream &os, modular<T> &_m) {
os >> _m.val;
_m *= 1;
return os;
}
friend std::ostream &operator<<(std::ostream &os, const modular<T> &_m) {
return os << _m.val;
}
template <typename U> modular<T> exp(U e) {
modular<T> res = 1;
modular<T> b = val;
if (e < 0) {
b = 1 / b;
e *= -1;
}
for (; e; e >>= 1) {
if (e & 1) {
res *= b;
}
b *= b;
}
return res;
}
private:
T val;
};
template <typename T>
inline modular<T> operator+(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) += _rhs;
}
template <typename T, typename U>
inline modular<T> operator+(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) += _rhs;
}
template <typename T, typename U>
inline modular<T> operator+(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) += _rhs;
}
template <typename T>
inline modular<T> operator-(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) -= _rhs;
}
template <typename T, typename U>
inline modular<T> operator-(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) -= _rhs;
}
template <typename T, typename U>
inline modular<T> operator-(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) -= _rhs;
}
template <typename T>
inline modular<T> operator*(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) *= _rhs;
}
template <typename T, typename U>
inline modular<T> operator*(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) *= _rhs;
}
template <typename T, typename U>
inline modular<T> operator*(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) *= _rhs;
}
template <typename T>
inline modular<T> operator/(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) /= _rhs;
}
template <typename T, typename U>
inline modular<T> operator/(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) /= _rhs;
}
template <typename T, typename U>
inline modular<T> operator/(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) /= _rhs;
}
template <typename T>
inline bool operator==(const modular<T> &_lhs, const modular<T> &_rhs) {
return _lhs.val == _rhs.val;
}
template <typename T, typename U>
inline bool operator==(const modular<T> &_lhs, const U &_rhs) {
return _lhs == modular<T>(_rhs);
}
template <typename T, typename U>
inline bool operator==(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) == _rhs;
}
template <typename T>
inline bool operator!=(const modular<T> &_lhs, const modular<T> &_rhs) {
return !(_lhs == _rhs);
}
template <typename T, typename U>
inline bool operator!=(const modular<T> &_lhs, const U &_rhs) {
return !(_lhs == _rhs);
}
template <typename T, typename U>
inline bool operator!=(const U &_lhs, const modular<T> &_rhs) {
return !(_lhs == _rhs);
}
typedef modular<int> mint;
struct Comb {
int N;
vector<mint> fac, ifac, inv;
Comb(int _n = 1) {
resize(2);
fac[0] = fac[1] = ifac[0] = ifac[1] = inv[1] = 1;
N = 1;
grow(_n);
}
void resize(int _s) {
fac.resize(_s);
ifac.resize(_s);
inv.resize(_s);
}
bool grow(int _n) {
if (_n <= N)
return false;
swap(_n, N);
resize(N + 1);
for (int i = _n + 1; i <= N; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = (-MOD / i) * inv[MOD % i];
ifac[i] = ifac[i - 1] * inv[i];
}
return true;
}
// perm
mint a(int n, int k) {
if (n < k || k < 0)
return 0;
if (n > N)
grow(n);
return fac[n] * ifac[n - k];
}
// choose
mint c(int n, int k) {
if (n < k || k < 0)
return 0;
if (n > N)
grow(n);
return fac[n] * ifac[n - k] * ifac[k];
}
// sum x = s, x > 0
mint p(int s, int k) { return c(s - 1, k - 1); }
// sum x = s, x >= 0
mint z(int s, int k) { return p(s + k, k); }
// \E Y-X >= m
mint hit(int n, int k, int m = 1) {
if (m <= k - n)
return c(n + k, n);
return c(n + k, k - m);
}
// catalan trapezoids C_m(n, k)
// \A Y-X < m, =c(n+k,n) - hit
mint cat(int n, int k, int m = 1) {
if (m > k)
return c(n + k, n);
if (m <= k - n)
return 0;
return c(n + k, n) - c(n + k, k - m);
}
};
void solve() {
int n, m;
cin >> n >> m;
vector<int> prime;
auto sieve = [&](int _n = 45000) {
vector<bool> is(_n + 1, true);
is[0] = is[1] = false;
for (int p = 2; p * p <= _n; p++) {
if (is[p]) {
for (int i = p * p; i <= _n; i += p) {
is[i] = false;
}
}
}
for (int i = 2; i <= _n; i++) {
if (is[i])
prime.emplace_back(i);
}
};
auto decomp = [&](int x) {
assert(x > 1);
vector<pair<int, int>> res;
for (int p : prime) {
if (p * p > x)
break;
if (x % p == 0) {
int e = 0;
while (x % p == 0) {
e++;
x /= p;
}
res.emplace_back(p, e);
}
}
if (x != 1)
res.emplace_back(x, 1);
return res;
};
sieve();
Comb c(n);
mint res = 1;
for (auto &p : decomp(m)) {
int e = p.second;
res *= c.z(e, n);
}
cout << res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007; // 998244353; // 998244853;
template <typename T> struct modular {
constexpr modular() : val(0) {}
constexpr modular(const modular<T> &_m) : val(_m.val) {}
template <typename U> constexpr modular(const U &_r = U()) {
val = -MOD <= _r && _r < MOD ? _r : _r % MOD;
if (val < 0) {
val += MOD;
}
}
const T operator()() { return val; }
template <typename U> explicit operator U() const {
return static_cast<U>(val);
}
modular<T> &operator+=(const modular<T> &_m) {
if ((val += _m.val) >= MOD) {
val -= MOD;
}
return *this;
}
modular<T> &operator-=(const modular<T> &_m) {
if ((val -= _m.val) < 0) {
val += MOD;
}
return *this;
}
modular<T> &operator*=(const modular<T> &_m) {
val = modular<T>(static_cast<int64_t>(val) * static_cast<int64_t>(_m.val))
.val;
return *this;
}
modular<T> &operator/=(const modular<T> &_m) {
T a = _m.val, b = MOD, u = 0, v = 1;
while (a != 0) {
T q = b / a;
b -= q * a;
swap(a, b);
u -= q * v;
swap(u, v);
}
return *this *= u;
}
modular<T> &operator=(const modular<T> &_m) {
val = _m.val;
return *this;
}
template <typename U> modular<T> &operator+=(const U &_r) {
return *this += modular<T>(_r);
}
template <typename U> modular<T> &operator-=(const U &_r) {
return *this -= modular<T>(_r);
}
template <typename U> modular<T> &operator*=(const U &_r) {
return *this *= modular<T>(_r);
}
template <typename U> modular<T> &operator/=(const U &_r) {
return *this /= modular<T>(_r);
}
template <typename U> modular<T> &operator=(const U &_r) {
val = modular<T>(_r).val;
return *this;
}
modular<T> operator-() { return modular<T>(-val); }
template <typename U>
friend bool operator==(const modular<U> &, const modular<U> &);
friend std::istream &operator>>(std::istream &os, modular<T> &_m) {
os >> _m.val;
_m *= 1;
return os;
}
friend std::ostream &operator<<(std::ostream &os, const modular<T> &_m) {
return os << _m.val;
}
template <typename U> modular<T> exp(U e) {
modular<T> res = 1;
modular<T> b = val;
if (e < 0) {
b = 1 / b;
e *= -1;
}
for (; e; e >>= 1) {
if (e & 1) {
res *= b;
}
b *= b;
}
return res;
}
private:
T val;
};
template <typename T>
inline modular<T> operator+(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) += _rhs;
}
template <typename T, typename U>
inline modular<T> operator+(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) += _rhs;
}
template <typename T, typename U>
inline modular<T> operator+(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) += _rhs;
}
template <typename T>
inline modular<T> operator-(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) -= _rhs;
}
template <typename T, typename U>
inline modular<T> operator-(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) -= _rhs;
}
template <typename T, typename U>
inline modular<T> operator-(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) -= _rhs;
}
template <typename T>
inline modular<T> operator*(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) *= _rhs;
}
template <typename T, typename U>
inline modular<T> operator*(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) *= _rhs;
}
template <typename T, typename U>
inline modular<T> operator*(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) *= _rhs;
}
template <typename T>
inline modular<T> operator/(const modular<T> &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) /= _rhs;
}
template <typename T, typename U>
inline modular<T> operator/(const modular<T> &_lhs, const U &_rhs) {
return modular<T>(_lhs) /= _rhs;
}
template <typename T, typename U>
inline modular<T> operator/(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) /= _rhs;
}
template <typename T>
inline bool operator==(const modular<T> &_lhs, const modular<T> &_rhs) {
return _lhs.val == _rhs.val;
}
template <typename T, typename U>
inline bool operator==(const modular<T> &_lhs, const U &_rhs) {
return _lhs == modular<T>(_rhs);
}
template <typename T, typename U>
inline bool operator==(const U &_lhs, const modular<T> &_rhs) {
return modular<T>(_lhs) == _rhs;
}
template <typename T>
inline bool operator!=(const modular<T> &_lhs, const modular<T> &_rhs) {
return !(_lhs == _rhs);
}
template <typename T, typename U>
inline bool operator!=(const modular<T> &_lhs, const U &_rhs) {
return !(_lhs == _rhs);
}
template <typename T, typename U>
inline bool operator!=(const U &_lhs, const modular<T> &_rhs) {
return !(_lhs == _rhs);
}
typedef modular<int> mint;
struct Comb {
int N;
vector<mint> fac, ifac, inv;
Comb(int _n = 1) {
resize(2);
fac[0] = fac[1] = ifac[0] = ifac[1] = inv[1] = 1;
N = 1;
grow(_n);
}
void resize(int _s) {
fac.resize(_s);
ifac.resize(_s);
inv.resize(_s);
}
bool grow(int _n) {
if (_n <= N)
return false;
swap(_n, N);
resize(N + 1);
for (int i = _n + 1; i <= N; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = (-MOD / i) * inv[MOD % i];
ifac[i] = ifac[i - 1] * inv[i];
}
return true;
}
// perm
mint a(int n, int k) {
if (n < k || k < 0)
return 0;
if (n > N)
grow(n);
return fac[n] * ifac[n - k];
}
// choose
mint c(int n, int k) {
if (n < k || k < 0)
return 0;
if (n > N)
grow(n);
return fac[n] * ifac[n - k] * ifac[k];
}
// sum x = s, x > 0
mint p(int s, int k) { return c(s - 1, k - 1); }
// sum x = s, x >= 0
mint z(int s, int k) { return p(s + k, k); }
// \E Y-X >= m
mint hit(int n, int k, int m = 1) {
if (m <= k - n)
return c(n + k, n);
return c(n + k, k - m);
}
// catalan trapezoids C_m(n, k)
// \A Y-X < m, =c(n+k,n) - hit
mint cat(int n, int k, int m = 1) {
if (m > k)
return c(n + k, n);
if (m <= k - n)
return 0;
return c(n + k, n) - c(n + k, k - m);
}
};
void solve() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 1;
return;
}
vector<int> prime;
auto sieve = [&](int _n = 45000) {
vector<bool> is(_n + 1, true);
is[0] = is[1] = false;
for (int p = 2; p * p <= _n; p++) {
if (is[p]) {
for (int i = p * p; i <= _n; i += p) {
is[i] = false;
}
}
}
for (int i = 2; i <= _n; i++) {
if (is[i])
prime.emplace_back(i);
}
};
auto decomp = [&](int x) {
assert(x > 1);
vector<pair<int, int>> res;
for (int p : prime) {
if (p * p > x)
break;
if (x % p == 0) {
int e = 0;
while (x % p == 0) {
e++;
x /= p;
}
res.emplace_back(p, e);
}
}
if (x != 1)
res.emplace_back(x, 1);
return res;
};
sieve();
Comb c(n);
mint res = 1;
for (auto &p : decomp(m)) {
int e = p.second;
res *= c.z(e, n);
}
cout << res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
cout << endl;
}
| insert | 238 | 238 | 238 | 242 | 0 | |
p03253 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
// 階乗
vector<ll> fact;
// 逆元
vector<ll> inv;
// 逆元階乗
vector<ll> finv;
pii extgcd(ll a, ll b) {
// 前提：aとbが互いに素であること．
pii x(make_pair(1, 0), a);
pii y(make_pair(0, 1), b);
ll div = 0;
// 終了条件:(GCD(a,b), 0)または(0,GCD(a,b))
while (true) {
if (y.second == 0)
return x;
div = x.second / y.second;
x.second = x.second - div * y.second;
x.first.first = x.first.first - div * y.first.first;
x.first.second = x.first.second - div * y.first.second;
if (x.second == 0)
return y;
div = y.second / x.second;
y.second = y.second - div * x.second;
y.first.first = y.first.first - div * x.first.first;
y.first.second = y.first.second - div * x.first.second;
}
}
ll modinv(ll a, ll m = MOD) {
// 前提：aとmが互いに素であること．
pii ans;
ans = extgcd(a, m);
ll invNum = 0;
invNum = ans.first.first;
invNum %= m;
// C++特有の剰余がマイナスになってしまう対策
if (invNum < 0)
invNum += m;
return invNum;
}
ll warizan_mod(ll warareru, ll waru, ll m = MOD) {
// 割られる数に逆元をかけるだけ
warareru %= m;
return warareru * modinv(waru, m) % m;
}
// 階乗と逆元を列挙
void combination(ll num, ll m = MOD) {
fact.assign(num + 1919, 0);
finv.assign(num + 1919, 0);
inv.assign(num + 1919, 0);
// 初期化
fact[0] = 1;
inv[0] = 1;
// テーブルに列挙
for (ll i = 1; i < fact.size(); i++) {
fact[i] = fact[i - 1] * i % m;
inv[i] = modinv(fact[i]);
}
}
// 階乗 n!
ll factrial(ll n) { return fact[n]; }
// 順列 nPk n!/(n-k)!
ll nPk(ll n, ll k, ll m = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * inv[n - k] % m;
}
// 二項係数 nCk n!/(k!*(n-k)!)
ll nCk(ll n, ll k, ll m = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * (inv[k] * inv[n - k] % m) % m;
}
// 重複組み合わせ n+k-1Ck
ll nHk(ll n, ll k, ll m = MOD) { return nCk(n + k - 1, k); }
map<ll, ll> primeFactor(ll num) {
// 素因数と指数部の並び
map<ll, ll> PF;
ll i = 2;
while (num >= i * i) {
if (num % i == 0) {
PF[i]++;
num /= i;
} else {
i++;
}
}
// 1は素因数分解できない
if (num != 1) {
PF[num]++;
}
return PF;
}
int main() {
ll N, M;
cin >> N >> M;
// 準備
combination(1000);
map<ll, ll> PF = primeFactor(M);
ll ans = 1;
// 素因数ごとに独立して考える！！
auto begin = PF.begin(), end = PF.end();
for (auto iter = begin; iter != end; iter++) {
// 素因数の数
ll num = iter->second;
ans *= nHk(N, num);
ans %= MOD;
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pi;
typedef pair<pair<ll, ll>, ll> pii;
vector<ll> vec;
vector<vector<ll>> vec2;
ll MOD = 1000000007;
ll INF = 11451419194545;
// 階乗
vector<ll> fact;
// 逆元
vector<ll> inv;
// 逆元階乗
vector<ll> finv;
pii extgcd(ll a, ll b) {
// 前提：aとbが互いに素であること．
pii x(make_pair(1, 0), a);
pii y(make_pair(0, 1), b);
ll div = 0;
// 終了条件:(GCD(a,b), 0)または(0,GCD(a,b))
while (true) {
if (y.second == 0)
return x;
div = x.second / y.second;
x.second = x.second - div * y.second;
x.first.first = x.first.first - div * y.first.first;
x.first.second = x.first.second - div * y.first.second;
if (x.second == 0)
return y;
div = y.second / x.second;
y.second = y.second - div * x.second;
y.first.first = y.first.first - div * x.first.first;
y.first.second = y.first.second - div * x.first.second;
}
}
ll modinv(ll a, ll m = MOD) {
// 前提：aとmが互いに素であること．
pii ans;
ans = extgcd(a, m);
ll invNum = 0;
invNum = ans.first.first;
invNum %= m;
// C++特有の剰余がマイナスになってしまう対策
if (invNum < 0)
invNum += m;
return invNum;
}
ll warizan_mod(ll warareru, ll waru, ll m = MOD) {
// 割られる数に逆元をかけるだけ
warareru %= m;
return warareru * modinv(waru, m) % m;
}
// 階乗と逆元を列挙
void combination(ll num, ll m = MOD) {
fact.assign(num + 1919, 0);
finv.assign(num + 1919, 0);
inv.assign(num + 1919, 0);
// 初期化
fact[0] = 1;
inv[0] = 1;
// テーブルに列挙
for (ll i = 1; i < fact.size(); i++) {
fact[i] = fact[i - 1] * i % m;
inv[i] = modinv(fact[i]);
}
}
// 階乗 n!
ll factrial(ll n) { return fact[n]; }
// 順列 nPk n!/(n-k)!
ll nPk(ll n, ll k, ll m = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * inv[n - k] % m;
}
// 二項係数 nCk n!/(k!*(n-k)!)
ll nCk(ll n, ll k, ll m = MOD) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * (inv[k] * inv[n - k] % m) % m;
}
// 重複組み合わせ n+k-1Ck
ll nHk(ll n, ll k, ll m = MOD) { return nCk(n + k - 1, k); }
map<ll, ll> primeFactor(ll num) {
// 素因数と指数部の並び
map<ll, ll> PF;
ll i = 2;
while (num >= i * i) {
if (num % i == 0) {
PF[i]++;
num /= i;
} else {
i++;
}
}
// 1は素因数分解できない
if (num != 1) {
PF[num]++;
}
return PF;
}
int main() {
ll N, M;
cin >> N >> M;
// 準備
combination(100000);
map<ll, ll> PF = primeFactor(M);
ll ans = 1;
// 素因数ごとに独立して考える！！
auto begin = PF.begin(), end = PF.end();
for (auto iter = begin; iter != end; iter++) {
// 素因数の数
ll num = iter->second;
ans *= nHk(N, num);
ans %= MOD;
}
cout << ans << endl;
} | replace | 131 | 132 | 131 | 132 | 0 | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX 100005
#define pb push_back
#define INF 2147483647
#define MOD 1000000007
using namespace std;
typedef long long ll;
vector<int> factorize(int n) {
vector<int> v;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
v.pb(i);
n /= i;
}
}
if (n != 1)
v.pb(n);
return v;
}
ll powMod(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;
}
ll fact(int n) {
ll res = 1;
for (int i = 1; i <= n; i++) {
res = (res * i) % MOD;
}
return res;
}
ll solve(int n, int r) {
ll res = 1;
n = n + r - 1;
for (int i = n; i >= n - r + 1; i--) {
res = (1LL * res * i) % MOD;
}
res = (res * powMod(fact(r), MOD - 2)) % MOD;
return res;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, m;
cin >> n >> m;
map<ll, ll> mp;
vector<int> factor = factorize(m);
for (int i = 0; i < factor.size(); i++) {
mp[factor[i]]++;
}
ll ans = 1;
for (map<ll, ll>::iterator it = mp.begin(); it != mp.end(); it++) {
ans = (ans * solve(n, it->second)) % MOD;
// cout<<solve(n, it->second)<<endl;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define MAX 100005
#define pb push_back
#define INF 2147483647
#define MOD 1000000007
using namespace std;
typedef long long ll;
vector<int> factorize(int n) {
vector<int> v;
for (int i = 2; i * i <= n; i++) {
while (n % i == 0) {
v.pb(i);
n /= i;
}
}
if (n != 1)
v.pb(n);
return v;
}
ll powMod(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;
}
ll fact(int n) {
ll res = 1;
for (int i = 1; i <= n; i++) {
res = (res * i) % MOD;
}
return res;
}
ll solve(int n, int r) {
ll res = 1;
n = n + r - 1;
for (int i = n; i >= n - r + 1; i--) {
res = (1LL * res * i) % MOD;
}
res = (res * powMod(fact(r), MOD - 2)) % MOD;
return res;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, m;
cin >> n >> m;
map<ll, ll> mp;
vector<int> factor = factorize(m);
for (int i = 0; i < factor.size(); i++) {
mp[factor[i]]++;
}
ll ans = 1;
for (map<ll, ll>::iterator it = mp.begin(); it != mp.end(); it++) {
ans = (ans * solve(n, it->second)) % MOD;
// cout<<solve(n, it->second)<<endl;
}
cout << ans << endl;
return 0;
} | replace | 56 | 57 | 56 | 57 | 0 | |
p03253 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <set>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lli = long long int;
// #define DEBUG
#ifdef DEBUG
#define debug(var) cout << (#var) << ": " << (var) << endl;
template <class T> void dump_array_impl(const T &a) {
bool first = true;
for (auto &&x : a) {
if (!first) {
cout << ", ";
first = false;
}
cout << x;
}
}
#define debug_array(a) \
cout << (#a) << ": "; \
dump_array_impl(a); \
cout << endl
#else
#define debug(var) \
{}
#define debug_array(a) \
{}
#endif
template <class T> void read_n(vector<T> &v, size_t n) {
v = vector<T>(n);
for (lli i = 0; i < n; ++i)
cin >> v[i];
}
vector<lli> factmem, factinvmem;
lli n, m, mod = 1e9 + 7;
lli fact(lli n) {
if (factmem[n] == 0)
factmem[n] = n * fact(n - 1) % mod;
return factmem[n];
}
lli modinv(lli a) {
lli b = mod, u = 1, v = 0;
while (b) {
lli t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
lli factinv(lli n) {
if (factinvmem[n] == 0)
factinvmem[n] = modinv(fact(n));
return factinvmem[n];
}
lli conb(lli n, lli k) {
return fact(n) * (factinv(k) * factinv(n - k) % mod) % mod;
}
int main() {
factmem = vector<lli>(20000, 0);
factinvmem = vector<lli>(20000, 0);
factmem[0] = 1;
cin >> n >> m;
lli lim = sqrt((double)m);
lli mm = m;
lli ans = 1;
for (lli i = 2; i <= lim; ++i) {
lli cnt = 0;
while (mm % i == 0) {
mm /= i;
++cnt;
}
if (cnt > 0) {
ans = ans * conb(cnt + n - 1, n - 1) % mod;
}
}
if (mm > 1)
ans = ans * conb(1 + n - 1, n - 1) % mod;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <set>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lli = long long int;
// #define DEBUG
#ifdef DEBUG
#define debug(var) cout << (#var) << ": " << (var) << endl;
template <class T> void dump_array_impl(const T &a) {
bool first = true;
for (auto &&x : a) {
if (!first) {
cout << ", ";
first = false;
}
cout << x;
}
}
#define debug_array(a) \
cout << (#a) << ": "; \
dump_array_impl(a); \
cout << endl
#else
#define debug(var) \
{}
#define debug_array(a) \
{}
#endif
template <class T> void read_n(vector<T> &v, size_t n) {
v = vector<T>(n);
for (lli i = 0; i < n; ++i)
cin >> v[i];
}
vector<lli> factmem, factinvmem;
lli n, m, mod = 1e9 + 7;
lli fact(lli n) {
if (factmem[n] == 0)
factmem[n] = n * fact(n - 1) % mod;
return factmem[n];
}
lli modinv(lli a) {
lli b = mod, u = 1, v = 0;
while (b) {
lli t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
lli factinv(lli n) {
if (factinvmem[n] == 0)
factinvmem[n] = modinv(fact(n));
return factinvmem[n];
}
lli conb(lli n, lli k) {
return fact(n) * (factinv(k) * factinv(n - k) % mod) % mod;
}
int main() {
factmem = vector<lli>(200000, 0);
factinvmem = vector<lli>(200000, 0);
factmem[0] = 1;
cin >> n >> m;
lli lim = sqrt((double)m);
lli mm = m;
lli ans = 1;
for (lli i = 2; i <= lim; ++i) {
lli cnt = 0;
while (mm % i == 0) {
mm /= i;
++cnt;
}
if (cnt > 0) {
ans = ans * conb(cnt + n - 1, n - 1) % mod;
}
}
if (mm > 1)
ans = ans * conb(1 + n - 1, n - 1) % mod;
cout << ans << endl;
return 0;
}
| replace | 77 | 79 | 77 | 79 | 0 | |
p03253 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int A[100000] = {};
int RT = pow(M, 0.5);
for (int i = 2; i <= RT; i++) {
while (M % i == 0) {
A[i]++;
M /= i;
}
}
if (M != 1)
A[M]++;
ll pasu[100100][35] = {};
ll mod = 1e9 + 7;
rep1(i, N) {
pasu[i][0] = 1;
rep1(ii, 34) {
if (i == 1)
pasu[i][ii] = 1;
else
pasu[i][ii] = (pasu[i][ii - 1] + pasu[i - 1][ii]) % mod;
}
}
ll kotae = 1;
rep(i, 100000) { kotae = (kotae * pasu[N][A[i]]) % mod; }
co(kotae);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
int A[100000] = {};
int RT = pow(M, 0.5);
for (int i = 2; i <= RT; i++) {
while (M % i == 0) {
A[i]++;
M /= i;
}
}
if (M != 1)
A[1]++;
ll pasu[100100][35] = {};
ll mod = 1e9 + 7;
rep1(i, N) {
pasu[i][0] = 1;
rep1(ii, 34) {
if (i == 1)
pasu[i][ii] = 1;
else
pasu[i][ii] = (pasu[i][ii - 1] + pasu[i - 1][ii]) % mod;
}
}
ll kotae = 1;
rep(i, 100000) { kotae = (kotae * pasu[N][A[i]]) % mod; }
co(kotae);
Would you please return 0;
} | replace | 27 | 28 | 27 | 28 | -11 | |
p03253 | Python | Runtime Error | from math import sqrt
from scipy.special import comb
n, m = map(int, input().split())
mod = 10**9 + 7
def sieve(x):
primes = []
li = list(range(2, x + 1))
while li[0] <= sqrt(x):
p = li[0]
primes.append(p)
li = [e for e in li if e % p != 0]
primes += li
return primes
def prime_fact(x):
primes = sieve(int(sqrt(x)) + 1)
d = {}
for p in primes:
cnt = 0
while x % p == 0:
x //= p
cnt += 1
if cnt:
d[p] = cnt
if x != 1:
d[x] = 1
return d
pf = prime_fact(m)
ans = 1
for v in pf.values():
ans *= comb(v + n - 1, v, exact=True)
ans %= mod
print(ans)
| from math import sqrt
from scipy.misc import comb
n, m = map(int, input().split())
mod = 10**9 + 7
def sieve(x):
primes = []
li = list(range(2, x + 1))
while li[0] <= sqrt(x):
p = li[0]
primes.append(p)
li = [e for e in li if e % p != 0]
primes += li
return primes
def prime_fact(x):
primes = sieve(int(sqrt(x)) + 1)
d = {}
for p in primes:
cnt = 0
while x % p == 0:
x //= p
cnt += 1
if cnt:
d[p] = cnt
if x != 1:
d[x] = 1
return d
pf = prime_fact(m)
ans = 1
for v in pf.values():
ans *= comb(v + n - 1, v, exact=True)
ans %= mod
print(ans)
| replace | 1 | 2 | 1 | 2 | ModuleNotFoundError: No module named 'scipy' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03253/Python/s977357827.py", line 2, in <module>
from scipy.special import comb
ModuleNotFoundError: No module named 'scipy'
|
p03253 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vl = vector<ll>;
using vi = vector<int>;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dp[100100][100100];
ll power(int m, int n) { // m^n（繰り返し自乗法）
if (n == 0)
return 1;
if (n % 2 == 1)
return power(m, n - 1) * m % mod;
ll r = power(m, n / 2);
return r * r % mod;
}
// ll fact(int n) { // 階乗
// return f[n];
// }
ll inv(ll a, ll b) { // 逆元を利用してa/bのmodを返す
return a * power(b, mod - 2) % mod;
}
ll f[101000];
ll comb(int n, int r) { // nCr
if (n < r)
return 0;
// if (n == r || r == 0) return dp[n][r] = 1;
// if (r == 1) return dp[n][r] = n;
// if (dp[n][r] != 0) return dp[n][r];
// return dp[n][r] = (comb(n-1, r-1) + comb(n-1, r)) % mod;
if (n == r || r == 0)
return 1;
ll s = f[n - r] * f[r] % mod;
return inv(f[n], s);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll p = 1;
rep(i, 101000) {
if (i == 0)
f[i] = 1;
else {
p *= i;
p %= mod;
f[i] = p;
}
}
int n, m;
cin >> n >> m;
int M = m;
ll r = 1;
for (int i = 2; i <= m; i++) {
int cnt = 0;
if (M % i == 0) {
while (M % i == 0) {
M /= i;
cnt++;
}
// cout << cnt << "\n";
r *= comb(cnt + n - 1, cnt);
r %= mod;
}
}
cout << r << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vl = vector<ll>;
using vi = vector<int>;
const ll INF = 1e18;
const ll mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dp[100100][100100];
ll power(int m, int n) { // m^n（繰り返し自乗法）
if (n == 0)
return 1;
if (n % 2 == 1)
return power(m, n - 1) * m % mod;
ll r = power(m, n / 2);
return r * r % mod;
}
// ll fact(int n) { // 階乗
// return f[n];
// }
ll inv(ll a, ll b) { // 逆元を利用してa/bのmodを返す
return a * power(b, mod - 2) % mod;
}
ll f[101000];
ll comb(int n, int r) { // nCr
if (n < r)
return 0;
// if (n == r || r == 0) return dp[n][r] = 1;
// if (r == 1) return dp[n][r] = n;
// if (dp[n][r] != 0) return dp[n][r];
// return dp[n][r] = (comb(n-1, r-1) + comb(n-1, r)) % mod;
if (n == r || r == 0)
return 1;
ll s = f[n - r] * f[r] % mod;
return inv(f[n], s);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll p = 1;
rep(i, 101000) {
if (i == 0)
f[i] = 1;
else {
p *= i;
p %= mod;
f[i] = p;
}
}
int n, m;
cin >> n >> m;
int M = m;
ll r = 1;
for (int i = 2; i <= M; i++) {
int cnt = 0;
if (M % i == 0) {
while (M % i == 0) {
M /= i;
cnt++;
}
// cout << cnt << "\n";
r *= comb(cnt + n - 1, cnt);
r %= mod;
}
}
cout << r << "\n";
} | replace | 65 | 66 | 65 | 66 | TLE | |
p03253 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REREP(i, n) for (int i = int(n - 1); i >= 0; i--)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define REFOR(i, m, n) for (int i = int(n - 1); i >= int(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VD vector<double>
#define VVD vector<vector<double>>
#define VVVD vector<vector<vector<double>>>
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VVVL vector<vector<vector<ll>>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define VVVB vector<vector<vector<bool>>>
#define VS vector<string>
#define VVS vector<vector<string>>
#define VVVS vector<vector<vector<string>>>
#define PII pair<int, int>
#define PDD pair<double, double>
#define PLL pair<ll, ll>
#define VPII vector<pair<int, int>>
#define VVPII vector<vector<pair<int, int>>>
#define VVVPII vector<vector<vector<pair<int, int>>>>
#define VPLL vector<pair<ll, ll>>
#define VVPLL vector<vector<pair<ll, ll>>>
#define VVVPLL vector<vector<vector<pair<ll, ll>>>>
#define SUMI(obj) accumulate((obj).begin(), (obj).end(), 0)
#define SUMD(obj) accumulate((obj).begin(), (obj).end(), 0.)
#define SUML(obj) accumulate((obj).begin(), (obj).end(), 0LL)
#define SORT(obj) sort((obj).begin(), (obj).end()) // 1,2,3,4,5...
#define RESORT(obj) \
sort((obj).begin(), (obj).end(), greater<int>()) // 5,4,3,2,1...
#define UB(obj, n) upper_bound((obj).begin(), (obj).end(), n) // itr > n
#define LB(obj, n) lower_bound((obj).begin(), (obj).end(), n) // itr>= n
const ll HMOD = (ll)1e9 + 7;
const ll LMOD = 998244353;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
const long double EPS = 1e-10;
void YN(bool flag) { cout << ((flag) ? "YES" : "NO") << endl; }
void Yn(bool flag) { cout << ((flag) ? "Yes" : "No") << endl; }
void yn(bool flag) { cout << ((flag) ? "yes" : "no") << endl; }
// Prime Factorization
vector<long long> PrimeFact(long long N) {
vector<long long> ret;
if (N == 1)
ret.push_back(1);
for (long long i = 2, M = N; i * i <= M; ++i) {
if (N % i == 0)
ret.push_back(i);
while (N % i == 0)
N /= i;
}
if (N != 1)
ret.push_back(N);
return ret;
}
// Combination Mod
class Combination_Mod {
public:
vector<long long> fac, finv, inv;
long long MOD;
Combination_Mod(int N, long long mod)
: fac(vector<long long>(N + 1)), finv(vector<long long>(N + 1)),
inv(vector<long long>(N + 1)), MOD(mod) {
fac[0] = fac[1] = finv[0] = finv[1] = inv[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;
}
}
long long com(int n, int k) {
return ((n < 0 || k < 0 || n < k)
? 0
: fac[n] * (finv[k] * finv[n - k] % MOD) % MOD);
}
};
int main() {
ll N, M, K, maxi = 0;
cin >> N >> M;
VL p = PrimeFact(M);
map<ll, ll> mp;
K = M;
for (auto i : p)
for (; K % i == 0; K /= i)
mp[i]++;
for (auto i : mp)
maxi = max(i.second, maxi);
Combination_Mod CM(N + maxi, HMOD);
ll ans = 1;
for (auto i : mp)
(ans *= CM.com(N - 1 + i.second, N - 1)) %= HMOD;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REREP(i, n) for (int i = int(n - 1); i >= 0; i--)
#define FOR(i, m, n) for (int i = int(m); i < int(n); i++)
#define REFOR(i, m, n) for (int i = int(n - 1); i >= int(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define VI vector<int>
#define VVI vector<vector<int>>
#define VVVI vector<vector<vector<int>>>
#define VD vector<double>
#define VVD vector<vector<double>>
#define VVVD vector<vector<vector<double>>>
#define VL vector<ll>
#define VVL vector<vector<ll>>
#define VVVL vector<vector<vector<ll>>>
#define VB vector<bool>
#define VVB vector<vector<bool>>
#define VVVB vector<vector<vector<bool>>>
#define VS vector<string>
#define VVS vector<vector<string>>
#define VVVS vector<vector<vector<string>>>
#define PII pair<int, int>
#define PDD pair<double, double>
#define PLL pair<ll, ll>
#define VPII vector<pair<int, int>>
#define VVPII vector<vector<pair<int, int>>>
#define VVVPII vector<vector<vector<pair<int, int>>>>
#define VPLL vector<pair<ll, ll>>
#define VVPLL vector<vector<pair<ll, ll>>>
#define VVVPLL vector<vector<vector<pair<ll, ll>>>>
#define SUMI(obj) accumulate((obj).begin(), (obj).end(), 0)
#define SUMD(obj) accumulate((obj).begin(), (obj).end(), 0.)
#define SUML(obj) accumulate((obj).begin(), (obj).end(), 0LL)
#define SORT(obj) sort((obj).begin(), (obj).end()) // 1,2,3,4,5...
#define RESORT(obj) \
sort((obj).begin(), (obj).end(), greater<int>()) // 5,4,3,2,1...
#define UB(obj, n) upper_bound((obj).begin(), (obj).end(), n) // itr > n
#define LB(obj, n) lower_bound((obj).begin(), (obj).end(), n) // itr>= n
const ll HMOD = (ll)1e9 + 7;
const ll LMOD = 998244353;
const ll HINF = (ll)1e18;
const ll LINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
const long double EPS = 1e-10;
void YN(bool flag) { cout << ((flag) ? "YES" : "NO") << endl; }
void Yn(bool flag) { cout << ((flag) ? "Yes" : "No") << endl; }
void yn(bool flag) { cout << ((flag) ? "yes" : "no") << endl; }
// Prime Factorization
vector<long long> PrimeFact(long long N) {
vector<long long> ret;
if (N == 1)
ret.push_back(1);
for (long long i = 2, M = N; i * i <= M; ++i) {
if (N % i == 0)
ret.push_back(i);
while (N % i == 0)
N /= i;
}
if (N != 1)
ret.push_back(N);
return ret;
}
// Combination Mod
class Combination_Mod {
public:
vector<long long> fac, finv, inv;
long long MOD;
Combination_Mod(int N, long long mod)
: fac(vector<long long>(N + 1)), finv(vector<long long>(N + 1)),
inv(vector<long long>(N + 1)), MOD(mod) {
fac[0] = fac[1] = finv[0] = finv[1] = inv[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;
}
}
long long com(int n, int k) {
return ((n < 0 || k < 0 || n < k)
? 0
: fac[n] * (finv[k] * finv[n - k] % MOD) % MOD);
}
};
int main() {
ll N, M, K, maxi = 0;
cin >> N >> M;
if (M == 1) {
cout << 1 << endl;
return 0;
}
VL p = PrimeFact(M);
map<ll, ll> mp;
K = M;
for (auto i : p)
for (; K % i == 0; K /= i)
mp[i]++;
for (auto i : mp)
maxi = max(i.second, maxi);
Combination_Mod CM(N + maxi, HMOD);
ll ans = 1;
for (auto i : mp)
(ans *= CM.com(N - 1 + i.second, N - 1)) %= HMOD;
cout << ans << endl;
return 0;
}
| insert | 119 | 119 | 119 | 123 | TLE | |
p03253 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX c
#define intMAX numeric_limits<int>::max()
#define d_5 100000
#define d9_7 1000000007
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb push_back
#define pf push_front
#define ld long double
#define ll long long
// 階乗
long long modinv(long long a, long long m) { // modの逆元
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll Factrial(ll num) {
if (num == 1 || num == 0) {
return 1;
} else if (num < 0) {
printf("ERROR_minus\n");
return 0;
} else {
return (num * Factrial(num - 1)) % d9_7;
}
}
ll linercomb(ll n, ll k, ll mod) { // n,kの線形時間で求める
ll ans = 1;
for (ll i = n; i >= n - k + 1; i--) {
ans *= i;
ans %= mod;
}
ll k1 = Factrial(k);
k1 %= mod;
ans *= modinv(k1, mod);
ans %= mod;
return ans;
}
int main(void) {
ll n, m;
cin >> n >> m;
ll now = 2;
vi b(300000000, 0);
set<ll> nums;
if (m == 1) {
cout << 1 << endl;
return 0;
}
while (m != 1) {
if (m % now == 0) {
m /= now;
b[now]++;
nums.insert(now);
} else {
now += 1;
}
}
ll ans = 1;
for (auto i : nums) {
// cout<<i<<" "<<b[i]<<endl;
ans *= linercomb(n + (ll)b[i] - 1, (ll)b[i], d9_7);
ans %= d9_7;
}
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
using namespace std;
#define llMAX c
#define intMAX numeric_limits<int>::max()
#define d_5 100000
#define d9_7 1000000007
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb push_back
#define pf push_front
#define ld long double
#define ll long long
// 階乗
long long modinv(long long a, long long m) { // modの逆元
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll Factrial(ll num) {
if (num == 1 || num == 0) {
return 1;
} else if (num < 0) {
printf("ERROR_minus\n");
return 0;
} else {
return (num * Factrial(num - 1)) % d9_7;
}
}
ll linercomb(ll n, ll k, ll mod) { // n,kの線形時間で求める
ll ans = 1;
for (ll i = n; i >= n - k + 1; i--) {
ans *= i;
ans %= mod;
}
ll k1 = Factrial(k);
k1 %= mod;
ans *= modinv(k1, mod);
ans %= mod;
return ans;
}
int main(void) {
ll n, m;
cin >> n >> m;
ll now = 2;
vi b(200000000, 0);
set<ll> nums;
if (m == 1) {
cout << 1 << endl;
return 0;
}
while (m != 1) {
if (m % now == 0) {
m /= now;
b[now]++;
nums.insert(now);
} else {
now += 1;
}
}
ll ans = 1;
for (auto i : nums) {
// cout<<i<<" "<<b[i]<<endl;
ans *= linercomb(n + (ll)b[i] - 1, (ll)b[i], d9_7);
ans %= d9_7;
}
cout << ans << endl;
return 0;
}
| replace | 59 | 60 | 59 | 60 | MLE | |
p03253 | C++ | Runtime Error | /**
* File : D.cpp
* Author : Kazune Takahashi
* Created : 2018-9-23 21:11:13
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <functional>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725));
#include <set>
#include <stack>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <tuple>
#include <vector>
// start = std::chrono::system_clock::now();
// double elapsed =
// std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define DEBUG 0 // change 0 -> 1 if we need debug.
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
// const ll M = 1000000007;
const int MAX_SIZE = 1000010; // 10000010でもよさそう？
bool isprime[MAX_SIZE];
vector<int> prime_num;
void init() {
fill(isprime, isprime + MAX_SIZE, true);
isprime[0] = isprime[1] = false;
for (auto i = 2; i < MAX_SIZE; i++) {
if (isprime[i]) {
prime_num.push_back(i);
for (auto j = 2; i * j < MAX_SIZE; j++) {
isprime[i * j] = false;
}
}
}
}
bool prime(long long x) { // 2 \leq x \leq MAX_SIZE^2
if (x < MAX_SIZE) {
return isprime[x];
}
for (auto e : prime_num) {
if (x % e == 0)
return false;
}
return true;
}
const long long MOD = 1000000007;
long long inv[MAX_SIZE];
long long fact[MAX_SIZE];
long long factinv[MAX_SIZE];
void init2() {
inv[1] = 1;
for (int i = 2; i < MAX_SIZE; i++) {
inv[i] = ((MOD - inv[MOD % i]) * (MOD / i)) % MOD;
}
fact[0] = factinv[0] = 1;
for (int i = 1; i < MAX_SIZE; i++) {
fact[i] = (i * fact[i - 1]) % MOD;
factinv[i] = (inv[i] * factinv[i - 1]) % MOD;
}
}
long long C(int n, int k) {
if (n >= 0 && k >= 0 && n - k >= 0) {
return ((fact[n] * factinv[k]) % MOD * factinv[n - k]) % MOD;
}
return 0;
}
map<ll, ll> X;
int main() {
init();
init2();
ll N, M;
cin >> N >> M;
if (prime(M)) {
cout << N << endl;
} else {
for (auto x : prime_num) {
while (M % x == 0) {
M /= x;
if (X.find(x) == X.end()) {
X[x] = 1;
} else {
X[x]++;
}
}
}
assert(M == 1);
ll ans = 1;
for (auto x : X) {
// cerr << x.first << ": " << x.second << endl;
ll k = x.second;
ans *= C(k + N - 1, k);
ans %= MOD;
}
cout << ans << endl;
}
} | /**
* File : D.cpp
* Author : Kazune Takahashi
* Created : 2018-9-23 21:11:13
* Powered by Visual Studio Code
*/
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
#include <complex>
#include <functional>
#include <iomanip> // << fixed << setprecision(xxx)
#include <iostream>
#include <map> // if (M.find(key) != M.end()) { }
#include <queue>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725));
#include <set>
#include <stack>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <tuple>
#include <vector>
// start = std::chrono::system_clock::now();
// double elapsed =
// std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define DEBUG 0 // change 0 -> 1 if we need debug.
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
// const ll M = 1000000007;
const int MAX_SIZE = 1000010; // 10000010でもよさそう？
bool isprime[MAX_SIZE];
vector<int> prime_num;
void init() {
fill(isprime, isprime + MAX_SIZE, true);
isprime[0] = isprime[1] = false;
for (auto i = 2; i < MAX_SIZE; i++) {
if (isprime[i]) {
prime_num.push_back(i);
for (auto j = 2; i * j < MAX_SIZE; j++) {
isprime[i * j] = false;
}
}
}
}
bool prime(long long x) { // 2 \leq x \leq MAX_SIZE^2
if (x < MAX_SIZE) {
return isprime[x];
}
for (auto e : prime_num) {
if (x % e == 0)
return false;
}
return true;
}
const long long MOD = 1000000007;
long long inv[MAX_SIZE];
long long fact[MAX_SIZE];
long long factinv[MAX_SIZE];
void init2() {
inv[1] = 1;
for (int i = 2; i < MAX_SIZE; i++) {
inv[i] = ((MOD - inv[MOD % i]) * (MOD / i)) % MOD;
}
fact[0] = factinv[0] = 1;
for (int i = 1; i < MAX_SIZE; i++) {
fact[i] = (i * fact[i - 1]) % MOD;
factinv[i] = (inv[i] * factinv[i - 1]) % MOD;
}
}
long long C(int n, int k) {
if (n >= 0 && k >= 0 && n - k >= 0) {
return ((fact[n] * factinv[k]) % MOD * factinv[n - k]) % MOD;
}
return 0;
}
map<ll, ll> X;
int main() {
init();
init2();
ll N, M;
cin >> N >> M;
if (prime(M)) {
cout << N << endl;
} else {
for (auto x : prime_num) {
while (M % x == 0) {
M /= x;
if (X.find(x) == X.end()) {
X[x] = 1;
} else {
X[x]++;
}
}
}
if (M != 1) {
X[M] = 1;
}
ll ans = 1;
for (auto x : X) {
// cerr << x.first << ": " << x.second << endl;
ll k = x.second;
ans *= C(k + N - 1, k);
ans %= MOD;
}
cout << ans << endl;
}
} | replace | 114 | 115 | 114 | 117 | 0 | |
p03254 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { // 一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; // 全体右に1つシフト
}
return c;
}
// 12だったら{(2,2),(3,1)}って返してくれるはず
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main() {
int n, x;
cin >> n >> x;
V<int> a(n);
fo(i, n) { cin >> a[i]; }
Sort(a);
int cnt = 0;
while (true) {
fo(i, n) {
if (a[i] <= x)
cnt++;
else
break;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { // 一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; // 全体右に1つシフト
}
return c;
}
// 12だったら{(2,2),(3,1)}って返してくれるはず
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main() {
int n, x;
cin >> n >> x;
V<int> a(n);
fo(i, n) { cin >> a[i]; }
Sort(a);
int cnt = 0;
fo(i, n) {
if (a[i] <= x)
cnt++;
else
break;
if (i == n - 1) {
if (a[i] != x)
cnt--;
}
x -= a[i];
}
cout << cnt << endl;
} | replace | 369 | 376 | 369 | 379 | TLE | |
p03254 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN
int n, x, a[MAXN + 5], cnt;
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
if (x >= a[i])
x -= a[i], cnt++;
else
break;
if (cnt == n && x)
cnt--;
printf("%d", cnt);
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 100
int n, x, a[MAXN + 5], cnt;
int main() {
scanf("%d%d", &n, &x);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
if (x >= a[i])
x -= a[i], cnt++;
else
break;
if (cnt == n && x)
cnt--;
printf("%d", cnt);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03254 | C++ | Runtime Error | /* it was worth becoming a chemist */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned int uni;
typedef unsigned long long unll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<int> vi;
typedef vector<long long> vll;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define NAME "puts"
#define F first
#define S second
const ll INF = 1e18;
const int inf = 1e9;
const int mod = 1e9 + 7;
const db EPS = (db)1e-9;
const db pi = acos(-1.0);
const int MAXN = 2e6 + 5;
int n;
ll a[MAXN], x;
int main() {
#ifndef ONLINE_JUDGE
freopen(NAME ".in", "r", stdin);
freopen(NAME ".out", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(9) << fixed;
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int res = 0;
for (int i = 1; i <= n; i++) {
if (i == n) {
if (a[i] == x)
res++;
continue;
}
if (a[i] <= x) {
x -= a[i];
res++;
}
}
cout << res;
return 0;
}
| /* it was worth becoming a chemist */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef unsigned int uni;
typedef unsigned long long unll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<int> vi;
typedef vector<long long> vll;
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define NAME "puts"
#define F first
#define S second
const ll INF = 1e18;
const int inf = 1e9;
const int mod = 1e9 + 7;
const db EPS = (db)1e-9;
const db pi = acos(-1.0);
const int MAXN = 2e6 + 5;
int n;
ll a[MAXN], x;
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
int res = 0;
for (int i = 1; i <= n; i++) {
if (i == n) {
if (a[i] == x)
res++;
continue;
}
if (a[i] <= x) {
x -= a[i];
res++;
}
}
cout << res;
return 0;
}
| delete | 35 | 44 | 35 | 35 | 0 | |
p03254 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <vector>
// #include "boost/algorithm/string.hpp"
#define fio ios_base::sync_with_stdio(false)
#define mod 1000000007
#define mod1 mod
#define mod2 100000009
#define li long long int
#define ll li
#define readi(x) scanf("%d", &x)
#define reads(x) scanf("%s", x)
#define readl(x) scanf("%I64d", &x)
#define rep(i, n) for (i = 0; i < n; i++)
#define revp(i, n) for (i = (n - 1); i >= 0; i--)
#define myrep1(i, a, b) for (i = a; i <= b; i++)
#define myrep2(i, a, b) for (i = b; i >= a; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define MAXN 1000000000000000000
#define MINN -1000000000000000000
#define INTMAX 1000001000
#define pii pair<ll, ll>
#define pdd pair<double, double>
#define pic pair<int, char>
#define N 2000010
#define lgn 20
#define ddouble long double
#define minus minu
#define PI 3.1415926535
#define lgn 20
// #define INTMAX 200000000
// using namespace boost;
// #define si short int
using namespace std;
using namespace __gnu_pbds;
typedef priority_queue<pii, vector<pii>, greater<pii>> min_pq;
// typedef priority_queue<pii, vector<pii> , greater<pii > > min_pq;
ll toint(const string &s) {
stringstream ss;
ss << s;
ll x;
ss >> x;
return x;
}
string tostring(ll number) {
stringstream ss;
ss << number;
return ss.str();
}
// using namespace __gnu_pbds;
// typedef priority_queue<pair<ll,char> , vector<pair<ll , char> > > max_pq;
// typedef priority_queue<pii , vector<pii > ,greater<pii > > min_pq;
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
OST;
// typedef priority_queue<pair < ll , pair < pii , ll > > , vector<pair < ll ,
// pair < pii , ll > > > ,greater<pair < ll , pair < pii , ll > > > > min_pq;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << std::endl;
// use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define nn 2000005
ll n;
ll ar[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll k;
cin >> n >> k;
ll sum = 0;
for (ll i = 1; i <= n; i++)
cin >> ar[i], sum += ar[i];
sort(ar + 1, ar + n + 1);
if (sum == k) {
cout << n;
return 0;
}
if (sum < k) {
cout << n - 1;
return 0;
}
sum = 0;
ll cnt = 0;
for (ll i = 1; i <= n; i++)
if ((sum + ar[i]) <= k)
sum += ar[i], cnt++;
cout << cnt;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <unordered_map>
#include <vector>
// #include "boost/algorithm/string.hpp"
#define fio ios_base::sync_with_stdio(false)
#define mod 1000000007
#define mod1 mod
#define mod2 100000009
#define li long long int
#define ll li
#define readi(x) scanf("%d", &x)
#define reads(x) scanf("%s", x)
#define readl(x) scanf("%I64d", &x)
#define rep(i, n) for (i = 0; i < n; i++)
#define revp(i, n) for (i = (n - 1); i >= 0; i--)
#define myrep1(i, a, b) for (i = a; i <= b; i++)
#define myrep2(i, a, b) for (i = b; i >= a; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define MAXN 1000000000000000000
#define MINN -1000000000000000000
#define INTMAX 1000001000
#define pii pair<ll, ll>
#define pdd pair<double, double>
#define pic pair<int, char>
#define N 2000010
#define lgn 20
#define ddouble long double
#define minus minu
#define PI 3.1415926535
#define lgn 20
// #define INTMAX 200000000
// using namespace boost;
// #define si short int
using namespace std;
using namespace __gnu_pbds;
typedef priority_queue<pii, vector<pii>, greater<pii>> min_pq;
// typedef priority_queue<pii, vector<pii> , greater<pii > > min_pq;
ll toint(const string &s) {
stringstream ss;
ss << s;
ll x;
ss >> x;
return x;
}
string tostring(ll number) {
stringstream ss;
ss << number;
return ss.str();
}
// using namespace __gnu_pbds;
// typedef priority_queue<pair<ll,char> , vector<pair<ll , char> > > max_pq;
// typedef priority_queue<pii , vector<pii > ,greater<pii > > min_pq;
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>
OST;
// typedef priority_queue<pair < ll , pair < pii , ll > > , vector<pair < ll ,
// pair < pii , ll > > > ,greater<pair < ll , pair < pii , ll > > > > min_pq;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << std::endl;
// use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define nn 2000005
ll n;
ll ar[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
ll k;
cin >> n >> k;
ll sum = 0;
for (ll i = 1; i <= n; i++)
cin >> ar[i], sum += ar[i];
sort(ar + 1, ar + n + 1);
if (sum == k) {
cout << n;
return 0;
}
if (sum < k) {
cout << n - 1;
return 0;
}
sum = 0;
ll cnt = 0;
for (ll i = 1; i <= n; i++)
if ((sum + ar[i]) <= k)
sum += ar[i], cnt++;
cout << cnt;
} | replace | 96 | 100 | 96 | 100 | 0 | |
p03254 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
int N, x;
cin >> N >> x;
vi a;
rep(i, N) cin >> a.at(i);
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < N; i++) {
if (x >= a[i]) {
++ans;
x -= a[i];
}
}
if (ans == N && x > 0)
--ans;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
int main() {
int N, x;
cin >> N >> x;
int a[N];
rep(i, N) cin >> a[i];
sort(a, a + N);
int ans = 0;
for (int i = 0; i < N; i++) {
if (x >= a[i]) {
++ans;
x -= a[i];
}
}
if (ans == N && x > 0)
--ans;
cout << ans << endl;
return 0;
} | replace | 10 | 13 | 10 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03254 | C++ | Runtime Error | // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 100;
int n, a[MAXN], k, ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
if (k >= a[i])
k -= a[i], ans++;
else
k = 0;
cout << ans - (k > 0) << endl;
return 0;
}
| // IOI 2021
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 100 + 17;
int n, a[MAXN], k, ans;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++)
if (k >= a[i])
k -= a[i], ans++;
else
k = 0;
cout << ans - (k > 0) << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03254 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int k;
int a[n];
cin >> n >> k;
for (int i = 0; i < n; i++) {
int nu;
cin >> nu;
a[i] = nu;
}
sort(a, a + n);
int ans = 0;
for (int i = 0; i < n; i++) {
if (k < a[i]) {
break;
}
if (k >= a[i]) {
k -= a[i];
ans++;
}
if (i == n - 1 & k != 0) {
ans--;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int k;
int a[n];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0;
for (int i = 0; i < n; i++) {
if (k < a[i]) {
break;
}
if (k >= a[i]) {
k -= a[i];
ans++;
}
if (i == n - 1 & k != 0) {
ans--;
}
}
cout << ans;
}
| replace | 9 | 12 | 9 | 10 | -11 | |
p03254 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 100005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
ll a[10];
REP(i, n) cin >> a[i];
sort(a, a + n);
int i;
for (i = 0; i < n; i++) {
x -= a[i];
if (x < 0)
break;
}
// cout << i << endl;
// if(i==n)i--;
if (x > 0)
i--;
cout << i << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 100005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, x;
cin >> n >> x;
ll a[1000];
REP(i, n) cin >> a[i];
sort(a, a + n);
int i;
for (i = 0; i < n; i++) {
x -= a[i];
if (x < 0)
break;
}
// cout << i << endl;
// if(i==n)i--;
if (x > 0)
i--;
cout << i << endl;
return 0;
} | replace | 32 | 33 | 32 | 33 | 0 | |
p03254 | C++ | Runtime Error | /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define ll long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define watch(x) cout << (#x) << " " << (x) << endl;
#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 um unordered_map
#define F first
#define S second
ll modulo = 1e9 + 7;
template <class X>
void printarr(X arr[], int n) {
for (int i = 0; i < n; ++i)
cout << arr[i] << " ";
cout << endl;
}
int 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
int n, x;
cin >> n >> x;
int arr[n];
FOR(i, 0, n)
cin >> arr[i];
sort(arr, arr + n);
int cnt = 0, ans = 0;
while (x >= arr[cnt] and cnt < n - 1) {
x -= arr[cnt];
++cnt;
++ans;
}
if (arr[n - 1] == x)
++ans;
cout << ans << endl;
return 0;
}
| /*
author: Apoorv Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define ll long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define watch(x) cout << (#x) << " " << (x) << endl;
#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 um unordered_map
#define F first
#define S second
ll modulo = 1e9 + 7;
template <class X>
void printarr(X arr[], int n) {
for (int i = 0; i < n; ++i)
cout << arr[i] << " ";
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, x;
cin >> n >> x;
int arr[n];
FOR(i, 0, n)
cin >> arr[i];
sort(arr, arr + n);
int cnt = 0, ans = 0;
while (x >= arr[cnt] and cnt < n - 1) {
x -= arr[cnt];
++cnt;
++ans;
}
if (arr[n - 1] == x)
++ans;
cout << ans << endl;
return 0;
}
| delete | 43 | 47 | 43 | 43 | 0 | |
p03254 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int memo[100];
int dp(int now, int sum, int ans);
int n, x, a[100];
int main() {
fill(memo, memo + 100, -1);
scanf("%d %d", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
printf("%d\n", dp(0, 0, 0));
return 0;
}
int dp(int now, int sum, int ans) {
if (now == n) {
if (sum < x)
return ans - 1;
else
return ans;
}
if (sum + a[now] > x)
return ans;
return memo[now] =
max(dp(now + 1, sum, ans), dp(now + 1, sum + a[now], ans + 1));
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int memo[100];
int dp(int now, int sum, int ans);
int n, x, a[100];
int main() {
fill(memo, memo + 100, -1);
scanf("%d %d", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
printf("%d\n", dp(0, 0, 0));
return 0;
}
int dp(int now, int sum, int ans) {
if (now == n) {
if (sum < x)
return ans - 1;
else
return ans;
}
if (memo[now] != -1)
return ans;
if (sum + a[now] > x)
return ans;
return memo[now] =
max(dp(now + 1, sum, ans), dp(now + 1, sum + a[now], ans + 1));
}
| insert | 30 | 30 | 30 | 32 | TLE | |
p03255 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 1987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i, a, b, c) for (int(i) = (a); (i) <= (b); (i) += (c))
#define fdn(i, a, b, c) for (int(i) = (a); (i) >= (b); (i) -= (c))
#define MEM0(a) memset((a), 0, sizeof(a));
#define MEM_1(a) memset((a), -1, sizeof(a));
#define ALL(a) a.begin(), a.end()
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) {
ll ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1)
ret = (ret * a) % MMM;
return ret;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int n;
ll x, a[200001], sum[400001];
int main() {
scanf("%d%lld", &n, &x);
fdn(i, n, 1, 1) scanf("%lld", a + i);
fup(i, 1, 2 * n, 1) sum[i] = sum[i - 1] + a[i];
ll ans = INF;
fup(k, 1, n, 1) {
ll t = k * x + 5 * sum[k];
for (int i = 2; (i - 1) * k <= n; i++) {
t += (sum[i * k] - sum[(i - 1) * k]) * (2 * i + 1);
if (t >= INF) {
t = INF;
break;
}
}
if (t != INF)
ans = min(ans, t);
}
printf("%lld", ans + x * n);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 1987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i, a, b, c) for (int(i) = (a); (i) <= (b); (i) += (c))
#define fdn(i, a, b, c) for (int(i) = (a); (i) >= (b); (i) -= (c))
#define MEM0(a) memset((a), 0, sizeof(a));
#define MEM_1(a) memset((a), -1, sizeof(a));
#define ALL(a) a.begin(), a.end()
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) {
ll ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1)
ret = (ret * a) % MMM;
return ret;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
int n;
ll x, a[400001], sum[400001];
int main() {
scanf("%d%lld", &n, &x);
fdn(i, n, 1, 1) scanf("%lld", a + i);
fup(i, 1, 2 * n, 1) sum[i] = sum[i - 1] + a[i];
ll ans = INF;
fup(k, 1, n, 1) {
ll t = k * x + 5 * sum[k];
for (int i = 2; (i - 1) * k <= n; i++) {
t += (sum[i * k] - sum[(i - 1) * k]) * (2 * i + 1);
if (t >= INF) {
t = INF;
break;
}
}
if (t != INF)
ans = min(ans, t);
}
printf("%lld", ans + x * n);
} | replace | 75 | 76 | 75 | 76 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define mp make_pair
using namespace std;
using ll = unsigned long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 30;
const ll LINF = 1LL << 62;
const double eps = 1e-5;
template <typename T> void chmin(T &a, T b) { a = min(a, b); };
template <typename T> void chmax(T &a, T b) { a = max(a, b); };
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
ll n, X;
cin >> n >> X;
vector<ll> x(n + 10), sum(n + 10);
for (int i = 1; i <= n; i++) {
cin >> x[i];
sum[i] = sum[i - 1] + x[i];
}
ll ans = LINF;
for (ll k = 1; k <= n; k++) {
ll s = 0, c = 1;
s += (sum[n % k] - sum[0]) * (n / k + c + 1ULL) * (n / k + c + 1ULL);
for (ll i = n % k + k; i <= n; i += k) {
--c;
s += (sum[i] - sum[i - k] - sum[i - k] + sum[max(0ULL, i - 2 * k)]) *
(n / k + c + 1LL) * (n / k + c + 1LL);
}
s += (n + k) * X;
s += sum[n] - sum[n - k];
ans = min(ans, s);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define mp make_pair
using namespace std;
using ll = unsigned long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 30;
const ll LINF = 1LL << 62;
const double eps = 1e-5;
template <typename T> void chmin(T &a, T b) { a = min(a, b); };
template <typename T> void chmax(T &a, T b) { a = max(a, b); };
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
ll n, X;
cin >> n >> X;
vector<ll> x(n + 10), sum(n + 10);
for (int i = 1; i <= n; i++) {
cin >> x[i];
sum[i] = sum[i - 1] + x[i];
}
ll ans = LINF;
for (ll k = 1; k <= n; k++) {
ll s = 0, c = 1;
s += (sum[n % k] - sum[0]) * (n / k + c + 1ULL) * (n / k + c + 1ULL);
for (ll i = n % k + k; i <= n; i += k) {
--c;
ll id = 0;
if (i > 2 * k)
id = i - 2 * k;
s += (sum[i] - sum[i - k] - sum[i - k] + sum[id]) * (n / k + c + 1LL) *
(n / k + c + 1LL);
}
s += (n + k) * X;
s += sum[n] - sum[n - k];
ans = min(ans, s);
}
cout << ans << endl;
}
| replace | 27 | 29 | 27 | 32 | 0 | |
p03255 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define SF scanf
#define PF printf
#define MAXN 100010
using namespace std;
typedef long long ll;
ll a[MAXN], x, pre[MAXN], ans;
int n;
int main() {
SF("%d%lld", &n, &x);
for (int i = 1; i <= n; i++) {
SF("%lld", &a[i]);
pre[i] = pre[i - 1] + a[i];
ans += a[i] * 5ll + 2ll * x;
}
for (int k = 1; k < n; k++) {
ll res = k * x;
for (int j = n, cnt = 1; j > 0; cnt++) {
int j1 = max(0, j - k);
ll sum = pre[j] - pre[j1];
res += max(5ll, cnt * 2ll + 1ll) * sum;
if (res > ans)
break;
j = j1;
}
ans = min(ans, res);
}
PF("%lld", ans + 1ll * n * x);
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define SF scanf
#define PF printf
#define MAXN 200010
using namespace std;
typedef long long ll;
ll a[MAXN], x, pre[MAXN], ans;
int n;
int main() {
SF("%d%lld", &n, &x);
for (int i = 1; i <= n; i++) {
SF("%lld", &a[i]);
pre[i] = pre[i - 1] + a[i];
ans += a[i] * 5ll + 2ll * x;
}
for (int k = 1; k < n; k++) {
ll res = k * x;
for (int j = n, cnt = 1; j > 0; cnt++) {
int j1 = max(0, j - k);
ll sum = pre[j] - pre[j1];
res += max(5ll, cnt * 2ll + 1ll) * sum;
if (res > ans)
break;
j = j1;
}
ans = min(ans, res);
}
PF("%lld", ans + 1ll * n * x);
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
int sum[200003], N, X;
signed main() {
cin >> N >> X;
int ans = 1e19;
for (int i = 1; i <= N; ++i) {
cin >> sum[i];
sum[i] += sum[i - 1];
}
for (int j = 1; j <= N; ++j) {
int pos = N, all = j * X, cur = 3;
while (pos > 0) {
all += (cur == 3 ? 5 : cur) * (sum[pos] - sum[max(0ull, pos - j)]);
pos -= j;
cur += 2;
}
ans = min(ans, all);
}
cout << ans + N * X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int unsigned long long
int sum[200003], N, X;
signed main() {
cin >> N >> X;
int ans = 1e19;
for (int i = 1; i <= N; ++i) {
cin >> sum[i];
sum[i] += sum[i - 1];
}
for (int j = 1; j <= N; ++j) {
int pos = N, all = j * X, cur = 3;
while (pos > 0) {
all += (cur == 3 ? 5 : cur) * (sum[pos] - sum[max(j, pos) - j]);
pos = max(pos, j) - j;
cur += 2;
}
ans = min(ans, all);
}
cout << ans + N * X << endl;
return 0;
} | replace | 16 | 18 | 16 | 18 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N = 100100;
ll x[N];
int n;
ll c;
ll calc(int k) {
ll s = (n + k - 1) * c;
for (int i = n - 1; i >= 1; --i) {
int j = n - i + 1;
int t = j / 2;
t = min(t, k);
j += t - 1;
ll k1 = j / t;
ll k2 = k1 + 1;
k1 *= k1;
k2 *= k2;
ll m2 = j % t;
ll m1 = t - j % t;
s += (x[i] - x[i - 1]) * (k1 * m1 + k2 * m2 + t);
}
return s;
}
int main() {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(l, r)(rng);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> c;
++n;
x[0] = 0;
for (int i = 1; i < n; ++i) {
cin >> x[i];
}
ll ans = 0;
int l = 1, r = n;
while (r - l > 0) {
int t = (r - l) / 3;
int m1 = l + t;
int m2 = r - t;
ll t1 = calc(m1);
ll t2 = calc(m2);
if (r - l == 1) {
ans = min(t1, t2);
break;
}
if (r - l == 2) {
ll t3 = calc(l + 1);
ans = min(t1, t2);
ans = min(ans, t3);
break;
}
if (t1 > t2) {
l = m1;
} else {
r = m2;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const int N = 200100;
ll x[N];
int n;
ll c;
ll calc(int k) {
ll s = (n + k - 1) * c;
for (int i = n - 1; i >= 1; --i) {
int j = n - i + 1;
int t = j / 2;
t = min(t, k);
j += t - 1;
ll k1 = j / t;
ll k2 = k1 + 1;
k1 *= k1;
k2 *= k2;
ll m2 = j % t;
ll m1 = t - j % t;
s += (x[i] - x[i - 1]) * (k1 * m1 + k2 * m2 + t);
}
return s;
}
int main() {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(l, r)(rng);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> c;
++n;
x[0] = 0;
for (int i = 1; i < n; ++i) {
cin >> x[i];
}
ll ans = 0;
int l = 1, r = n;
while (r - l > 0) {
int t = (r - l) / 3;
int m1 = l + t;
int m2 = r - t;
ll t1 = calc(m1);
ll t2 = calc(m2);
if (r - l == 1) {
ans = min(t1, t2);
break;
}
if (r - l == 2) {
ll t3 = calc(l + 1);
ans = min(t1, t2);
ans = min(ans, t3);
break;
}
if (t1 > t2) {
l = m1;
} else {
r = m2;
}
}
cout << ans;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, x;
cin >> n >> x;
vi v(n);
rep(i, n) cin >> v[i];
auto f = [&](int one) {
ll tmp = (ll)x * (n + one);
for (int i = n - 1; i >= 0; i--) {
int num = (n - i - 1) / one + 1;
if (num == 1)
tmp += 5ll * v[i];
else
tmp += v[i] * ((num + 1ll) * (num + 1) - num * num);
}
return tmp;
};
int l = 0, r = n - 1, a, b;
ll ans = 1e18;
while (l + 100 < r) {
int a = (2 * l + r) / 3, b = (l + 2 * r) / 3;
if (f(a) <= f(b))
r = b;
else
l = a;
}
for (int i = l; i <= r; i++)
ans = min(ans, f(i));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, x;
cin >> n >> x;
vi v(n);
rep(i, n) cin >> v[i];
auto f = [&](int one) {
ll tmp = (ll)x * (n + one);
for (int i = n - 1; i >= 0; i--) {
int num = (n - i - 1) / one + 1;
if (num == 1)
tmp += 5ll * v[i];
else
tmp += v[i] * ((num + 1ll) * (num + 1) - num * num);
}
return tmp;
};
int l = 1, r = n, a, b;
ll ans = 1e18;
while (l + 100 < r) {
int a = (2 * l + r) / 3, b = (l + 2 * r) / 3;
if (f(a) <= f(b))
r = b;
else
l = a;
}
for (int i = l; i <= r; i++)
ans = min(ans, f(i));
cout << ans << endl;
return 0;
} | replace | 79 | 80 | 79 | 80 | -8 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
#define priority_queue __gnu_pbds::priority_queue
typedef long long LL;
typedef long double LD;
typedef unsigned int ui;
typedef unsigned long long ul;
#define ri register int
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define mid ((l + r) >> 1)
#define ls (i << 1)
#define rs (i << 1 | 1)
using namespace std;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
#define adde(x, y) \
{ \
e[++z].v = y; \
e[z].nxt = h[x]; \
h[x] = &e[z]; \
}
#define addrev(u, v) \
{ \
adde(u, v); \
adde(v, u); \
}
#define ae(x) for (node *p = h[x]; p; p = p->nxt)
#define FO(x) \
{ \
freopen("#x.in", "r", stdin); \
freopen("#x.out", "w", stdout); \
}
inline int read() // ret >= 0
{
int ret = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
ch = getchar();
do {
ret = ret * 10 + ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
return ret;
}
inline void write(int x) // x >= 0
{
if (x < 10) {
putchar(x + '0');
return;
}
write(x / 10);
putchar(x % 10 + '0');
}
#define maxn 100100
int n, m;
int a[maxn];
ul s[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
ul Ans = LLONG_MAX;
for (int i = 1; i <= n; i++)
s[i] = s[i - 1] + a[i];
for (int i = 1; i <= n; i++) {
ul res = (ul)i * m;
int cur = n - 2 * i;
cur = max(cur, 0);
res += 5 * (s[n] - s[cur]);
for (int j = 7; cur; j += 2) {
int tmp = cur - i;
tmp = max(tmp, 0);
res += j * (s[cur] - s[tmp]);
cur = tmp;
}
Ans = min(Ans, res);
}
Ans += (ul)n * m;
cout << Ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
#define priority_queue __gnu_pbds::priority_queue
typedef long long LL;
typedef long double LD;
typedef unsigned int ui;
typedef unsigned long long ul;
#define ri register int
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define mid ((l + r) >> 1)
#define ls (i << 1)
#define rs (i << 1 | 1)
using namespace std;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
#define adde(x, y) \
{ \
e[++z].v = y; \
e[z].nxt = h[x]; \
h[x] = &e[z]; \
}
#define addrev(u, v) \
{ \
adde(u, v); \
adde(v, u); \
}
#define ae(x) for (node *p = h[x]; p; p = p->nxt)
#define FO(x) \
{ \
freopen("#x.in", "r", stdin); \
freopen("#x.out", "w", stdout); \
}
inline int read() // ret >= 0
{
int ret = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
ch = getchar();
do {
ret = ret * 10 + ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
return ret;
}
inline void write(int x) // x >= 0
{
if (x < 10) {
putchar(x + '0');
return;
}
write(x / 10);
putchar(x % 10 + '0');
}
#define maxn 200100
int n, m;
int a[maxn];
ul s[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
ul Ans = LLONG_MAX;
for (int i = 1; i <= n; i++)
s[i] = s[i - 1] + a[i];
for (int i = 1; i <= n; i++) {
ul res = (ul)i * m;
int cur = n - 2 * i;
cur = max(cur, 0);
res += 5 * (s[n] - s[cur]);
for (int j = 7; cur; j += 2) {
int tmp = cur - i;
tmp = max(tmp, 0);
res += j * (s[cur] - s[tmp]);
cur = tmp;
}
Ans = min(Ans, res);
}
Ans += (ul)n * m;
cout << Ans << endl;
return 0;
}
| replace | 58 | 59 | 58 | 59 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 5000000000000000LL
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define RFOR(i, a, b) for (int i = (a); i >= b; i--)
#define MN 200005
ll n;
ll x[MN];
ll ps[MN];
ll c; // x in problem!
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
cin >> n >> c;
FOR(i, 1, n) {
cin >> x[n + 1 - i];
// ps[i] = ps[i-1]+x[i];
}
FOR(i, 1, n) {
ps[i] = ps[i - 1] + x[i];
// cout << ps[i] << " ";
}
// cout << "\n";
ll ans = INF;
FOR(i, 1, n) {
ll cm = 5;
ll ca = 0;
for (ll j = i; j <= n + i; j += i) {
ll sm = ps[min(j, n)] - ps[j - i];
ca += sm * cm;
// cm+=2;
if (j != i)
cm += 2;
if (ca > INF)
ca = INF;
}
ca += c * (ll)(i + n);
if (ca > INF)
ca = INF;
// cout << i << " " << ca << "\n";
ans = min(ans, ca);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<long long>> vvll;
typedef vector<pair<int, int>> vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define INF 5000000000000000LL
#define MOD 1000000007
#define EPSILON 0.00001
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define p_q priority_queue
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define RFOR(i, a, b) for (int i = (a); i >= b; i--)
#define MN 200005
ll n;
ll x[MN];
ll ps[MN];
ll c; // x in problem!
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> c;
FOR(i, 1, n) {
cin >> x[n + 1 - i];
// ps[i] = ps[i-1]+x[i];
}
FOR(i, 1, n) {
ps[i] = ps[i - 1] + x[i];
// cout << ps[i] << " ";
}
// cout << "\n";
ll ans = INF;
FOR(i, 1, n) {
ll cm = 5;
ll ca = 0;
for (ll j = i; j <= n + i; j += i) {
ll sm = ps[min(j, n)] - ps[j - i];
ca += sm * cm;
// cm+=2;
if (j != i)
cm += 2;
if (ca > INF)
ca = INF;
}
ca += c * (ll)(i + n);
if (ca > INF)
ca = INF;
// cout << i << " " << ca << "\n";
ans = min(ans, ca);
}
cout << ans << "\n";
return 0;
}
| replace | 31 | 33 | 31 | 33 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void dump(vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i];
if (i + 1 < vec.size())
cout << ' ';
else
cout << endl;
}
return;
}
template <class T> void input(vector<T> &vec, int n) {
vec.resize(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
}
int N;
ll X;
ll x[100100];
ll rui[100100];
ll sum(int l, int r) {
if (l <= 0)
return rui[r];
else
return rui[r] - rui[l - 1];
}
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> x[i];
}
rui[0] = x[0];
for (int i = 1; i < N; i++) {
rui[i] = x[i] + rui[i - 1];
}
ll ans = LLINF;
for (int i = 1; i <= N; i++) {
ll ret = X * (N + i);
// cout << ret << ' ';
for (int j = 0; j < N; j += i) {
ll c = j / i + 1;
ll k = max(5ll, 2ll * c + 1ll);
ll ruis = sum(N - 1 - j - i + 1, N - 1 - j);
if ((LLINF - ret) / k <= ruis) {
ret = LLINF;
break;
}
ret += ruis * k;
}
// cout << ret << endl;
ans = min(ans, ret);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define repn(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define EQ(a, b) (abs((a) - (b)) < eps)
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void dump(vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i];
if (i + 1 < vec.size())
cout << ' ';
else
cout << endl;
}
return;
}
template <class T> void input(vector<T> &vec, int n) {
vec.resize(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
}
int N;
ll X;
ll x[300100];
ll rui[300100];
ll sum(int l, int r) {
if (l <= 0)
return rui[r];
else
return rui[r] - rui[l - 1];
}
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> x[i];
}
rui[0] = x[0];
for (int i = 1; i < N; i++) {
rui[i] = x[i] + rui[i - 1];
}
ll ans = LLINF;
for (int i = 1; i <= N; i++) {
ll ret = X * (N + i);
// cout << ret << ' ';
for (int j = 0; j < N; j += i) {
ll c = j / i + 1;
ll k = max(5ll, 2ll * c + 1ll);
ll ruis = sum(N - 1 - j - i + 1, N - 1 - j);
if ((LLINF - ret) / k <= ruis) {
ret = LLINF;
break;
}
ret += ruis * k;
}
// cout << ret << endl;
ans = min(ans, ret);
}
cout << ans << endl;
return 0;
}
| replace | 46 | 48 | 46 | 48 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2018;
const ll oo = 9e18;
ll x[N];
ll X;
int n;
ll mul(ll a, ll b) { return a > oo / b ? oo : a * b; }
ll add(ll a, ll b) { return a > oo - b ? oo : a + b; }
int main() {
scanf("%d %lld", &n, &X);
for (int i = 1; i <= n; i++)
scanf("%lld", x + i);
reverse(x + 1, 1 + x + n);
ll psum[N];
partial_sum(x + 1, x + 1 + n, psum + 1);
ll ans = 1e18;
for (int k = 1; k <= n; k++) {
int j = 1;
ll sum = 0;
int i;
for (i = k; i <= n; i += k) {
if (j == 1)
sum = add(sum, (psum[i] - psum[i - k]) * 5);
else
sum = add(sum, mul(psum[i] - psum[i - k], (2 * j + 1)));
j++;
}
if (i - k < n) {
sum = add(sum, mul(psum[n] - psum[i - k], (2 * j + 1)));
}
ans = min(ans, sum + k * X);
}
printf("%lld\n", ans + X * n);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200018;
const ll oo = 9e18;
ll x[N];
ll X;
int n;
ll mul(ll a, ll b) { return a > oo / b ? oo : a * b; }
ll add(ll a, ll b) { return a > oo - b ? oo : a + b; }
int main() {
scanf("%d %lld", &n, &X);
for (int i = 1; i <= n; i++)
scanf("%lld", x + i);
reverse(x + 1, 1 + x + n);
ll psum[N];
partial_sum(x + 1, x + 1 + n, psum + 1);
ll ans = 1e18;
for (int k = 1; k <= n; k++) {
int j = 1;
ll sum = 0;
int i;
for (i = k; i <= n; i += k) {
if (j == 1)
sum = add(sum, (psum[i] - psum[i - k]) * 5);
else
sum = add(sum, mul(psum[i] - psum[i - k], (2 * j + 1)));
j++;
}
if (i - k < n) {
sum = add(sum, mul(psum[n] - psum[i - k], (2 * j + 1)));
}
ans = min(ans, sum + k * X);
}
printf("%lld\n", ans + X * n);
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p03255 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a < b) ? a = b, 1 : 0; }
template <typename T> bool cmin(T &a, T b) { return (a > b) ? a = b, 1 : 0; }
template <typename T> T read() {
T ans = 0, f = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
f = -1, ch = getchar();
while (isdigit(ch))
ans = (ans << 3) + (ans << 1) + (ch - '0'), ch = getchar();
return ans * f;
}
template <typename T> void write(T x, char y) {
if (x == 0) {
putchar('0'), putchar(y);
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char wr[20];
int top = 0;
for (; x; x /= 10)
wr[++top] = x % 10 + '0';
while (top)
putchar(wr[top--]);
putchar(y);
}
void file() {
#ifndef ONLINE_JUDGE
freopen("B.in", "r", stdin);
freopen("B.out", "w", stdout);
#endif
}
int n, x;
ll sum[N], cost[N];
unsigned long long ans;
void input() {
n = read<int>(), x = read<int>();
For(i, 1, n) sum[i] = sum[i - 1] + read<int>();
}
void work() {
cost[1] = 5;
For(i, 2, n) cost[i] = 1ll * (i + 1) * (i + 1) - 1ll * i * i;
// For(i,1,n)cout<<cost[i]<<' ';
// cout<<endl;
unsigned long long res;
int l, r, now;
ans = 1e18;
For(i, 1, n) {
// num=n/i;
res = 0;
for (r = n, now = 1; r > 0; r = l - 1, now++) {
l = r - i + 1;
cmax(l, 1);
res = res + (sum[r] - sum[l - 1]) * cost[now];
if (res > ans)
res = ans;
}
res = res + 1ll * x * i;
// cout<<i<<' '<<res<<endl<<endl;
cmin(ans, res);
// i=n/num;
}
write(ans + 1ll * n * x, '\n');
}
int main() {
file();
input();
work();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a < b) ? a = b, 1 : 0; }
template <typename T> bool cmin(T &a, T b) { return (a > b) ? a = b, 1 : 0; }
template <typename T> T read() {
T ans = 0, f = 1;
char ch = getchar();
while (!isdigit(ch) && ch != '-')
ch = getchar();
if (ch == '-')
f = -1, ch = getchar();
while (isdigit(ch))
ans = (ans << 3) + (ans << 1) + (ch - '0'), ch = getchar();
return ans * f;
}
template <typename T> void write(T x, char y) {
if (x == 0) {
putchar('0'), putchar(y);
return;
}
if (x < 0) {
putchar('-');
x = -x;
}
static char wr[20];
int top = 0;
for (; x; x /= 10)
wr[++top] = x % 10 + '0';
while (top)
putchar(wr[top--]);
putchar(y);
}
void file() {
#ifndef ONLINE_JUDGE
freopen("B.in", "r", stdin);
freopen("B.out", "w", stdout);
#endif
}
int n, x;
ll sum[N], cost[N];
unsigned long long ans;
void input() {
n = read<int>(), x = read<int>();
For(i, 1, n) sum[i] = sum[i - 1] + read<int>();
}
void work() {
cost[1] = 5;
For(i, 2, n) cost[i] = 1ll * (i + 1) * (i + 1) - 1ll * i * i;
// For(i,1,n)cout<<cost[i]<<' ';
// cout<<endl;
unsigned long long res;
int l, r, now;
ans = 1e18;
For(i, 1, n) {
// num=n/i;
res = 0;
for (r = n, now = 1; r > 0; r = l - 1, now++) {
l = r - i + 1;
cmax(l, 1);
res = res + (sum[r] - sum[l - 1]) * cost[now];
if (res > ans)
res = ans;
}
res = res + 1ll * x * i;
// cout<<i<<' '<<res<<endl<<endl;
cmin(ans, res);
// i=n/num;
}
write(ans + 1ll * n * x, '\n');
}
int main() {
// file();
input();
work();
return 0;
}
| replace | 77 | 78 | 77 | 78 | TLE | |
p03255 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull sum[200005] = {0};
ull n, x;
ull solve();
int main() {
cin >> n >> x;
for (ull i = 1; i <= n; ++i) {
ull a;
cin >> a;
sum[i] = sum[i - 1] + a;
}
cout << solve() << endl;
return 0;
}
ull solve() {
ull ans = 0;
for (ull i = 1; i <= n; ++i) {
ull now = n, j = 1, nans = 0;
while (1) {
if (j == 1)
nans += sum[now] * 5;
else if (j >= 2)
nans += sum[now] * (2 * j + 1);
now -= n * (ull)((long double)i / n);
if (now == 0 || now > n)
break;
if (j == 1)
nans -= sum[now] * 5;
else if (j >= 2)
nans -= sum[now] * (2 * j + 1);
++j;
}
nans += x * (n + i);
if (i == 1)
ans = nans;
ans = min(nans, ans);
}
return ans;
} | #include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
ull sum[200005] = {0};
ull n, x;
ull solve();
int main() {
cin >> n >> x;
for (ull i = 1; i <= n; ++i) {
ull a;
cin >> a;
sum[i] = sum[i - 1] + a;
}
cout << solve() << endl;
return 0;
}
ull solve() {
ull ans = 0;
for (ull i = 1; i <= n; ++i) {
ull now = n, j = 1, nans = 0;
while (1) {
if (j == 1)
nans += sum[now] * 5;
else if (j >= 2)
nans += sum[now] * (2 * j + 1);
now -= i;
if (now == 0 || now > n)
break;
if (j == 1)
nans -= sum[now] * 5;
else if (j >= 2)
nans -= sum[now] * (2 * j + 1);
++j;
}
nans += x * (n + i);
if (i == 1)
ans = nans;
ans = min(nans, ans);
}
return ans;
} | replace | 29 | 30 | 29 | 30 | TLE | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define pss pair<short, short>
#define piii pair<pii, int>
#define vii vector<pair<int, int>>
#define st first
#define nd second
const int mod = 1000000007;
const int inf = 1000000009;
const long long int INF = 1000000000000000009;
using namespace std;
int T[100005];
ll S[100005], D[100005];
int main() {
int n, x;
scanf("%d %d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &T[i]);
S[i] = S[i - 1] + T[i];
}
ll wynik = INF;
D[1] = 5;
D[2] = 5;
for (int i = 3; i <= n; i++)
D[i] = D[i - 1] + 2;
for (int i = 1; i <= n; i++) {
ll aktual = (ll)x * n;
aktual += (ll)i * x;
int ile = n;
int wsk = 1;
while (ile > 0) {
if (aktual > wynik)
break;
if (S[ile] - S[max(0, ile - i)] > INF / (ll)D[wsk])
break;
aktual += (ll)D[wsk] * (S[ile] - S[max(0, ile - i)]);
wsk++;
ile -= i;
}
wynik = min(wynik, aktual);
}
printf("%lld", wynik);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define pss pair<short, short>
#define piii pair<pii, int>
#define vii vector<pair<int, int>>
#define st first
#define nd second
const int mod = 1000000007;
const int inf = 1000000009;
const long long int INF = 1000000000000000009;
using namespace std;
int T[200005];
ll S[200005], D[200005];
int main() {
int n, x;
scanf("%d %d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d", &T[i]);
S[i] = S[i - 1] + T[i];
}
ll wynik = INF;
D[1] = 5;
D[2] = 5;
for (int i = 3; i <= n; i++)
D[i] = D[i - 1] + 2;
for (int i = 1; i <= n; i++) {
ll aktual = (ll)x * n;
aktual += (ll)i * x;
int ile = n;
int wsk = 1;
while (ile > 0) {
if (aktual > wynik)
break;
if (S[ile] - S[max(0, ile - i)] > INF / (ll)D[wsk])
break;
aktual += (ll)D[wsk] * (S[ile] - S[max(0, ile - i)]);
wsk++;
ile -= i;
}
wynik = min(wynik, aktual);
}
printf("%lld", wynik);
return 0;
}
| replace | 15 | 17 | 15 | 17 | 0 | |
p03255 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
*/
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(0);
using namespace std;
const int maxn = 2e5 + 123, inf = 1e9, mod = 1e9 + 7;
ll n, x, a[maxn], col[maxn];
ll get(ll k) {
ll res = 0;
for (int i = n, j = 2, q = k; i >= 0; i--) {
if (q == 0)
q = k, j++;
col[i] = j;
q--;
}
for (int i = 1; i <= n; i++)
if (col[i] == 2)
res += a[i] * 2;
for (int i = n; i >= 1; i--)
res += a[i] * (col[i] * col[i] - (col[i] - 1) * (col[i] - 1));
return res + x * (k + n);
}
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
ll res = 1e18;
for (int i = 1; i <= n; i++)
res = min(res, get(i));
cout << res;
return 0;
}
| #include <bits/stdc++.h>
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
*/
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define IOS ios_base::sync_with_stdio(0);
using namespace std;
const int maxn = 2e5 + 123, inf = 1e9, mod = 1e9 + 7;
ll n, x, a[maxn], col[maxn];
ll get(ll k) {
ll res = 0;
for (int i = n, j = 2, q = k; i >= 0; i--) {
if (q == 0)
q = k, j++;
col[i] = j;
q--;
}
for (int i = 1; i <= n; i++)
if (col[i] == 2)
res += a[i] * 2;
for (int i = n; i >= 1; i--)
res += a[i] * (col[i] * col[i] - (col[i] - 1) * (col[i] - 1));
return res + x * (k + n);
}
int main() {
cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> a[i];
ll res = 1e18;
int l = 1, r = n;
for (int i = 0; i < 50; i++) {
l = max(1, l);
r = min(n, 0ll + r);
int m1 = l + (r - l) / 3;
int m2 = r - (r - l) / 3;
if (get(m1) > get(m2))
l = m1 - 1;
else
r = m2 + 1;
}
for (int i = max(1, l - 50); i <= min(n, r + 50ll); i++)
res = min(res, get(i));
cout << res;
return 0;
}
| replace | 39 | 41 | 39 | 51 | TLE | |
p03255 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define For(i, x, y) for (ll i = x; i <= y; i++)
#define FOr(i, x, y) for (ll i = x; i >= y; i--)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to... Red
using namespace std;
inline bool isvowel(char c) {
c = tolower(c);
if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
return 1;
return 0;
}
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n, m;
ll x;
string s;
int a[N];
vector<int> g[N];
int u[N];
ll ans;
ll get(ll k) {
int c = 0;
ll res = 0;
For(i, 0, k - 1) g[i].clear();
FOr(i, n, 1) {
if (g[c].size()) {
res += (g[c].back() - a[i]) * (g[c].size() + 1) * (g[c].size() + 1);
} else {
res += a[i];
}
g[c].pb(a[i]);
c++;
if (c >= k)
c -= k;
}
For(i, 0, k - 1) res += g[i].back() * (g[i].size() + 1) * (g[i].size() + 1);
return res + x * n + x * k;
}
int main() {
cin >> n >> x;
For(i, 1, n) { cin >> a[i]; }
ans = INF;
For(i, 1, n) { ans = min(ans, get(i)); }
cout << ans << '\n';
return Accepted;
}
// Coded By OB | #include <bits/stdc++.h>
#include <stdio.h>
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define For(i, x, y) for (ll i = x; i <= y; i++)
#define FOr(i, x, y) for (ll i = x; i >= y; i--)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to... Red
using namespace std;
inline bool isvowel(char c) {
c = tolower(c);
if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u')
return 1;
return 0;
}
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;
const int M = 22;
const int pri = 997;
const int Magic = 2101;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int n, m;
ll x;
string s;
int a[N];
vector<int> g[N];
int u[N];
ll ans;
ll get(ll k) {
int c = 0;
ll res = 0;
For(i, 0, k - 1) g[i].clear();
FOr(i, n, 1) {
if (g[c].size()) {
res += (g[c].back() - a[i]) * (g[c].size() + 1) * (g[c].size() + 1);
} else {
res += a[i];
}
g[c].pb(a[i]);
c++;
if (c >= k)
c -= k;
}
For(i, 0, k - 1) res += g[i].back() * (g[i].size() + 1) * (g[i].size() + 1);
return res + x * n + x * k;
}
int main() {
cin >> n >> x;
For(i, 1, n) { cin >> a[i]; }
ans = INF;
ll l = 1, r = n;
while (l + 10 < r) {
ll m1 = l, m2 = r;
m1 += (r - l) / 3;
m2 -= (r - l) / 3;
if (get(m1) > get(m2))
l = m1;
else
r = m2;
}
For(i, l, r) { ans = min(ans, get(i)); }
cout << ans << '\n';
return Accepted;
}
// Coded By OB | replace | 74 | 76 | 74 | 85 | TLE | |
p03255 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PDD;
#define _upgrade \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
template <typename _T> inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const char *s, _T x, args... a) {
while (*s != ',')
cerr << *s++;
cerr << " = " << x << ',';
_DBG(s + 1, a...);
}
#ifdef LOCAL
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define DBG(...) (__VA_ARGS__)
#define cerr \
if (0) \
cout
#endif
// ********************** CODE ********************** //
const int N = 2e5 + 7;
const LL INF = 1e18 + 7;
int n;
LL x, T[N];
LL count(int k) {
LL ans = x * (n + k);
int tmp = k, kr = 1;
for (int i = n; i; i--) {
if (kr == 1)
ans += 2LL * T[i];
ans += T[i] * (2 * kr + 1);
tmp--;
if (tmp == 0) {
tmp = k;
kr++;
}
}
return ans;
}
int main() {
_upgrade cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> T[i];
LL ans = INF;
for (int i = 1; i <= n; i++)
ans = min(ans, count(i));
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PDD;
#define _upgrade \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
template <typename _T> inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const char *s, _T x, args... a) {
while (*s != ',')
cerr << *s++;
cerr << " = " << x << ',';
_DBG(s + 1, a...);
}
#ifdef LOCAL
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define DBG(...) (__VA_ARGS__)
#define cerr \
if (0) \
cout
#endif
// ********************** CODE ********************** //
const int N = 2e5 + 7;
const LL INF = 1e18 + 7;
int n;
LL x, T[N];
LL count(int k) {
LL ans = x * (n + k);
int tmp = k, kr = 1;
for (int i = n; i; i--) {
if (kr == 1)
ans += 2LL * T[i];
ans += T[i] * (2 * kr + 1);
tmp--;
if (tmp == 0) {
tmp = k;
kr++;
}
}
return ans;
}
int main() {
_upgrade cin >> n >> x;
for (int i = 1; i <= n; i++)
cin >> T[i];
LL ans = INF;
if (n <= 2000) {
for (int i = 1; i <= n; i++)
ans = min(ans, count(i));
} else {
int l = 1, r = n;
while (l + 20 < r) {
int l1 = (l + l + r) / 3;
int r1 = (l + r + r) / 3;
LL c1 = count(l1), c2 = count(r1);
ans = min({ans, c1, c2});
if (c1 < c2) {
r = r1;
} else {
l = l1;
}
}
for (int i = l; i <= r; i++)
ans = min(ans, count(i));
}
cout << ans << "\n";
return 0;
}
| replace | 64 | 66 | 64 | 83 | TLE | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
#define taskname "A"
#define pb push_back
#define mp make_pair
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> ii;
const int maxn = 2e5 + 5;
const int inf = 1e9 + 1;
const ll llinf = 1e18 + 5;
int n, a[maxn];
int x;
ll s[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if (fopen(taskname ".inp", "r")) {
freopen(taskname ".inp", "r", stdin);
freopen(taskname ".out", "w", stdout);
}
cin >> n >> x;
ll res = LLONG_MAX;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
s[i] = a[i] + s[i - 1];
}
vector<int> delta;
delta.pb(5);
for (int i = 2; i <= n; ++i) {
delta.pb(i * 2 + 1);
}
for (int i = 1; i <= n; ++i) {
int now = n;
ll tmp = 0;
for (int c : delta) {
function<ll(ll, ll)> Mul = [&](ll x, ll y) {
if (llinf / y < x)
return llinf;
return x * y;
};
if (now > i) {
tmp += Mul((s[now] - s[now - i]), c);
} else
tmp += Mul((s[now] - s[now - i]), c);
tmp = min(tmp, llinf);
now -= i;
if (now <= 0)
break;
}
res = min(res, tmp + (ll)(n + i) * x);
}
cout << res;
}
| #include <bits/stdc++.h>
#define taskname "A"
#define pb push_back
#define mp make_pair
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> ii;
const int maxn = 2e5 + 5;
const int inf = 1e9 + 1;
const ll llinf = 1e18 + 5;
int n, a[maxn];
int x;
ll s[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if (fopen(taskname ".inp", "r")) {
freopen(taskname ".inp", "r", stdin);
freopen(taskname ".out", "w", stdout);
}
cin >> n >> x;
ll res = LLONG_MAX;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
s[i] = a[i] + s[i - 1];
}
vector<int> delta;
delta.pb(5);
for (int i = 2; i <= n; ++i) {
delta.pb(i * 2 + 1);
}
for (int i = 1; i <= n; ++i) {
int now = n;
ll tmp = 0;
for (int c : delta) {
function<ll(ll, ll)> Mul = [&](ll x, ll y) {
if (llinf / y < x)
return llinf;
return x * y;
};
if (now > i) {
tmp += Mul((s[now] - s[now - i]), c);
} else
tmp += Mul((s[now]), c);
tmp = min(tmp, llinf);
now -= i;
if (now <= 0)
break;
}
res = min(res, tmp + (ll)(n + i) * x);
}
cout << res;
}
| replace | 50 | 51 | 50 | 51 | 0 | |
p03255 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
#define EPS ((long double)1e-12)
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define sz(x) ((long long)(x).size())
#define endl '\n'
#define DUMP_NAME(name, a) cout << "#dump " << (name) << " = " << (a) << " "
#define dump(a) DUMP_NAME(#a, (a));
#define FOREACH(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define FOR(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define ROF(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); --i)
const ld PI = 3.141592653589793238L;
const ll N = 500005;
using namespace std;
ull a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
//<<>>
ll n, x;
cin >> n >> x;
FOR(i, 1, n) cin >> a[i];
reverse(a + 1, a + n + 1);
ROF(i, n - 1, 1) a[i] += a[i + 1];
ull ans = ULLONG_MAX;
FOR(k, 1, n) {
ull ans1 = k * x;
bool take = 1;
FOR(i, 1, n) {
ull ans2 = (a[i] - a[i + k]) * max(5ll, 2 * ((i - 1) / k + 1) + 1);
if (ans - ans2 <= ans1)
take = 0;
ans1 += ans2;
i += k - 1;
}
if (take == 1)
ans = ans1;
}
ans += (ull)n * x;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define MOD 1000000007
#define EPS ((long double)1e-12)
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define sz(x) ((long long)(x).size())
#define endl '\n'
#define DUMP_NAME(name, a) cout << "#dump " << (name) << " = " << (a) << " "
#define dump(a) DUMP_NAME(#a, (a));
#define FOREACH(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define FOR(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define ROF(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); --i)
const ld PI = 3.141592653589793238L;
const ll N = 500005;
using namespace std;
ull a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
#endif
//<<>>
ll n, x;
cin >> n >> x;
FOR(i, 1, n) cin >> a[i];
reverse(a + 1, a + n + 1);
ROF(i, n - 1, 1) a[i] += a[i + 1];
ull ans = ULLONG_MAX;
FOR(k, 1, n) {
ull ans1 = k * x;
bool take = 1;
FOR(i, 1, n) {
ull ans2 = (a[i] - a[i + k]) * max(5ll, 2 * ((i - 1) / k + 1) + 1);
if (ans - ans2 <= ans1)
take = 0;
ans1 += ans2;
i += k - 1;
}
if (take == 1)
ans = ans1;
}
ans += (ull)n * x;
cout << ans << endl;
return 0;
} | delete | 30 | 32 | 30 | 30 | TLE | |
p03256 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
string S;
bool ok[200010] = {0};
vector<vector<int>> v(200010);
int N, M, visited[200010] = {0};
bool dfs(int n) {
visited[n] = 1;
bool j = true;
if (!ok[n])
j = false;
for (int i = 0; i < v[n].size(); i++) {
if (visited[v[n][i]] == 0 && ok[v[n][i]])
j = (j | dfs(v[n][i]));
}
return j;
}
int main() {
cin >> N >> M >> S;
int a, b;
int A[100010] = {0}, B[100010] = {0};
for (int i = 0; i < M; i++) {
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
queue<int> Q;
int count = 0;
for (int i = 1; i <= N; i++) {
for (int j = 0; j < v[i].size(); j++) {
if (S[v[i][j] - 1] == 'A')
A[i]++;
if (S[v[i][j] - 1] == 'B')
B[i]++;
}
if (A[i] == 0 || B[i] == 0) {
Q.push(i);
visited[i] = 1;
count++;
}
if (A && B)
ok[i] = true;
}
while (!Q.empty()) {
int t = Q.front();
Q.pop();
for (int i = 0; i < v[t].size(); i++) {
if (S[t - 1] == 'A')
A[v[t][i]]--;
if (S[t - 1] == 'B')
B[v[t][i]]--;
if ((A[v[t][i]] == 0 || B[v[t][i]] == 0) && visited[v[t][i]] == 0) {
Q.push(v[t][i]);
count++;
visited[v[t][i]] = 1;
}
}
}
/* bool judge = false;
for(int i=1;i<=N;i++){
if(visited[i]==0 && dfs(i)) judge = true;
}
*/ cout << (count < N ? "Yes" : "No") << endl;
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
string S;
bool ok[200010] = {0};
vector<vector<int>> v(200010);
int N, M, visited[200010] = {0};
bool dfs(int n) {
visited[n] = 1;
bool j = true;
if (!ok[n])
j = false;
for (int i = 0; i < v[n].size(); i++) {
if (visited[v[n][i]] == 0 && ok[v[n][i]])
j = (j | dfs(v[n][i]));
}
return j;
}
int main() {
cin >> N >> M >> S;
int a, b;
int A[200010] = {0}, B[200010] = {0};
for (int i = 0; i < M; i++) {
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
queue<int> Q;
int count = 0;
for (int i = 1; i <= N; i++) {
for (int j = 0; j < v[i].size(); j++) {
if (S[v[i][j] - 1] == 'A')
A[i]++;
if (S[v[i][j] - 1] == 'B')
B[i]++;
}
if (A[i] == 0 || B[i] == 0) {
Q.push(i);
visited[i] = 1;
count++;
}
if (A && B)
ok[i] = true;
}
while (!Q.empty()) {
int t = Q.front();
Q.pop();
for (int i = 0; i < v[t].size(); i++) {
if (S[t - 1] == 'A')
A[v[t][i]]--;
if (S[t - 1] == 'B')
B[v[t][i]]--;
if ((A[v[t][i]] == 0 || B[v[t][i]] == 0) && visited[v[t][i]] == 0) {
Q.push(v[t][i]);
count++;
visited[v[t][i]] = 1;
}
}
}
/* bool judge = false;
for(int i=1;i<=N;i++){
if(visited[i]==0 && dfs(i)) judge = true;
}
*/ cout << (count < N ? "Yes" : "No") << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03256 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int maxn = 2e5 + 10;
char label[maxn];
struct edge {
int v, next;
edge(int v = 0, int next = 0) : v(v), next(next) {}
} e[maxn * 2];
int hd[maxn], ek = 1;
inline void adde(int u, int v) {
e[ek] = edge(v, hd[u]);
hd[u] = ek++;
}
int clock;
bool vis[maxn];
int dep[maxn];
bool dfs(int len, char pas, int u) {
vis[u] = 1;
++clock;
if (clock >= 5e7)
return 0;
for (int i = hd[u]; i; i = e[i].next) {
int v = e[i].v;
if (label[v] == pas)
continue;
if (len >= 3e5)
return 1;
if (dfs(len + 1, label[u], v))
return 1;
}
return 0;
}
int main() {
memset(dep, 0x3f, sizeof dep);
dep[1] = 1;
int n, m;
scanf("%d%d%s", &n, &m, label + 1);
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
adde(u, v);
adde(v, u);
}
for (int i = 1; i <= n; i++)
if (dfs(1, '$', i))
return !printf("Yes");
return !printf("No");
} | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int maxn = 2e5 + 10;
char label[maxn];
struct edge {
int v, next;
edge(int v = 0, int next = 0) : v(v), next(next) {}
} e[maxn * 2];
int hd[maxn], ek = 1;
inline void adde(int u, int v) {
e[ek] = edge(v, hd[u]);
hd[u] = ek++;
}
int clock;
bool vis[maxn];
int dep[maxn];
bool dfs(int len, char pas, int u) {
vis[u] = 1;
++clock;
if (clock >= 3e7)
return 0;
for (int i = hd[u]; i; i = e[i].next) {
int v = e[i].v;
if (label[v] == pas)
continue;
if (len >= 3e5)
return 1;
if (dfs(len + 1, label[u], v))
return 1;
}
return 0;
}
int main() {
memset(dep, 0x3f, sizeof dep);
dep[1] = 1;
int n, m;
scanf("%d%d%s", &n, &m, label + 1);
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
adde(u, v);
adde(v, u);
}
for (int i = 1; i <= n; i++)
if (dfs(1, '$', i))
return !printf("Yes");
return !printf("No");
} | replace | 25 | 26 | 25 | 26 | TLE | |
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int v[400010];
vector<vi> e;
string s;
void rec(int c, int d) {
v[2 * c + d] = 1;
for (int i : e[c]) {
if ((d > 0) == (s[c] == s[i]))
continue;
if (v[2 * i + 1 - d] == 1) {
cout << "Yes" << endl;
exit(0);
}
if (!v[2 * i + 1 - d])
rec(i, 1 - d);
}
v[2 * c + d] = 2;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m;
cin >> n >> m >> s;
assert(n >= 10);
e.resize(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
e[a].pb(b);
if (a != b)
e[b].pb(a);
}
rep(i, n) if (s[i] == 'A' && !v[2 * i]) rec(i, 0);
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int v[400010];
vector<vi> e;
string s;
void rec(int c, int d) {
v[2 * c + d] = 1;
for (int i : e[c]) {
if ((d > 0) == (s[c] == s[i]))
continue;
if (v[2 * i + 1 - d] == 1) {
cout << "Yes" << endl;
exit(0);
}
if (!v[2 * i + 1 - d])
rec(i, 1 - d);
}
v[2 * c + d] = 2;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m;
cin >> n >> m >> s;
e.resize(n);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
e[a].pb(b);
if (a != b)
e[b].pb(a);
}
rep(i, n) if (s[i] == 'A' && !v[2 * i]) rec(i, 0);
cout << "No" << endl;
return 0;
} | delete | 84 | 85 | 84 | 84 | -6 | 27231888-4c8e-4e93-8705-af538159fcdf.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03256/C++/s965980599.cpp:33: int main(): Assertion `n >= 10' failed.
|
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline LL rd() {
char ch = getchar();
LL i = 0, f = 1;
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
i = (i << 1) + (i << 3) + ch - '0';
ch = getchar();
}
return i * f;
}
const int N = 1e5 + 50, mod = 1e9 + 7;
int n, m, vis[N];
int cnt[N][2], type[N];
vector<int> edge[N];
char ch[N];
int main() {
n = rd(), m = rd();
scanf("%s", ch + 1);
for (int i = 1; i <= n; i++)
type[i] = (ch[i] == 'A') ? 0 : 1;
for (int i = 1; i <= m; i++) {
int x = rd(), y = rd();
if (x != y) {
edge[x].push_back(y);
edge[y].push_back(x);
}
++cnt[x][type[y]];
++cnt[y][type[x]];
}
queue<int> q;
int cc = 0;
for (int i = 1; i <= n; ++i)
if (!cnt[i][0] || !cnt[i][1])
q.push(i), vis[i] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
++cc;
for (auto e : edge[u])
if (!vis[e]) {
cnt[e][type[u]]--;
if (!cnt[e][0] || !cnt[e][1])
q.push(e), vis[e] = 1;
}
}
if (cc == n)
puts("No");
else
puts("Yes");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline LL rd() {
char ch = getchar();
LL i = 0, f = 1;
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
i = (i << 1) + (i << 3) + ch - '0';
ch = getchar();
}
return i * f;
}
const int N = 2e5 + 50, mod = 1e9 + 7;
int n, m, vis[N];
int cnt[N][2], type[N];
vector<int> edge[N];
char ch[N];
int main() {
n = rd(), m = rd();
scanf("%s", ch + 1);
for (int i = 1; i <= n; i++)
type[i] = (ch[i] == 'A') ? 0 : 1;
for (int i = 1; i <= m; i++) {
int x = rd(), y = rd();
if (x != y) {
edge[x].push_back(y);
edge[y].push_back(x);
}
++cnt[x][type[y]];
++cnt[y][type[x]];
}
queue<int> q;
int cc = 0;
for (int i = 1; i <= n; ++i)
if (!cnt[i][0] || !cnt[i][1])
q.push(i), vis[i] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
++cc;
for (auto e : edge[u])
if (!vis[e]) {
cnt[e][type[u]]--;
if (!cnt[e][0] || !cnt[e][1])
q.push(e), vis[e] = 1;
}
}
if (cc == n)
puts("No");
else
puts("Yes");
} | replace | 18 | 19 | 18 | 19 | 0 | |
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s;
multiset<int> edge[200005];
int memo[200005][2];
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m >> s;
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
--a;
--b;
edge[a].insert(b);
++memo[a][s[b] - 'A'];
if (a != b) {
edge[b].insert(a);
++memo[b][s[a] - 'A'];
}
}
multiset<int> que;
for (int i = 0; i < n; ++i) {
if (memo[i][0] == 0 || memo[i][1] == 0) {
que.insert(i);
while (que.size() > 0) {
int now = *que.begin();
for (auto itr = edge[now].begin(); itr != edge[now].end();) {
int v = *itr;
itr = edge[now].erase(itr);
--memo[now][s[v] - 'A'];
edge[v].erase(now);
--memo[v][s[now] - 'A'];
if (memo[v][0] == 0 || memo[v][1] == 0) {
que.insert(v);
}
}
que.erase(now);
}
}
}
int f = 0;
for (int i = 0; i < n; ++i) {
if (edge[i].size() > 0) {
f = 1;
}
}
if (f) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
string s;
multiset<int> edge[200005];
int memo[200005][2];
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m >> s;
int a, b;
for (int i = 0; i < m; ++i) {
cin >> a >> b;
--a;
--b;
if (edge[a].count(b) > 0) {
continue;
}
edge[a].insert(b);
++memo[a][s[b] - 'A'];
if (a != b) {
edge[b].insert(a);
++memo[b][s[a] - 'A'];
}
}
multiset<int> que;
for (int i = 0; i < n; ++i) {
if (memo[i][0] == 0 || memo[i][1] == 0) {
que.insert(i);
while (que.size() > 0) {
int now = *que.begin();
for (auto itr = edge[now].begin(); itr != edge[now].end();) {
int v = *itr;
itr = edge[now].erase(itr);
--memo[now][s[v] - 'A'];
edge[v].erase(now);
--memo[v][s[now] - 'A'];
if (memo[v][0] == 0 || memo[v][1] == 0) {
que.insert(v);
}
}
que.erase(now);
}
}
}
int f = 0;
for (int i = 0; i < n; ++i) {
if (edge[i].size() > 0) {
f = 1;
}
}
if (f) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
| insert | 15 | 15 | 15 | 18 | 0 | |
p03256 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, int> pli;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
vector<int> v[404040];
int used[404040], ans;
void dfs(int x) {
used[x] = -1;
for (auto &u : v[x]) {
if (used[u] == -1) {
ans = true;
} else
dfs(u);
}
used[x] = 1;
}
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
rep(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
if (s[x] == s[y]) {
v[x].push_back(y + n);
v[y].push_back(x + n);
} else {
v[x + n].push_back(y);
v[y + n].push_back(x);
}
}
rep(i, 2 * n) if (!used[i]) dfs(i);
cout << (ans ? "Yes" : "No") << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, int> pli;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
vector<int> v[404040];
int used[404040], ans;
void dfs(int x) {
used[x] = -1;
for (auto &u : v[x]) {
if (used[u] == -1) {
ans = true;
} else if (used[u] == 1)
continue;
else
dfs(u);
}
used[x] = 1;
}
int main() {
int n, m;
cin >> n >> m;
string s;
cin >> s;
rep(i, m) {
int x, y;
cin >> x >> y;
--x;
--y;
if (s[x] == s[y]) {
v[x].push_back(y + n);
v[y].push_back(x + n);
} else {
v[x + n].push_back(y);
v[y + n].push_back(x);
}
}
rep(i, 2 * n) if (!used[i]) dfs(i);
cout << (ans ? "Yes" : "No") << endl;
return 0;
} | replace | 31 | 32 | 31 | 34 | TLE | |
p03256 | C++ | Runtime Error | #include <cassert>
#include <iostream>
#include <vector>
using namespace std;
const string s = "AABB";
bool dfs(const vector<vector<int>> &G, const string &S, vector<int> &V,
vector<bool> &visited, int v, int t, int u) {
bool ret = false;
V[v] |= (1 << t);
visited[v] = true;
t = (t + 1) % 4;
for (size_t i = 0; i < G[v].size(); ++i) {
int v_ = G[v][i];
if (S[v_] != s[t])
continue;
if (v_ == u and not t)
return true;
// if(not t and V[v_]%2) return true;
if ((V[v_] >> t) & 1)
return true;
// if((V[v_]>>t)&1) continue;
ret |= dfs(G, S, V, visited, v_, t, u);
}
V[v] = 0;
return ret;
}
int main() {
int N, M;
cin >> N >> M;
string S;
cin >> S;
vector<vector<int>> G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
assert(N <= 1000);
bool f = false;
vector<bool> visited(N, false);
vector<int> V(N, 0);
for (int i = 0; i < N; ++i) {
if (S[i] != 'A')
continue;
if (visited[i])
continue;
f |= dfs(G, S, V, visited, i, 0, i);
if (f) {
cerr << i << endl;
break;
}
}
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <cassert>
#include <iostream>
#include <vector>
using namespace std;
const string s = "AABB";
bool dfs(const vector<vector<int>> &G, const string &S, vector<int> &V,
vector<bool> &visited, int v, int t, int u) {
bool ret = false;
V[v] |= (1 << t);
visited[v] = true;
t = (t + 1) % 4;
for (size_t i = 0; i < G[v].size(); ++i) {
int v_ = G[v][i];
if (S[v_] != s[t])
continue;
if (v_ == u and not t)
return true;
// if(not t and V[v_]%2) return true;
if ((V[v_] >> t) & 1)
return true;
// if((V[v_]>>t)&1) continue;
ret |= dfs(G, S, V, visited, v_, t, u);
}
V[v] = 0;
return ret;
}
int main() {
int N, M;
cin >> N >> M;
string S;
cin >> S;
vector<vector<int>> G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
--a, --b;
G[a].push_back(b);
G[b].push_back(a);
}
// assert(N <= 1000);
bool f = false;
vector<bool> visited(N, false);
vector<int> V(N, 0);
for (int i = 0; i < N; ++i) {
if (S[i] != 'A')
continue;
if (visited[i])
continue;
f |= dfs(G, S, V, visited, i, 0, i);
if (f) {
cerr << i << endl;
break;
}
}
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 41 | 42 | 41 | 42 | 0 | 0
|
p03256 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#define ll long long
using namespace std;
#define MAXN 200050
int n, m;
char c;
int label[MAXN];
int x, y;
struct T {
int y;
int next;
} e[MAXN];
int top = 1;
int st[MAXN];
bool hasCheck[MAXN];
bool result[MAXN];
bool ig[MAXN];
void adde(int x, int y) {
if (!st[x]) {
e[top].y = y;
e[top].next = 0;
st[x] = top++;
} else {
e[top].y = y;
e[top].next = st[x];
st[x] = top++;
}
}
void printe() {
for (int i = 1; i <= n; ++i) {
cout << i << ":";
for (int j = st[i]; j; j = e[j].next) {
cout << e[j].y << ' ';
}
cout << endl;
}
}
bool checkig(int i) {
if (ig[i] == 1)
return 0;
bool A = 0, B = 0;
for (int j = st[i]; j; j = e[j].next) {
int y = e[j].y;
if (ig[y])
continue;
if (label[y] == 0)
A = 1;
if (label[y] == 1)
B = 1;
}
if (A == 0 || B == 0)
ig[i] = 1;
return ig[i];
}
bool inq[MAXN];
int q[MAXN];
void solve(int i) {
int l = 1;
q[l] = i;
while (l > 0) {
int now = q[l];
inq[now] = 0;
l--;
if (checkig(now)) {
for (int j = st[now]; j; j = e[j].next) {
int y = e[j].y;
if (ig[y])
continue;
if (inq[y])
continue;
inq[y] = 1;
l++;
q[l] = y;
}
}
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> c;
if (c == 'A')
label[i] = 0;
else
label[i] = 1;
}
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
adde(x, y);
adde(y, x);
}
bool flag = 0;
for (int i = 1; i <= n; ++i)
solve(i);
for (int i = 1; i <= n; ++i)
if (ig[i] == 0) {
cout << "Yes" << endl;
flag = 1;
break;
}
if (!flag) {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#define ll long long
using namespace std;
#define MAXN 200050
int n, m;
char c;
int label[MAXN];
int x, y;
struct T {
int y;
int next;
} e[MAXN * 5];
int top = 1;
int st[MAXN];
bool hasCheck[MAXN];
bool result[MAXN];
bool ig[MAXN];
void adde(int x, int y) {
if (!st[x]) {
e[top].y = y;
e[top].next = 0;
st[x] = top++;
} else {
e[top].y = y;
e[top].next = st[x];
st[x] = top++;
}
}
void printe() {
for (int i = 1; i <= n; ++i) {
cout << i << ":";
for (int j = st[i]; j; j = e[j].next) {
cout << e[j].y << ' ';
}
cout << endl;
}
}
bool checkig(int i) {
if (ig[i] == 1)
return 0;
bool A = 0, B = 0;
for (int j = st[i]; j; j = e[j].next) {
int y = e[j].y;
if (ig[y])
continue;
if (label[y] == 0)
A = 1;
if (label[y] == 1)
B = 1;
}
if (A == 0 || B == 0)
ig[i] = 1;
return ig[i];
}
bool inq[MAXN];
int q[MAXN];
void solve(int i) {
int l = 1;
q[l] = i;
while (l > 0) {
int now = q[l];
inq[now] = 0;
l--;
if (checkig(now)) {
for (int j = st[now]; j; j = e[j].next) {
int y = e[j].y;
if (ig[y])
continue;
if (inq[y])
continue;
inq[y] = 1;
l++;
q[l] = y;
}
}
}
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> c;
if (c == 'A')
label[i] = 0;
else
label[i] = 1;
}
for (int i = 1; i <= m; ++i) {
cin >> x >> y;
adde(x, y);
adde(y, x);
}
bool flag = 0;
for (int i = 1; i <= n; ++i)
solve(i);
for (int i = 1; i <= n; ++i)
if (ig[i] == 0) {
cout << "Yes" << endl;
flag = 1;
break;
}
if (!flag) {
cout << "No" << endl;
}
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MX = 200005;
int n, m, c[MX][2], a, b, qu[MX], t, k = 1, out[MX];
char s[MX];
vector<int> G[MX];
int main() {
scanf("%d%d\n%s", &n, &m, s);
rep(i, m) {
scanf("%d%d", &a, &b);
G[--a].push_back(--b);
G[b].push_back(a);
c[a][s[b] - 'A']++;
c[b][s[a] - 'A']++;
}
rep(i, n) if (!out[i] && !(c[i][0] && c[i][1])) {
out[qu[b++] = i] = 1;
while (a < b) {
t = qu[a++];
for (int u : G[t])
if (!out[u] && !--c[u][s[t] - 'A']) {
out[qu[b++] = u] = 1;
}
}
}
rep(i, n) k &= out[i];
puts(k ? "No" : "Yes");
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MX = 200005;
int n, m, c[MX][2], a, b, qu[MX], t, k = 1, out[MX];
char s[MX];
vector<int> G[MX];
int main() {
scanf("%d%d\n%s", &n, &m, s);
rep(i, m) {
scanf("%d%d", &a, &b);
G[--a].push_back(--b);
G[b].push_back(a);
c[a][s[b] - 'A']++;
c[b][s[a] - 'A']++;
}
a = b = 0;
rep(i, n) if (!out[i] && !(c[i][0] && c[i][1])) {
out[qu[b++] = i] = 1;
while (a < b) {
t = qu[a++];
for (int u : G[t])
if (!out[u] && !--c[u][s[t] - 'A']) {
out[qu[b++] = u] = 1;
}
}
}
rep(i, n) k &= out[i];
puts(k ? "No" : "Yes");
} | insert | 16 | 16 | 16 | 17 | 0 | |
p03256 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
vector<int> edge[216000];
queue<int> q;
int n, m, a, b;
bool removed[216000];
bool loop[216000];
string s;
int cnt[216000][2];
int main() {
cin >> n >> m >> s;
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--, b--;
if (a == b) {
loop[a] = true;
} else {
edge[a].push_back(b);
edge[b].push_back(a);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < edge[i].size(); j++) {
int to = edge[i][j];
cnt[i][s[to] - 'A']++;
}
if (loop[i])
cnt[i][s[i] - 'A']++;
if (cnt[i][0] == 0 || cnt[i][1] == 0) {
q.push(i);
}
}
int remain = n;
while (!q.empty()) {
int x = q.front();
q.pop();
if (removed[x])
continue;
removed[x] = true;
remain--;
for (int i = 0; i < edge[x].size(); i++) {
int to = edge[x][i];
if (removed[to])
continue;
if (--cnt[to][s[x] - 'a'] == 0) {
q.push(to);
}
}
}
if (remain)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF (1 << 29)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
vector<int> edge[216000];
queue<int> q;
int n, m, a, b;
bool removed[216000];
bool loop[216000];
string s;
int cnt[216000][2];
int main() {
cin >> n >> m >> s;
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--, b--;
if (a == b) {
loop[a] = true;
} else {
edge[a].push_back(b);
edge[b].push_back(a);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < edge[i].size(); j++) {
int to = edge[i][j];
cnt[i][s[to] - 'A']++;
}
if (loop[i])
cnt[i][s[i] - 'A']++;
if (cnt[i][0] == 0 || cnt[i][1] == 0) {
q.push(i);
}
}
int remain = n;
while (!q.empty()) {
int x = q.front();
q.pop();
if (removed[x])
continue;
removed[x] = true;
remain--;
for (int i = 0; i < edge[x].size(); i++) {
int to = edge[x][i];
if (removed[to])
continue;
if (--cnt[to][s[x] - 'A'] == 0) {
q.push(to);
}
}
}
if (remain)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 62 | 63 | 62 | 63 | 0 | |
p03256 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
vector<int> E[400000];
int flag[400000];
int N, M;
bool dfs(int x, int ind) {
if (flag[x] == ind)
return true;
flag[x] = ind;
for (int &to : E[x]) {
if (dfs(to, ind))
return true;
}
flag[x] = 1000000;
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
string s;
cin >> s;
rep(i, 0, M) {
int a, b;
cin >> a >> b;
a--;
b--;
if (a == b) {
E[N + a].pb(a);
} else if (s[a] == s[b]) {
E[N + a].pb(b);
E[b + N].pb(a);
} else {
E[a].pb(b + N);
E[b].pb(a + N);
}
}
rep(i, 0, 2 * N) {
if (!flag[i]) {
if (dfs(i, i + 1)) {
cout << "Yes"
<< "\n";
return 0;
}
}
}
cout << "No"
<< "\n";
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
vector<int> E[400000];
int flag[400000];
int N, M;
bool dfs(int x, int ind) {
if (flag[x] == ind)
return true;
flag[x] = ind;
for (int &to : E[x]) {
if (flag[to] < 1000000 && dfs(to, ind))
return true;
}
flag[x] = 1000000;
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
string s;
cin >> s;
rep(i, 0, M) {
int a, b;
cin >> a >> b;
a--;
b--;
if (a == b) {
E[N + a].pb(a);
} else if (s[a] == s[b]) {
E[N + a].pb(b);
E[b + N].pb(a);
} else {
E[a].pb(b + N);
E[b].pb(a + N);
}
}
rep(i, 0, 2 * N) {
if (!flag[i]) {
if (dfs(i, i + 1)) {
cout << "Yes"
<< "\n";
return 0;
}
}
}
cout << "No"
<< "\n";
} | replace | 25 | 26 | 25 | 26 | TLE | |
p03256 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
#define MOD 1000000007
using namespace std;
char str[100005];
int main(int argc, char *argv[]) {
long n, m;
scanf("%ld%ld", &n, &m);
scanf("%s", str);
vector<vector<long>> z(n);
long i, j;
for (i = 0; i < m; i++) {
long a, b;
scanf("%ld%ld", &a, &b);
z[a - 1].push_back(b - 1);
z[b - 1].push_back(a - 1);
}
queue<long> que;
for (i = 0; i < n; i++) {
long a = 0, b = 0;
for (j = 0; j < z[i].size(); j++) {
if (str[z[i][j]] == 'A')
a++;
else
b++;
}
if (a == 0 || b == 0) {
que.push(i);
}
}
vector<long> flag(n, 0);
while (!que.empty()) {
long i = que.front();
que.pop();
if (flag[i])
continue;
long a = 0, b = 0;
for (j = 0; j < z[i].size(); j++) {
if (!flag[z[i][j]]) {
if (str[z[i][j]] == 'A')
a++;
else
b++;
}
}
if (a == 0 || b == 0) {
flag[i] = 1;
for (j = 0; j < z[i].size(); j++) {
if (!flag[z[i][j]]) {
que.push(z[i][j]);
}
}
}
}
for (i = 0; i < n; i++) {
if (flag[i] == 0) {
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
#define MOD 1000000007
using namespace std;
char str[200005];
int main(int argc, char *argv[]) {
long n, m;
scanf("%ld%ld", &n, &m);
scanf("%s", str);
vector<vector<long>> z(n);
long i, j;
for (i = 0; i < m; i++) {
long a, b;
scanf("%ld%ld", &a, &b);
z[a - 1].push_back(b - 1);
z[b - 1].push_back(a - 1);
}
queue<long> que;
for (i = 0; i < n; i++) {
long a = 0, b = 0;
for (j = 0; j < z[i].size(); j++) {
if (str[z[i][j]] == 'A')
a++;
else
b++;
}
if (a == 0 || b == 0) {
que.push(i);
}
}
vector<long> flag(n, 0);
while (!que.empty()) {
long i = que.front();
que.pop();
if (flag[i])
continue;
long a = 0, b = 0;
for (j = 0; j < z[i].size(); j++) {
if (!flag[z[i][j]]) {
if (str[z[i][j]] == 'A')
a++;
else
b++;
}
}
if (a == 0 || b == 0) {
flag[i] = 1;
for (j = 0; j < z[i].size(); j++) {
if (!flag[z[i][j]]) {
que.push(z[i][j]);
}
}
}
}
for (i = 0; i < n; i++) {
if (flag[i] == 0) {
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p03256 | C++ | Time Limit Exceeded | /*FBI WARNING
Federal law provides severe civil and criminal penalties for
the unauthorzed reproduction, distribution, or exhibition of
copyrighted motion pictures (Title 17 united states code
sections 501 and 508). The federal bureau of investigation
investigates allegations of criminal copyright infringement
(Title 17, united states code sections 506).*/
#include <bits/stdc++.h>
using namespace std;
#define maxn 400010
template <typename tp> void read(tp &dig) {
char ch = getchar();
dig = 0;
int flag = 0;
while (!isdigit(ch)) {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (isdigit(ch))
dig = dig * 10 + ch - '0', ch = getchar();
if (flag)
dig = -dig;
}
int fst[maxn], nxt[maxn << 1], to[maxn << 1];
int n, m, lnum, a[maxn], sum[maxn][2];
char s[maxn];
int vis[maxn];
queue<int> que;
inline void add_edge(int u, int v) {
nxt[++lnum] = fst[u];
fst[u] = lnum;
to[lnum] = v;
nxt[++lnum] = fst[v];
fst[v] = lnum;
to[lnum] = u;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("a.in", "r", stdin);
#endif
read(n);
read(m);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i)
a[i] = (s[i] == 'A');
for (int i = 1, x, y; i <= m; ++i) {
read(x), read(y);
add_edge(x, y);
++sum[x][a[y]];
++sum[y][a[x]];
}
for (int i = 1; i <= n; ++i)
if (!sum[i][0] || !sum[i][1])
que.push(i), vis[i] = 1;
while (!que.empty()) {
int now = que.front();
que.pop();
for (int j = fst[now]; j; j = nxt[j]) {
int v = to[j];
--sum[v][a[now]];
if (vis[v])
continue;
if (!sum[v][0] || !sum[v][1])
que.push(v), vis[v] = 1;
}
}
int flag = 0;
for (int i = 1; i <= n; ++i)
if (!vis[i])
flag = 1;
if (flag)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| /*FBI WARNING
Federal law provides severe civil and criminal penalties for
the unauthorzed reproduction, distribution, or exhibition of
copyrighted motion pictures (Title 17 united states code
sections 501 and 508). The federal bureau of investigation
investigates allegations of criminal copyright infringement
(Title 17, united states code sections 506).*/
#include <bits/stdc++.h>
using namespace std;
#define maxn 400010
template <typename tp> void read(tp &dig) {
char ch = getchar();
dig = 0;
int flag = 0;
while (!isdigit(ch)) {
if (ch == '-')
flag = 1;
ch = getchar();
}
while (isdigit(ch))
dig = dig * 10 + ch - '0', ch = getchar();
if (flag)
dig = -dig;
}
int fst[maxn], nxt[maxn << 1], to[maxn << 1];
int n, m, lnum, a[maxn], sum[maxn][2];
char s[maxn];
int vis[maxn];
queue<int> que;
inline void add_edge(int u, int v) {
nxt[++lnum] = fst[u];
fst[u] = lnum;
to[lnum] = v;
nxt[++lnum] = fst[v];
fst[v] = lnum;
to[lnum] = u;
}
int main() {
read(n);
read(m);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i)
a[i] = (s[i] == 'A');
for (int i = 1, x, y; i <= m; ++i) {
read(x), read(y);
add_edge(x, y);
++sum[x][a[y]];
++sum[y][a[x]];
}
for (int i = 1; i <= n; ++i)
if (!sum[i][0] || !sum[i][1])
que.push(i), vis[i] = 1;
while (!que.empty()) {
int now = que.front();
que.pop();
for (int j = fst[now]; j; j = nxt[j]) {
int v = to[j];
--sum[v][a[now]];
if (vis[v])
continue;
if (!sum[v][0] || !sum[v][1])
que.push(v), vis[v] = 1;
}
}
int flag = 0;
for (int i = 1; i <= n; ++i)
if (!vis[i])
flag = 1;
if (flag)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| delete | 44 | 48 | 44 | 44 | TLE | |
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define frab(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ld EPS = 1e-9;
const int N = 1e5 + 10;
vector<int> g[N];
char s[N];
int cnta[N], cntb[N];
void eraseA(int v, set<pair<int, int>> &white, int *cnta) {
for (auto u : g[v]) {
if (white.count({cnta[u], u})) {
white.erase(white.find({cnta[u], u}));
cnta[u]--;
white.insert({cnta[u], u});
}
}
}
int main() {
// freopen("a.in", "r", stdin);
int n, m;
scanf("%d %d", &n, &m);
scanf("%s", &s);
fr(i, m) {
int v, u;
scanf("%d %d", &v, &u);
--v, --u;
g[v].pb(u);
g[u].pb(v);
if (s[u] == 'A')
cnta[v]++;
else
cntb[v]++;
if (s[v] == 'A')
cnta[u]++;
else
cntb[u]++;
}
set<pair<int, int>> white, black;
fr(i, n) {
white.insert({cnta[i], i});
black.insert({cntb[i], i});
}
while (white.size() && black.size()) {
auto itw = white.begin();
auto itb = black.begin();
// cout << itw->second << " " << itb->second << endl;
if (itw->first && itb->first) {
cout << "Yes";
return 0;
}
if (!(itw->first)) {
int v = itw->second;
white.erase(itw);
assert(black.count({cntb[v], v}));
black.erase(black.find({cntb[v], v}));
if (s[v] == 'A')
eraseA(v, white, cnta);
else
eraseA(v, black, cntb);
} else if (!(itb->first)) {
int v = itb->second;
black.erase(itb);
assert(white.count({cnta[v], v}));
white.erase(white.find({cnta[v], v}));
if (s[v] == 'A')
eraseA(v, white, cnta);
else
eraseA(v, black, cntb);
}
}
cout << "No";
}
| #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define frab(i, a, b) for (int i = a; i < b; i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ld EPS = 1e-9;
const int N = 3e5 + 10;
vector<int> g[N];
char s[N];
int cnta[N], cntb[N];
void eraseA(int v, set<pair<int, int>> &white, int *cnta) {
for (auto u : g[v]) {
if (white.count({cnta[u], u})) {
white.erase(white.find({cnta[u], u}));
cnta[u]--;
white.insert({cnta[u], u});
}
}
}
int main() {
// freopen("a.in", "r", stdin);
int n, m;
scanf("%d %d", &n, &m);
scanf("%s", &s);
fr(i, m) {
int v, u;
scanf("%d %d", &v, &u);
--v, --u;
g[v].pb(u);
g[u].pb(v);
if (s[u] == 'A')
cnta[v]++;
else
cntb[v]++;
if (s[v] == 'A')
cnta[u]++;
else
cntb[u]++;
}
set<pair<int, int>> white, black;
fr(i, n) {
white.insert({cnta[i], i});
black.insert({cntb[i], i});
}
while (white.size() && black.size()) {
auto itw = white.begin();
auto itb = black.begin();
// cout << itw->second << " " << itb->second << endl;
if (itw->first && itb->first) {
cout << "Yes";
return 0;
}
if (!(itw->first)) {
int v = itw->second;
white.erase(itw);
assert(black.count({cntb[v], v}));
black.erase(black.find({cntb[v], v}));
if (s[v] == 'A')
eraseA(v, white, cnta);
else
eraseA(v, black, cntb);
} else if (!(itb->first)) {
int v = itb->second;
black.erase(itb);
assert(white.count({cnta[v], v}));
white.erase(white.find({cnta[v], v}));
if (s[v] == 'A')
eraseA(v, white, cnta);
else
eraseA(v, black, cntb);
}
}
cout << "No";
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03256 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 100005;
int n, m;
char ss[N];
int X[N], Y[N];
int du[N][2];
vector<int> vec[N];
queue<int> q;
bool in[N];
int main() {
scanf("%d%d", &n, &m);
scanf("%s", ss + 1);
for (int u = 1; u <= m; u++) {
int x, y;
scanf("%d%d", &x, &y);
vec[x].push_back(y);
vec[y].push_back(x);
du[y][ss[x] - 'A']++;
du[x][ss[y] - 'A']++;
}
memset(in, true, sizeof(in));
for (int u = 1; u <= n; u++) {
if (du[u][0] <= 0 || du[u][1] <= 0) {
in[u] = false;
q.push(u);
}
}
while (!q.empty()) {
int x = q.front();
q.pop();
int siz = vec[x].size();
for (int u = 0; u < siz; u++) {
int y = vec[x][u];
if (in[y] == false)
continue;
du[y][ss[x] - 'A']--;
if (du[y][ss[x] - 'A'] == 0) {
in[y] = false;
q.push(y);
}
}
}
for (int u = 1; u <= n; u++)
if (in[u]) {
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 200005;
int n, m;
char ss[N];
int X[N], Y[N];
int du[N][2];
vector<int> vec[N];
queue<int> q;
bool in[N];
int main() {
scanf("%d%d", &n, &m);
scanf("%s", ss + 1);
for (int u = 1; u <= m; u++) {
int x, y;
scanf("%d%d", &x, &y);
vec[x].push_back(y);
vec[y].push_back(x);
du[y][ss[x] - 'A']++;
du[x][ss[y] - 'A']++;
}
memset(in, true, sizeof(in));
for (int u = 1; u <= n; u++) {
if (du[u][0] <= 0 || du[u][1] <= 0) {
in[u] = false;
q.push(u);
}
}
while (!q.empty()) {
int x = q.front();
q.pop();
int siz = vec[x].size();
for (int u = 0; u < siz; u++) {
int y = vec[x][u];
if (in[y] == false)
continue;
du[y][ss[x] - 'A']--;
if (du[y][ss[x] - 'A'] == 0) {
in[y] = false;
q.push(y);
}
}
}
for (int u = 1; u <= n; u++)
if (in[u]) {
printf("Yes\n");
return 0;
}
printf("No\n");
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03256 | C++ | Runtime Error | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<bitset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
const int N = 1e5;
std::vector<std::vector<int>> g;
int n, m;
string s;
bool ok[N];
void check(int i) {
if (!ok[i])
return;
auto ng = g[i];
ng.clear();
int cntA = 0, cntB = 0;
for (int j : g[i]) {
if (ok[j]) {
ng.push_back(j);
if (s[j] == 'A')
cntA++;
else
cntB++;
}
}
g[i] = ng;
if (!cntA || !cntB) {
ok[i] = 0;
for (int j : g[i]) {
check(j);
}
}
}
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
cin >> n >> m;
cin >> s;
g.resize(n);
for (int i = 0; i < m; i++) {
int a, b;
std::cin >> a >> b;
a--;
b--;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
for (int i = 0; i < n; i++)
ok[i] = 1;
for (int i = 0; i < n; i++) {
check(i);
}
bool ans = 0;
for (int i = 0; i < n; i++)
ans |= ok[i];
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<bitset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
const int N = 2e5;
std::vector<std::vector<int>> g;
int n, m;
string s;
bool ok[N];
void check(int i) {
if (!ok[i])
return;
auto ng = g[i];
ng.clear();
int cntA = 0, cntB = 0;
for (int j : g[i]) {
if (ok[j]) {
ng.push_back(j);
if (s[j] == 'A')
cntA++;
else
cntB++;
}
}
g[i] = ng;
if (!cntA || !cntB) {
ok[i] = 0;
for (int j : g[i]) {
check(j);
}
}
}
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
cin >> n >> m;
cin >> s;
g.resize(n);
for (int i = 0; i < m; i++) {
int a, b;
std::cin >> a >> b;
a--;
b--;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
for (int i = 0; i < n; i++)
ok[i] = 1;
for (int i = 0; i < n; i++) {
check(i);
}
bool ans = 0;
for (int i = 0; i < n; i++)
ans |= ok[i];
cout << (ans ? "Yes" : "No") << endl;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p03256 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("trapv")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vi>;
using pi = pair<ll, ll>;
const ll mod = 1e9 + 7;
int n, m, col[200200], t = 0;
string s;
vvi g;
void dfs(int v) {
sort(all(g[v]));
g[v].erase(unique(all(g[v])), g[v].end());
col[v] = 1;
for (auto i : g[v]) {
if (col[i] == 1)
cout << "Yes", exit(0);
if (col[i])
continue;
dfs(i);
}
col[v] = 2;
}
int main() { // DINIC ORZ
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> s;
g.resize(2 * n);
for (int f, t, i = 0; i < m; i++) {
cin >> f >> t, f--, t--;
f *= 2, t *= 2;
if (s[f >> 1] == s[t >> 1]) {
g[f].pb(t + 1);
if (f != t)
g[t].pb(f + 1);
} else {
g[f + 1].pb(t);
g[t + 1].pb(f);
}
}
for (int i = 0; i < 2 * n; i++) {
if (col[i])
continue;
dfs(i);
}
cout << "No";
}
| // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("trapv")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<ll>;
using vvi = vector<vi>;
using pi = pair<ll, ll>;
const ll mod = 1e9 + 7;
int n, m, col[500200], t = 0;
string s;
vvi g;
void dfs(int v) {
sort(all(g[v]));
g[v].erase(unique(all(g[v])), g[v].end());
col[v] = 1;
for (auto i : g[v]) {
if (col[i] == 1)
cout << "Yes", exit(0);
if (col[i])
continue;
dfs(i);
}
col[v] = 2;
}
int main() { // DINIC ORZ
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> s;
g.resize(2 * n);
for (int f, t, i = 0; i < m; i++) {
cin >> f >> t, f--, t--;
f *= 2, t *= 2;
if (s[f >> 1] == s[t >> 1]) {
g[f].pb(t + 1);
if (f != t)
g[t].pb(f + 1);
} else {
g[f + 1].pb(t);
g[t + 1].pb(f);
}
}
for (int i = 0; i < 2 * n; i++) {
if (col[i])
continue;
dfs(i);
}
cout << "No";
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p03256 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define neko 400010
#define f(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
int book[neko], fa[neko], t, head[neko], vis[neko], n, m, ans;
char s[neko];
struct node {
int v, w, nex;
} e[neko << 1];
void add(int x, int y, int z) {
e[++t].v = y, e[t].w = z, e[t].nex = head[x], head[x] = t;
e[++t].v = x, e[t].w = z, e[t].nex = head[y], head[y] = t;
}
void dfs(int u, int col) {
int tag = 0;
// printf("%d %d\n",u,col);
for (register int i = head[u], v = e[i].v; i; i = e[i].nex, v = e[i].v) {
if (!book[i] && e[i].w ^ col) {
book[i] = 1, vis[e[i].w] = 1;
dfs(v, e[i].w);
book[i] = 0;
} else if (book[i] && e[i].w ^ col) {
printf("Yes\n");
exit(0);
}
}
}
int main() {
int x, y;
scanf("%d%d", &n, &m);
scanf("%s", s + 1);
f(i, 1, m) {
scanf("%d%d", &x, &y);
if (s[x] ^ s[y])
add(x, y, 0);
else
add(x, y, 1);
}
f(i, 1, m << 1) if (!vis[i]) vis[i] = 1, dfs(e[i].v, e[i].w);
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
#define neko 400010
#define f(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
int book[neko], fa[neko], t, head[neko], vis[neko], n, m, ans;
char s[neko];
struct node {
int v, w, nex;
} e[neko << 1];
void add(int x, int y, int z) {
e[++t].v = y, e[t].w = z, e[t].nex = head[x], head[x] = t;
e[++t].v = x, e[t].w = z, e[t].nex = head[y], head[y] = t;
}
void dfs(int u, int col) {
int tag = 0;
// printf("%d %d\n",u,col);
for (register int i = head[u], v = e[i].v; i; i = e[i].nex, v = e[i].v) {
if (!book[i] && e[i].w ^ col) {
book[i] = 1, vis[i] = 1;
dfs(v, e[i].w);
book[i] = 0;
} else if (book[i] && e[i].w ^ col) {
printf("Yes\n");
exit(0);
}
}
}
int main() {
int x, y;
scanf("%d%d", &n, &m);
scanf("%s", s + 1);
f(i, 1, m) {
scanf("%d%d", &x, &y);
if (s[x] ^ s[y])
add(x, y, 0);
else
add(x, y, 1);
}
f(i, 1, m << 1) if (!vis[i]) vis[i] = 1, dfs(e[i].v, e[i].w);
printf("No\n");
return 0;
} | replace | 18 | 19 | 18 | 19 | TLE | |
p03256 | Python | Time Limit Exceeded | import sys
sys.setrecursionlimit(200000)
def add_link(a, b):
la = links[a]
i, j = [(0, 1), (1, 0)][s[b] == "B"]
if not la[i] and la[j]:
able[a] = True
la[i].add(b)
def close(v, i):
j = int(s[v] == "B")
for u in links[v][i].copy():
if not able[u]:
continue
links[u][j].discard(v)
if not links[u][j]:
able[u] = False
close(u, j ^ 1)
n, m = map(int, input().split())
s = input()
links = [[set(), set()] for _ in range(n)]
able = [False] * n
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
add_link(a, b)
add_link(b, a)
for v in range(n):
if able[v]:
continue
close(v, bool(links[v][1]))
print("Yes" if any(able) else "No")
| import sys
sys.setrecursionlimit(200000)
def add_link(a, b):
la = links[a]
i, j = [(0, 1), (1, 0)][s[b] == "B"]
if not la[i] and la[j]:
able[a] = True
la[i].add(b)
def close(v, i):
j = int(s[v] == "B")
for u in links[v][i].copy():
if not able[u]:
continue
links[u][j].discard(v)
if not links[u][j]:
able[u] = False
close(u, j ^ 1)
n, m = map(int, input().split())
s = input()
links = [[set(), set()] for _ in range(n)]
able = [False] * n
for line in sys.stdin.readlines():
a, b = map(int, line.split())
a -= 1
b -= 1
add_link(a, b)
add_link(b, a)
for v in range(n):
if able[v]:
continue
close(v, bool(links[v][1]))
print("Yes" if any(able) else "No")
| replace | 28 | 30 | 28 | 30 | TLE | |
p03256 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
string s;
int field[200100];
vector<int> children[200010];
bool ok[200100];
void search(int from) {
bool checker[2];
checker[0] = false;
checker[1] = false;
for (int i = 0; i < children[from].size(); i++) {
int to = children[from][i];
if (!ok[to]) {
continue;
}
checker[field[to]] = true;
if (checker[0] && checker[1]) {
return;
}
}
ok[from] = false;
}
void search2(int from) {
if (!ok[from])
return;
bool checker[2];
checker[0] = false;
checker[1] = false;
for (int i = 0; i < children[from].size(); i++) {
int to = children[from][i];
if (!ok[to]) {
continue;
}
checker[field[to]] = true;
if (checker[0] && checker[1]) {
return;
}
}
ok[from] = false;
for (int i = 0; i < children[from].size(); i++) {
if (ok[children[from][i]])
search2(children[from][i]);
}
return;
}
int main() {
// cout.precision(10);
cin >> n >> m;
cin >> s;
for (int i = 1; i <= n; i++) {
if (s[i - 1] == 'A') {
field[i] = 0;
} else {
field[i] = 1;
}
}
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
if (a == b) {
children[a].push_back(b);
continue;
}
children[a].push_back(b);
children[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
ok[i] = true;
}
for (int time = 1; time <= 300; time++) {
for (int i = 1; i <= n; i++) {
if (ok[i])
search(i);
}
}
for (int i = 1; i <= n; i++) {
search2(i);
}
for (int i = 1; i <= n; i++) {
if (ok[i]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
string s;
int field[200100];
vector<int> children[200010];
bool ok[200100];
void search(int from) {
bool checker[2];
checker[0] = false;
checker[1] = false;
for (int i = 0; i < children[from].size(); i++) {
int to = children[from][i];
if (!ok[to]) {
continue;
}
checker[field[to]] = true;
if (checker[0] && checker[1]) {
return;
}
}
ok[from] = false;
}
void search2(int from) {
if (!ok[from])
return;
bool checker[2];
checker[0] = false;
checker[1] = false;
for (int i = 0; i < children[from].size(); i++) {
int to = children[from][i];
if (!ok[to]) {
continue;
}
checker[field[to]] = true;
if (checker[0] && checker[1]) {
return;
}
}
ok[from] = false;
for (int i = 0; i < children[from].size(); i++) {
if (ok[children[from][i]])
search2(children[from][i]);
}
return;
}
int main() {
// cout.precision(10);
cin >> n >> m;
cin >> s;
for (int i = 1; i <= n; i++) {
if (s[i - 1] == 'A') {
field[i] = 0;
} else {
field[i] = 1;
}
}
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
if (a == b) {
children[a].push_back(b);
continue;
}
children[a].push_back(b);
children[b].push_back(a);
}
for (int i = 1; i <= n; i++) {
ok[i] = true;
}
for (int time = 1; time <= 100; time++) {
for (int i = 1; i <= n; i++) {
if (ok[i])
search(i);
}
}
for (int i = 1; i <= n; i++) {
search2(i);
}
for (int i = 1; i <= n; i++) {
if (ok[i]) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| replace | 78 | 79 | 78 | 79 | TLE | |
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define for1(a, b, i) for (int i = a; i <= b; ++i)
#define FOR2(a, b, i) for (int i = a; i >= b; --i)
using namespace std;
typedef long long ll;
inline int read() {
int f = 1, sum = 0;
char x = getchar();
for (; (x < '0' || x > '9'); x = getchar())
if (x == '-')
f = -1;
for (; x >= '0' && x <= '9'; x = getchar())
sum = sum * 10 + x - '0';
return f * sum;
}
#define M 200005
int n, m;
char s[M];
int e_size, head[M], vis[M];
struct node {
int v, nxt;
} e[M * 2];
inline void e_add(int u, int v) {
e[++e_size] = (node){v, head[u]};
head[u] = e_size;
}
inline void dfs(int x) {
vis[x] = 1;
for (int i = head[x]; i; i = e[i].nxt) {
int v = e[i].v;
if (vis[v] == 1) {
puts("Yes");
exit(0);
}
if (vis[v] == 0)
dfs(v);
}
vis[x] = -1;
}
int main() {
// freopen("a.in","r",stdin);
n = read(), m = read();
scanf("%s", s + 1);
for1(1, m, i) {
int x = read(), y = read();
if (s[x] == s[y])
e_add(x, y + n), e_add(y, x + n);
else
e_add(x + n, y), e_add(y + n, x);
}
for1(1, n, i) if (!vis[i]) dfs(i);
puts("No");
} | #include <bits/stdc++.h>
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define for1(a, b, i) for (int i = a; i <= b; ++i)
#define FOR2(a, b, i) for (int i = a; i >= b; --i)
using namespace std;
typedef long long ll;
inline int read() {
int f = 1, sum = 0;
char x = getchar();
for (; (x < '0' || x > '9'); x = getchar())
if (x == '-')
f = -1;
for (; x >= '0' && x <= '9'; x = getchar())
sum = sum * 10 + x - '0';
return f * sum;
}
#define M 1000005
int n, m;
char s[M];
int e_size, head[M], vis[M];
struct node {
int v, nxt;
} e[M * 2];
inline void e_add(int u, int v) {
e[++e_size] = (node){v, head[u]};
head[u] = e_size;
}
inline void dfs(int x) {
vis[x] = 1;
for (int i = head[x]; i; i = e[i].nxt) {
int v = e[i].v;
if (vis[v] == 1) {
puts("Yes");
exit(0);
}
if (vis[v] == 0)
dfs(v);
}
vis[x] = -1;
}
int main() {
// freopen("a.in","r",stdin);
n = read(), m = read();
scanf("%s", s + 1);
for1(1, m, i) {
int x = read(), y = read();
if (s[x] == s[y])
e_add(x, y + n), e_add(y, x + n);
else
e_add(x + n, y), e_add(y + n, x);
}
for1(1, n, i) if (!vis[i]) dfs(i);
puts("No");
} | replace | 18 | 19 | 18 | 19 | 0 | |
p03256 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << endl
#define p7(a, b, c, d, e, f, g) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) \
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n) \
idp { \
rep(i, n) { cout << x[i] << " "; } \
puts(""); \
}
#define dump2(x, n) \
idp { \
rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
puts(""); \
}
#define dumpi(x) \
idp { \
foreach (it, x) { \
cout << (*it) << " "; \
} \
puts(""); \
}
#define dumpi2(x) \
idp { \
foreach (it, x) { \
cout << "[" << (it)->F << " , " << (it)->S << "] "; \
} \
puts(""); \
}
#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h) \
rep(i, h) { \
rep(j, w) cout << a[i][j] << " "; \
puts(""); \
}
typedef pair<li, li> PI;
li n, m;
bool isa[200200];
set<li> edge[200200][2];
inline bool ok(li x) { return (!edge[x][0].empty() && !edge[x][1].empty()); }
inline void prune(li x) {
vector<li> remove_list;
rep(i, 2) {
foreach (it, edge[x][i]) {
li next = *it;
edge[next][(isa[x] ? 0 : 1)].erase(x);
remove_list.pb(next);
}
edge[x][i].clear();
}
rep(i, sz(remove_list)) {
if (!ok(remove_list[i]) && remove_list[i] != x) {
prune(remove_list[i]);
}
}
}
int main() {
cin >> n >> m;
string s;
cin >> s;
rep(i, sz(s)) { isa[i] = (s[i] == 'A'); }
rep(i, m) {
li x, y;
cin >> x >> y;
x--;
y--;
if (isa[y]) {
edge[x][0].insert(y);
} else {
edge[x][1].insert(y);
}
if (isa[x]) {
edge[y][0].insert(x);
} else {
edge[y][1].insert(x);
}
}
rin {
if (!ok(i)) {
prune(i);
}
}
bool res = false;
rin {
if (ok(i)) {
res = true;
break;
}
}
cout << (res ? "Yes" : "No") << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << endl
#define p7(a, b, c, d, e, f, g) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) \
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n) \
idp { \
rep(i, n) { cout << x[i] << " "; } \
puts(""); \
}
#define dump2(x, n) \
idp { \
rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
puts(""); \
}
#define dumpi(x) \
idp { \
foreach (it, x) { \
cout << (*it) << " "; \
} \
puts(""); \
}
#define dumpi2(x) \
idp { \
foreach (it, x) { \
cout << "[" << (it)->F << " , " << (it)->S << "] "; \
} \
puts(""); \
}
#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h) \
rep(i, h) { \
rep(j, w) cout << a[i][j] << " "; \
puts(""); \
}
typedef pair<li, li> PI;
li n, m;
bool isa[200200];
set<li> edge[200200][2];
inline bool ok(li x) { return (!edge[x][0].empty() && !edge[x][1].empty()); }
inline void prune(li x) {
vector<li> remove_list;
rep(i, 2) {
foreach (it, edge[x][i]) {
li next = *it;
if (next == x)
continue;
edge[next][(isa[x] ? 0 : 1)].erase(x);
remove_list.pb(next);
}
edge[x][i].clear();
}
rep(i, sz(remove_list)) {
if (!ok(remove_list[i]) && remove_list[i] != x) {
prune(remove_list[i]);
}
}
}
int main() {
cin >> n >> m;
string s;
cin >> s;
rep(i, sz(s)) { isa[i] = (s[i] == 'A'); }
rep(i, m) {
li x, y;
cin >> x >> y;
x--;
y--;
if (isa[y]) {
edge[x][0].insert(y);
} else {
edge[x][1].insert(y);
}
if (isa[x]) {
edge[y][0].insert(x);
} else {
edge[y][1].insert(x);
}
}
rin {
if (!ok(i)) {
prune(i);
}
}
bool res = false;
rin {
if (ok(i)) {
res = true;
break;
}
}
cout << (res ? "Yes" : "No") << endl;
return 0;
} | insert | 97 | 97 | 97 | 99 | 0 | |
p03256 | C++ | Runtime Error | /*
发现有解的充要条件是有一个形为AABBAABBAABB的环
此时每一个点至少与两个不同颜色的点相连
对于初始不合法的点直接删掉，判断删掉后与其相连的点是否变为不合法
类似拓扑排序
*/
#include <bits/stdc++.h>
#define gc getchar()
#define pc putchar
inline int read() {
int x = 0, f = 1;
char c = gc;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = gc;
}
while (c <= '9' && c >= '0')
x = x * 10 + c - '0', c = gc;
return x * f;
}
void print(long long x) {
if (x < 0) {
pc('-');
x = -x;
}
if (x >= 10)
print(x / 10);
pc(x % 10 + '0');
}
const int maxn = 100007;
int val[maxn];
int n, m;
struct node {
int v, next;
} edge[maxn];
int head[maxn], num = 0;
inline void add_edge(int u, int v) {
edge[++num].v = v;
edge[num].next = head[u];
head[u] = num;
}
int d[maxn][2];
std::queue<int> q;
char s[maxn];
bool vis[maxn];
int main() {
n = read(), m = read();
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i) {
char c = s[i];
if (c == 'A')
val[i] = 0;
else
val[i] = 1;
}
for (int u, v, i = 1; i <= m; ++i) {
u = read(), v = read();
add_edge(u, v);
add_edge(v, u);
d[u][val[v]]++, d[v][val[u]]++;
}
int count = 0;
for (int i = 1; i <= n; ++i)
if (!d[i][1] || !d[i][0])
q.push(i), count++, vis[i] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i; i = edge[i].next) {
int v = edge[i].v;
d[v][val[u]]--;
if ((!d[v][1] || !d[v][0]) && !vis[v]) {
q.push(v);
count++;
vis[v] = 1;
}
}
}
puts(count == n ? "No" : "Yes");
return 0;
} | /*
发现有解的充要条件是有一个形为AABBAABBAABB的环
此时每一个点至少与两个不同颜色的点相连
对于初始不合法的点直接删掉，判断删掉后与其相连的点是否变为不合法
类似拓扑排序
*/
#include <bits/stdc++.h>
#define gc getchar()
#define pc putchar
inline int read() {
int x = 0, f = 1;
char c = gc;
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = gc;
}
while (c <= '9' && c >= '0')
x = x * 10 + c - '0', c = gc;
return x * f;
}
void print(long long x) {
if (x < 0) {
pc('-');
x = -x;
}
if (x >= 10)
print(x / 10);
pc(x % 10 + '0');
}
const int maxn = 1000007;
int val[maxn];
int n, m;
struct node {
int v, next;
} edge[maxn];
int head[maxn], num = 0;
inline void add_edge(int u, int v) {
edge[++num].v = v;
edge[num].next = head[u];
head[u] = num;
}
int d[maxn][2];
std::queue<int> q;
char s[maxn];
bool vis[maxn];
int main() {
n = read(), m = read();
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i) {
char c = s[i];
if (c == 'A')
val[i] = 0;
else
val[i] = 1;
}
for (int u, v, i = 1; i <= m; ++i) {
u = read(), v = read();
add_edge(u, v);
add_edge(v, u);
d[u][val[v]]++, d[v][val[u]]++;
}
int count = 0;
for (int i = 1; i <= n; ++i)
if (!d[i][1] || !d[i][0])
q.push(i), count++, vis[i] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i; i = edge[i].next) {
int v = edge[i].v;
d[v][val[u]]--;
if ((!d[v][1] || !d[v][0]) && !vis[v]) {
q.push(v);
count++;
vis[v] = 1;
}
}
}
puts(count == n ? "No" : "Yes");
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p03256 | C++ | Time Limit Exceeded |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto &in = std::cin;
auto &out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int32_t N, M;
char S[200100];
int32_t flag[200000][2];
std::vector<int> graph[200000];
bool deleted[200000];
int main() {
using std::endl;
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> N >> M;
in >> S;
for (int32_t i = 0; i < N; i++) {
S[i] -= 'A';
}
for (int32_t i = 0; i < M; i++) {
int a, b;
in >> a >> b;
--a;
--b;
graph[a].emplace_back(b);
graph[b].emplace_back(a);
++flag[a][S[b]];
++flag[b][S[a]];
}
bool update = true;
while (update) {
update = false;
for (int32_t i = 0; i < N; i++) {
if (!deleted[i] && (flag[i][0] == 0 || flag[i][1] == 0)) {
update = true;
deleted[i] = true;
for (auto &t : graph[i]) {
--flag[t][S[i]];
}
}
}
}
for (int32_t i = 0; i < N; i++) {
if (!deleted[i]) {
out << "Yes" << endl;
return 0;
}
}
out << "No" << endl;
return 0;
}
#endif
|
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
auto &in = std::cin;
auto &out = std::cout;
#define all_range(C) std::begin(C), std::end(C)
const double PI =
3.141592653589793238462643383279502884197169399375105820974944;
int32_t N, M;
char S[200100];
int32_t flag[200000][2];
std::vector<int> graph[200000];
bool deleted[200000];
int main() {
using std::endl;
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in.tie(nullptr);
out.tie(nullptr);
in >> N >> M;
in >> S;
for (int32_t i = 0; i < N; i++) {
S[i] -= 'A';
}
for (int32_t i = 0; i < M; i++) {
int a, b;
in >> a >> b;
--a;
--b;
graph[a].emplace_back(b);
graph[b].emplace_back(a);
++flag[a][S[b]];
++flag[b][S[a]];
}
std::queue<int> que;
for (int32_t i = 0; i < N; i++) {
if (flag[i][0] <= 0 || flag[i][1] <= 0) {
deleted[i] = true;
que.push(i);
}
}
while (!que.empty()) {
auto v = que.front();
que.pop();
for (auto &t : graph[v]) {
--flag[t][S[v]];
if (flag[t][S[v]] <= 0 && !deleted[t]) {
deleted[t] = true;
que.push(t);
}
}
}
for (int32_t i = 0; i < N; i++) {
if (!deleted[i]) {
out << "Yes" << endl;
return 0;
}
}
out << "No" << endl;
return 0;
}
#endif
| replace | 62 | 72 | 62 | 78 | TLE | |
p03256 | C++ | Runtime Error | // https://agc027.contest.atcoder.jp/tasks/agc027_c
#include <bits/stdc++.h>
const int N = 1e5 + 5;
using namespace std;
queue<int> mq;
vector<int> adj[N];
int n, m, cnt[N][2], num;
string s;
bool dead[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
cin >> s;
s = '.' + s;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
cnt[u][s[v] - 'A']++;
adj[v].push_back(u);
cnt[v][s[u] - 'A']++;
}
for (int u = 1; u <= n; u++) {
if (!cnt[u][0] || !cnt[u][1]) {
mq.push(u);
dead[u] = true;
}
}
while (mq.size()) {
int u = mq.front();
mq.pop();
num++;
for (auto v : adj[u]) {
if (dead[v])
continue;
cnt[v][s[u] - 'A']--;
if (!cnt[v][s[u] - 'A']) {
mq.push(v);
dead[v] = true;
}
}
}
cout << ((num == n) ? "No" : "Yes");
}
| // https://agc027.contest.atcoder.jp/tasks/agc027_c
#include <bits/stdc++.h>
const int N = 2e5 + 5;
using namespace std;
queue<int> mq;
vector<int> adj[N];
int n, m, cnt[N][2], num;
string s;
bool dead[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
cin >> s;
s = '.' + s;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
cnt[u][s[v] - 'A']++;
adj[v].push_back(u);
cnt[v][s[u] - 'A']++;
}
for (int u = 1; u <= n; u++) {
if (!cnt[u][0] || !cnt[u][1]) {
mq.push(u);
dead[u] = true;
}
}
while (mq.size()) {
int u = mq.front();
mq.pop();
num++;
for (auto v : adj[u]) {
if (dead[v])
continue;
cnt[v][s[u] - 'A']--;
if (!cnt[v][s[u] - 'A']) {
mq.push(v);
dead[v] = true;
}
}
}
cout << ((num == n) ? "No" : "Yes");
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03256 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int N = 200005, M = N * 2;
int a[N];
int en = 0, to[M], nxt[M], h[N];
void addedge(int u, int v) { to[++en] = v, nxt[en] = h[u], h[u] = en; }
int du[2][N];
int n, m;
int iff[N], cnt = 0;
queue<int> q;
int main() {
freopen("input.txt", "r", stdin);
cin >> n >> m;
char ch = getchar();
while (ch != 'A' && ch != 'B') {
ch = getchar();
}
a[1] = ch == 'A';
for (int i = 2; i <= n; i++) {
a[i] = getchar() == 'A';
}
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
du[a[v]][u]++;
du[a[u]][v]++;
addedge(u, v);
addedge(v, u);
}
for (int i = 1; i <= n; i++) {
if (!du[0][i] || !du[1][i])
q.push(i), iff[i] = 1, cnt++;
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = h[u]; i; i = nxt[i]) {
int v = to[i];
du[a[u]][v]--;
if (iff[v])
continue;
if (!du[a[u]][v] && !iff[v]) {
q.push(v);
iff[v] = 1;
cnt++;
}
}
}
if (cnt < n) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int N = 200005, M = N * 2;
int a[N];
int en = 0, to[M], nxt[M], h[N];
void addedge(int u, int v) { to[++en] = v, nxt[en] = h[u], h[u] = en; }
int du[2][N];
int n, m;
int iff[N], cnt = 0;
queue<int> q;
int main() {
// freopen("input.txt","r",stdin);
cin >> n >> m;
char ch = getchar();
while (ch != 'A' && ch != 'B') {
ch = getchar();
}
a[1] = ch == 'A';
for (int i = 2; i <= n; i++) {
a[i] = getchar() == 'A';
}
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
du[a[v]][u]++;
du[a[u]][v]++;
addedge(u, v);
addedge(v, u);
}
for (int i = 1; i <= n; i++) {
if (!du[0][i] || !du[1][i])
q.push(i), iff[i] = 1, cnt++;
}
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = h[u]; i; i = nxt[i]) {
int v = to[i];
du[a[u]][v]--;
if (iff[v])
continue;
if (!du[a[u]][v] && !iff[v]) {
q.push(v);
iff[v] = 1;
cnt++;
}
}
}
if (cnt < n) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| replace | 17 | 18 | 17 | 18 | TLE | |
p03257 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
vector<ll> primes;
ll factor[505];
ll field[505][505];
set<ll> used;
int main() {
// cout.precision(10);
int N;
cin >> N;
for (ll i = 2; i <= 20000; i++) {
bool ok = true;
for (ll j = 2; j * j <= i; j++) {
if (i % j == 0) {
ok = false;
break;
}
}
if (ok)
primes.push_back(i);
}
int index = 1;
for (int i = 2; i <= 2 * N; i += 2) {
factor[i] = primes[index];
index++;
}
for (int i = 1; i <= N + 1; i += 2) {
field[i][1] = primes[index];
index++;
ll now1 = field[i][1];
field[1][i] = primes[index];
index++;
ll now2 = field[1][i];
// cerr << i << " " << index << endl;
for (int j = 1; j + i - 1 <= N + 1; j++) {
field[j][i + j - 1] = now1 * factor[i + 2 * j - 1];
field[i + j - 1][j] = now2 * factor[i + 2 * j - 1];
// cerr << i << " " << j << endl;
}
}
vector<ll> val;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (field[i][j] == 0) {
if (i > 1)
field[i][j] = field[i + 1][j] * field[i - 1][j] + 1;
else
field[i][j] = field[i][j + 1] * field[i][j - 1] + 1;
}
cout << field[i][j] << " ";
// if(field[i][j] > 1e15) val.push_back(field[i][j]);
// if(used.find(field[i][j]) != used.end()) val.push_back(field[i][j]);
used.insert(field[i][j]);
if (i > 1) {
if (max(field[i - 1][j], field[i][j]) %
min(field[i][j], field[i - 1][j]) !=
1)
val.push_back(field[i][j]);
// cerr << i << " " << j << " " << field[i][j] << " "<< field[i-1][j] <<
// endl;
}
}
cout << endl;
}
// cout << "out" << endl;
// for(int i = 0; i < val.size(); i++) cout << val[i] << endl;
// cout << primes.size() << " " << primes[2] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
vector<ll> primes;
ll factor[1005];
ll field[505][505];
set<ll> used;
int main() {
// cout.precision(10);
int N;
cin >> N;
for (ll i = 2; i <= 20000; i++) {
bool ok = true;
for (ll j = 2; j * j <= i; j++) {
if (i % j == 0) {
ok = false;
break;
}
}
if (ok)
primes.push_back(i);
}
int index = 1;
for (int i = 2; i <= 2 * N; i += 2) {
factor[i] = primes[index];
index++;
}
for (int i = 1; i <= N + 1; i += 2) {
field[i][1] = primes[index];
index++;
ll now1 = field[i][1];
field[1][i] = primes[index];
index++;
ll now2 = field[1][i];
// cerr << i << " " << index << endl;
for (int j = 1; j + i - 1 <= N + 1; j++) {
field[j][i + j - 1] = now1 * factor[i + 2 * j - 1];
field[i + j - 1][j] = now2 * factor[i + 2 * j - 1];
// cerr << i << " " << j << endl;
}
}
vector<ll> val;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (field[i][j] == 0) {
if (i > 1)
field[i][j] = field[i + 1][j] * field[i - 1][j] + 1;
else
field[i][j] = field[i][j + 1] * field[i][j - 1] + 1;
}
cout << field[i][j] << " ";
// if(field[i][j] > 1e15) val.push_back(field[i][j]);
// if(used.find(field[i][j]) != used.end()) val.push_back(field[i][j]);
used.insert(field[i][j]);
if (i > 1) {
if (max(field[i - 1][j], field[i][j]) %
min(field[i][j], field[i - 1][j]) !=
1)
val.push_back(field[i][j]);
// cerr << i << " " << j << " " << field[i][j] << " "<< field[i-1][j] <<
// endl;
}
}
cout << endl;
}
// cout << "out" << endl;
// for(int i = 0; i < val.size(); i++) cout << val[i] << endl;
// cout << primes.size() << " " << primes[2] << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p03257 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
const int N = 20005;
set<ll> st;
int n, i, j, k, p[N], l, w1[N], w2[N];
bool v[N];
ll a[505][505];
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll LCM(ll a, ll b, ll c, ll d) {
ll rtn = a / gcd(a, b) * b;
rtn = rtn / gcd(rtn, c) * c;
rtn = rtn / gcd(rtn, d) * d;
return rtn;
}
int main() {
scanf("%d", &n);
for (i = 2; i <= 20000; ++i) {
if (!v[i])
p[++l] = i;
for (j = 1; j <= l && p[j] * i <= 20000; ++j) {
v[p[j] * i] = true;
if (i % p[j] == 0)
break;
}
}
for (i = 1; i <= n; ++i)
w1[i] = p[i];
for (i = 1; i <= n; ++i)
w2[i] = p[n + i];
random_shuffle(w1 + 1, w1 + 1 + n);
random_shuffle(w2 + 1, w2 + 1 + n);
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if ((i + j) % 2 == 0)
a[i][j] = w1[(i + j) / 2] * w2[(i - j + n) / 2];
for (i = 0; i <= n + 1; ++i)
a[0][i] = a[n + 1][i] = a[i][0] = a[i][n + 1] = 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if ((i + j) & 1) {
a[i][j] = LCM(a[i - 1][j], a[i + 1][j], a[i][j - 1], a[i][j + 1]) + 1;
while (st.count(a[i][j]))
a[i][j] += LCM(a[i - 1][j], a[i + 1][j], a[i][j - 1], a[i][j + 1]);
st.insert(a[i][j]);
}
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j)
printf("%lld ", a[i][j]);
puts("");
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
const int N = 20005;
set<ll> st;
int n, i, j, k, p[N], l, w1[N], w2[N];
bool v[N];
ll a[505][505];
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll LCM(ll a, ll b, ll c, ll d) {
ll rtn = a / gcd(a, b) * b;
rtn = rtn / gcd(rtn, c) * c;
rtn = rtn / gcd(rtn, d) * d;
return rtn;
}
int main() {
scanf("%d", &n);
for (i = 2; i <= 20000; ++i) {
if (!v[i])
p[++l] = i;
for (j = 1; j <= l && p[j] * i <= 20000; ++j) {
v[p[j] * i] = true;
if (i % p[j] == 0)
break;
}
}
for (i = 1; i <= n; ++i)
w1[i] = p[i];
for (i = 1; i <= n; ++i)
w2[i] = p[n + i];
random_shuffle(w1 + 1, w1 + 1 + n);
random_shuffle(w2 + 1, w2 + 1 + n);
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if ((i + j) % 2 == 0)
a[i][j] = w1[(i + j) / 2] * w2[(i - j + n + 1) / 2];
for (i = 0; i <= n + 1; ++i)
a[0][i] = a[n + 1][i] = a[i][0] = a[i][n + 1] = 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= n; ++j)
if ((i + j) & 1) {
a[i][j] = LCM(a[i - 1][j], a[i + 1][j], a[i][j - 1], a[i][j + 1]) + 1;
while (st.count(a[i][j]))
a[i][j] += LCM(a[i - 1][j], a[i + 1][j], a[i][j - 1], a[i][j + 1]);
st.insert(a[i][j]);
}
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j)
printf("%lld ", a[i][j]);
puts("");
}
return 0;
}
| replace | 43 | 44 | 43 | 44 | TLE | |
p03257 | C++ | Runtime Error | #include <bits/stdc++.h>
const int MAXN = 510;
typedef long long LL;
int pri[MAXN], bak, n;
int ispri(int x) {
for (int i = 2; i * i <= x; ++i)
if (x % i == 0)
return false;
return true;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL get(int x, int y) {
if (x < 1 || y < 1 || x > n || y > n)
return 1;
if ((x & 1) == (y & 1))
return pri[x + y >> 1] * pri[x + n * 3 - y + 1 >> 1];
return lcm(lcm(get(x - 1, y), get(x, y - 1)),
lcm(get(x + 1, y), get(x, y + 1))) +
1;
}
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n;
n += 2;
int now = 2;
while (bak < n * 2) {
if (ispri(now))
pri[++bak] = now;
++now;
}
for (int i = 2; i < n; ++i, std::cout << '\n')
for (int j = 2; j < n; ++j)
std::cout << get(i, j) << ' ';
return 0;
}
| #include <bits/stdc++.h>
const int MAXN = 1010;
typedef long long LL;
int pri[MAXN], bak, n;
int ispri(int x) {
for (int i = 2; i * i <= x; ++i)
if (x % i == 0)
return false;
return true;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; }
LL get(int x, int y) {
if (x < 1 || y < 1 || x > n || y > n)
return 1;
if ((x & 1) == (y & 1))
return pri[x + y >> 1] * pri[x + n * 3 - y + 1 >> 1];
return lcm(lcm(get(x - 1, y), get(x, y - 1)),
lcm(get(x + 1, y), get(x, y + 1))) +
1;
}
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n;
n += 2;
int now = 2;
while (bak < n * 2) {
if (ispri(now))
pri[++bak] = now;
++now;
}
for (int i = 2; i < n; ++i, std::cout << '\n')
for (int j = 2; j < n; ++j)
std::cout << get(i, j) << ' ';
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p03257 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define ll long long
using namespace std;
const int N = 510, MX = 1e6;
int p[25010];
int vis[MX];
ll rec[N][N];
int n, m, cnt;
void prework(int n) {
vis[1] = false;
int cnt = 0;
for (int i = 2; cnt < n; ++i) {
if (!vis[i])
p[++cnt] = i;
for (int j = 1; j <= cnt && i * p[j] < MX; ++j) {
vis[i * p[j]] = 1;
if (i % p[j] == 0)
break;
}
}
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) {
if (!x || !y)
return x + y;
return x / gcd(x, y) * y;
}
void solve() {
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if ((i + j) % 2 == 0)
rec[i][j] = 1LL * p[(i + j) / 2] * p[n + (i - j) / 2 + (n + 1) / 2];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (!rec[i][j])
rec[i][j] = lcm(lcm(rec[i - 1][j], rec[i][j + 1]),
lcm(rec[i + 1][j], rec[i][j - 1])) +
1;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("a.in","r",stdin);
#endif
ll tmp;
scanf("%d", &n);
if (n == 2) {
printf("%d %d\n%d %d\n", 4, 7, 23, 10);
return 0;
}
prework(n * n);
solve();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
printf("%lld ", rec[i][j]);
printf("\n");
}
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define ll long long
using namespace std;
const int N = 510, MX = 1e7;
int p[250010];
int vis[MX];
ll rec[N][N];
int n, m, cnt;
void prework(int n) {
vis[1] = false;
int cnt = 0;
for (int i = 2; cnt < n; ++i) {
if (!vis[i])
p[++cnt] = i;
for (int j = 1; j <= cnt && i * p[j] < MX; ++j) {
vis[i * p[j]] = 1;
if (i % p[j] == 0)
break;
}
}
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) {
if (!x || !y)
return x + y;
return x / gcd(x, y) * y;
}
void solve() {
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if ((i + j) % 2 == 0)
rec[i][j] = 1LL * p[(i + j) / 2] * p[n + (i - j) / 2 + (n + 1) / 2];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (!rec[i][j])
rec[i][j] = lcm(lcm(rec[i - 1][j], rec[i][j + 1]),
lcm(rec[i + 1][j], rec[i][j - 1])) +
1;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("a.in","r",stdin);
#endif
ll tmp;
scanf("%d", &n);
if (n == 2) {
printf("%d %d\n%d %d\n", 4, 7, 23, 10);
return 0;
}
prework(n * n);
solve();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
printf("%lld ", rec[i][j]);
printf("\n");
}
} | replace | 6 | 8 | 6 | 8 | 0 | |
p03258 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 3e5;
char st[N];
int F[N], nxt[N];
int su, ans, n;
void ADD(int &t, int d) {
t += d;
if (t >= MOD)
t -= MOD;
}
int main() {
scanf("%s", st + 1);
n = strlen(st + 1);
for (int i = 1, j = 1; i <= n; ++i) {
j = max(j, i);
while (j < n && st[j + 1] != st[j])
j++;
for (int k = i; k <= j; ++k)
nxt[k] = j;
}
if (nxt[1] == n) {
printf("%d\n", 1);
return 0;
}
F[0] = 1;
for (int i = 1; i <= n; ++i) {
ADD(F[i], F[i - 1]);
ADD(F[nxt[i] + 1], F[i - 1]);
}
for (int i = n, su = 0; i >= 1; --i) {
if (su % 3 == 0)
ADD(ans, F[i]);
su += st[i] - 'a' + 1;
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 3e5;
char st[N];
int F[N], nxt[N];
int su, ans, n;
void ADD(int &t, int d) {
t += d;
if (t >= MOD)
t -= MOD;
}
int main() {
scanf("%s", st + 1);
n = strlen(st + 1);
for (int i = 1, j = 1; i <= n; ++i) {
j = max(j, i);
while (j < n && st[j + 1] != st[j])
j++;
for (int k = i; k <= j; ++k)
nxt[k] = j;
i = j;
}
if (nxt[1] == n) {
printf("%d\n", 1);
return 0;
}
F[0] = 1;
for (int i = 1; i <= n; ++i) {
ADD(F[i], F[i - 1]);
ADD(F[nxt[i] + 1], F[i - 1]);
}
for (int i = n, su = 0; i >= 1; --i) {
if (su % 3 == 0)
ADD(ans, F[i]);
su += st[i] - 'a' + 1;
}
printf("%d\n", ans);
}
| insert | 22 | 22 | 22 | 23 | TLE | |
p03258 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
const ll MODULO = 1e9 + 7;
map<vector<int>, ll> ans;
ll Solve(int at, int sum, int want, int len, int was, const vector<int> &a) {
if (at == a.size()) {
if (sum == want)
return 1;
return 0;
}
vector<int> state = {at, sum, want, len, was};
for (int x : state)
cerr << x << " ";
cerr << endl;
if (ans.count(state))
return ans[state];
ll &result = ans[state];
result = 0;
if (sum == want && want != 0 && (len == 1 || was)) {
for (int w = 0; w < 3; ++w)
result = (result + Solve(at, 0, w, 0, 0, a)) % MODULO;
return result;
}
int newLen = min(len + 1, 2);
int newWas = was;
if (len != 0)
newWas |= (a[at] == a[at - 1]);
int newSum = (sum + a[at]) % 3;
result = (result + Solve(at + 1, newSum, want, newLen, newWas, a)) % MODULO;
return result;
}
int main() {
string s;
cin >> s;
int n = s.size();
bool found = false;
for (int i = 0; i < n - 1; ++i)
if (s[i] == s[i + 1])
found = true;
if (!found) {
cout << 1 << endl;
return 0;
}
vector<int> a(n, 1);
for (int i = 0; i < n; ++i)
if (s[i] == 'b')
a[i] = 2;
ll result = (Solve(0, 0, 1, 0, 0, a) + Solve(0, 0, 2, 0, 0, a)) % MODULO;
cout << result << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
const ll MODULO = 1e9 + 7;
map<vector<int>, ll> ans;
ll Solve(int at, int sum, int want, int len, int was, const vector<int> &a) {
if (at == a.size()) {
if (sum == want)
return 1;
return 0;
}
vector<int> state = {at, sum, want, len, was};
if (ans.count(state))
return ans[state];
ll &result = ans[state];
result = 0;
if (sum == want && want != 0 && (len == 1 || was)) {
for (int w = 0; w < 3; ++w)
result = (result + Solve(at, 0, w, 0, 0, a)) % MODULO;
return result;
}
int newLen = min(len + 1, 2);
int newWas = was;
if (len != 0)
newWas |= (a[at] == a[at - 1]);
int newSum = (sum + a[at]) % 3;
result = (result + Solve(at + 1, newSum, want, newLen, newWas, a)) % MODULO;
return result;
}
int main() {
string s;
cin >> s;
int n = s.size();
bool found = false;
for (int i = 0; i < n - 1; ++i)
if (s[i] == s[i + 1])
found = true;
if (!found) {
cout << 1 << endl;
return 0;
}
vector<int> a(n, 1);
for (int i = 0; i < n; ++i)
if (s[i] == 'b')
a[i] = 2;
ll result = (Solve(0, 0, 1, 0, 0, a) + Solve(0, 0, 2, 0, 0, a)) % MODULO;
cout << result << endl;
return 0;
}
| delete | 25 | 28 | 25 | 25 | TLE | |
p03259 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tr1/unordered_map>
#include <vector>
typedef long long LL;
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
<< endl;
}
int read() {
int x = 0, f = 1;
int c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = 0;
c = getchar();
}
while (isdigit(c)) {
x = (x * 10) + (c ^ 48);
c = getchar();
}
return f ? x : -x;
}
#define map MAP
const int maxn = 55, maxm = maxn << 1;
int vis[maxn], anc[maxn], map[maxn][maxn], anc1[maxn];
vector<int> G[maxn], F[maxn];
pair<int, int> E[maxn];
void dfs_same(int u, int fa, int fg) {
vis[u] = fg;
anc[u] = fa;
for (auto x : G[u]) {
if (x == fa)
continue;
if (map[u][x])
dfs_same(x, u, fg);
else
dfs_same(x, u, 0);
}
}
void dfs_same1(int u, int fa) {
anc1[u] = fa;
for (auto x : F[u]) {
if (x == fa)
continue;
if (map[u][x])
dfs_same1(x, u);
else
dfs_same1(x, u);
}
}
namespace tp {
int to[maxm], nxt[maxm], head[maxn], e, deg[maxn];
void add(int x, int y) {
to[++e] = y;
nxt[e] = head[x];
head[x] = e;
deg[y]++;
}
void init(int n) {
for (int i = 1; i <= n; ++i)
deg[i] = 0;
e = 0;
for (int i = 1; i <= n; ++i)
head[i] = 0;
}
int acp(int n) {
queue<int> Q;
for (int i = 1; i <= n; ++i)
if (!deg[i])
Q.push(i);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
--n;
for (int i = head[u]; i; i = nxt[i]) {
int v = to[i];
if ((--deg[v]) == 0)
Q.push(v);
}
}
return !n;
}
} // namespace tp
int main() {
int T = read();
while (T--) {
// init(); //map, G
int n = read();
for (int i = 1; i < n; ++i) {
int x = read(), y = read();
G[x].pb(y);
G[y].pb(x);
}
for (int i = 1; i < n; ++i) {
int x = read(), y = read();
map[x][y] = 1;
map[y][x] = 1;
E[i] = mp(x, y);
F[x].pb(y);
F[y].pb(x);
}
int ans = 0x3f3f3f3f;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
vis[j] = 0;
dfs_same(i, 0, 1);
dfs_same1(i, 0);
tp::init(n);
int tmp = n;
for (int j = 1; j <= n; ++j) {
tmp -= vis[j];
if (!vis[j] && !vis[anc[j]])
tp::add(j, anc[j]);
}
for (int j = 1; j < n; ++j) {
int x = E[j].x, y = E[j].y;
if (!vis[x] && !vis[y]) {
if (anc1[x] == y)
tp::add(y, x);
else
tp::add(x, y);
}
}
if (tp::acp(n))
ans = min(ans, tmp);
}
if (ans == 0x3f3f3f3f) {
for (int i = 1; i <= n; ++i)
if (G[i].size() == 1)
for (int j = 1; j <= n; ++j)
if (i != j) {
int fi = G[i][0];
if (fi == j)
continue;
for (int k = 0; k < G[fi].size(); ++k)
if (G[fi][k] == i) {
G[fi].erase(G[fi].begin() + k);
break;
}
G[i][0] = j;
G[j].pb(i);
for (int u = 1; u <= n; ++u)
vis[u] = 0;
/*
for(int u = 1; u <= n; ++u)
{
for(auto x : G[u]) cout << x << ' ';
cout << endl;
}*/
dfs_same(i, 0, 1);
dfs_same1(i, 0);
tp::init(n);
for (int u = 1; u <= n; ++u)
if (!vis[u] && !vis[anc[u]])
tp::add(u, anc[u]);
for (int u = 1; u < n; ++u) {
int x = E[u].x, y = E[u].y;
if (!vis[x] && !vis[y]) {
if (anc1[x] == y)
tp::add(y, x);
else
tp::add(x, y);
}
}
if (tp::acp(n)) {
ans = n;
goto nxt;
}
G[j].pop_back();
G[i][0] = fi;
G[fi].pb(i);
}
}
nxt:;
if (ans == 0x3f3f3f3f)
puts("-1");
else
cout << ans << endl;
for (int i = 1; i <= n; ++i)
G[i].clear();
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
map[i][j] = 0;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tr1/unordered_map>
#include <vector>
typedef long long LL;
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
<< endl;
}
int read() {
int x = 0, f = 1;
int c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = 0;
c = getchar();
}
while (isdigit(c)) {
x = (x * 10) + (c ^ 48);
c = getchar();
}
return f ? x : -x;
}
#define map MAP
const int maxn = 55, maxm = maxn << 1;
int vis[maxn], anc[maxn], map[maxn][maxn], anc1[maxn];
vector<int> G[maxn], F[maxn];
pair<int, int> E[maxn];
void dfs_same(int u, int fa, int fg) {
vis[u] = fg;
anc[u] = fa;
for (auto x : G[u]) {
if (x == fa)
continue;
if (map[u][x])
dfs_same(x, u, fg);
else
dfs_same(x, u, 0);
}
}
void dfs_same1(int u, int fa) {
anc1[u] = fa;
for (auto x : F[u]) {
if (x == fa)
continue;
if (map[u][x])
dfs_same1(x, u);
else
dfs_same1(x, u);
}
}
namespace tp {
int to[maxm], nxt[maxm], head[maxn], e, deg[maxn];
void add(int x, int y) {
to[++e] = y;
nxt[e] = head[x];
head[x] = e;
deg[y]++;
}
void init(int n) {
for (int i = 1; i <= n; ++i)
deg[i] = 0;
e = 0;
for (int i = 1; i <= n; ++i)
head[i] = 0;
}
int acp(int n) {
queue<int> Q;
for (int i = 1; i <= n; ++i)
if (!deg[i])
Q.push(i);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
--n;
for (int i = head[u]; i; i = nxt[i]) {
int v = to[i];
if ((--deg[v]) == 0)
Q.push(v);
}
}
return !n;
}
} // namespace tp
int main() {
int T = read();
while (T--) {
// init(); //map, G
int n = read();
for (int i = 1; i < n; ++i) {
int x = read(), y = read();
G[x].pb(y);
G[y].pb(x);
}
for (int i = 1; i < n; ++i) {
int x = read(), y = read();
map[x][y] = 1;
map[y][x] = 1;
E[i] = mp(x, y);
F[x].pb(y);
F[y].pb(x);
}
int ans = 0x3f3f3f3f;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
vis[j] = 0;
dfs_same(i, 0, 1);
dfs_same1(i, 0);
tp::init(n);
int tmp = n;
for (int j = 1; j <= n; ++j) {
tmp -= vis[j];
if (!vis[j] && !vis[anc[j]])
tp::add(j, anc[j]);
}
for (int j = 1; j < n; ++j) {
int x = E[j].x, y = E[j].y;
if (!vis[x] && !vis[y]) {
if (anc1[x] == y)
tp::add(y, x);
else
tp::add(x, y);
}
}
if (tp::acp(n))
ans = min(ans, tmp);
}
if (ans == 0x3f3f3f3f) {
for (int i = 1; i <= n; ++i)
if (G[i].size() == 1)
for (int j = 1; j <= n; ++j)
if (i != j) {
int fi = G[i][0];
if (fi == j)
continue;
for (int k = 0; k < G[fi].size(); ++k)
if (G[fi][k] == i) {
G[fi].erase(G[fi].begin() + k);
break;
}
G[i][0] = j;
G[j].pb(i);
for (int u = 1; u <= n; ++u)
vis[u] = 0;
/*
for(int u = 1; u <= n; ++u)
{
for(auto x : G[u]) cout << x << ' ';
cout << endl;
}*/
dfs_same(i, 0, 1);
dfs_same1(i, 0);
tp::init(n);
for (int u = 1; u <= n; ++u)
if (!vis[u] && !vis[anc[u]])
tp::add(u, anc[u]);
for (int u = 1; u < n; ++u) {
int x = E[u].x, y = E[u].y;
if (!vis[x] && !vis[y]) {
if (anc1[x] == y)
tp::add(y, x);
else
tp::add(x, y);
}
}
if (tp::acp(n)) {
ans = n;
goto nxt;
}
G[j].pop_back();
G[i][0] = fi;
G[fi].pb(i);
}
}
nxt:;
if (ans == 0x3f3f3f3f)
puts("-1");
else
cout << ans << endl;
for (int i = 1; i <= n; ++i)
G[i].clear(), F[i].clear();
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
map[i][j] = 0;
}
return 0;
} | replace | 219 | 220 | 219 | 220 | -11 | |
p03259 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Fail puts("NO"), exit(0);
#define eps 1e-10
#define maxn 55
#define maxm 100010
#define inf 1000000007
#define mod 1000000007
#define pi acos(-1)
#define mp(x, y) make_pair(x, y)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef bitset<maxn> bit;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch - '0' < 0 || ch - '0' > 9) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch - '0' >= 0 && ch - '0' <= 9) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int T;
int n;
int a[maxn][maxn], fa_a[maxn], fa_b[maxn], deg[maxn];
struct Graph {
int head[maxn], nxt[maxn * 2], to[maxn * 2], tot;
void add(int u, int v) {
tot++;
nxt[tot] = head[u];
head[u] = tot;
to[tot] = v;
}
void dfs(int x, int las, int *fa) {
for (int i = head[x]; i; i = nxt[i]) {
if (to[i] == las)
continue;
fa[to[i]] = x;
dfs(to[i], x, fa);
}
}
void init() {
memset(head, 0, sizeof(head));
tot = 0;
}
} A, B;
int book[maxn];
int degx[maxn];
int head[maxn], nxt[maxn], to[maxn], tot;
void add(int u, int v) {
tot++;
nxt[tot] = head[u];
head[u] = tot;
to[tot] = v;
}
queue<int> q;
bool check() {
for (int i = 1; i <= n; i++)
if (!degx[i] && book[i])
q.push(i);
while (q.size()) {
int now = q.front();
q.pop();
for (int i = head[now]; i; i = nxt[i]) {
degx[to[i]]--;
if (!degx[to[i]])
q.push(to[i]);
}
}
for (int i = 1; i <= n; i++)
if (book[i] && degx[i])
return false;
return true;
}
int solve(int rt, int x) {
memset(degx, 0, sizeof(degx));
tot = 0;
memset(head, 0, sizeof(head));
A.dfs(x, 0, fa_a);
fa_a[x] = rt;
fa_a[rt] = 0;
B.dfs(rt, 0, fa_b);
fa_b[rt] = 0;
int res = 0;
for (int i = 1; i <= n; i++)
book[i] = (fa_a[i] != fa_b[i]), res += book[i];
for (int i = 1; i <= n; i++) {
if (i == rt)
continue;
if (!book[i] && book[fa_a[i]])
return inf;
if (book[i] && book[fa_a[i]])
add(i, fa_a[i]), degx[fa_a[i]]++;
if (book[i] && book[fa_b[i]])
add(fa_b[i], i), degx[i]++;
}
if (check())
return res;
return inf;
}
int main() {
T = read();
while (T--) {
A.init();
B.init();
memset(a, 0, sizeof(a));
memset(deg, 0, sizeof(deg));
n = read();
int ans = inf;
for (int i = 1; i < n; i++) {
int x = read(), y = read();
A.add(x, y);
A.add(y, x);
deg[x]++;
deg[y]++;
a[x][y] = a[y][x] = 1;
}
for (int i = 1; i < n; i++) {
int x = read(), y = read();
B.add(x, y);
B.add(y, x);
}
for (int i = 1; i <= n; i++) {
if (deg[i] != 1)
continue;
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
ans = min(ans, solve(i, j) + (!a[i][j]));
}
}
if (ans == inf)
puts("-1");
else
printf("%d\n", ans);
}
return 0;
} | #include <bits/stdc++.h>
#define Fail puts("NO"), exit(0);
#define eps 1e-10
#define maxn 55
#define maxm 100010
#define inf 1000000007
#define mod 1000000007
#define pi acos(-1)
#define mp(x, y) make_pair(x, y)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef bitset<maxn> bit;
int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch - '0' < 0 || ch - '0' > 9) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch - '0' >= 0 && ch - '0' <= 9) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int T;
int n;
int a[maxn][maxn], fa_a[maxn], fa_b[maxn], deg[maxn];
struct Graph {
int head[maxn], nxt[maxn * 2], to[maxn * 2], tot;
void add(int u, int v) {
tot++;
nxt[tot] = head[u];
head[u] = tot;
to[tot] = v;
}
void dfs(int x, int las, int *fa) {
for (int i = head[x]; i; i = nxt[i]) {
if (to[i] == las)
continue;
fa[to[i]] = x;
dfs(to[i], x, fa);
}
}
void init() {
memset(head, 0, sizeof(head));
tot = 0;
}
} A, B;
int book[maxn];
int degx[maxn];
int head[maxn], nxt[maxn * 2], to[maxn * 2], tot;
void add(int u, int v) {
tot++;
nxt[tot] = head[u];
head[u] = tot;
to[tot] = v;
}
queue<int> q;
bool check() {
for (int i = 1; i <= n; i++)
if (!degx[i] && book[i])
q.push(i);
while (q.size()) {
int now = q.front();
q.pop();
for (int i = head[now]; i; i = nxt[i]) {
degx[to[i]]--;
if (!degx[to[i]])
q.push(to[i]);
}
}
for (int i = 1; i <= n; i++)
if (book[i] && degx[i])
return false;
return true;
}
int solve(int rt, int x) {
memset(degx, 0, sizeof(degx));
tot = 0;
memset(head, 0, sizeof(head));
A.dfs(x, 0, fa_a);
fa_a[x] = rt;
fa_a[rt] = 0;
B.dfs(rt, 0, fa_b);
fa_b[rt] = 0;
int res = 0;
for (int i = 1; i <= n; i++)
book[i] = (fa_a[i] != fa_b[i]), res += book[i];
for (int i = 1; i <= n; i++) {
if (i == rt)
continue;
if (!book[i] && book[fa_a[i]])
return inf;
if (book[i] && book[fa_a[i]])
add(i, fa_a[i]), degx[fa_a[i]]++;
if (book[i] && book[fa_b[i]])
add(fa_b[i], i), degx[i]++;
}
if (check())
return res;
return inf;
}
int main() {
T = read();
while (T--) {
A.init();
B.init();
memset(a, 0, sizeof(a));
memset(deg, 0, sizeof(deg));
n = read();
int ans = inf;
for (int i = 1; i < n; i++) {
int x = read(), y = read();
A.add(x, y);
A.add(y, x);
deg[x]++;
deg[y]++;
a[x][y] = a[y][x] = 1;
}
for (int i = 1; i < n; i++) {
int x = read(), y = read();
B.add(x, y);
B.add(y, x);
}
for (int i = 1; i <= n; i++) {
if (deg[i] != 1)
continue;
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
ans = min(ans, solve(i, j) + (!a[i][j]));
}
}
if (ans == inf)
puts("-1");
else
printf("%d\n", ans);
}
return 0;
} | replace | 57 | 58 | 57 | 58 | TLE | |
p03260 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
string w[100];
cin >> n >> w[100];
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (w[j] != w[i]) {
} else {
cout << "No" << endl;
return 0;
}
}
if (i > 0) {
if (w[i][0] == w[i - 1].size()) {
} else {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a % 2 == 1 && b % 2 == 1)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | replace | 4 | 24 | 4 | 10 | -6 | *** stack smashing detected ***: terminated
|
p03260 | Python | Runtime Error | a, b = map(int, input().slice())
if a == 2 or b == 2:
print("No")
else:
print("Yes")
| a, b = map(int, input().split())
if a == 2 or b == 2:
print("No")
else:
print("Yes")
| replace | 0 | 1 | 0 | 1 | AttributeError: 'str' object has no attribute 'slice' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03260/Python/s301271695.py", line 1, in <module>
a, b = map(int, input().slice())
AttributeError: 'str' object has no attribute 'slice'
|
p03260 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#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
ll a, b;
cin >> a >> b;
if (a % 2 == 0 || b % 2 == 0) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll a, b;
cin >> a >> b;
if (a % 2 == 0 || b % 2 == 0) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | replace | 9 | 15 | 9 | 10 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rp(i, N) for (ll i = 0; i < (ll)N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (b < former) {
former = b;
return true;
}
return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v) \
std::sort(v.begin(), v.end(), \
std::greater<decltype(v[0])>()) // 降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v>>
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\n"; };
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(30);
int n;
cin >> n;
vector<string> vs;
char ch;
bool ok = true;
rp(i, n) {
string w;
cin >> w;
vs.push_back(w);
if (i >= 1 && ch != w[0]) {
ok = false;
break;
}
reverse(all(w));
ch = w[0];
}
sort(all(vs));
rp(i, n - 1) {
if (vs[i] == vs[i + 1])
ok = false;
}
Yes(ok);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rp(i, N) for (ll i = 0; i < (ll)N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (b < former) {
former = b;
return true;
}
return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v) \
std::sort(v.begin(), v.end(), \
std::greater<decltype(v[0])>()) // 降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v>>
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\n"; };
template <class T> inline void Yes(T condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(30);
int n;
cin >> n;
vector<string> vs;
char ch;
bool ok = true;
rp(i, n) {
string w;
cin >> w;
vs.push_back(w);
if (i >= 1 && ch != w[0]) {
ok = false;
}
reverse(all(w));
ch = w[0];
}
sort(all(vs));
rp(i, n - 1) {
if (vs[i] == vs[i + 1])
ok = false;
}
Yes(ok);
return 0;
} | delete | 68 | 69 | 68 | 68 | 0 | |
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int saisho(string a) {
char c;
c = a.at(0);
return c;
}
int matubi(string a) {
char c;
int s;
s = a.size();
c = a.at(s - 1);
return c;
}
int main() {
int N;
cin >> N;
vector<string> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
bool decide = true;
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; i++) {
if (A.at(i) == A.at(j))
decide = false;
}
}
for (int i = 0; i < N - 1; i++) {
char c1 = matubi(A.at(i));
char c2 = saisho(A.at(i + 1));
if (c1 == c2) {
} else {
decide = false;
}
}
if (decide) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
int saisho(string a) {
char c;
c = a.at(0);
return c;
}
int matubi(string a) {
char c;
int s;
s = a.size();
c = a.at(s - 1);
return c;
}
int main() {
int N;
cin >> N;
vector<string> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
bool decide = true;
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; j++) {
if (A.at(i) == A.at(j))
decide = false;
}
}
for (int i = 0; i < N - 1; i++) {
char c1 = matubi(A.at(i));
char c2 = saisho(A.at(i + 1));
if (c1 == c2) {
} else {
decide = false;
}
}
if (decide) {
cout << "Yes";
} else {
cout << "No";
}
} | replace | 26 | 27 | 26 | 27 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03261 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> S(n);
for (int i = 0; i < n; i++) {
cin >> S.at(i);
}
bool flag = true;
// 末尾と次の語の頭文字を比較
for (int i = 0; i < n - 1; i++) {
if (S.at(i).at(S.size() - 1) == S.at(i + 1).at(0)) {
flag = true;
} else {
flag = false;
break;
}
}
// flag = trueの場合、言葉にダブりがないかを確認
if (flag) {
sort(S.begin(), S.end());
for (int i = 0; i < n - 1; i++) {
if (S.at(i) == S.at(i + 1)) {
flag = false;
break;
}
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> S(n);
for (int i = 0; i < n; i++) {
cin >> S.at(i);
}
bool flag = true;
// 末尾と次の語の頭文字を比較
for (int i = 0; i < n - 1; i++) {
if (S.at(i).at(S.at(i).size() - 1) == S.at(i + 1).at(0)) {
flag = true;
} else {
flag = false;
break;
}
}
// flag = trueの場合、言葉にダブりがないかを確認
if (flag) {
sort(S.begin(), S.end());
for (int i = 0; i < n - 1; i++) {
if (S.at(i) == S.at(i + 1)) {
flag = false;
break;
}
}
}
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (i == 0) {
//
} else if (s[i - 1].back() != s[i].front()) {
cout << "No" << endl;
return 0;
}
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
if (i == 0) {
//
}
if (s[i - 1] == s[i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (i == 0) {
//
} else if (s[i - 1].back() != s[i].front()) {
cout << "No" << endl;
return 0;
}
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
if (i == 0) {
//
} else if (s[i - 1] == s[i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | replace | 32 | 34 | 32 | 33 | 0 | |
p03261 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
string b[a];
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 1; i < a; i++) {
if (b[i - 1][b[i - 1].size() - 1] != b[i][0]) {
cout << "No" << endl;
return 0;
}
for (int j = 0; j < a; j++) {
if (b[i - 1] == b[i + j]) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
string b[a];
for (int i = 0; i < a; i++) {
cin >> b[i];
}
for (int i = 1; i < a; i++) {
if (b[i - 1][b[i - 1].size() - 1] != b[i][0]) {
cout << "No" << endl;
return 0;
}
for (int j = 0; j < a; j++) {
if (b[i] == b[j] && i != j) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
| replace | 18 | 19 | 18 | 19 | 0 |