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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define ll long long
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell 1000000007
#define PI 3.141592653589793
int main() {
fastio;
int testcases = 1;
// cin>>testcases;
while (testcases--) {
int n;
ll k;
cin >> n >> k;
vi towns(n + 1);
for (int i = 1; i <= n; i++)
cin >> towns[i];
vi visited;
int current = 1;
int used = 0;
while (!cpresent(visited, towns[current])) {
visited.pb(towns[current]);
current = towns[current];
++used;
if (used >= k)
break;
}
if (used < k) {
int pos;
for (int i = 0; i < sz(visited); i++) {
if (visited[i] == towns[current]) {
pos = i;
break;
}
}
int period = used - pos;
int rem = (k - used) % period;
if (rem == 0)
rem = period;
current = visited[pos + rem - 1];
}
cout << current;
cout << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define ll long long
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell 1000000007
#define PI 3.141592653589793
int main() {
fastio;
int testcases = 1;
// cin>>testcases;
while (testcases--) {
int n;
ll k;
cin >> n >> k;
vi towns(n + 1);
for (int i = 1; i <= n; i++)
cin >> towns[i];
vi visited;
int current = 1;
int used = 0;
while (used < n) {
visited.pb(towns[current]);
current = towns[current];
++used;
if (used >= k)
break;
}
if (used < k) {
int pos;
for (int i = 0; i < sz(visited); i++) {
if (visited[i] == towns[current]) {
pos = i;
break;
}
}
int period = used - pos;
int rem = (k - used) % period;
if (rem == 0)
rem = period;
current = visited[pos + rem - 1];
}
cout << current;
cout << "\n";
}
return 0;
}
| replace | 35 | 36 | 35 | 36 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> firstpath;
vector<long long> roop;
long long N;
long long K;
;
cin >> N >> K;
long long A[N], visited[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i]--;
visited[i] = 0;
}
long long now, roopstart;
now = A[0];
visited[0] = 1;
while (1) {
if (visited[now] > 0) {
roopstart = now;
break;
} else {
visited[now] = 1;
now = A[now];
}
}
now = 0;
while (1) {
if (now == roopstart) {
break;
} else {
firstpath.push_back(now);
now = A[now];
}
}
now = roopstart;
roop.push_back(roopstart);
while (1) {
now = A[now];
if (now == roopstart)
break;
else {
roop.push_back(now);
}
}
long long ans;
if (K <= firstpath.size()) {
ans = firstpath.at(K);
} else {
K -= firstpath.size();
K %= roop.size();
ans = roop.at(K);
}
cout << ans + 1;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> firstpath;
vector<long long> roop;
long long N;
long long K;
;
cin >> N >> K;
long long A[N], visited[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
A[i]--;
visited[i] = 0;
}
long long now, roopstart;
now = A[0];
visited[0] = 1;
while (1) {
if (visited[now] > 0) {
roopstart = now;
break;
} else {
visited[now] = 1;
now = A[now];
}
}
now = 0;
while (1) {
if (now == roopstart) {
break;
} else {
firstpath.push_back(now);
now = A[now];
}
}
now = roopstart;
roop.push_back(roopstart);
while (1) {
now = A[now];
if (now == roopstart)
break;
else {
roop.push_back(now);
}
}
long long ans;
if (K < firstpath.size()) {
ans = firstpath.at(K);
} else {
K -= firstpath.size();
K %= roop.size();
ans = roop.at(K);
}
cout << ans + 1;
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, deque<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
for (auto it : P) {
s << "<" << it << "> ";
}
return s << endl;
}
int main() {
int N;
long long K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i], --A[i];
deque<int> a; // 繰り返しの部分
vector<bool> seen(N, false); // 一度見たかどうか
int cur = 0;
while (true) {
// 一度通った頂点を見つけたときの処理
if (seen[cur]) {
while (a[0] != cur) {
// 最初の余計な数手分を除去する
--K;
a.pop_front();
// 繰り返す前に K が限界になったらリターン
if (K == 0)
return a[0] + 1;
}
break;
}
// 最初は愚直にシミュレーションしつつ、履歴をメモしていく
a.push_back(cur);
seen[cur] = true;
cur = A[cur];
}
cout << a[K % a.size()] + 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, deque<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
for (auto it : P) {
s << "<" << it << "> ";
}
return s << endl;
}
int main() {
int N;
long long K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; ++i)
cin >> A[i], --A[i];
deque<int> a; // 繰り返しの部分
vector<bool> seen(N, false); // 一度見たかどうか
int cur = 0;
while (true) {
// 一度通った頂点を見つけたときの処理
if (seen[cur]) {
while (a[0] != cur) {
// 最初の余計な数手分を除去する
--K;
a.pop_front();
// 繰り返す前に K が限界になったらリターン
if (K == 0) {
cout << a[0] + 1 << endl;
return 0;
}
}
break;
}
// 最初は愚直にシミュレーションしつつ、履歴をメモしていく
a.push_back(cur);
seen[cur] = true;
cur = A[cur];
}
cout << a[K % a.size()] + 1 << endl;
} | replace | 49 | 51 | 49 | 53 | 0 | |
p02684 | Python | Time Limit Exceeded | [n, k], [*a] = [[*map(int, t.split())] for t in open(0)]
ans = 1
for _ in range(k):
ans = a[ans - 1]
print(ans)
| [n, k], [*a] = [[*map(int, t.split())] for t in open(0)]
count = 0
visited = dict()
tmp = 1
while count < k:
visited[tmp] = count
count += 1
tmp = a[tmp - 1]
if tmp in visited:
break
if count < k:
k = (k - count) % (count - visited[tmp])
for _ in range(k):
tmp = a[tmp - 1]
print(tmp)
| replace | 1 | 5 | 1 | 15 | TLE | |
p02684 | Python | Runtime Error | N, K = map(int, input().split())
X = list(map(int, input().split()))
town = []
dic = {}
i = 0
j = 0
while i not in dic and j < K:
dic[i] = j
town.append(i)
i = X[i] - 1
j += 1
if j == K:
print(town[K] + 1)
else:
num = dic[i]
loop = j - num
print(town[((K - num) % loop) + num] + 1)
| N, K = map(int, input().split())
X = list(map(int, input().split()))
town = []
dic = {}
i = 0
j = 0
while i not in dic and j < K:
dic[i] = j
town.append(i)
i = X[i] - 1
j += 1
if j == K:
print(i + 1)
else:
num = dic[i]
loop = j - num
print(town[((K - num) % loop) + num] + 1)
| replace | 13 | 14 | 13 | 14 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
ll n, k;
cin >> n >> k; // nは街の個数,kは高橋王が移動する回数
vector<ll> a(n);
REP(i, n) {
ll temp;
cin >> temp;
a[i] = temp - 1; // i番目の村の転送先
}
// 3周分だけ周りroopを見つける
map<ll, ll>
roop_finder; // 通った回数をカウントする通った回数が一回であればroop外2回以上であればroopのメンバー
vector<ll> roop; // roop担っているものを順番に入れたもの.
vector<ll> road_to_roop; // roopに入るまでの順番を記録したもの
// ll jun_idx = 0, road_idx = 0; // jun_idx roopのメンバーのidx road_idx
// roopまでのインデックス
ll temp = 0;
REP(i, 2 * n) {
roop_finder[temp]++;
// if (roop_finder[temp] == 1) {
// road_to_roop.PB(temp);
// }
if (roop_finder[temp] == 2) {
roop.PB(temp);
}
temp = a[temp];
}
// cout << "roop finder ";
// REP(i,SIZE(roop_finder)) cout << roop_finder[i] << " ";
// cout << "\n";
// cout << "roop ";
// REP(i,SIZE(roop)) cout << roop[i] << " ";
// cout << "\n";
// roopに入るまでの数をカウントする.
ll road = 0;
// REP(i, SIZE(road_to_roop)) {
// if (road_to_roop[i] != roop[0]) road++;
// else break;
// }
REP(i, SIZE(roop_finder)) {
if (roop_finder[i] == 1)
road++;
}
// cout << road << "\n";
ll roop_num = SIZE(roop);
temp = k - road;
ll idx = temp % roop_num;
cout << roop[min(idx, temp)] + 1 << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
ll n, k;
cin >> n >> k; // nは街の個数,kは高橋王が移動する回数
vector<ll> a(n);
REP(i, n) {
ll temp;
cin >> temp;
a[i] = temp - 1; // i番目の村の転送先
}
// 3周分だけ周りroopを見つける
map<ll, ll>
roop_finder; // 通った回数をカウントする通った回数が一回であればroop外2回以上であればroopのメンバー
vector<ll> roop; // roop担っているものを順番に入れたもの.
vector<ll> road_to_roop; // roopに入るまでの順番を記録したもの
// ll jun_idx = 0, road_idx = 0; // jun_idx roopのメンバーのidx road_idx
// roopまでのインデックス
ll temp = 0;
REP(i, 2 * n) {
roop_finder[temp]++;
// if (roop_finder[temp] == 1) {
// road_to_roop.PB(temp);
// }
if (roop_finder[temp] == 2) {
roop.PB(temp);
}
temp = a[temp];
}
// cout << "roop finder ";
// REP(i,SIZE(roop_finder)) cout << roop_finder[i] << " ";
// cout << "\n";
// cout << "roop ";
// REP(i,SIZE(roop)) cout << roop[i] << " ";
// cout << "\n";
// roopに入るまでの数をカウントする.
ll road = 0;
// REP(i, SIZE(road_to_roop)) {
// if (road_to_roop[i] != roop[0]) road++;
// else break;
// }
REP(i, SIZE(roop_finder)) {
if (roop_finder[i] == 1)
road++;
}
// cout << road << "\n";
ll roop_num = SIZE(roop);
temp = k - road;
ll idx = temp % roop_num;
if (k < n) {
temp = 0;
REP(i, k) { temp = a[temp]; }
cout << temp + 1 << "\n";
} else
cout << roop[min(idx, temp)] + 1 << "\n";
return 0;
}
| replace | 74 | 75 | 74 | 80 | 0 | |
p02684 | Python | Runtime Error | n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
visited_city = {1: 0}
visited_city_inv = {0: 1}
now = 1
num = 0
while True:
next_city = arr[now - 1]
num += 1
if next_city not in visited_city:
visited_city[next_city] = num
visited_city_inv[num] = next_city
now = next_city
else:
break
if k < num:
ans = visited_city[k]
else:
x = visited_city[next_city]
period = num - x
ans = visited_city_inv[x + (k - x) % period]
print(ans)
# print(visited_city)
| n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
visited_city = {1: 0}
visited_city_inv = {0: 1}
now = 1
num = 0
while True:
next_city = arr[now - 1]
num += 1
if next_city not in visited_city:
visited_city[next_city] = num
visited_city_inv[num] = next_city
now = next_city
else:
break
if k < num:
ans = visited_city_inv[k]
else:
x = visited_city[next_city]
period = num - x
ans = visited_city_inv[x + (k - x) % period]
print(ans)
# print(visited_city)
| replace | 19 | 20 | 19 | 20 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define nl '\n'
#define AC \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
using namespace std;
const int M = 1e9 + 7;
const int N = 1e5;
int cur_pos[N + 5];
int tele[N + 5];
ll pred[N + 5];
int main() {
AC int n;
ll k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> tele[i];
tele[i]--;
}
memset(pred, -1, sizeof(pred));
cur_pos[0] = 0;
pred[0] = 0;
for (ll i = 1; i <= k; i++) {
cur_pos[i] = tele[cur_pos[i - 1]];
if (pred[cur_pos[i]] != -1) {
// city already visited
ll cycle_len = i - pred[cur_pos[i]];
ll last_steps = (k - i) % cycle_len;
ll last_pos = cur_pos[pred[cur_pos[i]] + last_steps];
cout << last_pos + 1 << endl;
return 0;
} else
pred[cur_pos[i]] = i;
}
cout << cur_pos[k] + 1 << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define ar array
#define nl '\n'
#define AC \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
using namespace std;
const int M = 1e9 + 7;
const int N = 2 * 1e5;
int cur_pos[N + 5];
int tele[N + 5];
ll pred[N + 5];
int main() {
AC int n;
ll k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> tele[i];
tele[i]--;
}
memset(pred, -1, sizeof(pred));
cur_pos[0] = 0;
pred[0] = 0;
for (ll i = 1; i <= k; i++) {
cur_pos[i] = tele[cur_pos[i - 1]];
if (pred[cur_pos[i]] != -1) {
// city already visited
ll cycle_len = i - pred[cur_pos[i]];
ll last_steps = (k - i) % cycle_len;
ll last_pos = cur_pos[pred[cur_pos[i]] + last_steps];
cout << last_pos + 1 << endl;
return 0;
} else
pred[cur_pos[i]] = i;
}
cout << cur_pos[k] + 1 << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> g;
bool seen[200001];
vector<int> go;
int dfs(int s) {
if (seen[s])
return s;
seen[s] = true;
go.push_back(s);
dfs(g[s]);
}
int main() {
int n;
ll k;
cin >> n >> k;
g.resize(n);
rep(i, n) {
int tmp;
cin >> tmp;
g[i] = (tmp - 1);
}
int loop;
loop = dfs(0);
int start;
int mod;
int len;
len = go.size();
for (int i = 0; i < len; i++) {
if (go[i] == loop)
start = i;
mod = len - start;
}
vector<int> to(mod);
for (int j = start; j < len; j++) {
to[j % mod] = go[j];
}
if (k < len)
cout << go[int(k)] + 1 << endl;
else {
k %= (ll)mod;
cout << to[int(k)] + 1 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> g;
bool seen[200001];
vector<int> go;
int dfs(int s) {
if (seen[s])
return s;
seen[s] = true;
go.push_back(s);
return dfs(g[s]);
}
int main() {
int n;
ll k;
cin >> n >> k;
g.resize(n);
rep(i, n) {
int tmp;
cin >> tmp;
g[i] = (tmp - 1);
}
int loop;
loop = dfs(0);
int start;
int mod;
int len;
len = go.size();
for (int i = 0; i < len; i++) {
if (go[i] == loop)
start = i;
mod = len - start;
}
vector<int> to(mod);
for (int j = start; j < len; j++) {
to[j % mod] = go[j];
}
if (k < len)
cout << go[int(k)] + 1 << endl;
else {
k %= (ll)mod;
cout << to[int(k)] + 1 << endl;
}
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02684 | C++ | Time Limit Exceeded | // https://codeforces.com/contest/1352/problem/C
// Author: BrownieTK
// #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//========================Debug======================================
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef local
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
//========================TypeDefs===================================
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
typedef pair<lli, lli> pll;
typedef pair<int, int> pii;
typedef pair<int, lli> pil;
//=========================MACROS====================================
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front()
#define si size()
#define be begin()
#define en end()
#define all(v) v.be, v.en
#define mp make_pair
#define mt make_tuple
#define acc(v) accumulate(all(v), 0)
#define F first
#define S second
#define forz(i, n) for (int i = 0; i < n; i++)
#define fore(i, m, n) for (int i = m; i <= n; i++)
#define rforz(i, n) for (int i = n - 1; i >= 0; i--)
#define rfore(i, m, n) for (int i = n; i >= m; i--)
#define deci(n) fixed << setprecision(n)
#define high(n) __builtin_popcount(n)
#define highll(n) __builtin_popcountll(n)
#define parity(n) __builtin_parity(n)
#define clz(n) __builtin_clz(n)
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define lb lower_bound
#define ub upper_bound
#define er equal_range
#define findnot find_first_not_of
#define maxe *max_element
#define mine *min_element
#define mod 1000000007
#define mod2 998244353
#define gcd __gcd
#define kira ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define osetlli \
tree<lli, null_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
#define ofk order_of_key
#define fbo find_by_order
// member functions :
// 1. order_of_key(k) : number of elements sbtriectly lesser than k
// 2. find_by_order(k) : k-th element in the set
//==============================FUNCTIONS===========================================
auto clk = clock();
mt19937_64
rang(chrono::high_resolution_clock::now().time_since_epoch().count());
void run_time() {
#ifdef local
cout << endl;
cout << "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return;
}
inline lli power(lli x, lli y, lli p = mod) {
lli res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
inline lli modadd(lli a, lli b, lli m = mod) {
a += b;
if (a >= m)
a -= m;
return a;
}
inline lli modmul(lli a, lli b, lli m = mod) { return ((a % m) * (b % m)) % m; }
inline lli modi(lli a, lli m = mod) { return power(a, m - 2, m); }
//================================CODE=============================================
const int N = 2e5 + 5;
vector<lli> color(N, 0), pred(N);
vector<lli> adj[N];
lli cycst, cycen;
int n, eu;
bool dfs(lli s) {
color[s] = 1;
for (auto u : adj[s]) {
if (color[u] == 0) {
pred[u] = s;
if (dfs(u))
return true;
} else if (color[u] == 1 && pred[s] != u) {
// FOR DIRECTED GRAPH REMOVE pred[s]!=u
cycen = s;
cycst = u;
return true;
}
}
color[s] = 2;
return false;
}
int findcyc() {
color.assign(n + 1, 0);
pred.assign(n + 1, -1);
cycst = -1;
for (int i = 1; i <= n; i++) {
if (color[i] == 0 && dfs(i))
break;
}
if (cycst == -1)
return -1;
vector<lli> path;
path.pb(cycst);
for (lli v = cycen; v != cycst; v = pred[v])
path.pb(v);
path.pb(cycst);
reverse(all(path));
return int(path.si) - 1;
}
int main() {
kira;
lli k;
cin >> n >> k;
forz(i, n) {
cin >> eu;
adj[i + 1].pb(eu);
}
int t = findcyc();
int i = 1;
while (1) {
if (k == 0)
break;
if (i == cycst) {
k %= t;
}
if (k > 0) {
i = adj[i][0];
k--;
}
}
p0(i);
run_time();
return 0;
} | // https://codeforces.com/contest/1352/problem/C
// Author: BrownieTK
// #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
//========================Debug======================================
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifdef local
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
//========================TypeDefs===================================
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
typedef pair<lli, lli> pll;
typedef pair<int, int> pii;
typedef pair<int, lli> pil;
//=========================MACROS====================================
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front()
#define si size()
#define be begin()
#define en end()
#define all(v) v.be, v.en
#define mp make_pair
#define mt make_tuple
#define acc(v) accumulate(all(v), 0)
#define F first
#define S second
#define forz(i, n) for (int i = 0; i < n; i++)
#define fore(i, m, n) for (int i = m; i <= n; i++)
#define rforz(i, n) for (int i = n - 1; i >= 0; i--)
#define rfore(i, m, n) for (int i = n; i >= m; i--)
#define deci(n) fixed << setprecision(n)
#define high(n) __builtin_popcount(n)
#define highll(n) __builtin_popcountll(n)
#define parity(n) __builtin_parity(n)
#define clz(n) __builtin_clz(n)
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define lb lower_bound
#define ub upper_bound
#define er equal_range
#define findnot find_first_not_of
#define maxe *max_element
#define mine *min_element
#define mod 1000000007
#define mod2 998244353
#define gcd __gcd
#define kira ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define osetlli \
tree<lli, null_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
#define ofk order_of_key
#define fbo find_by_order
// member functions :
// 1. order_of_key(k) : number of elements sbtriectly lesser than k
// 2. find_by_order(k) : k-th element in the set
//==============================FUNCTIONS===========================================
auto clk = clock();
mt19937_64
rang(chrono::high_resolution_clock::now().time_since_epoch().count());
void run_time() {
#ifdef local
cout << endl;
cout << "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return;
}
inline lli power(lli x, lli y, lli p = mod) {
lli res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
inline lli modadd(lli a, lli b, lli m = mod) {
a += b;
if (a >= m)
a -= m;
return a;
}
inline lli modmul(lli a, lli b, lli m = mod) { return ((a % m) * (b % m)) % m; }
inline lli modi(lli a, lli m = mod) { return power(a, m - 2, m); }
//================================CODE=============================================
const int N = 2e5 + 5;
vector<lli> color(N, 0), pred(N);
vector<lli> adj[N];
lli cycst, cycen;
int n, eu;
bool dfs(lli s) {
color[s] = 1;
for (auto u : adj[s]) {
if (color[u] == 0) {
pred[u] = s;
if (dfs(u))
return true;
} else if (color[u] == 1) {
// FOR DIRECTED GRAPH REMOVE pred[s]!=u
cycen = s;
cycst = u;
return true;
}
}
color[s] = 2;
return false;
}
int findcyc() {
color.assign(n + 1, 0);
pred.assign(n + 1, -1);
cycst = -1;
for (int i = 1; i <= n; i++) {
if (color[i] == 0 && dfs(i))
break;
}
if (cycst == -1)
return -1;
vector<lli> path;
path.pb(cycst);
for (lli v = cycen; v != cycst; v = pred[v])
path.pb(v);
path.pb(cycst);
reverse(all(path));
return int(path.si) - 1;
}
int main() {
kira;
lli k;
cin >> n >> k;
forz(i, n) {
cin >> eu;
adj[i + 1].pb(eu);
}
int t = findcyc();
int i = 1;
while (1) {
if (k == 0)
break;
if (i == cycst) {
k %= t;
}
if (k > 0) {
i = adj[i][0];
k--;
}
}
p0(i);
run_time();
return 0;
} | replace | 185 | 186 | 185 | 186 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> P;
typedef priority_queue<P, vector<P>, greater<P>> P_queue;
#define REP(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());
const ll MOD = 998244353;
const ll mod = 1000000007;
const ll INF = 1e15;
vec dx = {1, 0, -1, 0};
vec dy = {0, 1, 0, -1};
vec d;
ll memo[200010];
bool used[200010];
ll Loop;
ll Solve(ll x, ll K) {
// cout<<K<<' '<<memo[x]<<' '<<x<<endl;
if (K == 0)
return x;
if (!used[x]) {
memo[x] = K;
used[x] = true;
return Solve(d[x], K - 1);
}
if (K >= memo[x] - K) {
Loop = memo[x] - K;
return Solve(x, K % Loop);
}
return Solve(d[x], K - 1);
}
void init() {
rep(i, 200010) memo[i] = INF;
rep(i, 200010) used[i] = false;
return;
}
int main() {
init();
ll N, K;
cin >> N >> K;
rep(i, N) {
ll x;
cin >> x;
x--;
d.pb(x);
}
Solve(0, 300000);
// cout<<Loop<<endl;
init();
ll P = (N / Loop);
P++;
P *= Loop;
K %= Loop;
K += P;
cout << Solve(0, K) + 1 << endl;
} | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> P;
typedef priority_queue<P, vector<P>, greater<P>> P_queue;
#define REP(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define mp make_pair
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());
const ll MOD = 998244353;
const ll mod = 1000000007;
const ll INF = 1e15;
vec dx = {1, 0, -1, 0};
vec dy = {0, 1, 0, -1};
vec d;
ll memo[200010];
bool used[200010];
ll Loop;
ll Solve(ll x, ll K) {
// cout<<K<<' '<<memo[x]<<' '<<x<<endl;
if (K == 0)
return x;
if (!used[x]) {
memo[x] = K;
used[x] = true;
return Solve(d[x], K - 1);
}
if (K >= memo[x] - K) {
Loop = memo[x] - K;
return Solve(x, K % Loop);
}
return Solve(d[x], K - 1);
}
void init() {
rep(i, 200010) memo[i] = INF;
rep(i, 200010) used[i] = false;
return;
}
int main() {
init();
ll N, K;
cin >> N >> K;
rep(i, N) {
ll x;
cin >> x;
x--;
d.pb(x);
}
cout << Solve(0, K) + 1 << endl;
} | replace | 59 | 67 | 59 | 60 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, k, cur = 1, cnt = 1;
cin >> n >> k;
vector<long> a(n);
vector<bool> flag(n, true);
rep(i, n) cin >> a.at(i);
bool f = true;
do {
k--;
f &= flag.at(cur - 1);
flag.at(cur - 1) = false;
cur = a.at(cur - 1);
} while (k > 0 && f);
long temp = a.at(cur - 1);
while (temp != cur) {
cnt++;
temp = a.at(temp - 1);
}
k %= cnt;
rep(i, k) cur = a.at(cur - 1);
cout << cur << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long n, k, cur = 1, cnt = 1;
cin >> n >> k;
vector<long> a(n);
vector<bool> flag(n, true);
rep(i, n) cin >> a.at(i);
bool f = true;
do {
k--;
f &= flag.at(cur - 1);
flag.at(cur - 1) = false;
cur = a.at(cur - 1);
} while (k > 0 && f);
long temp = a.at(cur - 1);
while (k > 0 && temp != cur) {
cnt++;
temp = a.at(temp - 1);
}
k %= cnt;
rep(i, k) cur = a.at(cur - 1);
cout << cur << endl;
} | replace | 18 | 19 | 18 | 19 | TLE | |
p02684 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #pragma comment(linker, "/STACK:16777216")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("unswitch-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,abm,mmx,avx,avx2,popcnt,tune=native")
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ull unsigned long long
// #define double long double
#define int ll
// #define int ull
// #define int short
// #define int unsigned short
// #define int unsigned int
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define hash hash228
const int SZ = 12 + 4;
const double EPS = 1e-7;
const int mod = 1e9 + 7;
const int hashpow = 2;
const int inf = 2e9;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int n, k;
int a[SZ][61];
inline void read() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i][0];
--a[i][0];
}
}
int get(int k) {
int ans = 0;
int t = 0;
while (k) {
if (k & 1) {
ans = a[ans][t];
}
k >>= 1;
++t;
}
return ans;
}
inline void solve() {
for (int j = 1; j < 61; ++j) {
for (int i = 0; i < n; ++i) {
a[i][j] = a[a[i][j - 1]][j - 1];
}
}
cout << get(k) + 1 << "\n";
}
signed main() {
#ifdef __LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
// int t;
// cin >> t;
// for (int i = 0; i < t; ++i) {
read();
solve();
// }
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
// #pragma comment(linker, "/STACK:16777216")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("unswitch-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,abm,mmx,avx,avx2,popcnt,tune=native")
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ull unsigned long long
// #define double long double
#define int ll
// #define int ull
// #define int short
// #define int unsigned short
// #define int unsigned int
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define hash hash228
const int SZ = 2e5 + 4;
const double EPS = 1e-7;
const int mod = 1e9 + 7;
const int hashpow = 2;
const int inf = 2e9;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int n, k;
int a[SZ][61];
inline void read() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i][0];
--a[i][0];
}
}
int get(int k) {
int ans = 0;
int t = 0;
while (k) {
if (k & 1) {
ans = a[ans][t];
}
k >>= 1;
++t;
}
return ans;
}
inline void solve() {
for (int j = 1; j < 61; ++j) {
for (int i = 0; i < n; ++i) {
a[i][j] = a[a[i][j - 1]][j - 1];
}
}
cout << get(k) + 1 << "\n";
}
signed main() {
#ifdef __LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
// int t;
// cin >> t;
// for (int i = 0; i < t; ++i) {
read();
solve();
// }
return 0;
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02684 | C++ | Runtime Error | // D_Teleporter.cpp
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define ppi pair<ll, ll>
#define fi first
#define si second
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F(a, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define F1(a, n) \
for (int i = 1; i <= n; i++) { \
cin >> a[i]; \
}
#define P(a, n) \
for (int i = 0; i < n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define P1(a, n) \
for (int i = 1; i <= n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define NF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cin >> a[i][j]; \
} \
}
#define NF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cin >> a[i][j]; \
} \
}
#define PNF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define PNF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define AS 200005
#define mod 1000000007
int main() {
fastIO
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
vector<ll> Next(AS);
unordered_map<ll, ll> m;
m[0] = 0;
int ith = 1;
int current = 0;
int start, end;
for (int i = 0; i <= n; i++) {
Next[ith] = a[current];
if (m.count(Next[ith])) {
start = m[Next[ith]];
end = ith;
break;
}
else {
m[Next[ith]] = ith;
}
ith++;
current = a[current];
}
if (k < end) {
cout << Next[k] + 1 << endl;
}
else {
ll len = end - start;
k -= start;
k = k % len;
cout << Next[start + k] + 1 << endl;
}
return 0;
}
| // D_Teleporter.cpp
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define ppi pair<ll, ll>
#define fi first
#define si second
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F(a, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define F1(a, n) \
for (int i = 1; i <= n; i++) { \
cin >> a[i]; \
}
#define P(a, n) \
for (int i = 0; i < n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define P1(a, n) \
for (int i = 1; i <= n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define NF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cin >> a[i][j]; \
} \
}
#define NF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cin >> a[i][j]; \
} \
}
#define PNF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define PNF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define AS 200005
#define mod 1000000007
int main() {
fastIO
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
vector<ll> Next(AS);
unordered_map<ll, ll> m;
m[0] = 0;
int ith = 1;
int current = 0;
int start, end;
for (int i = 0; i <= n; i++) {
Next[ith] = a[current];
if (m.count(Next[ith])) {
start = m[Next[ith]];
end = ith;
break;
}
else {
m[Next[ith]] = ith;
}
ith++;
current = a[current];
}
if (k < end) {
cout << Next[k] + 1 << endl;
}
else {
ll len = end - start;
k -= start;
k = k % len;
cout << Next[start + k] + 1 << endl;
}
return 0;
}
| replace | 71 | 72 | 71 | 72 | -11 | |
p02684 | C++ | Runtime Error | // WeirdBugsButOkay
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
using namespace std;
const ll N = 100001;
ll a[N], vis[N];
ll ccs, pl;
vector<ll> seq;
void dfs(ll u, ll p = 0) {
vis[u] = vis[p] + 1;
seq.pb(u);
ll v = a[u];
if (!vis[v])
dfs(v, u);
else
ccs = vis[u] + 1 - vis[v];
}
void solve() {
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; i++)
cin >> a[i];
dfs(1);
pl = seq.size() - ccs;
// cout << pl << ccs << endl;
if (x < seq.size())
cout << seq[x] << endl;
else {
ll tot = x - pl;
tot %= ccs;
cout << seq[pl + tot] << endl;
}
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q = 1;
// cin >> q;
for (int i = 1; i <= q; i++) {
solve();
}
return 0;
} | // WeirdBugsButOkay
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
using namespace std;
const ll N = 200001;
ll a[N], vis[N];
ll ccs, pl;
vector<ll> seq;
void dfs(ll u, ll p = 0) {
vis[u] = vis[p] + 1;
seq.pb(u);
ll v = a[u];
if (!vis[v])
dfs(v, u);
else
ccs = vis[u] + 1 - vis[v];
}
void solve() {
ll n, x;
cin >> n >> x;
for (ll i = 1; i <= n; i++)
cin >> a[i];
dfs(1);
pl = seq.size() - ccs;
// cout << pl << ccs << endl;
if (x < seq.size())
cout << seq[x] << endl;
else {
ll tot = x - pl;
tot %= ccs;
cout << seq[pl + tot] << endl;
}
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q = 1;
// cin >> q;
for (int i = 1; i <= q; i++) {
solve();
}
return 0;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02684 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <stdlib.h> /* srand, rand */
#include <time.h> /* time */
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define reflex ios_base::sync_with_stdio(false)
#define nl '\n'
#define ioi exit(0);
#define PI 3.14159265
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
// const int mod = 1000000007;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int kx[] = {-1, 1, 2, 2, 1, -1, -2, -2};
const int ky[] = {2, 2, 1, -1, -2, -2, -1, 1};
struct node {
int x, y, z;
mutable int w;
node() { x = -1, y = -1, z = -1; }
bool operator<(const node &nod) const {
if (this->x == nod.x) {
if (this->y == nod.y) {
return this->z < nod.z;
}
return this->y < nod.y;
}
return this->x < nod.x;
}
};
int a[N];
bool vis[N];
int main() {
clr(vis, false);
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int id = 1;
while (!vis[id] && k > 0) {
vis[id] = true;
k--;
id = a[id];
//~ cout<<id<<"->";
}
if (k >= 0) {
ll cnt = 1;
int init = id;
id = a[id];
while (init != id) {
id = a[id];
cnt++;
}
k = k % cnt;
//~ cout<<"k:"<< k <<endl;
while (k) {
k--;
id = a[id];
}
}
cout << id << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <stdlib.h> /* srand, rand */
#include <time.h> /* time */
using namespace std;
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x)*1ll * (x))
#define all(x) x.begin(), x.end()
#define clr(a, v) memset(a, v, sizeof(a))
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define reflex ios_base::sync_with_stdio(false)
#define nl '\n'
#define ioi exit(0);
#define PI 3.14159265
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
// const int mod = 1000000007;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int kx[] = {-1, 1, 2, 2, 1, -1, -2, -2};
const int ky[] = {2, 2, 1, -1, -2, -2, -1, 1};
struct node {
int x, y, z;
mutable int w;
node() { x = -1, y = -1, z = -1; }
bool operator<(const node &nod) const {
if (this->x == nod.x) {
if (this->y == nod.y) {
return this->z < nod.z;
}
return this->y < nod.y;
}
return this->x < nod.x;
}
};
int a[N];
bool vis[N];
int main() {
clr(vis, false);
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int id = 1;
while (!vis[id] && k > 0) {
vis[id] = true;
k--;
id = a[id];
//~ cout<<id<<"->";
}
if (k > 0) {
ll cnt = 1;
int init = id;
id = a[id];
while (init != id) {
id = a[id];
cnt++;
}
k = k % cnt;
//~ cout<<"k:"<< k <<endl;
while (k) {
k--;
id = a[id];
}
}
cout << id << endl;
return 0;
}
| replace | 77 | 78 | 77 | 78 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
constexpr ll MOD = (1e9 + 7);
constexpr int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
constexpr int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll factorial(ll n, ll m = 2) {
// calculate n!
m = max(2LL, m);
ll rtn = 1;
for (ll i = m; i <= n; i++) {
rtn = (rtn * i) % MOD;
}
return rtn;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
a[i]--;
}
ll cnt = 0, per = 0, start_new = 0;
vector<ll> already;
already.push_back(0);
rep1(i, n - 1) {
int cur = a[cur];
bool flag = false;
cnt++;
rep(j, already.size()) {
if (cur == already[j]) {
start_new = cur;
per = i - j;
flag = true;
break;
}
}
already.push_back(cur);
if (flag)
break;
}
k -= cnt;
k %= per;
ll prev = start_new;
rep(i, k) prev = a[prev];
cout << prev + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
constexpr ll MOD = (1e9 + 7);
constexpr int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
constexpr int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll factorial(ll n, ll m = 2) {
// calculate n!
m = max(2LL, m);
ll rtn = 1;
for (ll i = m; i <= n; i++) {
rtn = (rtn * i) % MOD;
}
return rtn;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<vector<ll>> nxt(60, vector<ll>(n));
rep(i, n) cin >> nxt[0][i], nxt[0][i]--;
rep1(i, 59) rep(j, n) nxt[i][j] = nxt[i - 1][nxt[i - 1][j]];
rep(i, 60) if (k & (1ll << i)) ans = nxt[i][ans];
cout << ++ans << endl;
return 0;
} | replace | 68 | 97 | 68 | 74 | -11 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
void solve() {
ll n, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; ++i) {
/* code */
cin >> a[i];
}
vector<ll> s;
ll t = n + 1;
ll i = 1;
ll l = 0;
bool flag = true;
set<ll> r;
while (t--) {
if (r.find(i) != r.end()) {
auto it = find(s.begin(), s.end(), i);
if (k < (it - s.begin()))
;
{ cout << s[k] << endl; }
k -= (ll)(it - s.begin());
ll temp = s.end() - it;
flag = false;
ll y = (k % temp + temp) % temp;
cout << *(it + y) << endl;
break;
} else {
r.insert(i);
s.push_back(i);
i = a[i - 1];
}
}
}
int main() {
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
void solve() {
ll n, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; ++i) {
/* code */
cin >> a[i];
}
vector<ll> s;
ll t = n + 1;
ll i = 1;
ll l = 0;
bool flag = true;
set<ll> r;
while (t--) {
if (r.find(i) != r.end()) {
auto it = find(s.begin(), s.end(), i);
// cout<<it-s.begin()<<endl;
if (k < (ll)(it - s.begin())) {
cout << s[k] << endl;
break;
}
k -= (ll)(it - s.begin());
ll temp = s.end() - it;
flag = false;
ll y = (k % temp + temp) % temp;
cout << *(it + y) << endl;
break;
} else {
r.insert(i);
s.push_back(i);
i = a[i - 1];
}
}
}
int main() {
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
} | replace | 23 | 26 | 23 | 28 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'
using namespace std;
struct custom_hash {
static unsigned long long splitmix64(unsigned long long x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(unsigned long long x) const {
static const unsigned long long FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
mt19937
random_generator(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 3;
int n;
long long k;
int a[maxn];
void read() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
bool used[maxn];
void solve() {
vector<int> v;
int curr = 1;
while (!used[curr]) {
used[curr] = true;
v.push_back(curr);
curr = a[curr];
}
for (int i = 0; i < (int)v.size(); i++)
if (v[i] == curr) {
if (k < i)
cout << v[k] << endl;
else {
int r = k - i;
int l = (int)v.size() - i;
r %= l;
cout << v[i + r] << endl;
}
return;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
read();
solve();
}
| #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'
using namespace std;
struct custom_hash {
static unsigned long long splitmix64(unsigned long long x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(unsigned long long x) const {
static const unsigned long long FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
mt19937
random_generator(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 3;
int n;
long long k;
int a[maxn];
void read() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
bool used[maxn];
void solve() {
vector<int> v;
int curr = 1;
while (!used[curr]) {
used[curr] = true;
v.push_back(curr);
curr = a[curr];
}
for (int i = 0; i < (int)v.size(); i++)
if (v[i] == curr) {
if (k < i)
cout << v[k] << endl;
else {
long long r = k - i;
int l = (int)v.size() - i;
r %= l;
cout << v[i + r] << endl;
}
return;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
read();
solve();
}
| replace | 50 | 51 | 50 | 51 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define BOUND 27182818284
#define MAT 2
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
ll MOD = 1000000007;
const ll INF = (1ll << 60);
const int INFint = (1 << 30);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll findGCD(vector<ll> arr) {
ll result = arr[0];
for (auto a : arr) {
result = gcd(a, result);
}
return result;
}
template <typename T> T getlcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
// v.front() = -BOUND;
// v.back() = BOUND;
// struct edge{
// int cost, to;
//
// edge(int in_cost, int in_to){
// cost=in_cost;
// to=in_to;
// }
// bool operator<(const edge &a) const
// {
// return cost > a.cost;
// }
// };
ll euler_phi(ll n) {
ll ret = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret -= ret / i;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
ret -= ret / n;
return ret;
}
class Combination {
long long powmod(long long a, long long p) {
long long ans = 1LL;
long long mul = a;
while (p > 0) {
if ((p & 1) == 1) {
ans = (ans * mul) % mod;
}
mul = (mul * mul) % mod;
p >>= 1;
}
return ans;
}
public:
int N;
long long mod;
vector<long long> fact;
vector<long long> revfact;
Combination(int n, long long m) : N(n), mod(m), fact(n + 1), revfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
}
revfact[N] = powmod(fact[N], mod - 2);
for (int i = N - 1; i >= 0; i--) {
revfact[i] = revfact[i + 1] * (i + 1) % mod;
}
}
long long getCombination(int a, int b) {
if (a < 0 || b < 0)
return 0;
if (b > a)
return 0;
return (fact[a] * revfact[b]) % mod * revfact[a - b] % mod;
}
};
struct mint {
const int mod = 1000000007;
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct UnionFind {
int n, cnt;
vector<int> par, rank, sz;
UnionFind(int n) : n(n), cnt(n), par(n), rank(n), sz(n, 1) {
iota(par.begin(), par.end(), 0);
}
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return sz[find(x)]; }
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
sz[y] += sz[x];
} else {
par[y] = x;
sz[x] += sz[y];
if (rank[x] == rank[y]) {
rank[x]++;
}
}
cnt--;
}
};
const string Yes = "Yes";
const string YES = "YES";
const string No = "No";
const string NO = "NO";
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;
}
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
template <typename T> vector<T> DIVISOR(T n) {
vector<T> v;
for (T i = 1; i * i <= n; ++i) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
vector<ll> first_reached(N, 0LL);
rep(i, N) {
cin >> A[i];
A[i]--;
}
vector<bool> used(N, false);
vector<ll> path;
ll one_loop;
ll before_loop;
ll from;
ll to = 0;
for (ll i = 0LL; i <= 2 * N + 1; i++) {
from = to;
if (used[from]) {
// one loopで何回テレポートするか
one_loop = i - first_reached[from];
// loopに入るまでのテレポート回数
before_loop = first_reached[from];
path.push_back(from);
break;
} else {
used[from] = true;
first_reached[from] = i;
path.push_back(from);
}
to = A[from];
}
ll ans = (K - before_loop) % one_loop;
if (K <= before_loop) {
cout << path[before_loop + ans] + 1LL << endl;
} else {
cout << path[K] + 1LL << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define BOUND 27182818284
#define MAT 2
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
ll MOD = 1000000007;
const ll INF = (1ll << 60);
const int INFint = (1 << 30);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
template <class T> bool umax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool umin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// gcd
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll findGCD(vector<ll> arr) {
ll result = arr[0];
for (auto a : arr) {
result = gcd(a, result);
}
return result;
}
template <typename T> T getlcm(T m, T n) {
// 引数に0がある場合は0を返す
if ((0 == m) || (0 == n))
return 0;
return ((m / gcd(m, n)) * n); // lcm = m * n / gcd(m,n)
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
fill((T *)array, (T *)(array + N), val);
}
// v.front() = -BOUND;
// v.back() = BOUND;
// struct edge{
// int cost, to;
//
// edge(int in_cost, int in_to){
// cost=in_cost;
// to=in_to;
// }
// bool operator<(const edge &a) const
// {
// return cost > a.cost;
// }
// };
ll euler_phi(ll n) {
ll ret = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret -= ret / i;
while (n % i == 0)
n /= i;
}
}
if (n > 1)
ret -= ret / n;
return ret;
}
class Combination {
long long powmod(long long a, long long p) {
long long ans = 1LL;
long long mul = a;
while (p > 0) {
if ((p & 1) == 1) {
ans = (ans * mul) % mod;
}
mul = (mul * mul) % mod;
p >>= 1;
}
return ans;
}
public:
int N;
long long mod;
vector<long long> fact;
vector<long long> revfact;
Combination(int n, long long m) : N(n), mod(m), fact(n + 1), revfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= N; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= mod;
}
revfact[N] = powmod(fact[N], mod - 2);
for (int i = N - 1; i >= 0; i--) {
revfact[i] = revfact[i + 1] * (i + 1) % mod;
}
}
long long getCombination(int a, int b) {
if (a < 0 || b < 0)
return 0;
if (b > a)
return 0;
return (fact[a] * revfact[b]) % mod * revfact[a - b] % mod;
}
};
struct mint {
const int mod = 1000000007;
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct UnionFind {
int n, cnt;
vector<int> par, rank, sz;
UnionFind(int n) : n(n), cnt(n), par(n), rank(n), sz(n, 1) {
iota(par.begin(), par.end(), 0);
}
int find(int x) {
if (x == par[x])
return x;
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return sz[find(x)]; }
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
sz[y] += sz[x];
} else {
par[y] = x;
sz[x] += sz[y];
if (rank[x] == rank[y]) {
rank[x]++;
}
}
cnt--;
}
};
const string Yes = "Yes";
const string YES = "YES";
const string No = "No";
const string NO = "NO";
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;
}
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
template <typename T> vector<T> DIVISOR(T n) {
vector<T> v;
for (T i = 1; i * i <= n; ++i) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N);
vector<ll> first_reached(N, 0LL);
rep(i, N) {
cin >> A[i];
A[i]--;
}
vector<bool> used(N, false);
vector<ll> path;
ll one_loop;
ll before_loop;
ll from;
ll to = 0;
for (ll i = 0LL; i <= 2 * N + 1; i++) {
from = to;
if (used[from]) {
// one loopで何回テレポートするか
one_loop = i - first_reached[from];
// loopに入るまでのテレポート回数
before_loop = first_reached[from];
path.push_back(from);
break;
} else {
used[from] = true;
first_reached[from] = i;
path.push_back(from);
}
to = A[from];
}
ll ans = (K - before_loop) % one_loop;
if (K > before_loop) {
cout << path[before_loop + ans] + 1LL << endl;
} else {
cout << path[K] + 1LL << endl;
}
return 0;
}
| replace | 388 | 389 | 388 | 389 | 0 | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int pos = 1;
int key = 0;
vector<int> count(n + 1);
for (int i = 1; i <= k; i++) {
pos = a[pos];
count[pos]++;
if (count[pos] == 2) {
key = pos;
break;
}
}
int preCount = 0;
int keyCount = 0;
pos = 1;
vector<int> town;
for (int i = 1; i <= k; i++) {
pos = a[pos];
if (pos == key)
keyCount++;
if (keyCount == 0)
preCount++;
else if (keyCount == 1)
town.push_back(pos);
else if (keyCount == 2)
break;
}
int back = town[town.size() - 1];
town.pop_back();
town.insert(town.begin(), back);
cout << town[(k - preCount) % town.size()] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int pos = 1;
int key = 0;
vector<int> count(n + 1);
for (int i = 1; i <= k; i++) {
pos = a[pos];
count[pos]++;
if (count[pos] == 2) {
key = pos;
break;
}
}
int preCount = 0;
int keyCount = 0;
pos = 1;
vector<int> town;
for (int i = 1; i <= k; i++) {
pos = a[pos];
if (pos == key)
keyCount++;
if (keyCount == 0)
preCount++;
else if (keyCount == 1)
town.push_back(pos);
else if (keyCount == 2)
break;
}
if (0 <= k - preCount - 1)
cout << town[(k - preCount - 1) % town.size()] << endl;
else {
int pos = 1;
for (int i = 1; i <= k; i++)
pos = a[pos];
cout << pos << endl;
}
}
| replace | 39 | 43 | 39 | 47 | 0 | |
p02684 | Python | Time Limit Exceeded | def main():
import sys
n, k, *a = map(int, sys.stdin.read().split())
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while 1:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print(path[d])
break
path = path + [nx]
check[nx] = 1
nw = nx
if __name__ == "__main__":
main()
| def main():
import sys
n, k, *a = map(int, sys.stdin.read().split())
a = [0] + a
check = [0] * (n + 1)
check[1] = 1
i = 0
nw = 1
path = [1]
while 1:
nx = a[nw]
i += 1
if i == k:
print(nx)
break
if check[nx]:
j = path.index(nx)
d = j + (k - i) % (i - j)
print(path[d])
break
path.append(nx)
check[nx] = 1
nw = nx
if __name__ == "__main__":
main()
| replace | 22 | 23 | 22 | 23 | TLE | |
p02684 | Python | Runtime Error | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
R = [False] * (N + 1)
D = []
p = 1
while True:
if R[p]:
break
D.append(p)
R[p] = True
p = A[p - 1]
m = D.index(p)
c = len(D) - m
if K <= m:
print(D[K])
else:
print(D[m + K - m] % c)
if __name__ == "__main__":
main()
| #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
R = [False] * (N + 1)
D = []
p = 1
while True:
if R[p]:
break
D.append(p)
R[p] = True
p = A[p - 1]
m = D.index(p)
c = len(D) - m
if K <= m:
print(D[K])
else:
print(D[m + (K - m) % c])
if __name__ == "__main__":
main()
| replace | 26 | 27 | 26 | 27 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02684/Python/s669353976.py", line 31, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02684/Python/s669353976.py", line 27, in main
print(D[m + K - m] % c)
IndexError: list index out of range
|
p02684 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
class cycle_finder {
public:
vector<vector<int>> adj;
vector<int> visit_state;
vector<int> parent;
int cycle_start;
int cycle_end;
vector<vector<int>> cycle_list;
public:
cycle_finder(int vertex_count)
: adj(), visit_state(), parent(), cycle_start(-1), cycle_end(-1),
cycle_list() {
adj.assign(vertex_count, vector<int>());
visit_state.assign(vertex_count, 0);
parent.assign(vertex_count, -1);
}
public:
void process() {
for (int i = 0; i < (int)visit_state.size(); i++) {
if (visit_state[i] == 0 && inner_process(i)) {
vector<int> cycle;
for (int curr = cycle_end; curr != cycle_start; curr = parent[curr]) {
visit_state[curr] = 2;
cycle.push_back(curr);
}
visit_state[cycle_start] = 2;
cycle.push_back(cycle_start);
reverse(cycle.begin(), cycle.end());
cycle_list.push_back(cycle);
}
}
}
bool inner_process(int curr) {
visit_state[curr] = 1;
for (int next : adj[curr]) {
if (visit_state[next] == 0) {
parent[next] = curr;
if (inner_process(next))
return true;
} else if (visit_state[next] == 1) {
cycle_end = curr;
cycle_start = next;
return true;
}
}
visit_state[curr] = 2;
return false;
}
};
// cycle_finder cf(N);
// cf.adj[u - 1].push_back(v - 1);
// cf.process();
// int ret = cf.cycle_list.size();
const int threshold = 2e5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long N, K;
cin >> N >> K;
cycle_finder cf(N);
for (int i = 0; i < N; i++) {
int port;
cin >> port;
cf.adj[i].push_back(port - 1);
}
cf.process();
if (K <= threshold) {
int result = 0;
int curr = 0;
for (int i = 0; i < K; i++) {
result = cf.adj[curr][0];
curr = result;
}
cout << result + 1;
} else {
int cycle_start = cf.cycle_list[0][0];
int cycle_size = cf.cycle_list[0].size();
int before_cycle = 0;
for (int i = 0; i != cycle_start; i = cf.adj[i][0]) {
before_cycle++;
}
K -= before_cycle;
K %= cycle_size;
int result = cycle_start;
int curr = cycle_start;
for (int i = 0; i < K; i++) {
result = cf.adj[curr][0];
curr = result;
}
cout << result + 1;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
class cycle_finder {
public:
vector<vector<int>> adj;
vector<int> visit_state;
vector<int> parent;
int cycle_start;
int cycle_end;
vector<vector<int>> cycle_list;
public:
cycle_finder(int vertex_count)
: adj(), visit_state(), parent(), cycle_start(-1), cycle_end(-1),
cycle_list() {
adj.assign(vertex_count, vector<int>());
visit_state.assign(vertex_count, 0);
parent.assign(vertex_count, -1);
}
public:
void process() {
for (int i = 0; i < (int)visit_state.size(); i++) {
if (visit_state[i] == 0 && inner_process(i)) {
vector<int> cycle;
for (int curr = cycle_end; curr != cycle_start; curr = parent[curr]) {
visit_state[curr] = 2;
cycle.push_back(curr);
}
visit_state[cycle_start] = 2;
cycle.push_back(cycle_start);
reverse(cycle.begin(), cycle.end());
cycle_list.push_back(cycle);
break;
}
}
}
bool inner_process(int curr) {
visit_state[curr] = 1;
for (int next : adj[curr]) {
if (visit_state[next] == 0) {
parent[next] = curr;
if (inner_process(next))
return true;
} else if (visit_state[next] == 1) {
cycle_end = curr;
cycle_start = next;
return true;
}
}
visit_state[curr] = 2;
return false;
}
};
// cycle_finder cf(N);
// cf.adj[u - 1].push_back(v - 1);
// cf.process();
// int ret = cf.cycle_list.size();
const int threshold = 2e5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long N, K;
cin >> N >> K;
cycle_finder cf(N);
for (int i = 0; i < N; i++) {
int port;
cin >> port;
cf.adj[i].push_back(port - 1);
}
cf.process();
if (K <= threshold) {
int result = 0;
int curr = 0;
for (int i = 0; i < K; i++) {
result = cf.adj[curr][0];
curr = result;
}
cout << result + 1;
} else {
int cycle_start = cf.cycle_list[0][0];
int cycle_size = cf.cycle_list[0].size();
int before_cycle = 0;
for (int i = 0; i != cycle_start; i = cf.adj[i][0]) {
before_cycle++;
}
K -= before_cycle;
K %= cycle_size;
int result = cycle_start;
int curr = cycle_start;
for (int i = 0; i < K; i++) {
result = cf.adj[curr][0];
curr = result;
}
cout << result + 1;
}
return 0;
}
| insert | 49 | 49 | 49 | 51 | TLE | |
p02684 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++)
cin >> a[i];
vector<ll> s;
vector<ll> ord(n + 1, -1);
ll c = 1, l = 0;
ll v = 1;
while (ord[v] == -1) {
ord[v] = s.size();
s.emplace_back(v);
v = a[v - 1];
}
c = s.size() - ord[v];
l = ord[v];
if (k < l)
cout << s[k] << endl;
else {
k -= l;
k %= c;
cout << s[(k - l) % c + k] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
ll k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++)
cin >> a[i];
vector<ll> s;
vector<ll> ord(n + 1, -1);
ll c = 1, l = 0;
ll v = 1;
while (ord[v] == -1) {
ord[v] = s.size();
s.emplace_back(v);
v = a[v - 1];
}
c = s.size() - ord[v];
l = ord[v];
if (k < l)
cout << s[k] << endl;
else {
k -= l;
k %= c;
cout << s[l + k] << endl;
}
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02684 | Python | Runtime Error | N, K = map(int, input().split())
portals = [0] + list(map(int, input().split()))
visitTowns = list()
visitTimes = [0 for _ in range(N + 1)]
curTown = 1
timeBackTo = 0
curTime = 0
while True:
if visitTimes[curTown] > 0:
timeBackTo = visitTimes[curTown]
break
visitTowns.append(curTown)
visitTimes[curTown] = curTime
# teleport
curTown = portals[curTown]
curTime += 1
print(visitTowns, visitTimes[1:])
nonLoopCount = timeBackTo
loopSpan = len(visitTowns) - nonLoopCount
if K <= nonLoopCount:
print(visitTowns[K])
exit()
rem = (K - nonLoopCount) % loopSpan
print(visitTowns[nonLoopCount + rem])
| N, K = map(int, input().split())
portals = [0] + list(map(int, input().split()))
visitTowns = list()
visitTimes = [0 for _ in range(N + 1)]
curTown = 1
timeBackTo = 0
curTime = 0
while True:
if visitTimes[curTown] > 0:
timeBackTo = visitTimes[curTown]
break
visitTowns.append(curTown)
visitTimes[curTown] = curTime
# teleport
curTown = portals[curTown]
curTime += 1
nonLoopCount = timeBackTo
loopSpan = len(visitTowns) - nonLoopCount
if K <= nonLoopCount:
print(visitTowns[K])
exit()
rem = (K - nonLoopCount) % loopSpan
print(visitTowns[nonLoopCount + rem])
| delete | 22 | 23 | 22 | 22 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ================================================
typedef unsigned int uint;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<double, double>> vpdouble;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vpint> vvpint;
typedef vector<vpll> vvpll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<string>> vvstring;
typedef vector<vector<bool>> vvbool;
typedef vector<vector<vector<ll>>> vvvll;
const int c_YET = -1;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const ll MOD = 998244353; // 10^9 + 7
const ll MAX = 1e9;
const double PI = 3.14159265358979323846264338327950288;
//---------------------------------------------------------------
// オーバーフローチェック
//---------------------------------------------------------------
bool is_overflow(ll a, ll b) { return ((a * b) / b != a); }
//---------------------------------------------------------------
// 約数列挙
//---------------------------------------------------------------
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
//---------------------------------------------------------------
// N以下のすべての素数を列挙する(エラトステネスの篩)
//---------------------------------------------------------------
vbool searchSosuu(ll N) {
vbool sosuu; // ←これをグローバル変数にして１度だけ実行する
for (ll i = 0; i < N; i++) {
sosuu.emplace_back(true);
}
sosuu[0] = false;
sosuu[1] = false;
for (ll i = 2; i < N; i++) {
if (sosuu[i]) {
for (ll j = 2; i * j < N; j++) {
sosuu[i * j] = false;
}
}
}
return sosuu;
}
//---------------------------------------------------------------
// 素因数分解 O(√N)
//---------------------------------------------------------------
vpll div_prime(ll n) {
vpll prime_factor;
for (ll i = 2; i * i <= n; i++) {
ll count = 0;
while (n % i == 0) {
count++;
n /= i;
}
if (count) {
pair<ll, ll> temp = {i, count};
prime_factor.emplace_back(temp);
}
}
if (n != 1) {
pair<ll, ll> temp = {n, 1};
prime_factor.emplace_back(temp);
}
return prime_factor;
}
//---------------------------------------------------------------
// 素数判定
//---------------------------------------------------------------
bool is_sosuu(ll N) {
if (N < 2) {
return false;
} else if (N == 2) {
return true;
} else if (N % 2 == 0) {
return false;
}
for (ll i = 3; i <= sqrt(N); i += 2) {
if (N % i == 0) {
return false;
}
}
return true;
}
//---------------------------------------------------------------
// 最大公約数（ユークリッドの互除法）
//---------------------------------------------------------------
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
//---------------------------------------------------------------
// 最小公倍数
//---------------------------------------------------------------
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp * (a / temp) * (b / temp);
}
//---------------------------------------------------------------
// 階乗
//---------------------------------------------------------------
ll factorial(ll n) {
if (n <= 1) {
return 1;
}
return (n * (factorial(n - 1))) % MOD;
}
//---------------------------------------------------------------
// 高速コンビネーション計算(前処理:O(N) 計算:O(1))
//---------------------------------------------------------------
// テーブルを作る前処理
ll comb_const = 200005;
vll fac(comb_const), finv(comb_const), inv(comb_const);
bool COMineted = false;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < comb_const; 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;
}
COMineted = true;
}
// 二項係数計算
ll COM(ll n, ll k) {
if (COMineted == false)
COMinit();
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//---------------------------------------------------------------
// 繰り返し２乗法 base^sisuu
//---------------------------------------------------------------
ll RepeatSquaring(ll base, ll sisuu) {
if (sisuu < 0) {
cout << "RepeatSquaring: 指数が負です!" << endl;
return 0;
}
if (sisuu == 0)
return 1;
if (sisuu % 2 == 0) {
ll t = RepeatSquaring(base, sisuu / 2) % MOD;
return (t * t) % MOD;
}
return base * RepeatSquaring(base, sisuu - 1) % MOD;
}
//---------------------------------------------------------------
// 高速単発コンビネーション計算(O(logN))
//---------------------------------------------------------------
ll fast_com(ll a, ll b) {
ll bunshi = 1;
ll bunbo = 1;
for (ll i = 1; i <= b; i++) {
bunbo *= i;
bunbo %= MOD;
bunshi *= (a - i + 1);
bunshi %= MOD;
}
ll ret = bunshi * RepeatSquaring(bunbo, MOD - 2);
ret %= MOD;
while (ret < 0) {
ret += MOD;
}
return ret;
}
//---------------------------------------------------------------
// 2直線の交差判定(直線(x1, y1)->(x2, y2) と 直線(X1, Y1)->(X2, Y2))
//---------------------------------------------------------------
bool is_cross(ll x1, ll y1, ll x2, ll y2, ll X1, ll Y1, ll X2, ll Y2) {
ll dx_ai = X1 - x1;
ll dy_ai = Y1 - y1;
ll dx_bi = X1 - x2;
ll dy_bi = Y1 - y2;
ll dx_ai2 = X2 - x1;
ll dy_ai2 = Y2 - y1;
ll dx_bi2 = X2 - x2;
ll dy_bi2 = Y2 - y2;
ll si = dx_ai * dy_bi - dy_ai * dx_bi;
ll si2 = dx_ai2 * dy_bi2 - dy_ai2 * dx_bi2;
ll si3 = dx_ai * dy_ai2 - dy_ai * dx_ai2;
ll si4 = dx_bi * dy_bi2 - dy_bi * dx_bi2;
return (si * si2 < 0 && si3 * si4 < 0);
}
//---------------------------------------------------------------
// 最長増加部分列の長さ(O(NlogN))
//---------------------------------------------------------------
ll LSI(vll vec, ll size) {
vll lsi(size + 1); // 長さjを作った時の右端の最小値
for (ll i = 0; i <= size; i++) {
lsi[i] = LLINF;
}
lsi[0] = 0;
lsi[1] = vec[0];
for (ll i = 1; i < size; i++) {
// 初めてvec[i]の方が小さくなるところを探す
auto Iter = lower_bound(lsi.begin(), lsi.end(), vec[i]);
ll idx = Iter - lsi.begin();
if (idx > 0 && lsi[idx - 1] < vec[i]) // 条件文の前半怪しい
{
lsi[idx] = vec[i];
}
}
for (ll i = size; i >= 0; i--) {
if (lsi[i] < LLINF) {
return i;
}
}
}
//---------------------------------------------------------------
// 木の根からの深さ
//---------------------------------------------------------------
vll tree_depth(vvll edge, ll start_node, ll n_node) {
vll dist(n_node, LLINF);
dist[start_node] = 0;
stack<pll> S;
S.push({start_node, 0});
while (!S.empty()) {
ll node = S.top().first;
ll d = S.top().second;
dist[node] = d;
S.pop();
for (int i = 0; i < edge[node].size(); i++) {
if (dist[edge[node][i]] == LLINF) {
S.push({edge[node][i], d + 1});
}
}
}
return dist;
}
//---------------------------------------------------------------
// ワーシャルフロイド法(O(N^3)) 任意の2点間の最短距離
//---------------------------------------------------------------
vvll warshall_floyd(ll n, vvll d) {
for (int k = 0; k < n; k++) { // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
return d;
}
//---------------------------------------------------------------
// Union Find
//---------------------------------------------------------------
/*
UnionFind uf(要素の個数);
for(int i = 0;i < 関係の個数; i++)
{
uf.merge(A[i], B[i]);
}
nを含む集合の大きさ = uf.size(n)
nを含む集合の代表者 = uf.root(n)
集合の個数 = uf.n_group
*/
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
ll n_group; // 集合の数
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
n_group = sz_;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
n_group--;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
//========================================================================
int main() {
////==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
////==================================
ll N, M, K;
cin >> N >> M >> K;
vll pow_M_1 = {1};
for (int i = 0; i < N + 100; i++) {
pow_M_1.emplace_back(pow_M_1[i] * (M - 1));
pow_M_1[i + 1] %= MOD;
}
ll ans = 0;
for (int i = 0; i <= K; i++) {
ll local = fast_com(N - 1, i);
local *= M;
local %= MOD;
local *= pow_M_1[N - i - 1];
local %= MOD;
ans += local;
ans %= MOD;
}
cout << ans;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ================================================
typedef unsigned int uint;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<bool> vbool;
typedef vector<string> vstring;
typedef vector<pair<int, int>> vpint;
typedef vector<pair<ll, ll>> vpll;
typedef vector<pair<double, double>> vpdouble;
typedef vector<vector<int>> vvint;
typedef vector<vector<ll>> vvll;
typedef vector<vpint> vvpint;
typedef vector<vpll> vvpll;
typedef vector<vector<double>> vvdouble;
typedef vector<vector<string>> vvstring;
typedef vector<vector<bool>> vvbool;
typedef vector<vector<vector<ll>>> vvvll;
const int c_YET = -1;
const int INF = 1e9 + 1;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const ll MOD = 998244353; // 10^9 + 7
const ll MAX = 1e9;
const double PI = 3.14159265358979323846264338327950288;
//---------------------------------------------------------------
// オーバーフローチェック
//---------------------------------------------------------------
bool is_overflow(ll a, ll b) { return ((a * b) / b != a); }
//---------------------------------------------------------------
// 約数列挙
//---------------------------------------------------------------
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(begin(ret), end(ret));
return (ret);
}
//---------------------------------------------------------------
// N以下のすべての素数を列挙する(エラトステネスの篩)
//---------------------------------------------------------------
vbool searchSosuu(ll N) {
vbool sosuu; // ←これをグローバル変数にして１度だけ実行する
for (ll i = 0; i < N; i++) {
sosuu.emplace_back(true);
}
sosuu[0] = false;
sosuu[1] = false;
for (ll i = 2; i < N; i++) {
if (sosuu[i]) {
for (ll j = 2; i * j < N; j++) {
sosuu[i * j] = false;
}
}
}
return sosuu;
}
//---------------------------------------------------------------
// 素因数分解 O(√N)
//---------------------------------------------------------------
vpll div_prime(ll n) {
vpll prime_factor;
for (ll i = 2; i * i <= n; i++) {
ll count = 0;
while (n % i == 0) {
count++;
n /= i;
}
if (count) {
pair<ll, ll> temp = {i, count};
prime_factor.emplace_back(temp);
}
}
if (n != 1) {
pair<ll, ll> temp = {n, 1};
prime_factor.emplace_back(temp);
}
return prime_factor;
}
//---------------------------------------------------------------
// 素数判定
//---------------------------------------------------------------
bool is_sosuu(ll N) {
if (N < 2) {
return false;
} else if (N == 2) {
return true;
} else if (N % 2 == 0) {
return false;
}
for (ll i = 3; i <= sqrt(N); i += 2) {
if (N % i == 0) {
return false;
}
}
return true;
}
//---------------------------------------------------------------
// 最大公約数（ユークリッドの互除法）
//---------------------------------------------------------------
ll gcd(ll a, ll b) {
if (a < b) {
ll tmp = a;
a = b;
b = tmp;
}
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
//---------------------------------------------------------------
// 最小公倍数
//---------------------------------------------------------------
ll lcm(ll a, ll b) {
ll temp = gcd(a, b);
return temp * (a / temp) * (b / temp);
}
//---------------------------------------------------------------
// 階乗
//---------------------------------------------------------------
ll factorial(ll n) {
if (n <= 1) {
return 1;
}
return (n * (factorial(n - 1))) % MOD;
}
//---------------------------------------------------------------
// 高速コンビネーション計算(前処理:O(N) 計算:O(1))
//---------------------------------------------------------------
// テーブルを作る前処理
ll comb_const = 200005;
vll fac(comb_const), finv(comb_const), inv(comb_const);
bool COMineted = false;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < comb_const; 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;
}
COMineted = true;
}
// 二項係数計算
ll COM(ll n, ll k) {
if (COMineted == false)
COMinit();
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//---------------------------------------------------------------
// 繰り返し２乗法 base^sisuu
//---------------------------------------------------------------
ll RepeatSquaring(ll base, ll sisuu) {
if (sisuu < 0) {
cout << "RepeatSquaring: 指数が負です!" << endl;
return 0;
}
if (sisuu == 0)
return 1;
if (sisuu % 2 == 0) {
ll t = RepeatSquaring(base, sisuu / 2) % MOD;
return (t * t) % MOD;
}
return base * RepeatSquaring(base, sisuu - 1) % MOD;
}
//---------------------------------------------------------------
// 高速単発コンビネーション計算(O(logN))
//---------------------------------------------------------------
ll fast_com(ll a, ll b) {
ll bunshi = 1;
ll bunbo = 1;
for (ll i = 1; i <= b; i++) {
bunbo *= i;
bunbo %= MOD;
bunshi *= (a - i + 1);
bunshi %= MOD;
}
ll ret = bunshi * RepeatSquaring(bunbo, MOD - 2);
ret %= MOD;
while (ret < 0) {
ret += MOD;
}
return ret;
}
//---------------------------------------------------------------
// 2直線の交差判定(直線(x1, y1)->(x2, y2) と 直線(X1, Y1)->(X2, Y2))
//---------------------------------------------------------------
bool is_cross(ll x1, ll y1, ll x2, ll y2, ll X1, ll Y1, ll X2, ll Y2) {
ll dx_ai = X1 - x1;
ll dy_ai = Y1 - y1;
ll dx_bi = X1 - x2;
ll dy_bi = Y1 - y2;
ll dx_ai2 = X2 - x1;
ll dy_ai2 = Y2 - y1;
ll dx_bi2 = X2 - x2;
ll dy_bi2 = Y2 - y2;
ll si = dx_ai * dy_bi - dy_ai * dx_bi;
ll si2 = dx_ai2 * dy_bi2 - dy_ai2 * dx_bi2;
ll si3 = dx_ai * dy_ai2 - dy_ai * dx_ai2;
ll si4 = dx_bi * dy_bi2 - dy_bi * dx_bi2;
return (si * si2 < 0 && si3 * si4 < 0);
}
//---------------------------------------------------------------
// 最長増加部分列の長さ(O(NlogN))
//---------------------------------------------------------------
ll LSI(vll vec, ll size) {
vll lsi(size + 1); // 長さjを作った時の右端の最小値
for (ll i = 0; i <= size; i++) {
lsi[i] = LLINF;
}
lsi[0] = 0;
lsi[1] = vec[0];
for (ll i = 1; i < size; i++) {
// 初めてvec[i]の方が小さくなるところを探す
auto Iter = lower_bound(lsi.begin(), lsi.end(), vec[i]);
ll idx = Iter - lsi.begin();
if (idx > 0 && lsi[idx - 1] < vec[i]) // 条件文の前半怪しい
{
lsi[idx] = vec[i];
}
}
for (ll i = size; i >= 0; i--) {
if (lsi[i] < LLINF) {
return i;
}
}
}
//---------------------------------------------------------------
// 木の根からの深さ
//---------------------------------------------------------------
vll tree_depth(vvll edge, ll start_node, ll n_node) {
vll dist(n_node, LLINF);
dist[start_node] = 0;
stack<pll> S;
S.push({start_node, 0});
while (!S.empty()) {
ll node = S.top().first;
ll d = S.top().second;
dist[node] = d;
S.pop();
for (int i = 0; i < edge[node].size(); i++) {
if (dist[edge[node][i]] == LLINF) {
S.push({edge[node][i], d + 1});
}
}
}
return dist;
}
//---------------------------------------------------------------
// ワーシャルフロイド法(O(N^3)) 任意の2点間の最短距離
//---------------------------------------------------------------
vvll warshall_floyd(ll n, vvll d) {
for (int k = 0; k < n; k++) { // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
return d;
}
//---------------------------------------------------------------
// Union Find
//---------------------------------------------------------------
/*
UnionFind uf(要素の個数);
for(int i = 0;i < 関係の個数; i++)
{
uf.merge(A[i], B[i]);
}
nを含む集合の大きさ = uf.size(n)
nを含む集合の代表者 = uf.root(n)
集合の個数 = uf.n_group
*/
class UnionFind {
public:
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
ll n_group; // 集合の数
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
n_group = sz_;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL); // resize だとなぜか初期化されなかった
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
n_group--;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(x)];
}
};
//========================================================================
int main() {
////==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
////==================================
ll N, M, K;
cin >> N >> M >> K;
vll pow_M_1 = {1};
for (int i = 0; i < N + 100; i++) {
pow_M_1.emplace_back(pow_M_1[i] * (M - 1));
pow_M_1[i + 1] %= MOD;
}
ll ans = 0;
for (int i = 0; i <= K; i++) {
ll local = COM(N - 1, i);
local *= M;
local %= MOD;
local *= pow_M_1[N - i - 1];
local %= MOD;
ans += local;
ans %= MOD;
}
cout << ans;
}
| replace | 437 | 438 | 437 | 438 | TLE | |
p02685 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int mod = 998244353;
const int MAX = 100005;
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 mod_comb(int n, int k, int mod) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long mod_pow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
COMinit();
int N, M, K;
cin >> N >> M >> K;
long long ans = 0;
for (int k = 0; k <= K; k++) {
long long add_v = 0;
add_v = (M * mod_pow(M - 1, N - k - 1, mod)) % mod;
add_v = (add_v * mod_comb(N - 1, k, mod)) % mod;
ans = (ans + add_v) % mod;
}
if (ans < 0) {
ans += mod;
}
cout << ans << "\n";
return 0;
} | #include <iostream>
using namespace std;
const int mod = 998244353;
const int MAX = 200005;
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 mod_comb(int n, int k, int mod) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long mod_pow(long long x, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
COMinit();
int N, M, K;
cin >> N >> M >> K;
long long ans = 0;
for (int k = 0; k <= K; k++) {
long long add_v = 0;
add_v = (M * mod_pow(M - 1, N - k - 1, mod)) % mod;
add_v = (add_v * mod_comb(N - 1, k, mod)) % mod;
ans = (ans + add_v) % mod;
}
if (ans < 0) {
ans += mod;
}
cout << ans << "\n";
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INX(x) (cin >> x)
#define OUTX(x) (cout << x << endl)
#define ADD emplace_back
#define MP make_pair
#define BASEP 998244353
ll powmod(ll x, ll pow, ll mod) {
ll result = 1;
while (pow > 0) {
if (pow & 1) {
result *= x;
result %= mod;
}
x *= x;
x %= mod;
pow >>= 1;
}
return result;
}
int main() {
ll N, M, K;
cin >> N >> M >> K;
ll Ndash = N - 1;
ll Mdash = M - 1;
// 累乗を求めておく
vector<ll> vpow(Ndash + 1);
vpow[0] = 1;
for (ll i = 0; i < Ndash; i++) {
vpow[i + 1] = (vpow[i] * Mdash) % BASEP;
}
// 階乗を求めておく
vector<ll> vfact(Ndash + 1);
vfact[0] = 1;
for (ll i = 0; i <= Ndash;) {
ll back = vfact[i];
i++;
vfact[i] = (back * i) % BASEP;
}
// 階乗の逆元を求めておく
vector<ll> vinv(Ndash + 1);
for (ll i = 0; i <= Ndash; i++) {
vinv[i] = powmod(vfact[i], BASEP - 2, BASEP);
}
// 組み合わせnCkを求めておく
vector<ll> vnck(Ndash + 1);
vnck[0] = vnck[Ndash] = 1;
for (ll i = 1; i <= Ndash / 2; i++) {
ll result = (vfact[Ndash] * vinv[i]) % BASEP;
result = (result * vinv[Ndash - i]) % BASEP;
vnck[i] = vnck[Ndash - i] = result;
}
// 目的の数式を計算する
ll result = 0;
for (ll i = 0; i <= K; i++) {
result += (vnck[i] * vpow[Ndash - i]) % BASEP;
result %= BASEP;
}
result *= M;
result %= BASEP;
OUTX(result);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INX(x) (cin >> x)
#define OUTX(x) (cout << x << endl)
#define ADD emplace_back
#define MP make_pair
#define BASEP 998244353
ll powmod(ll x, ll pow, ll mod) {
ll result = 1;
while (pow > 0) {
if (pow & 1) {
result *= x;
result %= mod;
}
x *= x;
x %= mod;
pow >>= 1;
}
return result;
}
int main() {
ll N, M, K;
cin >> N >> M >> K;
ll Ndash = N - 1;
ll Mdash = M - 1;
// 累乗を求めておく
vector<ll> vpow(Ndash + 1);
vpow[0] = 1;
for (ll i = 0; i < Ndash; i++) {
vpow[i + 1] = (vpow[i] * Mdash) % BASEP;
}
// 階乗を求めておく
// vector<ll> vfact(Ndash + 1);
// //ここvectorだとなぜかデストラクタ？で例外が起きる
ll vfact[Ndash + 1];
vfact[0] = 1;
for (ll i = 0; i <= Ndash;) {
ll back = vfact[i];
i++;
vfact[i] = (back * i) % BASEP;
}
// 階乗の逆元を求めておく
vector<ll> vinv(Ndash + 1);
for (ll i = 0; i <= Ndash; i++) {
vinv[i] = powmod(vfact[i], BASEP - 2, BASEP);
}
// 組み合わせnCkを求めておく
vector<ll> vnck(Ndash + 1);
vnck[0] = vnck[Ndash] = 1;
for (ll i = 1; i <= Ndash / 2; i++) {
ll result = (vfact[Ndash] * vinv[i]) % BASEP;
result = (result * vinv[Ndash - i]) % BASEP;
vnck[i] = vnck[Ndash - i] = result;
}
// 目的の数式を計算する
ll result = 0;
for (ll i = 0; i <= K; i++) {
result += (vnck[i] * vpow[Ndash - i]) % BASEP;
result %= BASEP;
}
result *= M;
result %= BASEP;
OUTX(result);
return 0;
}
| replace | 43 | 44 | 43 | 46 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 998244353;
static const int MAX = 100000;
ll 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;
}
}
ll 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;
}
ll ModPow(ll a, ll cur = MOD - 2) {
ll r = 1;
while (cur)
r = r * ((cur % 2) ? a : 1) % MOD, a = a * a % MOD, cur >>= 1;
return r;
}
int main() {
ll N, M, K;
cin >> N >> M >> K;
/*
先頭の選び方がM
iが[0,K]で、
先頭と同じ色のブロックの選び方はcomb(N-1,i)
残りのブロックの色の選び方はM^(N-1-i);
*/
ll ans = 0;
COMinit();
for (int i = 0; i <= K; i++) {
ans += M * COM(N - 1, i) % MOD * ModPow(M - 1, N - 1 - i) % MOD;
}
cout << ans % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 998244353;
static const int MAX = 500000 + 100;
ll 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;
}
}
ll 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;
}
ll ModPow(ll a, ll cur = MOD - 2) {
ll r = 1;
while (cur)
r = r * ((cur % 2) ? a : 1) % MOD, a = a * a % MOD, cur >>= 1;
return r;
}
int main() {
ll N, M, K;
cin >> N >> M >> K;
/*
先頭の選び方がM
iが[0,K]で、
先頭と同じ色のブロックの選び方はcomb(N-1,i)
残りのブロックの色の選び方はM^(N-1-i);
*/
ll ans = 0;
COMinit();
for (int i = 0; i <= K; i++) {
ans += M * COM(N - 1, i) % MOD * ModPow(M - 1, N - 1 - i) % MOD;
}
cout << ans % MOD << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> struct rge {
T b, e;
};
template <class T> rge<T> range(T i, T j) { return rge<T>{i, j}; }
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
template <class T> debug &operator<<(T x) {
cerr << boolalpha << x;
return *this;
}
template <class B, class C> debug &operator<<(pair<B, C> x) {
return *this << "(" << x.first << ", " << x.second << ")";
}
template <class T> debug &operator<<(rge<T> x) {
*this << "[";
for (auto it = x.b; it != x.e; it++) {
*this << ", " + 2 * (it == x.b) << *it;
}
return *this << "]";
}
template <class T> debug &operator<<(vector<T> x) {
return *this << range(x.begin(), x.end());
}
#else
template <class T> debug &operator<<(const T &) { return *this; }
#endif
};
#define nav(...) << "[ " << #__VA_ARGS__ ": " << (__VA_ARGS__) << " ] "
using ll = long long;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ford(i, n) for (int i = n - 1; i >= 0; i--)
template <typename T> void min_self(T &a, T b) { a = min(a, b); }
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
const int mod = 998244353;
const int mxN = 200 * 1000 + 5;
int fact[mxN], finv[mxN];
int add(int a, int b) {
a += b;
while (a >= mod) {
a -= mod;
}
return a;
}
int add_self(int &a, int b) { a = add(a, b); }
int mul(int a, int b) { return 1LL * a * b % mod; }
int mpow(int a, int n) {
if (n == 0) {
return 1;
}
int x = mpow(a, n / 2);
x = mul(x, x);
if (n & 1) {
x = mul(x, a);
}
return x;
}
int binomial(int n, int k) { return mul(fact[n], mul(finv[n - k], finv[k])); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
fact[0] = finv[0] = 1;
for (int i = 1; i < n; i++) {
fact[i] = mul(i, fact[i - 1]);
finv[i] = mpow(fact[i], mod - 2);
}
int ans = 0;
forn(i, k + 1) {
add_self(ans, mul(mul(m, binomial(n - 1, i)), mpow(m - 1, n - i - 1)));
}
cout << ans << endl;
}
// Those who say they can, and those who say they can't - are both usually
// right.
// Read statement carefully
// Solve on paper first!
// Overflows (long long)
// Author: blondie | #include <bits/stdc++.h>
using namespace std;
template <class T> struct rge {
T b, e;
};
template <class T> rge<T> range(T i, T j) { return rge<T>{i, j}; }
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
template <class T> debug &operator<<(T x) {
cerr << boolalpha << x;
return *this;
}
template <class B, class C> debug &operator<<(pair<B, C> x) {
return *this << "(" << x.first << ", " << x.second << ")";
}
template <class T> debug &operator<<(rge<T> x) {
*this << "[";
for (auto it = x.b; it != x.e; it++) {
*this << ", " + 2 * (it == x.b) << *it;
}
return *this << "]";
}
template <class T> debug &operator<<(vector<T> x) {
return *this << range(x.begin(), x.end());
}
#else
template <class T> debug &operator<<(const T &) { return *this; }
#endif
};
#define nav(...) << "[ " << #__VA_ARGS__ ": " << (__VA_ARGS__) << " ] "
using ll = long long;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ford(i, n) for (int i = n - 1; i >= 0; i--)
template <typename T> void min_self(T &a, T b) { a = min(a, b); }
template <typename T> void max_self(T &a, T b) { a = max(a, b); }
const int mod = 998244353;
const int mxN = 200 * 1000 + 5;
int fact[mxN], finv[mxN];
int add(int a, int b) {
a += b;
while (a >= mod) {
a -= mod;
}
return a;
}
void add_self(int &a, int b) { a = add(a, b); }
int mul(int a, int b) { return 1LL * a * b % mod; }
int mpow(int a, int n) {
if (n == 0) {
return 1;
}
int x = mpow(a, n / 2);
x = mul(x, x);
if (n & 1) {
x = mul(x, a);
}
return x;
}
int binomial(int n, int k) { return mul(fact[n], mul(finv[n - k], finv[k])); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
fact[0] = finv[0] = 1;
for (int i = 1; i < n; i++) {
fact[i] = mul(i, fact[i - 1]);
finv[i] = mpow(fact[i], mod - 2);
}
int ans = 0;
forn(i, k + 1) {
add_self(ans, mul(mul(m, binomial(n - 1, i)), mpow(m - 1, n - i - 1)));
}
cout << ans << endl;
}
// Those who say they can, and those who say they can't - are both usually
// right.
// Read statement carefully
// Solve on paper first!
// Overflows (long long)
// Author: blondie | replace | 52 | 53 | 52 | 53 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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;
}
i64 n, m, k;
int MOD = 998244353;
i64 mod_pow(i64 x, i64 y, i64 mod) {
i64 res = 1;
while (y > 0) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
const int MAX = 101010;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
inv[0] = 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 C(i64 n, i64 k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
/*i64 res = 1;
for(int i = 1; i <= k; i++){
res *= n-i+1;
res %= MOD;
res *= inv[i];
res %= MOD;
}
return res;
*/
}
void solve() {
cin >> n >> m >> k;
i64 ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ans += m * mod_pow(m - 1, n - i - 1, MOD) % MOD * C(n - 1, i) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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;
}
i64 n, m, k;
int MOD = 998244353;
i64 mod_pow(i64 x, i64 y, i64 mod) {
i64 res = 1;
while (y > 0) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
const int MAX = 404040;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
inv[0] = 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 C(i64 n, i64 k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
/*i64 res = 1;
for(int i = 1; i <= k; i++){
res *= n-i+1;
res %= MOD;
res *= inv[i];
res %= MOD;
}
return res;
*/
}
void solve() {
cin >> n >> m >> k;
i64 ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ans += m * mod_pow(m - 1, n - i - 1, MOD) % MOD * C(n - 1, i) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02685 | C++ | Time Limit Exceeded | /**
* author: MOOONI
* hackers are welcome!
**/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
const int md = 998244353;
inline int add(int &a, int b) {
a += b;
while (a < 0) {
a += md;
}
a %= md;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int power(int a, int b) {
int res = 1;
while (b) {
if (b & 1) {
res = mul(res, a);
}
a = mul(a, a);
b >>= 1;
}
return res;
}
inline int inv(int a) { return power(a, md - 2); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<int> fact(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = mul(fact[i - 1], i);
}
vector<int> inv_fact(n + 1);
inv_fact[n] = inv(fact[n]);
for (int i = n - 1; i >= 0; i--) {
inv_fact[i] = mul(inv_fact[i + 1], i + 1);
}
auto C = [&](int n, int k) {
if (k < 0 || k > n) {
return 0;
}
return mul(fact[n], mul(inv_fact[k], inv_fact[n - k]));
};
int ans = 0;
for (int i = 0; i <= k; i++) {
add(ans, mul(C(n - 1, i), mul(m, power(m - 1, n - i - 1))));
}
cout << ans << '\n';
return 0;
} | /**
* author: MOOONI
* hackers are welcome!
**/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
const int md = 998244353;
inline void add(int &a, int b) {
a += b;
while (a < 0) {
a += md;
}
a %= md;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int power(int a, int b) {
int res = 1;
while (b) {
if (b & 1) {
res = mul(res, a);
}
a = mul(a, a);
b >>= 1;
}
return res;
}
inline int inv(int a) { return power(a, md - 2); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<int> fact(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = mul(fact[i - 1], i);
}
vector<int> inv_fact(n + 1);
inv_fact[n] = inv(fact[n]);
for (int i = n - 1; i >= 0; i--) {
inv_fact[i] = mul(inv_fact[i + 1], i + 1);
}
auto C = [&](int n, int k) {
if (k < 0 || k > n) {
return 0;
}
return mul(fact[n], mul(inv_fact[k], inv_fact[n - k]));
};
int ans = 0;
for (int i = 0; i <= k; i++) {
add(ans, mul(C(n - 1, i), mul(m, power(m - 1, n - i - 1))));
}
cout << ans << '\n';
return 0;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02685 | 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 int MOD = 998244353;
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 = 100000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// コンビネーションを計算する関数
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cout << fixed << setprecision(15);
ll N, M, K;
cin >> N >> M >> K;
// 前処理
COMinit();
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ans += COM(N - 1, i) * M % MOD * modpow(M - 1, N - 1 - i) % MOD;
// ans = ans % MOD;
}
cout << (ans + MOD) % MOD << 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 int MOD = 998244353;
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;
}
// コンビネーションを計算する関数
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cout << fixed << setprecision(15);
ll N, M, K;
cin >> N >> M >> K;
// 前処理
COMinit();
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ans += COM(N - 1, i) * M % MOD * modpow(M - 1, N - 1 - i) % MOD;
// ans = ans % MOD;
}
cout << (ans + MOD) % MOD << endl;
return 0;
} | replace | 39 | 40 | 39 | 40 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 998244353;
const int MAX = 1e5 + 10;
long long kai[MAX], kair[MAX], rev[MAX];
void com_p() {
kai[0] = kai[1] = 1;
kair[0] = kair[1] = 1;
rev[1] = 1;
for (int i = 2; i < MAX; i++) {
kai[i] = kai[i - 1] * i % M;
rev[i] = M - rev[M % i] * (M / i) % M;
kair[i] = kair[i - 1] * rev[i] % M;
}
}
long long ncr(int n, int r) {
if (n < 0 || r < 0)
return 0;
if (n < r)
return 0;
return kai[n] * (kair[r] * kair[n - r] % M) % M;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
com_p();
long long sum = 0, x = m;
for (int i = 0; i < n - k - 1; i++) {
x = x * (m - 1) % M;
}
for (int i = k; i >= 0; i--) {
sum += x * ncr(n - 1, i) % M;
sum %= M;
x = x * (m - 1) % M;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int M = 998244353;
const int MAX = 1e5 * 2 + 5;
long long kai[MAX], kair[MAX], rev[MAX];
void com_p() {
kai[0] = kai[1] = 1;
kair[0] = kair[1] = 1;
rev[1] = 1;
for (int i = 2; i < MAX; i++) {
kai[i] = kai[i - 1] * i % M;
rev[i] = M - rev[M % i] * (M / i) % M;
kair[i] = kair[i - 1] * rev[i] % M;
}
}
long long ncr(int n, int r) {
if (n < 0 || r < 0)
return 0;
if (n < r)
return 0;
return kai[n] * (kair[r] * kair[n - r] % M) % M;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
com_p();
long long sum = 0, x = m;
for (int i = 0; i < n - k - 1; i++) {
x = x * (m - 1) % M;
}
for (int i = k; i >= 0; i--) {
sum += x * ncr(n - 1, i) % M;
sum %= M;
x = x * (m - 1) % M;
}
cout << sum << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 998244353;
vector<int> fact;
int modinit(int n) {
fact.push_back(1);
int now = 1;
for (int i = 1; i <= n; i++) {
now *= i;
now %= MOD;
fact.push_back(now);
}
}
int modpow(int x, int n) {
return n == 0 ? 1 : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int modcomb(int n, int r) {
if (n < r)
return 0;
return fact[n] * modpow(fact[n - r], MOD - 2) % MOD *
modpow(fact[r], MOD - 2) % MOD;
}
signed main() {
int n, m, k;
cin >> n >> m >> k;
int res = 0;
modinit(222222);
for (int i = 0; i <= k; i++) {
res += m * modcomb(n - 1, i) % MOD * modpow(m - 1, n - i - 1) % MOD;
res %= MOD;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INCANT \
cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), \
cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 998244353;
vector<int> fact;
void modinit(int n) {
fact.push_back(1);
int now = 1;
for (int i = 1; i <= n; i++) {
now *= i;
now %= MOD;
fact.push_back(now);
}
}
int modpow(int x, int n) {
return n == 0 ? 1 : modpow(x * x % MOD, n / 2) * (n % 2 ? x : 1) % MOD;
}
int modcomb(int n, int r) {
if (n < r)
return 0;
return fact[n] * modpow(fact[n - r], MOD - 2) % MOD *
modpow(fact[r], MOD - 2) % MOD;
}
signed main() {
int n, m, k;
cin >> n >> m >> k;
int res = 0;
modinit(222222);
for (int i = 0; i <= k; i++) {
res += m * modcomb(n - 1, i) % MOD * modpow(m - 1, n - i - 1) % MOD;
res %= MOD;
}
cout << res << endl;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02685 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int64_t M = 998244353;
vector<int64_t> fac(100001); // n! (mod M)
vector<int64_t> ifac(100001); // k!^{M-2} (mod M)
int64_t mpow(int64_t x, int64_t n) {
int64_t ans = 1;
while (n != 0) {
if (n & 1) {
ans = ans * x % M;
}
x = x * x % M;
n = n >> 1;
}
return ans;
}
int64_t comb(int64_t n, int64_t k) {
if (n == 0 && k == 0) {
return 1;
} else if (n < k || n < 0) {
return 0;
}
int64_t temp = ifac.at(k) * ifac.at(n - k) % M;
return temp * fac.at(n) % M;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
fac.at(0) = 1;
ifac.at(0) = 1;
for (int64_t i = 0; i < n; i++) {
fac.at(i + 1) = fac.at(i) * (i + 1) % M;
ifac.at(i + 1) = ifac.at(i) * mpow(i + 1, M - 2) % M;
}
int64_t ans = 0;
for (int i = 0; i <= k; i++) {
int64_t temp = m;
temp = temp * comb(n - 1, i) % M;
temp = temp * mpow(m - 1, n - 1 - i) % M;
ans = (ans + temp) % M;
}
cout << ans << endl;
}
| #include "bits/stdc++.h"
using namespace std;
int64_t M = 998244353;
vector<int64_t> fac(200001); // n! (mod M)
vector<int64_t> ifac(200001); // k!^{M-2} (mod M)
int64_t mpow(int64_t x, int64_t n) {
int64_t ans = 1;
while (n != 0) {
if (n & 1) {
ans = ans * x % M;
}
x = x * x % M;
n = n >> 1;
}
return ans;
}
int64_t comb(int64_t n, int64_t k) {
if (n == 0 && k == 0) {
return 1;
} else if (n < k || n < 0) {
return 0;
}
int64_t temp = ifac.at(k) * ifac.at(n - k) % M;
return temp * fac.at(n) % M;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
fac.at(0) = 1;
ifac.at(0) = 1;
for (int64_t i = 0; i < n; i++) {
fac.at(i + 1) = fac.at(i) * (i + 1) % M;
ifac.at(i + 1) = ifac.at(i) * mpow(i + 1, M - 2) % M;
}
int64_t ans = 0;
for (int i = 0; i <= k; i++) {
int64_t temp = m;
temp = temp * comb(n - 1, i) % M;
temp = temp * mpow(m - 1, n - 1 - i) % M;
ans = (ans + temp) % M;
}
cout << ans << endl;
}
| replace | 4 | 6 | 4 | 6 | 0 | |
p02685 | C++ | Runtime Error | /* Isn't passion overrated?*/
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll mod = 998244353;
ll power(ll a, ll x) {
if (x == 0)
return 1;
ll ans = power(a, x / 2) % mod;
ans = (ans % mod * ans % mod) % mod;
ans %= mod;
if (x % 2)
ans = (ans % mod * a) % mod;
return ans % mod;
}
vector<ll> per(100010);
ll ncr(ll n, ll i) {
return (per[n] % mod * power(per[i], mod - 2) % mod *
power(per[n - i], mod - 2) % mod) %
mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m, k;
cin >> n >> m >> k;
per[0] = 1;
ll h = per.size();
for (ll i = 1; i < h; i++) {
per[i] = i * per[i - 1];
per[i] %= mod;
}
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ll temp = ncr(n - 1, i) % mod;
temp = (temp * m) % mod;
temp = (temp * power(m - 1, n - 1 - i) % mod) % mod;
ans = ans + temp;
ans %= mod;
}
cout << ans % mod;
return 0;
}
| /* Isn't passion overrated?*/
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll mod = 998244353;
ll power(ll a, ll x) {
if (x == 0)
return 1;
ll ans = power(a, x / 2) % mod;
ans = (ans % mod * ans % mod) % mod;
ans %= mod;
if (x % 2)
ans = (ans % mod * a) % mod;
return ans % mod;
}
vector<ll> per(200010);
ll ncr(ll n, ll i) {
return (per[n] % mod * power(per[i], mod - 2) % mod *
power(per[n - i], mod - 2) % mod) %
mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m, k;
cin >> n >> m >> k;
per[0] = 1;
ll h = per.size();
for (ll i = 1; i < h; i++) {
per[i] = i * per[i - 1];
per[i] %= mod;
}
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ll temp = ncr(n - 1, i) % mod;
temp = (temp * m) % mod;
temp = (temp * power(m - 1, n - 1 - i) % mod) % mod;
ans = ans + temp;
ans %= mod;
}
cout << ans % mod;
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
const lli M = 998244353, N = 1e5 + 5;
lli fact[N];
lli binpow(lli a, lli b) {
if (b == 0)
return 1;
lli res = binpow(a, b / 2);
res = (res * res) % M;
if (b % 2)
return (res * a) % M;
return res;
}
lli inv(lli a) { return binpow(a, M - 2); }
lli add(lli a, lli b) {
lli res = a + b;
if (res >= M)
return res - M;
return res;
}
lli mul(lli a, lli b) {
lli res = a * b;
if (res >= M)
return res % M;
return res;
}
lli sub(lli a, lli b) { return (a % M - b % M + M) % M; }
void pre() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
}
lli ncr(lli n, lli r) { return mul(fact[n], inv(mul(fact[n - r], fact[r]))); }
/*c(n-1,k1) part is straight forward: find k1 points to split the whole row.
In each of k1 + 1 segments, colors must be different. The 2 blocks at either
side of each splitting point have same color.
m is for the first block of first segment, it can choose from all m colors. for
the rest blocks of first segment, each one can only choose from m-1 colors since
its color must be different from adjacent blocks.
for the first block of other segment, it has only 1 choice: the same as the last
one of previous segment. the rest blocks of other segment are like that in the
first segment, each has m-1 choices.*/
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
pre();
lli n, m, k;
cin >> n >> m >> k;
lli i, cur, ans = 0;
for (i = 0; i <= k; i++) {
cur = ncr(n - 1, i);
cur = mul(cur, mul(m, binpow(m - 1, n - 1 - i)));
ans = add(ans, cur);
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
const lli M = 998244353, N = 2e5 + 5;
lli fact[N];
lli binpow(lli a, lli b) {
if (b == 0)
return 1;
lli res = binpow(a, b / 2);
res = (res * res) % M;
if (b % 2)
return (res * a) % M;
return res;
}
lli inv(lli a) { return binpow(a, M - 2); }
lli add(lli a, lli b) {
lli res = a + b;
if (res >= M)
return res - M;
return res;
}
lli mul(lli a, lli b) {
lli res = a * b;
if (res >= M)
return res % M;
return res;
}
lli sub(lli a, lli b) { return (a % M - b % M + M) % M; }
void pre() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
}
lli ncr(lli n, lli r) { return mul(fact[n], inv(mul(fact[n - r], fact[r]))); }
/*c(n-1,k1) part is straight forward: find k1 points to split the whole row.
In each of k1 + 1 segments, colors must be different. The 2 blocks at either
side of each splitting point have same color.
m is for the first block of first segment, it can choose from all m colors. for
the rest blocks of first segment, each one can only choose from m-1 colors since
its color must be different from adjacent blocks.
for the first block of other segment, it has only 1 choice: the same as the last
one of previous segment. the rest blocks of other segment are like that in the
first segment, each has m-1 choices.*/
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
pre();
lli n, m, k;
cin >> n >> m >> k;
lli i, cur, ans = 0;
for (i = 0; i <= k; i++) {
cur = ncr(n - 1, i);
cur = mul(cur, mul(m, binpow(m - 1, n - 1 - i)));
ans = add(ans, cur);
}
cout << ans;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 998244353LL;
// MOD考慮power関数
template <typename type> inline type ModPow(type a, type b) {
type ret = 1;
for (type i = 0; i < b; i++) {
ret *= a;
ret %= MOD;
}
return ret;
}
// MOD考慮Combination関数使用準備関数
vector<long long> fac;
vector<long long> finv;
vector<long long> inv;
inline void ModCombiSetup(int size) {
fac.resize(size + 1);
finv.resize(size + 1);
inv.resize(size + 1);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < size; 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;
}
}
// MOD考慮Combination関数
inline long long ModCombi(long long n, long long r) {
if (n == 0 && r == 0)
return 1;
if (n < r || n < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
int main() {
long long n, m, k;
cin >> n >> m >> k;
long long ans = 0;
ModCombiSetup(n);
for (long long i = 0; i <= k; i++) {
long long cnt =
((m * ModCombi(n - 1, i) % MOD) * ModPow(m - 1, n - 1 - i)) % MOD;
ans = (ans + cnt) % MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 998244353LL;
// MOD考慮power関数
template <typename type> inline type ModPow(type a, type b) {
type ret = 1;
while (b > 0) {
if (b & 0x1)
ret = ret * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ret;
}
// MOD考慮Combination関数使用準備関数
vector<long long> fac;
vector<long long> finv;
vector<long long> inv;
inline void ModCombiSetup(int size) {
fac.resize(size + 1);
finv.resize(size + 1);
inv.resize(size + 1);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < size; 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;
}
}
// MOD考慮Combination関数
inline long long ModCombi(long long n, long long r) {
if (n == 0 && r == 0)
return 1;
if (n < r || n < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
int main() {
long long n, m, k;
cin >> n >> m >> k;
long long ans = 0;
ModCombiSetup(n);
for (long long i = 0; i <= k; i++) {
long long cnt =
((m * ModCombi(n - 1, i) % MOD) * ModPow(m - 1, n - 1 - i)) % MOD;
ans = (ans + cnt) % MOD;
}
cout << ans << endl;
} | replace | 9 | 12 | 9 | 14 | TLE | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(998244353))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
template <class T> void pr_vec(vector<T> &v, char ep = ' ') {
int n = v.size();
REP(ni, n) {
cout << v[ni];
if (ni != n - 1)
cout << ep;
}
cout << endl;
};
template <class T> inline bool chmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <uint32_t mod> struct ModInt {
uint32_t a;
ModInt &s(uint32_t vv) {
a = vv < mod ? vv : vv - mod;
return *this;
}
ModInt(int64_t x = 0) { s(x % mod + mod); }
ModInt &operator+=(const ModInt &x) { return s(a + x.a); }
ModInt &operator-=(const ModInt &x) { return s(a + mod - x.a); }
ModInt &operator*=(const ModInt &x) {
a = uint64_t(a) * x.a % mod;
return *this;
}
ModInt &operator/=(const ModInt &x) {
*this *= x.inv();
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
bool operator==(const ModInt &x) const { return a == x.a; }
bool operator!=(const ModInt &x) const { return a != x.a; }
bool operator<(const ModInt &x) const { return a < x.a; }
ModInt operator-() const { return ModInt() - *this; }
ModInt pow(int64_t n) const {
ModInt res(1), x(*this);
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
ModInt inv() const { return pow(mod - 2); }
};
template <uint32_t mod> istream &operator>>(istream &in, ModInt<mod> &a) {
return (in >> a.a);
}
template <uint32_t mod>
ostream &operator<<(ostream &out, const ModInt<mod> &a) {
return (out << a.a);
}
// using mint=ModInt<(ll)998244353>;
using mint = ModInt<MOD>;
vector<mint> inv, fact, invfact;
void mod_build(int n = 200005) {
fact.assign(n + 1, mint(1));
inv.assign(n + 1, mint(1));
invfact.assign(n + 1, mint(1));
REP(i, n) {
fact[i + 1] = fact[i] * mint(i + 1);
if (i > 0)
inv[i + 1] = mint() - inv[MOD % (i + 1)] * mint(MOD / (i + 1));
invfact[i + 1] = invfact[i] * inv[i + 1];
}
}
mint perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k];
}
mint comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k]) * invfact[k];
}
// O(n)が間に合わなさそうなnに対応したcomb
// フェルマーの小定理と逆元を用いて計算
mint comb2(ll n, int k) {
mint X(n), Y(1);
REP(i, k - 1) {
X *= n - i - 1;
Y *= i + 2;
}
return X * Y.pow(MOD - 2);
}
int main(void) {
int N, M, K;
cin >> N >> M >> K;
mint ans = mint(M).pow(N);
for (int i = N - 1; i > K; i--) {
// mint t = comb2(N-1, i) * mint(M).pow(i-1);
mint t = comb(N - 1, i) * mint(M) * mint(M - 1).pow(N - i - 1);
ans -= t;
}
pr(ans);
} | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(998244353))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
template <class T> void pr_vec(vector<T> &v, char ep = ' ') {
int n = v.size();
REP(ni, n) {
cout << v[ni];
if (ni != n - 1)
cout << ep;
}
cout << endl;
};
template <class T> inline bool chmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <uint32_t mod> struct ModInt {
uint32_t a;
ModInt &s(uint32_t vv) {
a = vv < mod ? vv : vv - mod;
return *this;
}
ModInt(int64_t x = 0) { s(x % mod + mod); }
ModInt &operator+=(const ModInt &x) { return s(a + x.a); }
ModInt &operator-=(const ModInt &x) { return s(a + mod - x.a); }
ModInt &operator*=(const ModInt &x) {
a = uint64_t(a) * x.a % mod;
return *this;
}
ModInt &operator/=(const ModInt &x) {
*this *= x.inv();
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
bool operator==(const ModInt &x) const { return a == x.a; }
bool operator!=(const ModInt &x) const { return a != x.a; }
bool operator<(const ModInt &x) const { return a < x.a; }
ModInt operator-() const { return ModInt() - *this; }
ModInt pow(int64_t n) const {
ModInt res(1), x(*this);
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
ModInt inv() const { return pow(mod - 2); }
};
template <uint32_t mod> istream &operator>>(istream &in, ModInt<mod> &a) {
return (in >> a.a);
}
template <uint32_t mod>
ostream &operator<<(ostream &out, const ModInt<mod> &a) {
return (out << a.a);
}
// using mint=ModInt<(ll)998244353>;
using mint = ModInt<MOD>;
vector<mint> inv, fact, invfact;
void mod_build(int n = 200005) {
fact.assign(n + 1, mint(1));
inv.assign(n + 1, mint(1));
invfact.assign(n + 1, mint(1));
REP(i, n) {
fact[i + 1] = fact[i] * mint(i + 1);
if (i > 0)
inv[i + 1] = mint() - inv[MOD % (i + 1)] * mint(MOD / (i + 1));
invfact[i + 1] = invfact[i] * inv[i + 1];
}
}
mint perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k];
}
mint comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k]) * invfact[k];
}
// O(n)が間に合わなさそうなnに対応したcomb
// フェルマーの小定理と逆元を用いて計算
mint comb2(ll n, int k) {
mint X(n), Y(1);
REP(i, k - 1) {
X *= n - i - 1;
Y *= i + 2;
}
return X * Y.pow(MOD - 2);
}
int main(void) {
int N, M, K;
cin >> N >> M >> K;
mint ans = mint(M).pow(N);
mod_build();
for (int i = N - 1; i > K; i--) {
// mint t = comb2(N-1, i) * mint(M).pow(i-1);
mint t = comb(N - 1, i) * mint(M) * mint(M - 1).pow(N - i - 1);
ans -= t;
}
pr(ans);
} | insert | 149 | 149 | 149 | 150 | -11 | |
p02685 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 998244353, INF = 1010101010;
constexpr lint LINF = 1LL << 60;
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (const auto &e : vec)
os << e << (&e == &vec.back() ? "\n" : " ");
return os;
}
#ifdef _DEBUG
template <class T> void dump(const char *str, T &&h) {
cerr << str << " = " << h << "\n";
};
template <class Head, class... Tail>
void dump(const char *str, Head &&h, Tail &&...t) {
while (*str != ',')
cerr << *str++;
cerr << " = " << h << "\n";
dump(str + (*(str + 1) == ' ' ? 2 : 1), t...);
}
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
template <int Modulo = MOD> struct Mint {
lint val;
constexpr Mint(lint v = 0) noexcept : val(v % Modulo) {
if (val < 0)
val += Modulo;
}
constexpr Mint &operator+=(const Mint &r) noexcept {
val += r.val;
if (val >= Modulo)
val -= Modulo;
return *this;
}
constexpr Mint &operator-=(const Mint &r) noexcept {
val -= r.val;
if (val < 0)
val += Modulo;
return *this;
}
constexpr Mint &operator*=(const Mint &r) noexcept {
val = val * r.val % Modulo;
return *this;
}
constexpr Mint &operator/=(const Mint &r) noexcept {
lint a = r.val, b = Modulo, u = 1, v = 0;
while (b) {
lint t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % Modulo;
if (val < 0)
val += Modulo;
return *this;
}
constexpr Mint operator+(const Mint &r) const noexcept {
return Mint(*this) += r;
}
constexpr Mint operator-(const Mint &r) const noexcept {
return Mint(*this) -= r;
}
constexpr Mint operator*(const Mint &r) const noexcept {
return Mint(*this) *= r;
}
constexpr Mint operator/(const Mint &r) const noexcept {
return Mint(*this) /= r;
}
constexpr int getmod() { return Modulo; }
constexpr Mint operator-() const noexcept { return val ? Modulo - val : 0; }
constexpr bool operator==(const Mint &r) const noexcept {
return val == r.val;
}
constexpr bool operator!=(const Mint &r) const noexcept {
return val != r.val;
}
friend ostream &operator<<(ostream &os, const Mint<Modulo> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, Mint<Modulo> &x) noexcept {
lint tmp;
is >> tmp;
x = Mint(tmp);
return is;
}
constexpr Mint pow(lint n) noexcept {
Mint res{1}, tmp{val};
while (n > 0) {
if (n & 1)
res *= tmp;
tmp *= tmp;
n >>= 1;
}
return res;
}
};
using mint = Mint<>;
class Factorial {
private:
vector<mint> fac, inv, finv;
void build(int N) {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < N; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
public:
Factorial(int N = 110000) : fac(N + 1), inv(N + 1), finv(N + 1) {
build(N + 1);
}
mint Cmod(int n, int k) {
if (n < k || k < 0)
return 0LL;
return fac[n] * (finv[k] * finv[n - k]);
}
mint Pmod(int n, int k) {
if (n < k || k < 0)
return 0LL;
return fac[n] * finv[n - k];
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, M, K;
cin >> N >> M >> K;
Factorial C;
mint ans = 0;
for (int i = N - 1 - K; i < N; i++) {
ans += C.Cmod(N - 1, i) * M * mint(M - 1).pow(i);
}
cout << ans << "\n";
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 998244353, INF = 1010101010;
constexpr lint LINF = 1LL << 60;
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (const auto &e : vec)
os << e << (&e == &vec.back() ? "\n" : " ");
return os;
}
#ifdef _DEBUG
template <class T> void dump(const char *str, T &&h) {
cerr << str << " = " << h << "\n";
};
template <class Head, class... Tail>
void dump(const char *str, Head &&h, Tail &&...t) {
while (*str != ',')
cerr << *str++;
cerr << " = " << h << "\n";
dump(str + (*(str + 1) == ' ' ? 2 : 1), t...);
}
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
template <int Modulo = MOD> struct Mint {
lint val;
constexpr Mint(lint v = 0) noexcept : val(v % Modulo) {
if (val < 0)
val += Modulo;
}
constexpr Mint &operator+=(const Mint &r) noexcept {
val += r.val;
if (val >= Modulo)
val -= Modulo;
return *this;
}
constexpr Mint &operator-=(const Mint &r) noexcept {
val -= r.val;
if (val < 0)
val += Modulo;
return *this;
}
constexpr Mint &operator*=(const Mint &r) noexcept {
val = val * r.val % Modulo;
return *this;
}
constexpr Mint &operator/=(const Mint &r) noexcept {
lint a = r.val, b = Modulo, u = 1, v = 0;
while (b) {
lint t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % Modulo;
if (val < 0)
val += Modulo;
return *this;
}
constexpr Mint operator+(const Mint &r) const noexcept {
return Mint(*this) += r;
}
constexpr Mint operator-(const Mint &r) const noexcept {
return Mint(*this) -= r;
}
constexpr Mint operator*(const Mint &r) const noexcept {
return Mint(*this) *= r;
}
constexpr Mint operator/(const Mint &r) const noexcept {
return Mint(*this) /= r;
}
constexpr int getmod() { return Modulo; }
constexpr Mint operator-() const noexcept { return val ? Modulo - val : 0; }
constexpr bool operator==(const Mint &r) const noexcept {
return val == r.val;
}
constexpr bool operator!=(const Mint &r) const noexcept {
return val != r.val;
}
friend ostream &operator<<(ostream &os, const Mint<Modulo> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, Mint<Modulo> &x) noexcept {
lint tmp;
is >> tmp;
x = Mint(tmp);
return is;
}
constexpr Mint pow(lint n) noexcept {
Mint res{1}, tmp{val};
while (n > 0) {
if (n & 1)
res *= tmp;
tmp *= tmp;
n >>= 1;
}
return res;
}
};
using mint = Mint<>;
class Factorial {
private:
vector<mint> fac, inv, finv;
void build(int N) {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < N; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
public:
Factorial(int N = 110000) : fac(N + 1), inv(N + 1), finv(N + 1) {
build(N + 1);
}
mint Cmod(int n, int k) {
if (n < k || k < 0)
return 0LL;
return fac[n] * (finv[k] * finv[n - k]);
}
mint Pmod(int n, int k) {
if (n < k || k < 0)
return 0LL;
return fac[n] * finv[n - k];
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, M, K;
cin >> N >> M >> K;
Factorial C(N);
mint ans = 0;
for (int i = N - 1 - K; i < N; i++) {
ans += C.Cmod(N - 1, i) * M * mint(M - 1).pow(i);
}
cout << ans << "\n";
return 0;
} | replace | 168 | 169 | 168 | 169 | 0 | |
p02685 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc167/tasks/abc167_e
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; --i)
#define SREP(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
template <typename T> T gcd(T a, T b) {
if (a < b)
gcd(b, a);
if (b == 1)
return 1;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
template <typename T> struct UnionFind {
vector<T> par;
vector<T> rank;
UnionFind(T n = 1) { init(n); }
void init(T n = 1) {
par.resize(n);
rank.resize(n);
for (T i = 0; i < n; ++i) {
par[i] = i;
rank[i] = 0;
}
}
int root(T x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(T x, T y) { return root(x) == root(y); }
bool merge(T x, T y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
// #define INF (ll(1e18))
template <typename Monoid, typename OperatorMonoid = Monoid>
struct LazySegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
using G = function<Monoid(Monoid, OperatorMonoid)>;
using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
ll sz, height;
vector<Monoid> data;
vector<OperatorMonoid> lazy;
const F f;
const G g;
const H h;
const Monoid M1;
const OperatorMonoid OM0;
LazySegmentTree(ll n, const F f, const G g, const H h, const Monoid &M1,
const OperatorMonoid OM0)
: f(f), g(g), h(h), M1(M1), OM0(OM0) {
sz = 1;
height = 0;
while (sz < n)
sz <<= 1, height++;
data.assign(2 * sz, M1);
lazy.assign(2 * sz, OM0);
}
void set(ll k, const Monoid &x) { data[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
data[k] = f(data[2 * k + 0], data[2 * k + 1]);
}
}
inline void propagate(ll k) {
if (lazy[k] != OM0) {
lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
data[k] = reflect(k);
lazy[k] = OM0;
}
}
inline Monoid reflect(ll k) {
return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
}
inline void recalc(ll k) {
while (k >>= 1)
data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
}
inline void thrust(ll k) {
for (int i = height; i > 0; i--)
propagate(k >> i);
}
void update(ll a, ll b, const OperatorMonoid &x) {
thrust(a += sz);
thrust(b += sz - 1);
for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
lazy[l] = h(lazy[l], x), ++l;
if (r & 1)
--r, lazy[r] = h(lazy[r], x);
}
recalc(a);
recalc(b);
}
Monoid query(ll a, ll b) {
thrust(a += sz);
thrust(b += sz - 1);
Monoid L = M1, R = M1;
for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
L = f(L, reflect(l++));
if (r & 1)
R = f(reflect(--r), R);
}
return f(L, R);
}
Monoid operator[](const int &k) { return query(k, k + 1); }
template <typename C>
int find_subtree(ll a, const C &check, Monoid &M, bool type) {
while (a < sz) {
propagate(a);
Monoid nxt =
type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(ll a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, reflect(1))))
return find_subtree(1, check, L, false);
return -1;
}
thrust(a + sz);
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, reflect(a));
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(ll b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(reflect(1), R)))
return find_subtree(1, check, R, true);
return -1;
}
thrust(b + sz - 1);
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(reflect(--b), R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
int msb(ll x) {
int n = 0;
while (x > 0) {
x /= 2;
n++;
}
return n;
}
template <ll Modulus> class modint {
public:
ll a;
constexpr modint(const ll x = 0) noexcept : a(x % Modulus) {}
constexpr ll &value() noexcept { return a; }
constexpr operator int() const { return a; }
constexpr operator long long() const { return a; }
constexpr const ll &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator+(const ll rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator-(const ll rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator*(const ll rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint operator/(const ll rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
ll exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
#define MOD (ll(998244353))
#define INF (ll(1e15))
int main(int argc, const char *argv[]) {
(void)argc;
(void)argv;
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M, K;
cin >> N >> M >> K;
vector<modint<MOD>> dp(K + 2);
dp[1] = M;
REP(i, N - 1) {
RREP(k, K + 1) { dp[k + 1] = dp[k + 1] * (M - 1) + dp[k]; }
}
modint<MOD> score = 0;
REP(i, K + 1) { score += dp[i + 1]; }
cout << score.value() << endl;
}
| // https://atcoder.jp/contests/abc167/tasks/abc167_e
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; --i)
#define SREP(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
template <typename T> T gcd(T a, T b) {
if (a < b)
gcd(b, a);
if (b == 1)
return 1;
T r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
template <typename T> struct UnionFind {
vector<T> par;
vector<T> rank;
UnionFind(T n = 1) { init(n); }
void init(T n = 1) {
par.resize(n);
rank.resize(n);
for (T i = 0; i < n; ++i) {
par[i] = i;
rank[i] = 0;
}
}
int root(T x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(T x, T y) { return root(x) == root(y); }
bool merge(T x, T y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
// #define INF (ll(1e18))
template <typename Monoid, typename OperatorMonoid = Monoid>
struct LazySegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
using G = function<Monoid(Monoid, OperatorMonoid)>;
using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;
ll sz, height;
vector<Monoid> data;
vector<OperatorMonoid> lazy;
const F f;
const G g;
const H h;
const Monoid M1;
const OperatorMonoid OM0;
LazySegmentTree(ll n, const F f, const G g, const H h, const Monoid &M1,
const OperatorMonoid OM0)
: f(f), g(g), h(h), M1(M1), OM0(OM0) {
sz = 1;
height = 0;
while (sz < n)
sz <<= 1, height++;
data.assign(2 * sz, M1);
lazy.assign(2 * sz, OM0);
}
void set(ll k, const Monoid &x) { data[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
data[k] = f(data[2 * k + 0], data[2 * k + 1]);
}
}
inline void propagate(ll k) {
if (lazy[k] != OM0) {
lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
data[k] = reflect(k);
lazy[k] = OM0;
}
}
inline Monoid reflect(ll k) {
return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
}
inline void recalc(ll k) {
while (k >>= 1)
data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
}
inline void thrust(ll k) {
for (int i = height; i > 0; i--)
propagate(k >> i);
}
void update(ll a, ll b, const OperatorMonoid &x) {
thrust(a += sz);
thrust(b += sz - 1);
for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
lazy[l] = h(lazy[l], x), ++l;
if (r & 1)
--r, lazy[r] = h(lazy[r], x);
}
recalc(a);
recalc(b);
}
Monoid query(ll a, ll b) {
thrust(a += sz);
thrust(b += sz - 1);
Monoid L = M1, R = M1;
for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
L = f(L, reflect(l++));
if (r & 1)
R = f(reflect(--r), R);
}
return f(L, R);
}
Monoid operator[](const int &k) { return query(k, k + 1); }
template <typename C>
int find_subtree(ll a, const C &check, Monoid &M, bool type) {
while (a < sz) {
propagate(a);
Monoid nxt =
type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(ll a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, reflect(1))))
return find_subtree(1, check, L, false);
return -1;
}
thrust(a + sz);
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, reflect(a));
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(ll b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(reflect(1), R)))
return find_subtree(1, check, R, true);
return -1;
}
thrust(b + sz - 1);
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(reflect(--b), R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
int msb(ll x) {
int n = 0;
while (x > 0) {
x /= 2;
n++;
}
return n;
}
template <ll Modulus> class modint {
public:
ll a;
constexpr modint(const ll x = 0) noexcept : a(x % Modulus) {}
constexpr ll &value() noexcept { return a; }
constexpr operator int() const { return a; }
constexpr operator long long() const { return a; }
constexpr const ll &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator+(const ll rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator-(const ll rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator*(const ll rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint operator/(const ll rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
ll exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
#define MOD (ll(998244353))
#define INF (ll(1e15))
int main(int argc, const char *argv[]) {
(void)argc;
(void)argv;
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M, K;
cin >> N >> M >> K;
vector<modint<MOD>> mm1n(N + 1, 1);
vector<modint<MOD>> factorial(N + 1, 1);
SREP(i, 1, N + 1) {
mm1n[i] = mm1n[i - 1] * (M - 1);
factorial[i] = factorial[i - 1] * i;
}
modint<MOD> sum = 0;
REP(k, K + 1) {
modint<MOD> score = M;
score *= mm1n[N - k - 1];
score *= factorial[N - 1] / (factorial[k] * factorial[N - 1 - k]);
sum += score;
}
cout << sum.value() << endl;
}
| replace | 306 | 315 | 306 | 322 | TLE | |
p02685 | C++ | Runtime Error | // ABC167-E
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
namespace you {
std::string to_string(char val) {
return std::string(1, val);
// return std::string{val};
// you::to_string(char)
}
} // namespace you
ll modpow(ll x, ll y, ll mod) { // x^y
if (y == 1)
return x % mod;
if (y % 2 == 1)
return x * modpow(x, y - 1, mod) % mod;
ll t = modpow(x, y / 2, mod);
return (t * t) % mod;
}
vector<ll> fact(210000);
vector<ll> invfact(210000);
ll nck(ll n, ll k, ll mod) {
if (n < k or k < 0)
return 0;
return (fact[n] * invfact[k]) % mod * invfact[n - k] % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n, m, k;
cin >> n >> m >> k;
int mod = 998244353;
fact[0] = 1;
for (int i = 1; i < 210000; i++) {
fact[i] = fact[i - 1] * i % mod;
}
// cout<<fact[20000]<<endl;
invfact[210000 - 1] = modpow(fact[210000 - 1], mod - 2, mod);
// cout<<modpow(fact[210000-1],mod-2,mod)<<endl;
for (int i = 210000 - 2; i > -1; i = i - 1) {
invfact[i] = invfact[i + 1] * (i + 1) % mod;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ll num =
(nck(n - 1, i, mod) * m) % mod * modpow(m - 1, n - i - 1, mod) % mod;
// cout<<nck(n-1,i)<<endl;
// cout<<modpow(m-1,n-i-1,mod)<<endl;
ans += num;
ans %= mod;
}
cout << ans << endl;
return 0;
} | // ABC167-E
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
namespace you {
std::string to_string(char val) {
return std::string(1, val);
// return std::string{val};
// you::to_string(char)
}
} // namespace you
ll modpow(ll x, ll y, ll mod) { // x^y
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y % 2 == 1)
return x * modpow(x, y - 1, mod) % mod;
ll t = modpow(x, y / 2, mod);
return (t * t) % mod;
}
vector<ll> fact(210000);
vector<ll> invfact(210000);
ll nck(ll n, ll k, ll mod) {
if (n < k or k < 0)
return 0;
return (fact[n] * invfact[k]) % mod * invfact[n - k] % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int n, m, k;
cin >> n >> m >> k;
int mod = 998244353;
fact[0] = 1;
for (int i = 1; i < 210000; i++) {
fact[i] = fact[i - 1] * i % mod;
}
// cout<<fact[20000]<<endl;
invfact[210000 - 1] = modpow(fact[210000 - 1], mod - 2, mod);
// cout<<modpow(fact[210000-1],mod-2,mod)<<endl;
for (int i = 210000 - 2; i > -1; i = i - 1) {
invfact[i] = invfact[i + 1] * (i + 1) % mod;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ll num =
(nck(n - 1, i, mod) * m) % mod * modpow(m - 1, n - i - 1, mod) % mod;
// cout<<nck(n-1,i)<<endl;
// cout<<modpow(m-1,n-i-1,mod)<<endl;
ans += num;
ans %= mod;
}
cout << ans << endl;
return 0;
} | insert | 24 | 24 | 24 | 26 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ll N, M, K, MOD = 998244353, ans = 0;
cin >> N >> M >> K;
vector<ll> f(N, 1);
rep(i, N) f[i + 1] = (f[i] * (i + 1)) % MOD;
rep(i, K + 1) {
ll x = M * mod_pow(M - 1, N - 1 - i, MOD);
x %= MOD;
x *= f[N - 1];
x %= MOD;
x *= mod_pow(f[i], MOD - 2, MOD);
x %= MOD;
x *= mod_pow(f[N - 1 - i], MOD - 2, MOD);
x %= MOD;
ans = (ans + x) % MOD;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ll N, M, K, MOD = 998244353, ans = 0;
cin >> N >> M >> K;
vector<ll> f(N + 1, 1);
rep(i, N) f[i + 1] = (f[i] * (i + 1)) % MOD;
rep(i, K + 1) {
ll x = M * mod_pow(M - 1, N - 1 - i, MOD);
x %= MOD;
x *= f[N - 1];
x %= MOD;
x *= mod_pow(f[i], MOD - 2, MOD);
x %= MOD;
x *= mod_pow(f[N - 1 - i], MOD - 2, MOD);
x %= MOD;
ans = (ans + x) % MOD;
}
cout << ans << "\n";
} | replace | 20 | 21 | 20 | 21 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> bool chmin(T1 &l, const T2 &r);
template <class T1, class T2> bool chmax(T1 &l, const T2 &r);
template <class T1, class T2> void vadd(vector<T1> &v, T2 x);
const int MF = 400005, MOD = 998244353;
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
void solve(long long N, long long M, long long K) {
int n = N, m = M, k = K;
mint ret = 0;
rep(i, K + 1) {
ret += binom(n - 1, i) * mint(M) * mint(M - 1).pow(n - i - 1);
}
cout << ret << endl;
}
signed main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
long long K;
scanf("%lld", &K);
solve(N, M, K);
return 0;
}
// -- lib
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2> bool chmin(T1 &l, const T2 &r) {
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2> bool chmax(T1 &l, const T2 &r) {
return (l < r) ? (l = r, true) : false;
}
template <class T1, class T2> void vadd(vector<T1> &v, T2 x) {
for (auto &s : v)
s += T2(x);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> bool chmin(T1 &l, const T2 &r);
template <class T1, class T2> bool chmax(T1 &l, const T2 &r);
template <class T1, class T2> void vadd(vector<T1> &v, T2 x);
const int MF = 400005, MOD = 998244353;
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
void solve(long long N, long long M, long long K) {
int n = N, m = M, k = K;
mint ret = 0;
if (m == 1) {
if (K >= N - 1) {
cout << 1 << endl;
} else {
cout << 0 << endl;
}
return;
}
rep(i, K + 1) {
ret += binom(n - 1, i) * mint(M) * mint(M - 1).pow(n - i - 1);
}
cout << ret << endl;
}
signed main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
long long K;
scanf("%lld", &K);
solve(N, M, K);
return 0;
}
// -- lib
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2> bool chmin(T1 &l, const T2 &r) {
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2> bool chmax(T1 &l, const T2 &r) {
return (l < r) ? (l = r, true) : false;
}
template <class T1, class T2> void vadd(vector<T1> &v, T2 x) {
for (auto &s : v)
s += T2(x);
}
| insert | 169 | 169 | 169 | 177 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
// #define INF 100000000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template <class T> ostream &operator<<(ostream &o, const vector<T> &obj) {
o << "[";
for (int i = 0; i < (int)obj.size(); ++i)
o << (i > 0 ? ", " : "") << obj[i];
o << "]";
return o;
}
template <class T>
ostream &operator<<(ostream &o, const vector<vector<T>> &obj) {
o << "[" << endl;
for (int i = 0; i < (int)obj.size(); ++i)
o << " " << obj[i] << endl;
o << "]";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &obj) {
o << "(" << obj.first << ", " << obj.second << ")";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const queue<T> &obj) {
queue<T> obj_cp = obj;
bool first = true;
o << "{";
while (!obj_cp.empty()) {
o << (!first ? ", " : "") << obj_cp.front();
obj_cp.pop();
first = false;
}
o << "}";
return o;
}
void print() { cout << "\n"; }
template <class Head, class... Body> void print(Head head, Body... body) {
cout << head << " ";
print(body...);
}
ull pow_mod(ull x, ull n) {
ull ans = 1;
while (n != 0) {
if (n & 1) {
ans = ans * x % MOD;
}
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
#define N_MAX 200000
vector<ull> fac(N_MAX + 1);
vector<ull> ifac(N_MAX + 1);
void init_fac() {
fac[0] = 1;
ifac[0] = 1;
for (int i = 1; i <= N_MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
ifac[i] = ifac[i - 1] * pow_mod(i, MOD - 2) % MOD;
}
}
ull comb_mod(ull a, ull b) {
assert(a > 0 && b >= 0 && a >= b);
ull tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
int main(int argc, char const *argv[]) {
ull N, M, K;
cin >> N >> M >> K;
init_fac();
ull ans = 0;
for (unsigned int k = 0; k <= K; ++k) {
ull x = (comb_mod(N - 1, k) * pow_mod(M - 1, N - 1 - k)) % MOD;
ans = (ans + x) % MOD;
}
ans = (ans * M) % MOD;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define MOD 998244353
// #define INF 100000000000
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template <class T> ostream &operator<<(ostream &o, const vector<T> &obj) {
o << "[";
for (int i = 0; i < (int)obj.size(); ++i)
o << (i > 0 ? ", " : "") << obj[i];
o << "]";
return o;
}
template <class T>
ostream &operator<<(ostream &o, const vector<vector<T>> &obj) {
o << "[" << endl;
for (int i = 0; i < (int)obj.size(); ++i)
o << " " << obj[i] << endl;
o << "]";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &obj) {
o << "(" << obj.first << ", " << obj.second << ")";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const queue<T> &obj) {
queue<T> obj_cp = obj;
bool first = true;
o << "{";
while (!obj_cp.empty()) {
o << (!first ? ", " : "") << obj_cp.front();
obj_cp.pop();
first = false;
}
o << "}";
return o;
}
void print() { cout << "\n"; }
template <class Head, class... Body> void print(Head head, Body... body) {
cout << head << " ";
print(body...);
}
ull pow_mod(ull x, ull n) {
ull ans = 1;
while (n != 0) {
if (n & 1) {
ans = ans * x % MOD;
}
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
#define N_MAX 200000
vector<ull> fac(N_MAX + 1);
vector<ull> ifac(N_MAX + 1);
void init_fac() {
fac[0] = 1;
ifac[0] = 1;
for (int i = 1; i <= N_MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
ifac[i] = ifac[i - 1] * pow_mod(i, MOD - 2) % MOD;
}
}
ull comb_mod(ull a, ull b) {
assert(a > 0 && b >= 0 && a >= b);
ull tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
int main(int argc, char const *argv[]) {
ull N, M, K;
cin >> N >> M >> K;
if (N == 1) {
cout << M << endl;
return 0;
}
init_fac();
ull ans = 0;
for (unsigned int k = 0; k <= K; ++k) {
ull x = (comb_mod(N - 1, k) * pow_mod(M - 1, N - 1 - k)) % MOD;
ans = (ans + x) % MOD;
}
ans = (ans * M) % MOD;
cout << ans << endl;
return 0;
}
| insert | 98 | 98 | 98 | 103 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl
#define outmat(v) \
for (auto i : v) { \
for (auto j : i) \
cout << j << " "; \
cout << endl; \
}
#define in(n, v) \
for (int i = 0; i < (n); i++) { \
cin >> v[i]; \
}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#define len(v) int(v.length())
#define lob(v, n) lower_bound(all(v), n)
#define lobi(v, n) lower_bound(all(v), n) - v.begin()
#define upb(v, n) upper_bound(all(v), n)
#define upbi(v, n) upper_bound(all(v), n) - v.begin()
#define mod 998244353
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvp = vector<vector<pair<int, int>>>;
template <typename T> using ve = vector<T>;
template <typename T> using pq2 = priority_queue<T>;
template <typename T> using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else
x = 1, y = 0;
return d;
}
template <typename T> T modpow(T x, T n, T m) {
if (n == 0)
return 1;
T resp = modpow(x * x % m, n / 2, m);
if (n & 1)
resp = resp * x % m;
return resp;
}
template <typename T> T modinverse(T a, T m) {
T x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
struct combination {
ll M = mod;
vector<ll> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
ifact[0] = 1;
for (ll i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % M;
ifact[i + 1] = ifact[i] * modpow(i + 1, M - 2, M) % M;
}
}
ll com(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifact[a - b] * ifact[b] % M;
return tmp * fact[a] % M;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, M, K;
cin >> N >> M >> K;
ll ans = 0;
combination C(M + 1);
for (ll k = 0; k <= K; k++) {
ll kk = modpow<ll>(M - 1, N - 1 - k, mod);
ll kkk = C.com(N - 1, k);
ans += kk * kkk % mod;
ans %= mod;
}
ans *= M;
ans %= mod;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl
#define outmat(v) \
for (auto i : v) { \
for (auto j : i) \
cout << j << " "; \
cout << endl; \
}
#define in(n, v) \
for (int i = 0; i < (n); i++) { \
cin >> v[i]; \
}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#define len(v) int(v.length())
#define lob(v, n) lower_bound(all(v), n)
#define lobi(v, n) lower_bound(all(v), n) - v.begin()
#define upb(v, n) upper_bound(all(v), n)
#define upbi(v, n) upper_bound(all(v), n) - v.begin()
#define mod 998244353
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvp = vector<vector<pair<int, int>>>;
template <typename T> using ve = vector<T>;
template <typename T> using pq2 = priority_queue<T>;
template <typename T> using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else
x = 1, y = 0;
return d;
}
template <typename T> T modpow(T x, T n, T m) {
if (n == 0)
return 1;
T resp = modpow(x * x % m, n / 2, m);
if (n & 1)
resp = resp * x % m;
return resp;
}
template <typename T> T modinverse(T a, T m) {
T x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
struct combination {
ll M = mod;
vector<ll> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
ifact[0] = 1;
for (ll i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % M;
ifact[i + 1] = ifact[i] * modpow(i + 1, M - 2, M) % M;
}
}
ll com(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifact[a - b] * ifact[b] % M;
return tmp * fact[a] % M;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N, M, K;
cin >> N >> M >> K;
ll ans = 0;
combination C(N + 1);
for (ll k = 0; k <= K; k++) {
ll kk = modpow<ll>(M - 1, N - 1 - k, mod);
ll kkk = C.com(N - 1, k);
ans += kk * kkk % mod;
ans %= mod;
}
ans *= M;
ans %= mod;
cout << ans << endl;
return 0;
}
| replace | 126 | 127 | 126 | 127 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int mod = 998244353;
const int inf = 2e9 + 5;
const int N = 2e5 + 5;
ll n, m, k, fact[N];
ll modexp(ll x, int n) {
if (n == 0)
return 1;
ll ans = modexp((x * x) % mod, n / 2);
if (n % 2 != 0)
return (x * ans) % mod;
return ans;
}
ll modinv(int x) { return modexp(x, mod - 2); }
ll choose(int i, int j) {
ll num1 = fact[i];
ll num2 = (fact[i - j] * fact[j]) % mod;
num2 = modinv(num2);
return (num1 * num2) % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> k;
fact[0] = 1;
for (int i = 1; i <= N; i++)
fact[i] = (i * fact[i - 1]) % mod;
if (k == 0) {
cout << (m * modexp(m - 1, n - 1)) % mod;
return 0;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans +
(choose(n - 1, i) * ((m * modexp(m - 1, n - 1 - i)) % mod)) % mod) %
mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int mod = 998244353;
const int inf = 2e9 + 5;
const int N = 2e5 + 5;
ll n, m, k, fact[N];
ll modexp(ll x, int n) {
if (n == 0)
return 1;
ll ans = modexp((x * x) % mod, n / 2);
if (n % 2 != 0)
return (x * ans) % mod;
return ans;
}
ll modinv(int x) { return modexp(x, mod - 2); }
ll choose(int i, int j) {
ll num1 = fact[i];
ll num2 = (fact[i - j] * fact[j]) % mod;
num2 = modinv(num2);
return (num1 * num2) % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> k;
fact[0] = 1;
for (int i = 1; i <= N - 5; i++)
fact[i] = (i * fact[i - 1]) % mod;
if (k == 0) {
cout << (m * modexp(m - 1, n - 1)) % mod;
return 0;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans +
(choose(n - 1, i) * ((m * modexp(m - 1, n - 1 - i)) % mod)) % mod) %
mod;
}
cout << ans << "\n";
return 0;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p02685 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b) {
return a.first < b.first;
}
use case
sort(V.begin(), V.end(), compare_function);*/
ll laip(ll a, ll b, ll liek) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a % liek;
}
ll c = (a * a) % liek;
if (b % 2 == 0) {
return laip(c, b / 2, liek);
}
return (a * laip(c, b / 2, liek)) % liek;
}
ll cnk(ll n, ll i, ll liek, vector<ll> &F) {
ll x = F[n] % liek;
// cout<<n<<" "<<x<<endl;
ll y = F[i] * F[n - i];
y = y % liek;
// cout<<i<<" "<<n-i<<" "<<x<<" "<<y<<endl;
ll ats = x * laip(y, liek - 2, liek);
ats = ats % liek;
return ats;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, m, k;
cin >> n >> m >> k;
ll liek = 998244353;
vector<ll> F;
F.push_back(1);
for (int i = 0; i < 100005; i++) {
ll x = (i + 1) * F[i];
x = x % liek;
F.push_back(x);
}
// cout<<cnk(3,2,liek,F)<<endl;
ll ats = 0;
for (int i = 0; i <= k; i++) {
ll x = cnk(n - 1, i, liek, F) * m;
// cout<<x<<endl;
x = x % liek;
x = x * laip(m - 1, n - i - 1, liek);
x = x % liek;
// cout<<i<<" "<<x<<endl;
ats = ats + x;
ats = ats % liek;
}
cout << ats << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b) {
return a.first < b.first;
}
use case
sort(V.begin(), V.end(), compare_function);*/
ll laip(ll a, ll b, ll liek) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a % liek;
}
ll c = (a * a) % liek;
if (b % 2 == 0) {
return laip(c, b / 2, liek);
}
return (a * laip(c, b / 2, liek)) % liek;
}
ll cnk(ll n, ll i, ll liek, vector<ll> &F) {
ll x = F[n] % liek;
// cout<<n<<" "<<x<<endl;
ll y = F[i] * F[n - i];
y = y % liek;
// cout<<i<<" "<<n-i<<" "<<x<<" "<<y<<endl;
ll ats = x * laip(y, liek - 2, liek);
ats = ats % liek;
return ats;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, m, k;
cin >> n >> m >> k;
ll liek = 998244353;
vector<ll> F;
F.push_back(1);
for (int i = 0; i < 200005; i++) {
ll x = (i + 1) * F[i];
x = x % liek;
F.push_back(x);
}
// cout<<cnk(3,2,liek,F)<<endl;
ll ats = 0;
for (int i = 0; i <= k; i++) {
ll x = cnk(n - 1, i, liek, F) * m;
// cout<<x<<endl;
x = x % liek;
x = x * laip(m - 1, n - i - 1, liek);
x = x % liek;
// cout<<i<<" "<<x<<endl;
ats = ats + x;
ats = ats % liek;
}
cout << ats << endl;
return 0;
}
| replace | 50 | 51 | 50 | 51 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
#define ALL(a) a.begin(), a.end()
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.sise())
#define reps(i, s, n) for (int i = s; i < n; i++)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
deque<int> deq;
#define fi first
#define se second
// const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<int, int> P;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} c(200005);
int main() {
int n, m, k;
cin >> n >> m >> k;
mint color = m;
rep(i, n - k) { color *= (m - 1); }
mint ans = color * c(n + k - 1, k);
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define mins(x, y) x = min(x, y)
#define maxs(x, y) x = max(x, y)
#define ALL(a) a.begin(), a.end()
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.sise())
#define reps(i, s, n) for (int i = s; i < n; i++)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
deque<int> deq;
#define fi first
#define se second
// const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<int, int> P;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} c(200005);
int main() {
int n, m, k;
cin >> n >> m >> k;
mint ans = 0;
mint col = m;
for (int x = n - 1; x >= 0; --x) {
mint now = col;
now *= c(n - 1, x);
if (x <= k)
ans += now;
col *= m - 1;
}
cout << ans << endl;
return 0;
} | replace | 98 | 102 | 98 | 108 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i <= n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
#define MAX 100000
#define inf 1000000007
#define mod 998244353 // 今回のでかい素数
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
// オーバーフローしないようにその都度割っていく！
// 階乗などを配列で持っておくことで計算量を減らす！
ll n, m, k, ans, p;
ll fact[MAX + 10]; // 階乗(factorial)
ll invfact[MAX + 10]; // 階乗の逆元
ll modpow(ll A,
ll N) { // 二分累乗法により、Nを2の累乗の和に分解してO(logN)で求める
ll res = 1;
while (N > 0) {
if (N & 1)
res = res * A % mod;
A = A * A % mod;
N >>= 1;
}
return res;
}
ll combination(ll A, ll B) { // combination(O(1))
if (A < B)
return 0;
if (A < 0 || B < 0)
return 0;
return fact[A] * invfact[A - B] % mod * invfact[B] % mod;
}
int main() {
cin >> n >> m >> k;
ans = 0;
fact[0] = 1; // 0!
FOR(i, 1, n) fact[i] = fact[i - 1] * i % mod; // fact[i] : i!の配列(factorial)
invfact[n] =
modpow(fact[n], mod - 2); // フェルマーの小定理よりaの逆元はa^(mod-2)
FORR(i, n - 1, 0)
invfact[i] = invfact[i + 1] * (i + 1) % mod; //(i+1)!の逆元にi+1かけてるだけ
p = modpow(m - 1, n - k - 1);
FOR(i, n - k, n) { // pow(m-1,n-i-1)の更新をループ内で行ってO(N)に
ans = (ans + m * p % mod * combination(n - 1, i - 1) % mod) % mod;
p = p * (m - 1) % mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i <= n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n)
#define MAX 100000
#define inf 1000000007
#define mod 998244353 // 今回のでかい素数
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
// オーバーフローしないようにその都度割っていく！
// 階乗などを配列で持っておくことで計算量を減らす！
ll n, m, k, ans, p;
ll fact[2 * MAX + 10]; // 階乗(factorial)
ll invfact[2 * MAX + 10]; // 階乗の逆元
ll modpow(ll A,
ll N) { // 二分累乗法により、Nを2の累乗の和に分解してO(logN)で求める
ll res = 1;
while (N > 0) {
if (N & 1)
res = res * A % mod;
A = A * A % mod;
N >>= 1;
}
return res;
}
ll combination(ll A, ll B) { // combination(O(1))
if (A < B)
return 0;
if (A < 0 || B < 0)
return 0;
return fact[A] * invfact[A - B] % mod * invfact[B] % mod;
}
int main() {
cin >> n >> m >> k;
ans = 0;
fact[0] = 1; // 0!
FOR(i, 1, n) fact[i] = fact[i - 1] * i % mod; // fact[i] : i!の配列(factorial)
invfact[n] =
modpow(fact[n], mod - 2); // フェルマーの小定理よりaの逆元はa^(mod-2)
FORR(i, n - 1, 0)
invfact[i] = invfact[i + 1] * (i + 1) % mod; //(i+1)!の逆元にi+1かけてるだけ
p = modpow(m - 1, n - k - 1);
FOR(i, n - k, n) { // pow(m-1,n-i-1)の更新をループ内で行ってO(N)に
ans = (ans + m * p % mod * combination(n - 1, i - 1) % mod) % mod;
p = p * (m - 1) % mod;
}
cout << ans << "\n";
return 0;
} | replace | 19 | 21 | 19 | 21 | 0 | |
p02685 | C++ | Runtime Error | #pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll mod = 998244353;
constexpr int NIL = -1;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
//-------------------
int n, m, k;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
bool operator>=(const mint a) { return (x >= a.x) ? 1 : 0; }
bool operator<(const mint a) { return !(*this >= a); }
bool operator>(const mint a) { return (x > a.x) ? 1 : 0; }
bool operator<=(const mint a) { return !(*this > a); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a; // 2 square
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(100005);
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // cout << fixed << setprecision(15);
cin >> n >> m >> k;
mint ans = mint(0);
FOR(l, n - k, n) {
ans += mint(m) * mint(m - 1).pow(l - 1) * comb(n - 1, l - 1);
}
cout << ans.x << endl;
return 0;
}
| #pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll mod = 998244353;
constexpr int NIL = -1;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
//-------------------
int n, m, k;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
bool operator>=(const mint a) { return (x >= a.x) ? 1 : 0; }
bool operator<(const mint a) { return !(*this >= a); }
bool operator>(const mint a) { return (x > a.x) ? 1 : 0; }
bool operator<=(const mint a) { return !(*this > a); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a; // 2 square
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(200005);
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // cout << fixed << setprecision(15);
cin >> n >> m >> k;
mint ans = mint(0);
FOR(l, n - k, n) {
ans += mint(m) * mint(m - 1).pow(l - 1) * comb(n - 1, l - 1);
}
cout << ans.x << endl;
return 0;
}
| replace | 111 | 112 | 111 | 112 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
using namespace std::chrono;
using namespace std;
#define fr(x, i, n) for (int x = i; x < n; ++x)
#define fb(x, i, n) for (int x = i; x >= n; --x)
#define pr pair<int, int>
#define ll long long int
const ll mod = 998244353;
/* auto start = high_resolution_clock::now();
auto stop = high_resolution_clock::now();
auto duration = duration_cast<microseconds>(stop - start);
cout << "\nduration="<<duration.count()/1e6 << endl;
*/
ll f(ll x, ll n) {
ll r = 1;
while (n) {
if (n % 2 == 1)
r = (r * x) % mod;
x = (x * x) % mod;
n /= 2;
}
return r;
}
vector<ll> fact(1e5 + 10, 1), ifact(1e5 + 10);
void build() {
for (ll i = 2; i < fact.size(); i++)
fact[i] = (i * fact[i - 1]) % mod;
fr(i, 0, fact.size()) { ifact[i] = f(fact[i], mod - 2); }
}
ll C(int n, int r) {
if (n < r)
return 0;
return (((fact[n] * ifact[r]) % mod) * ifact[n - r]) % mod;
}
void solve() {
int n, m, k;
cin >> n >> m >> k;
// let l blocks are colored same color as their left adjacent
ll ans = 0;
fr(l, 0, k + 1) {
ll x;
x = (C(n - 1, l) * m) % mod;
x = (x * f(m - 1, n - l - 1)) % mod;
x = (x + mod) % mod;
ans = (ans + x) % mod;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
build();
int t = 1;
// cin>>t;
while (t--)
solve();
}
| #include <bits/stdc++.h>
#include <chrono>
using namespace std::chrono;
using namespace std;
#define fr(x, i, n) for (int x = i; x < n; ++x)
#define fb(x, i, n) for (int x = i; x >= n; --x)
#define pr pair<int, int>
#define ll long long int
const ll mod = 998244353;
/* auto start = high_resolution_clock::now();
auto stop = high_resolution_clock::now();
auto duration = duration_cast<microseconds>(stop - start);
cout << "\nduration="<<duration.count()/1e6 << endl;
*/
ll f(ll x, ll n) {
ll r = 1;
while (n) {
if (n % 2 == 1)
r = (r * x) % mod;
x = (x * x) % mod;
n /= 2;
}
return r;
}
vector<ll> fact(2e5 + 10, 1), ifact(2e5 + 10);
void build() {
for (ll i = 2; i < fact.size(); i++)
fact[i] = (i * fact[i - 1]) % mod;
fr(i, 0, fact.size()) { ifact[i] = f(fact[i], mod - 2); }
}
ll C(int n, int r) {
if (n < r)
return 0;
return (((fact[n] * ifact[r]) % mod) * ifact[n - r]) % mod;
}
void solve() {
int n, m, k;
cin >> n >> m >> k;
// let l blocks are colored same color as their left adjacent
ll ans = 0;
fr(l, 0, k + 1) {
ll x;
x = (C(n - 1, l) * m) % mod;
x = (x * f(m - 1, n - l - 1)) % mod;
x = (x + mod) % mod;
ans = (ans + x) % mod;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
build();
int t = 1;
// cin>>t;
while (t--)
solve();
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(100005);
// nPk
mint f(int n, int k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
// 組み合わせの数nCrを計算
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
// N^P(modM)
using ll = long long int;
ll RepeatSquaring(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return t * t % M;
}
return N * RepeatSquaring(N, P - 1, M);
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
mint ans = 0;
vector<mint> v(n, 0);
mint temp = 1;
rep(i, n) {
v[i] = temp;
// cout<<temp<<endl;
temp *= (m - 1);
}
ans += v[n - 1] * m;
for (int i = 1; i <= k; i++) {
mint now = comb(n - 1, i);
// cout<<now<<endl;
mint pl = v[n - i - 1];
// cout<<v[n-k+1]<<' '<<v[1]<<' '<<pl<<'p'<<endl;
pl *= m;
now *= pl;
// cout<<now<<'n'<<pl<<'p'<<endl;
ans += now;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(200005);
// nPk
mint f(int n, int k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
// 組み合わせの数nCrを計算
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
// N^P(modM)
using ll = long long int;
ll RepeatSquaring(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return t * t % M;
}
return N * RepeatSquaring(N, P - 1, M);
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
mint ans = 0;
vector<mint> v(n, 0);
mint temp = 1;
rep(i, n) {
v[i] = temp;
// cout<<temp<<endl;
temp *= (m - 1);
}
ans += v[n - 1] * m;
for (int i = 1; i <= k; i++) {
mint now = comb(n - 1, i);
// cout<<now<<endl;
mint pl = v[n - i - 1];
// cout<<v[n-k+1]<<' '<<v[1]<<' '<<pl<<'p'<<endl;
pl *= m;
now *= pl;
// cout<<now<<'n'<<pl<<'p'<<endl;
ans += now;
}
cout << ans;
}
| replace | 71 | 72 | 71 | 72 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
const int mod = 998244353;
struct mint {
long long x;
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
mint operator()(int n) { return fact[n]; }
};
int main() {
lint N, M, K;
cin >> N >> M >> K;
combination comb(10000000);
mint ans = 0;
for (int k = 0; k <= K; k++) {
int l = (N - 1) - k;
// dd(k, l);
// d(comb(M, l + 1).x);
ans += comb(N - 1, l) * comb(M, 1) * comb(M - 1, 1).pow(N - 2);
// cout << ans.x << endl;
}
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
using lint = long long;
const int INF = 1e9;
const lint LINF = 1e18;
const lint MOD = 1e9 + 7;
const double EPS = 1e-10;
const int mod = 998244353;
struct mint {
long long x;
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
mint operator()(int n) { return fact[n]; }
};
int main() {
lint N, M, K;
cin >> N >> M >> K;
combination comb(10000000);
mint ans = 0;
for (int k = 0; k <= K; k++) {
int l = (N - 1) - k;
// dd(k, l);
// d(comb(M, l + 1).x);
ans += comb(N - 1, l) * comb(M, 1) * comb(M - 1, 1).pow(l);
// cout << ans.x << endl;
}
cout << ans.x << endl;
return 0;
} | replace | 104 | 105 | 104 | 105 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
// #define DEBUG 10
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 998244353, maxn = 155, maxm = 15;
const double PI = acos(-1);
ll fat[maxn], inv[maxn];
ll mul(ll a, ll b) {
ll ans = 0;
while (b) {
if (b & 1)
ans = (ans + a) % mod;
a = (a + a) % mod;
b = (b >> 1);
}
return ans;
}
ll sum(ll a, ll b) { return (a % mod + b % mod) % mod; }
ll sub(ll a, ll b) { return (a - b + mod + mod) % mod; }
ll fexp(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = mul(ans, a);
}
a = mul(a, a);
b = (b >> 1);
}
return ans;
}
void init() {
fat[0] = fat[1] = inv[0] = inv[1] = 1;
for (ll i = 2; i < maxn; i++) {
fat[i] = mul(fat[i - 1], i);
inv[i] = fexp(fat[i], mod - 2);
}
}
ll C(ll a, ll b) {
if (a < b)
return 0;
if (a == b || b == 0)
return 1;
return mul(mul(fat[a], inv[b]), inv[a - b]);
}
int main() {
ios_base::sync_with_stdio(false);
ll n, k, m, ans = 0;
init();
cin >> n >> m >> k;
for (ll i = 0; i <= k; i++) {
ll x = n - i - 1;
ans = sum(ans, mul(mul(m, C(n - 1, x)), fexp(m - 1, x)));
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
// #define DEBUG 10
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 998244353, maxn = 2 * 1e5 + 10, maxm = 15;
const double PI = acos(-1);
ll fat[maxn], inv[maxn];
ll mul(ll a, ll b) {
ll ans = 0;
while (b) {
if (b & 1)
ans = (ans + a) % mod;
a = (a + a) % mod;
b = (b >> 1);
}
return ans;
}
ll sum(ll a, ll b) { return (a % mod + b % mod) % mod; }
ll sub(ll a, ll b) { return (a - b + mod + mod) % mod; }
ll fexp(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = mul(ans, a);
}
a = mul(a, a);
b = (b >> 1);
}
return ans;
}
void init() {
fat[0] = fat[1] = inv[0] = inv[1] = 1;
for (ll i = 2; i < maxn; i++) {
fat[i] = mul(fat[i - 1], i);
inv[i] = fexp(fat[i], mod - 2);
}
}
ll C(ll a, ll b) {
if (a < b)
return 0;
if (a == b || b == 0)
return 1;
return mul(mul(fat[a], inv[b]), inv[a - b]);
}
int main() {
ios_base::sync_with_stdio(false);
ll n, k, m, ans = 0;
init();
cin >> n >> m >> k;
for (ll i = 0; i <= k; i++) {
ll x = n - i - 1;
ans = sum(ans, mul(mul(m, C(n - 1, x)), fexp(m - 1, x)));
}
cout << ans << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02685 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#pragma GCC optimize("-O3")
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); \
cerr.tie(NULL);
#define tolower(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
#define toupper(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
#define ll long long int
ll max(ll a, ll b) { return a > b ? a : b; }
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return b == 0 ? a : gcd(b, a % b);
}
#define case(i) cout << "Case #" << i << ": ";
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr << '\n'; \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << "[ " << *it << " = " << a << " ]";
err(++it, args...);
}
#define pii pair<ll, ll>
#define pb push_back
#define PRECISION 10
const ll inf = 1e16;
const int MAXN = 100001;
const int LOGN = 22;
const int MAXBIT = 61;
const int DIGITSIZE = 19;
ll mod = 1e9 + 7;
ll MOD = 998244353;
int x4[] = {1, -1, 0, 0};
int y4[] = {0, 0, 1, -1};
bool take_test_cases = 0;
bool print_case_no = 0;
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
ll factorial[MAXN];
ll modinverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
ll exponentMod(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = ((res % p) * (x % p)) % p;
y = y >> 1;
x = ((x % p) * (x % p)) % p;
}
return res % p;
}
ll ncrmodp(ll n, ll r, ll p) {
if (r == 0) {
return 1;
} else {
return (factorial[n] * modinverse(factorial[r], p) % p *
modinverse(factorial[n - r], p) % p) %
p;
}
}
void getac(int T) {
ll n, m, k;
cin >> n >> m >> k;
factorial[0] = 1;
for (ll i = 1; i <= n; i++) {
factorial[i] = factorial[i - 1] * i;
factorial[i] %= MOD;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans += ((m * (ncrmodp(n - 1, i, MOD)) % MOD) *
(exponentMod(m - 1, n - 1 - i, MOD) % MOD)) %
MOD;
ans %= MOD;
}
cout << ans % MOD << '\n';
}
int main() {
fastio;
int t = 1;
if (take_test_cases)
cin >> t;
int t_t = 1;
while (t--) {
if (print_case_no)
case (t_t);
getac(t_t);
t_t++;
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#pragma GCC optimize("-O3")
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); \
cerr.tie(NULL);
#define tolower(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
#define toupper(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
#define ll long long int
ll max(ll a, ll b) { return a > b ? a : b; }
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return b == 0 ? a : gcd(b, a % b);
}
#define case(i) cout << "Case #" << i << ": ";
#define debug(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr << '\n'; \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << "[ " << *it << " = " << a << " ]";
err(++it, args...);
}
#define pii pair<ll, ll>
#define pb push_back
#define PRECISION 10
const ll inf = 1e16;
const int MAXN = 200001;
const int LOGN = 22;
const int MAXBIT = 61;
const int DIGITSIZE = 19;
ll mod = 1e9 + 7;
ll MOD = 998244353;
int x4[] = {1, -1, 0, 0};
int y4[] = {0, 0, 1, -1};
bool take_test_cases = 0;
bool print_case_no = 0;
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
ll x1, y1;
ll gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
ll factorial[MAXN];
ll modinverse(ll b, ll m) {
ll x, y;
ll g = gcdExtended(b, m, &x, &y);
if (g != 1)
return -1;
return (x % m + m) % m;
}
ll exponentMod(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = ((res % p) * (x % p)) % p;
y = y >> 1;
x = ((x % p) * (x % p)) % p;
}
return res % p;
}
ll ncrmodp(ll n, ll r, ll p) {
if (r == 0) {
return 1;
} else {
return (factorial[n] * modinverse(factorial[r], p) % p *
modinverse(factorial[n - r], p) % p) %
p;
}
}
void getac(int T) {
ll n, m, k;
cin >> n >> m >> k;
factorial[0] = 1;
for (ll i = 1; i <= n; i++) {
factorial[i] = factorial[i - 1] * i;
factorial[i] %= MOD;
}
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans += ((m * (ncrmodp(n - 1, i, MOD)) % MOD) *
(exponentMod(m - 1, n - 1 - i, MOD) % MOD)) %
MOD;
ans %= MOD;
}
cout << ans % MOD << '\n';
}
int main() {
fastio;
int t = 1;
if (take_test_cases)
cin >> t;
int t_t = 1;
while (t--) {
if (print_case_no)
case (t_t);
getac(t_t);
t_t++;
}
return 0;
} | replace | 67 | 68 | 67 | 68 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.end(); ++itr)
const int MOD = 998244353;
const int MAX = 200010;
ll fac[MAX], finv[MAX], inv[MAX];
void cmbInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll cmb(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() {
ios_base::sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> p(n);
p[0] = 1;
rep(i, n) p[i + 1] = (p[i] * (m - 1)) % MOD;
ll ans = 0;
cmbInit();
rep(i, k + 1) {
ll a = (m * p[n - (i + 1)]) % MOD, b = cmb(n - 1, i);
ans += (a * b) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.end(); ++itr)
const int MOD = 998244353;
const int MAX = 200010;
ll fac[MAX], finv[MAX], inv[MAX];
void cmbInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll cmb(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() {
ios_base::sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<ll> p(n + 1);
p[0] = 1;
rep(i, n) p[i + 1] = (p[i] * (m - 1)) % MOD;
ll ans = 0;
cmbInit();
rep(i, k + 1) {
ll a = (m * p[n - (i + 1)]) % MOD, b = cmb(n - 1, i);
ans += (a * b) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
ll pd[200005];
ll rd[200005];
ll Ep(int x, int y) {
if (y == 1)
return x;
ll r = Ep(x, y / 2);
if (y % 2 == 1)
return r * r % MOD * x % MOD;
else
return r * r % MOD;
}
ll Ftl(ll x) {
if (x == 1 || x == 0)
return 1;
if (pd[x] != 0)
return pd[x];
return pd[x] = Ftl(x - 1) * x % MOD;
}
ll rFtl(ll x) {
if (x == 1 || x == 0)
return 1;
if (rd[x] != 0)
return rd[x];
return rd[x] = rFtl(x - 1) * Ep(x, MOD - 2) % MOD;
}
ll comb(ll m, ll n) {
if (m < n)
return 0;
return Ftl(m) * rFtl(n) % MOD * rFtl(m - n) % MOD;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
ll ans = 0;
for (int i = 0; i <= k; ++i) {
ll nans = m * Ep(m - 1, n - i - 1) % MOD;
nans *= comb(n - 1, i);
nans %= MOD;
ans += nans;
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
ll pd[200005];
ll rd[200005];
ll Ep(int x, int y) {
if (y == 0)
return 1;
if (y == 1)
return x;
ll r = Ep(x, y / 2);
if (y % 2 == 1)
return r * r % MOD * x % MOD;
else
return r * r % MOD;
}
ll Ftl(ll x) {
if (x == 1 || x == 0)
return 1;
if (pd[x] != 0)
return pd[x];
return pd[x] = Ftl(x - 1) * x % MOD;
}
ll rFtl(ll x) {
if (x == 1 || x == 0)
return 1;
if (rd[x] != 0)
return rd[x];
return rd[x] = rFtl(x - 1) * Ep(x, MOD - 2) % MOD;
}
ll comb(ll m, ll n) {
if (m < n)
return 0;
return Ftl(m) * rFtl(n) % MOD * rFtl(m - n) % MOD;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
ll ans = 0;
for (int i = 0; i <= k; ++i) {
ll nans = m * Ep(m - 1, n - i - 1) % MOD;
nans *= comb(n - 1, i);
nans %= MOD;
ans += nans;
ans %= MOD;
}
cout << ans << endl;
} | insert | 8 | 8 | 8 | 10 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// constexpr long MOD = 1000000007;
constexpr long MOD = 998244353;
vector<long> fact, inv;
long mpow(long a, long b) {
long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b /= 2;
}
return res;
}
long com(long n, long r) {
long x = 1, y = 1;
for (int i = 1; i <= r; i++) {
x = x * (n - i + 1) % MOD;
y = y * i % MOD;
}
return x * mpow(y, MOD - 2) % MOD;
}
void init(int n) {
fact.push_back(1);
inv.push_back(1);
for (int i = 0; i < n; i++) {
fact.push_back(fact.at(i) * (i + 1) % MOD);
inv.push_back(mpow(fact.at(i + 1), MOD - 2));
}
}
long qcom(long n, long r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact.at(n) * inv.at(r) % MOD * inv.at(n - r) % MOD;
}
int main() {
ios::sync_with_stdio(false);
init(100000);
long N, M, K;
cin >> N >> M >> K;
long ans = 0;
for (int i = 0; i <= K; i++) {
long tmp = qcom(N - 1, i);
tmp *= M;
tmp %= MOD;
tmp *= mpow(M - 1, N - i - 1);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
// constexpr long MOD = 1000000007;
constexpr long MOD = 998244353;
vector<long> fact, inv;
long mpow(long a, long b) {
long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b /= 2;
}
return res;
}
long com(long n, long r) {
long x = 1, y = 1;
for (int i = 1; i <= r; i++) {
x = x * (n - i + 1) % MOD;
y = y * i % MOD;
}
return x * mpow(y, MOD - 2) % MOD;
}
void init(int n) {
fact.push_back(1);
inv.push_back(1);
for (int i = 0; i < n; i++) {
fact.push_back(fact.at(i) * (i + 1) % MOD);
inv.push_back(mpow(fact.at(i + 1), MOD - 2));
}
}
long qcom(long n, long r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact.at(n) * inv.at(r) % MOD * inv.at(n - r) % MOD;
}
int main() {
ios::sync_with_stdio(false);
init(200000);
long N, M, K;
cin >> N >> M >> K;
long ans = 0;
for (int i = 0; i <= K; i++) {
long tmp = qcom(N - 1, i);
tmp *= M;
tmp %= MOD;
tmp *= mpow(M - 1, N - i - 1);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << "\n";
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 998244353;
double PI = 3.141592653589793;
int64_t MAX = 500000;
vector<int64_t> 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;
}
}
int64_t COM(int64_t n, int64_t k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int64_t mypow(int64_t x, int64_t y) // x ^ y
{
if (y == 1)
return x;
else if (y % 2 == 1)
return mypow(x, y - 1) * x % MOD;
else {
int64_t tmp = mypow(x, y / 2);
return tmp * tmp % MOD;
}
}
int main() {
COMinit();
int64_t N, M, K, tmp, ans = 0;
cin >> N >> M >> K;
for (int64_t i = 0; i <= K; i++) {
tmp = M * mypow(M - 1, N - i - 1) % MOD;
tmp = (tmp * COM(N - 1, i)) % MOD;
ans = (ans + tmp) % MOD;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 998244353;
double PI = 3.141592653589793;
int64_t MAX = 500000;
vector<int64_t> 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;
}
}
int64_t COM(int64_t n, int64_t k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int64_t mypow(int64_t x, int64_t y) // x ^ y
{
if (y == 0)
return 1;
if (y == 1)
return x;
else if (y % 2 == 1)
return mypow(x, y - 1) * x % MOD;
else {
int64_t tmp = mypow(x, y / 2);
return tmp * tmp % MOD;
}
}
int main() {
COMinit();
int64_t N, M, K, tmp, ans = 0;
cin >> N >> M >> K;
for (int64_t i = 0; i <= K; i++) {
tmp = M * mypow(M - 1, N - i - 1) % MOD;
tmp = (tmp * COM(N - 1, i)) % MOD;
ans = (ans + tmp) % MOD;
}
cout << ans;
} | insert | 29 | 29 | 29 | 31 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for (ll i = n; i < (ll)m; ++i)
#define IREP(i, n, m) for (ll i = n - 1; i >= m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) \
for (auto e : v) { \
cout << e << " "; \
}; \
cout << endl;
#define vvprint(vv) \
for (auto v : vv) \
vprint(v);
ll pow_mod(ll n, ll m, ll mod = 998244353) {
ll a = 1;
while (m > 0) {
if (m & 1)
a = a * n % mod;
n = n * n % mod;
m >>= 1;
}
return a;
}
ll combi(ll n, ll m, ll mod = 998244353) {
static const ll N_MAX = 100000;
static vll fac(N_MAX + 1, -1);
static vll ifac(N_MAX + 1, -1);
if (fac[0] < 0) {
fac[0] = ifac[0] = 1;
rep(i, N_MAX) {
fac[i + 1] = fac[i] * (i + 1) % mod;
ifac[i + 1] = ifac[i] * pow_mod(i + 1, mod - 2, mod) % mod;
}
}
if (n <= 0 && m <= 0)
return 1;
if (n < m || n < 0)
return 0;
return (ifac[n - m] * ifac[m] % mod) * fac[n] % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll N, M, K;
cin >> N >> M >> K;
ll total = 0;
rep(i, K + 1) {
ll t1 = combi(N - 1, i);
ll t2 = M * pow_mod(M - 1, N - 1 - i) % 998244353;
ll t = t1 * t2 % 998244353;
total = (total + t) % 998244353;
}
cout << total << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for (ll i = n; i < (ll)m; ++i)
#define IREP(i, n, m) for (ll i = n - 1; i >= m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) \
for (auto e : v) { \
cout << e << " "; \
}; \
cout << endl;
#define vvprint(vv) \
for (auto v : vv) \
vprint(v);
ll pow_mod(ll n, ll m, ll mod = 998244353) {
ll a = 1;
while (m > 0) {
if (m & 1)
a = a * n % mod;
n = n * n % mod;
m >>= 1;
}
return a;
}
ll combi(ll n, ll m, ll mod = 998244353) {
static const ll N_MAX = 200002;
static vll fac(N_MAX + 1, -1);
static vll ifac(N_MAX + 1, -1);
if (fac[0] < 0) {
fac[0] = ifac[0] = 1;
rep(i, N_MAX) {
fac[i + 1] = fac[i] * (i + 1) % mod;
ifac[i + 1] = ifac[i] * pow_mod(i + 1, mod - 2, mod) % mod;
}
}
if (n <= 0 && m <= 0)
return 1;
if (n < m || n < 0)
return 0;
return (ifac[n - m] * ifac[m] % mod) * fac[n] % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll N, M, K;
cin >> N >> M >> K;
ll total = 0;
rep(i, K + 1) {
ll t1 = combi(N - 1, i);
ll t2 = M * pow_mod(M - 1, N - 1 - i) % 998244353;
ll t = t1 * t2 % 998244353;
total = (total + t) % 998244353;
}
cout << total << endl;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02685 | Python | Time Limit Exceeded | import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def prepare(n, mod=998244353):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= mod
factorials.append(f)
inv = pow(f, mod - 2, mod)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= mod
invs[m - 1] = inv
return factorials, invs
def cmb(n, r):
mod = 998244353
ans = 1
for i in range(r):
ans *= n - i
ans %= mod
for i in range(1, r + 1):
ans *= pow(i, mod - 2, mod)
ans %= mod
return ans
# 実装を行う関数
def resolve(test_def_name=""):
n, m, k = map(int, input().split())
# 全組み合わせ数(重複順列)
# all_pattern = pow(m, n, 998244353)
# 使用方法サンプル(10 N 3= 10個の要素から3つを選ぶ場合の組み合わせ数)
fns, invs = prepare(100000000)
# さらに6 N 5= 6個の要素から5つを選ぶ場合の組み合わせ数 ->このように、大量のパターンが欲しいときはこっちを使う。
# aa = (fns[6] * invs[5] * invs[6 - 5]) % 998244353 # ans=120
# 許容される組み合わせを加算していく
ans = 0
for i in range(k + 1):
# ans += (m * pow(m - 1, m - i - 1, 998244353) * cmb(n - 1, i)) % 998244353
# ans = (fns[n-1] * invs[k] * invs[n-1 - k]) % 998244353
ans += (
m
* pow(m - 1, n - i - 1, 998244353)
* (fns[n - 1] * invs[i] * invs[n - 1 - i])
)
ans = ans % 998244353
print(ans)
# ans = (m * pow(m - 1, m - k - 1, 998244353) * cmb(n - 1, k)) % 998244353
# カウント外の組み合わせ数
# kpl1 = k + 1
# ng_pattern = m * pow((m - 1), n - (k + 1), 998244353)
# ng_pattern = ng_pattern % 998244353
# ans = all_pattern - ng_pattern
# テストクラス
class TestClass(unittest.TestCase):
def assertIO(self, assert_input, output):
stdout, sat_in = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
resolve(sys._getframe().f_back.f_code.co_name)
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, sat_in
self.assertEqual(out, output)
def test_input_1(self):
test_input = """3 2 1"""
output = """6"""
self.assertIO(test_input, output)
def test_input_2(self):
test_input = """100 100 0"""
output = """73074801"""
self.assertIO(test_input, output)
def test_input_3(self):
test_input = """60522 114575 7559"""
output = """479519525"""
self.assertIO(test_input, output)
# 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
def test_1original_1(self):
test_input = """4 10 0"""
output = """7290"""
self.assertIO(test_input, output)
def test_1original_2(self):
test_input = """4 10 1"""
output = """9720"""
self.assertIO(test_input, output)
def test_1original_3(self):
test_input = """4 10 2"""
output = """9990"""
self.assertIO(test_input, output)
def test_1original_4(self):
test_input = """4 10 3"""
output = """10000"""
self.assertIO(test_input, output)
# 実装orテストの呼び出し
if __name__ == "__main__":
if os.environ.get("USERNAME") is None:
# AtCoder提出時の場合
resolve()
else:
# 自PCの場合
unittest.main()
| import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def prepare(n, mod=998244353):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= mod
factorials.append(f)
inv = pow(f, mod - 2, mod)
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
inv *= m
inv %= mod
invs[m - 1] = inv
return factorials, invs
def cmb(n, r):
mod = 998244353
ans = 1
for i in range(r):
ans *= n - i
ans %= mod
for i in range(1, r + 1):
ans *= pow(i, mod - 2, mod)
ans %= mod
return ans
# 実装を行う関数
def resolve(test_def_name=""):
n, m, k = map(int, input().split())
# 全組み合わせ数(重複順列)
# all_pattern = pow(m, n, 998244353)
# 使用方法サンプル(10 N 3= 10個の要素から3つを選ぶ場合の組み合わせ数)
fns, invs = prepare(2000000)
# さらに6 N 5= 6個の要素から5つを選ぶ場合の組み合わせ数 ->このように、大量のパターンが欲しいときはこっちを使う。
# aa = (fns[6] * invs[5] * invs[6 - 5]) % 998244353 # ans=120
# 許容される組み合わせを加算していく
ans = 0
for i in range(k + 1):
# ans += (m * pow(m - 1, m - i - 1, 998244353) * cmb(n - 1, i)) % 998244353
# ans = (fns[n-1] * invs[k] * invs[n-1 - k]) % 998244353
ans += (
m
* pow(m - 1, n - i - 1, 998244353)
* (fns[n - 1] * invs[i] * invs[n - 1 - i])
)
ans = ans % 998244353
print(ans)
# ans = (m * pow(m - 1, m - k - 1, 998244353) * cmb(n - 1, k)) % 998244353
# カウント外の組み合わせ数
# kpl1 = k + 1
# ng_pattern = m * pow((m - 1), n - (k + 1), 998244353)
# ng_pattern = ng_pattern % 998244353
# ans = all_pattern - ng_pattern
# テストクラス
class TestClass(unittest.TestCase):
def assertIO(self, assert_input, output):
stdout, sat_in = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
resolve(sys._getframe().f_back.f_code.co_name)
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, sat_in
self.assertEqual(out, output)
def test_input_1(self):
test_input = """3 2 1"""
output = """6"""
self.assertIO(test_input, output)
def test_input_2(self):
test_input = """100 100 0"""
output = """73074801"""
self.assertIO(test_input, output)
def test_input_3(self):
test_input = """60522 114575 7559"""
output = """479519525"""
self.assertIO(test_input, output)
# 自作テストパターンのひな形(利用時は「tes_t」のアンダーバーを削除すること
def test_1original_1(self):
test_input = """4 10 0"""
output = """7290"""
self.assertIO(test_input, output)
def test_1original_2(self):
test_input = """4 10 1"""
output = """9720"""
self.assertIO(test_input, output)
def test_1original_3(self):
test_input = """4 10 2"""
output = """9990"""
self.assertIO(test_input, output)
def test_1original_4(self):
test_input = """4 10 3"""
output = """10000"""
self.assertIO(test_input, output)
# 実装orテストの呼び出し
if __name__ == "__main__":
if os.environ.get("USERNAME") is None:
# AtCoder提出時の場合
resolve()
else:
# 自PCの場合
unittest.main()
| replace | 47 | 48 | 47 | 48 | TLE | |
p02685 | Python | Runtime Error | n, m, k = [int(t) for t in open(0).read().split()]
mod = 998244353
def solve(n):
if n <= k + 1:
return pow(m, n, mod)
elif n == k + 2:
return (pow(m, n, mod) + mod - m) % mod
else:
return (m * solve(n - 1) - (m - 1) * solve(n - k - 2)) % mod
print(solve(n))
| n, m, k = [int(t) for t in open(0).read().split()]
mod = 998244353
mem = [0] * max(k + 3, n + 1)
for i in range(k + 2):
mem[i] = pow(m, i, mod)
c = 1
for i in range(k + 2, n + 1):
mem[i] = (m * mem[i - 1] - m * c * pow(m - 1, i - k - 2, mod)) % mod
c = (c * (i - 1) * pow(i - k - 1, -1, mod)) % mod
print(mem[n])
| replace | 2 | 14 | 2 | 10 | 0 | |
p02685 | Python | Time Limit Exceeded | import sys
from math import factorial
input = sys.stdin.readline
N, M, K = map(int, input().split())
MOD = 998244353
inv = [1] * N
FAC = factorial(N - 1) % MOD
if M == 1:
print(1 if K == N - 1 else 0)
else:
res = 0
for i in range(1, N):
inv[i] = pow(factorial(i), MOD - 2, MOD)
for k in range(K + 1):
# k個の○とN-k-1個の|を並べる順列
# punc = (N-1)!/k!/(N-k-1)!
# punc = factorial(
# k + (N - k - 1)) // factorial(k) // factorial(N - k - 1)
punc = FAC
# punc *= pow(factorial(k), MOD - 2, MOD)
punc *= inv[k]
punc = punc % MOD
# punc *= pow(factorial(N - k - 1), MOD - 2, MOD)
punc *= inv[N - k - 1]
punc = punc % MOD
color = M * pow(M - 1, N - k - 1, MOD)
res += ((punc % MOD) * color) % MOD
res = res % MOD
print(res % MOD)
| import sys
from math import factorial
input = sys.stdin.readline
N, M, K = map(int, input().split())
MOD = 998244353
inv = [1] * N
FAC = factorial(N - 1) % MOD
if M == 1:
print(1 if K == N - 1 else 0)
else:
res = 0
for i in range(1, N):
inv[i] = (inv[i - 1] * pow(i, MOD - 2, MOD)) % MOD
for k in range(K + 1):
# k個の○とN-k-1個の|を並べる順列
# punc = (N-1)!/k!/(N-k-1)!
# punc = factorial(
# k + (N - k - 1)) // factorial(k) // factorial(N - k - 1)
punc = FAC
# punc *= pow(factorial(k), MOD - 2, MOD)
punc *= inv[k]
punc = punc % MOD
# punc *= pow(factorial(N - k - 1), MOD - 2, MOD)
punc *= inv[N - k - 1]
punc = punc % MOD
color = M * pow(M - 1, N - k - 1, MOD)
res += ((punc % MOD) * color) % MOD
res = res % MOD
print(res % MOD)
| replace | 13 | 14 | 13 | 14 | TLE | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int mod = 998244353;
int expo(int num, int p) {
if (num == 0) {
if (p == 0)
assert(false);
return 0;
}
num = num % mod;
int ret = 1;
while (p) {
if (p & 1)
ret = (ret * num) % mod;
num = (num * num) % mod;
p /= 2;
}
return ret;
}
signed main() {
IOS;
int fact[200005], inv[200005];
fact[0] = 1;
for (int i = 1; i < 200005; ++i)
fact[i] = (fact[i - 1] * i) % mod;
for (int i = 0; i < 200005; ++i)
inv[i] = expo(fact[i], mod - 2);
int n, m, k;
cin >> n >> m >> k;
int ans = 0;
// if(m == 1) {
// if(k == n - 1) cout << 1;
// else cout << 0;
// return 0;
// }
for (int i = 0; i <= k; ++i) {
int cur = (m * expo(m - 1, n - i - 1)) % mod;
cur = (cur * fact[n - 1]) % mod;
cur = (cur * inv[i]) % mod;
cur = (cur * inv[n - i - 1]) % mod;
ans = (ans + cur) % mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int mod = 998244353;
int expo(int num, int p) {
if (num == 0) {
if (p == 0)
return 1;
return 0;
}
num = num % mod;
int ret = 1;
while (p) {
if (p & 1)
ret = (ret * num) % mod;
num = (num * num) % mod;
p /= 2;
}
return ret;
}
signed main() {
IOS;
int fact[200005], inv[200005];
fact[0] = 1;
for (int i = 1; i < 200005; ++i)
fact[i] = (fact[i - 1] * i) % mod;
for (int i = 0; i < 200005; ++i)
inv[i] = expo(fact[i], mod - 2);
int n, m, k;
cin >> n >> m >> k;
int ans = 0;
// if(m == 1) {
// if(k == n - 1) cout << 1;
// else cout << 0;
// return 0;
// }
for (int i = 0; i <= k; ++i) {
int cur = (m * expo(m - 1, n - i - 1)) % mod;
cur = (cur * fact[n - 1]) % mod;
cur = (cur * inv[i]) % mod;
cur = (cur * inv[n - i - 1]) % mod;
ans = (ans + cur) % mod;
}
cout << ans << "\n";
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02685 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define arep(i, v) for (auto i : v)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
// #define endl '\n';
#define fi first
#define se second
#define NONVOID [[nodiscard]]
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void dump(T &v) {
irep(i, v) { cout << *i << ((i == --v.end()) ? '\n' : ' '); }
}
inline string getline() {
string s;
getline(cin, s);
return s;
}
inline void yn(const bool b) { b ? fin("yes") : fin("no"); }
inline void Yn(const bool b) { b ? fin("Yes") : fin("No"); }
inline void YN(const bool b) { b ? fin("YES") : fin("NO"); }
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL << 60;
// constexpr ll MOD = 1000000007;
constexpr double EPS = 1e-9;
int MOD = 998244353;
#define MAX_NCK 101010
ll f[MAX_NCK], rf[MAX_NCK];
// modinvも呼ぶ！！
// (a/b)%P の場合は，(a%P)*modinv(b)%P とする
ll modinv(ll a) {
ll b = MOD, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
bool isinit = false;
void init(void) {
f[0] = 1;
rf[0] = modinv(1);
for (int i = 1; i < MAX_NCK; i++) {
f[i] = (f[i - 1] * i) % MOD;
rf[i] = modinv(f[i]);
}
}
ll nCk(int n, int k) {
if (!isinit) {
init();
isinit = 1;
}
ll nl = f[n]; // n!
ll nkl = rf[n - k]; // (n-k)!
ll kl = rf[k]; // k!
ll nkk = (nkl * kl) % MOD;
return (nl * nkk) % MOD;
}
// xのn乗%modを計算
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans += m * mod_pow(m - 1, n - i - 1, MOD) % MOD * nCk(n - 1, i);
ans %= MOD;
}
fin(ans);
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<ll, ll>> vpll;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define arep(i, v) for (auto i : v)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int
// #define endl '\n';
#define fi first
#define se second
#define NONVOID [[nodiscard]]
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline void dump(T &v) {
irep(i, v) { cout << *i << ((i == --v.end()) ? '\n' : ' '); }
}
inline string getline() {
string s;
getline(cin, s);
return s;
}
inline void yn(const bool b) { b ? fin("yes") : fin("no"); }
inline void Yn(const bool b) { b ? fin("Yes") : fin("No"); }
inline void YN(const bool b) { b ? fin("YES") : fin("NO"); }
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL << 60;
// constexpr ll MOD = 1000000007;
constexpr double EPS = 1e-9;
int MOD = 998244353;
#define MAX_NCK 201010
ll f[MAX_NCK], rf[MAX_NCK];
// modinvも呼ぶ！！
// (a/b)%P の場合は，(a%P)*modinv(b)%P とする
ll modinv(ll a) {
ll b = MOD, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
bool isinit = false;
void init(void) {
f[0] = 1;
rf[0] = modinv(1);
for (int i = 1; i < MAX_NCK; i++) {
f[i] = (f[i - 1] * i) % MOD;
rf[i] = modinv(f[i]);
}
}
ll nCk(int n, int k) {
if (!isinit) {
init();
isinit = 1;
}
ll nl = f[n]; // n!
ll nkl = rf[n - k]; // (n-k)!
ll kl = rf[k]; // k!
ll nkk = (nkl * kl) % MOD;
return (nl * nkk) % MOD;
}
// xのn乗%modを計算
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans += m * mod_pow(m - 1, n - i - 1, MOD) % MOD * nCk(n - 1, i);
ans %= MOD;
}
fin(ans);
} | replace | 96 | 97 | 96 | 97 | 0 | |
p02685 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#define rreps(i, x) for (ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max() / 4;
const int n_max = 1e5 + 10;
#define int ll
void print() { cout << endl; }
// template <class Head, class... Tail>
// void print(Head&& head, Tail&&... tail) {
// cout << head;
// if (sizeof...(tail) != 0) cout << " ";
// print(forward<Tail>(tail)...);
// }
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<T> &vec, ll k) {
ll n = vec.size();
k = min(k, n);
rep(i, k - 1) cout << vec[i] << " ";
cout << vec[k - 1] << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
template <class T, class U> void print(pair<T, U> &p) {
cout << p.first << " " << p.second << "\n";
}
template <std::int_fast64_t Modulus> class modint {
using i64 = int_fast64_t;
public:
i64 a;
constexpr modint(const i64 x = 0) noexcept {
this->a = x % Modulus;
if (a < 0) {
a += Modulus;
}
}
constexpr int getmod() { return Modulus; }
constexpr modint operator-() const noexcept { return a ? Modulus - a : 0; }
// constexpr i64 &value() const noexcept {return a;}
constexpr const i64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
i64 a_ = rhs.a, b = Modulus, u = 1, v = 0;
while (b) {
i64 t = a_ / b;
a_ -= t * b;
swap(a_, b);
u -= t * v;
swap(u, v);
}
a = a * u % Modulus;
if (a < 0)
a += Modulus;
return *this;
}
// 自前実装
constexpr bool operator==(const modint rhs) noexcept { return a == rhs.a; }
constexpr bool operator!=(const modint rhs) noexcept { return a != rhs.a; }
constexpr bool operator>(const modint rhs) noexcept { return a > rhs.a; }
constexpr bool operator>=(const modint rhs) noexcept { return a >= rhs.a; }
constexpr bool operator<(const modint rhs) noexcept { return a < rhs.a; }
constexpr bool operator<=(const modint rhs) noexcept { return a <= rhs.a; }
// constexpr modint& operator++() noexcept {
// return (*this) += modint(1);
// }
// constexpr modint operator++(int) {
// modint tmp(*this);
// operator++();
// return tmp;
// }
// constexpr modint& operator--() noexcept {
// return (*this) -= modint(1);
// }
// constexpr modint operator--(int) {
// modint tmp(*this);
// operator--();
// return tmp;
// }
template <typename T>
friend constexpr modint modpow(const modint &mt, T n) noexcept {
if (n < 0) {
modint t = (modint(1) / mt);
return modpow(t, -n);
}
modint res = 1, tmp = mt;
while (n) {
if (n & 1)
res *= tmp;
tmp *= tmp;
n /= 2;
}
return res;
}
};
const ll MOD = 998244353;
using mint = modint<MOD>;
// 標準入出力対応
std::ostream &operator<<(std::ostream &out, const modint<MOD> &m) {
out << m.a;
return out;
}
std::istream &operator>>(std::istream &in, modint<MOD> &m) {
ll a;
in >> a;
m = mint(a);
return in;
}
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
BiCoef<mint> bc(n_max);
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<mint> dp(k + 1);
rep(i, k + 1) dp[i] = bc.com(n - 1, i) * m * modpow(mint(m - 1), n - 1 - i);
mint ans = 0;
rep(i, k + 1) ans += dp[i];
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#define rreps(i, x) for (ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max() / 4;
const int n_max = 2e5 + 10;
#define int ll
void print() { cout << endl; }
// template <class Head, class... Tail>
// void print(Head&& head, Tail&&... tail) {
// cout << head;
// if (sizeof...(tail) != 0) cout << " ";
// print(forward<Tail>(tail)...);
// }
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<T> &vec, ll k) {
ll n = vec.size();
k = min(k, n);
rep(i, k - 1) cout << vec[i] << " ";
cout << vec[k - 1] << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
template <class T, class U> void print(pair<T, U> &p) {
cout << p.first << " " << p.second << "\n";
}
template <std::int_fast64_t Modulus> class modint {
using i64 = int_fast64_t;
public:
i64 a;
constexpr modint(const i64 x = 0) noexcept {
this->a = x % Modulus;
if (a < 0) {
a += Modulus;
}
}
constexpr int getmod() { return Modulus; }
constexpr modint operator-() const noexcept { return a ? Modulus - a : 0; }
// constexpr i64 &value() const noexcept {return a;}
constexpr const i64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
i64 a_ = rhs.a, b = Modulus, u = 1, v = 0;
while (b) {
i64 t = a_ / b;
a_ -= t * b;
swap(a_, b);
u -= t * v;
swap(u, v);
}
a = a * u % Modulus;
if (a < 0)
a += Modulus;
return *this;
}
// 自前実装
constexpr bool operator==(const modint rhs) noexcept { return a == rhs.a; }
constexpr bool operator!=(const modint rhs) noexcept { return a != rhs.a; }
constexpr bool operator>(const modint rhs) noexcept { return a > rhs.a; }
constexpr bool operator>=(const modint rhs) noexcept { return a >= rhs.a; }
constexpr bool operator<(const modint rhs) noexcept { return a < rhs.a; }
constexpr bool operator<=(const modint rhs) noexcept { return a <= rhs.a; }
// constexpr modint& operator++() noexcept {
// return (*this) += modint(1);
// }
// constexpr modint operator++(int) {
// modint tmp(*this);
// operator++();
// return tmp;
// }
// constexpr modint& operator--() noexcept {
// return (*this) -= modint(1);
// }
// constexpr modint operator--(int) {
// modint tmp(*this);
// operator--();
// return tmp;
// }
template <typename T>
friend constexpr modint modpow(const modint &mt, T n) noexcept {
if (n < 0) {
modint t = (modint(1) / mt);
return modpow(t, -n);
}
modint res = 1, tmp = mt;
while (n) {
if (n & 1)
res *= tmp;
tmp *= tmp;
n /= 2;
}
return res;
}
};
const ll MOD = 998244353;
using mint = modint<MOD>;
// 標準入出力対応
std::ostream &operator<<(std::ostream &out, const modint<MOD> &m) {
out << m.a;
return out;
}
std::istream &operator>>(std::istream &in, modint<MOD> &m) {
ll a;
in >> a;
m = mint(a);
return in;
}
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
BiCoef<mint> bc(n_max);
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n, m, k;
cin >> n >> m >> k;
vector<mint> dp(k + 1);
rep(i, k + 1) dp[i] = bc.com(n - 1, i) * m * modpow(mint(m - 1), n - 1 - i);
mint ans = 0;
rep(i, k + 1) ans += dp[i];
cout << ans << endl;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pb push_back
#define MOD 998244353
#define inf 3e18
#define vi vector<int>
#define vld vector<ld>
#define pii pair<int, int>
#define mii map<int, int>
#define fi first
#define se second
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
void inp_out() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
int bin_exp(int b, int e) {
if (e == 0)
return 1;
int a = bin_exp(b, e / 2);
if (e & 1)
return a * a * b;
else
return a * a;
}
int powm(int x, int y, int m = MOD) {
x = x % m;
int res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
int modInverse(int a, int m = MOD) { return powm(a, m - 2, m); }
int fact[100005];
int nCr(int n, int r) {
int res = (fact[n] * modInverse(fact[r])) % MOD;
res = (res * modInverse(fact[(n - r)])) % MOD;
return res;
}
int32_t main() {
fastIO inp_out();
int n, m, k;
cin >> n >> m >> k;
fact[0] = 1;
for (int i = 1; i < n; ++i)
fact[i] = (fact[i - 1] * i) % MOD;
int fa = 0;
for (int i = 0; i <= k; ++i) {
int ans = nCr(n - 1, i);
int bleft = n - i;
ans *= m;
ans %= MOD;
ans *= powm(m - 1, bleft - 1);
ans %= MOD;
fa += ans;
fa %= MOD;
}
cout << fa;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define pb push_back
#define MOD 998244353
#define inf 3e18
#define vi vector<int>
#define vld vector<ld>
#define pii pair<int, int>
#define mii map<int, int>
#define fi first
#define se second
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
void inp_out() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
int bin_exp(int b, int e) {
if (e == 0)
return 1;
int a = bin_exp(b, e / 2);
if (e & 1)
return a * a * b;
else
return a * a;
}
int powm(int x, int y, int m = MOD) {
x = x % m;
int res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
int modInverse(int a, int m = MOD) { return powm(a, m - 2, m); }
int fact[200005];
int nCr(int n, int r) {
int res = (fact[n] * modInverse(fact[r])) % MOD;
res = (res * modInverse(fact[(n - r)])) % MOD;
return res;
}
int32_t main() {
fastIO inp_out();
int n, m, k;
cin >> n >> m >> k;
fact[0] = 1;
for (int i = 1; i < n; ++i)
fact[i] = (fact[i - 1] * i) % MOD;
int fa = 0;
for (int i = 0; i <= k; ++i) {
int ans = nCr(n - 1, i);
int bleft = n - i;
ans *= m;
ans %= MOD;
ans *= powm(m - 1, bleft - 1);
ans %= MOD;
fa += ans;
fa %= MOD;
}
cout << fa;
return 0;
} | replace | 62 | 63 | 62 | 63 | -11 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v) {
is >> t;
}
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T t : v) {
os << t << " ";
}
os << "\n";
return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
// const int mod = 1000000007;
const int mod = 998244353;
struct mint {
ll x;
explicit mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator++() {
x += 1;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator--() {
x -= 1;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
bool operator==(const int &n) const {
mint a(n);
return this->x == a.x;
}
bool operator==(const ll &n) const {
mint a(n);
return this->x == a.x;
}
bool operator!=(const int &n) const {
mint a(n);
return this->x != a.x;
}
bool operator!=(const ll &n) const {
mint a(n);
return this->x != a.x;
}
mint pow(ll t) const {
mint res = mint(1), a(*this);
while (t > 0) {
if (t & 1)
res *= a;
t >>= 1;
a *= a;
}
return res;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &os, const mint &m) { return os << m.x; }
class combination {
vector<mint> fact, ifact;
public:
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = mint(1);
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * mint(i);
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * mint(i);
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return mint(0);
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(100010);
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m, k;
cin >> n >> m >> k;
mint ans(0);
rep(i, k + 1) {
mint nans(1);
nans *= mint(m - 1).pow(n - i - 1);
nans *= mint(m);
nans *= comb(n - 1, i);
ans += nans;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v) {
is >> t;
}
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T t : v) {
os << t << " ";
}
os << "\n";
return os;
}
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
// const int mod = 1000000007;
const int mod = 998244353;
struct mint {
ll x;
explicit mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator++() {
x += 1;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator--() {
x -= 1;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
bool operator==(const int &n) const {
mint a(n);
return this->x == a.x;
}
bool operator==(const ll &n) const {
mint a(n);
return this->x == a.x;
}
bool operator!=(const int &n) const {
mint a(n);
return this->x != a.x;
}
bool operator!=(const ll &n) const {
mint a(n);
return this->x != a.x;
}
mint pow(ll t) const {
mint res = mint(1), a(*this);
while (t > 0) {
if (t & 1)
res *= a;
t >>= 1;
a *= a;
}
return res;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &os, const mint &m) { return os << m.x; }
class combination {
vector<mint> fact, ifact;
public:
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = mint(1);
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * mint(i);
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * mint(i);
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return mint(0);
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(200010);
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, m, k;
cin >> n >> m >> k;
mint ans(0);
rep(i, k + 1) {
mint nans(1);
nans *= mint(m - 1).pow(n - i - 1);
nans *= mint(m);
nans *= comb(n - 1, i);
ans += nans;
}
cout << ans << endl;
}
| replace | 146 | 147 | 146 | 147 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
mint c(ll n, ll k) {
mint md = 1;
mint me = 1;
rep(i, k) {
md *= (n - i);
me *= (k - i);
}
md *= me.inv();
return md;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
mint ans(0);
mint mb(m - 1);
mint mbpow = mb.pow(n - k - 1);
mint ccc = c(n - 1, k);
rep(i, k + 1) {
mint ma(m);
ma *= mbpow;
ma *= c(n - 1, k - i);
ans += ma;
mbpow *= mb;
ccc *= k - i;
ccc /= (n - k + i);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
mint c(ll n, ll k) {
mint md = 1;
mint me = 1;
rep(i, k) {
md *= (n - i);
me *= (k - i);
}
md *= me.inv();
return md;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
mint ans(0);
mint mb(m - 1);
mint mbpow = mb.pow(n - k - 1);
mint ccc = c(n - 1, k);
rep(i, k + 1) {
mint ma(m);
ma *= mbpow;
ma *= ccc;
ans += ma;
mbpow *= mb;
ccc *= k - i;
ccc /= (n - k + i);
}
cout << ans << endl;
return 0;
}
| replace | 76 | 77 | 76 | 77 | TLE | |
p02685 | C++ | Runtime Error | // by szh
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define SZ(x) (int((x).size()))
#define se second
#define ll long long
#define pq priority_queue
#define MP make_pair
#define pii pair<int, int>
#define mod 998244353
#define inf 0x3f3f3f3f
#define debug(x) cerr << #x << "=" << x << '\n'
#define rep(i, a, b) for (int i = a; i < (b); i++)
const int maxn = 1e5 + 10;
int n, m, K;
ll fact[maxn], invf[maxn];
ll p0w(ll base, int p) {
ll res = 1;
while (p) {
if (p % 2 == 1)
(res *= base) %= mod;
(base *= base) %= mod;
p /= 2;
}
return res;
}
ll C(int x, int y) {
if (y == 0 || x == y)
return 1;
return fact[x] * invf[y] % mod * invf[x - y] % mod;
}
int main() {
std::ios::sync_with_stdio(false);
invf[0] = fact[0] = 1;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * (ll)i % mod;
invf[i] = p0w(fact[i], mod - 2);
}
cin >> n >> m >> K;
n--;
int ans = 0;
rep(i, 0, K + 1) { (ans += C(n, i) * p0w(m - 1, n - i) % mod) %= mod; }
ans = (ll)ans * (ll)m % mod;
cout << ans;
return 0;
}
| // by szh
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define SZ(x) (int((x).size()))
#define se second
#define ll long long
#define pq priority_queue
#define MP make_pair
#define pii pair<int, int>
#define mod 998244353
#define inf 0x3f3f3f3f
#define debug(x) cerr << #x << "=" << x << '\n'
#define rep(i, a, b) for (int i = a; i < (b); i++)
const int maxn = 3e5 + 10;
int n, m, K;
ll fact[maxn], invf[maxn];
ll p0w(ll base, int p) {
ll res = 1;
while (p) {
if (p % 2 == 1)
(res *= base) %= mod;
(base *= base) %= mod;
p /= 2;
}
return res;
}
ll C(int x, int y) {
if (y == 0 || x == y)
return 1;
return fact[x] * invf[y] % mod * invf[x - y] % mod;
}
int main() {
std::ios::sync_with_stdio(false);
invf[0] = fact[0] = 1;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * (ll)i % mod;
invf[i] = p0w(fact[i], mod - 2);
}
cin >> n >> m >> K;
n--;
int ans = 0;
rep(i, 0, K + 1) { (ans += C(n, i) * p0w(m - 1, n - i) % mod) %= mod; }
ans = (ll)ans * (ll)m % mod;
cout << ans;
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define f(i, l, h) for (ll i = l; i < h; i++)
#define fr(i, h, l) for (ll i = h; i >= l; i--)
using namespace std;
typedef pair<ll, ll> pll;
const ll mod = (ll)(998244353);
typedef vector<ll> vll;
ll fact[(ll)(2e5 + 1)];
ll poww(ll a, ll b) {
ll res = 1;
a %= mod;
while (b > 0) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
ll C(ll n, ll r) {
if (n < r) {
return 0;
}
ll lower = n - r, curr = 1;
while (n > lower) {
curr = (curr * n) % mod;
n--;
}
return (curr * poww(fact[r], mod - 2)) % mod;
}
int main() {
// cout << "Hello world!" << endl;
ll n, m, k;
cin >> n >> m >> k;
fact[0] = 1;
f(i, 1, 2e5 + 1) { fact[i] = (fact[i - 1] * i) % mod; }
ll temp = 0;
f(i, 0, k + 1) {
temp = (temp + (((C(n - 1, i) * m) % mod) * poww(m - 1, n - 1 - i)) % mod) %
mod;
}
cout << temp << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define f(i, l, h) for (ll i = l; i < h; i++)
#define fr(i, h, l) for (ll i = h; i >= l; i--)
using namespace std;
typedef pair<ll, ll> pll;
const ll mod = (ll)(998244353);
typedef vector<ll> vll;
ll fact[(ll)(2e5 + 1)];
ll poww(ll a, ll b) {
ll res = 1;
a %= mod;
while (b > 0) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
ll C(ll n, ll r) {
if (n < r) {
return 0;
}
return (((poww(fact[n - r], mod - 2) * poww(fact[r], mod - 2)) % mod) *
fact[n]) %
mod;
}
int main() {
// cout << "Hello world!" << endl;
ll n, m, k;
cin >> n >> m >> k;
fact[0] = 1;
f(i, 1, 2e5 + 1) { fact[i] = (fact[i - 1] * i) % mod; }
ll temp = 0;
f(i, 0, k + 1) {
temp = (temp + (((C(n - 1, i) * m) % mod) * poww(m - 1, n - 1 - i)) % mod) %
mod;
}
cout << temp << endl;
return 0;
}
| replace | 34 | 43 | 34 | 37 | TLE | |
p02685 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define VI vector<int>
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
int t; \
cin >> t; \
t; \
})
#define PII pair<int, int>
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define ERR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
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> istream &operator>>(istream &is, vector<T> &V) {
for (auto &&ele : V)
is >> ele;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]\n";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template <class F> struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args> decltype(auto) operator()(Args &&...args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F> y_combinator<std::decay_t<F>> recursive(F &&f) {
return {std::forward<F>(f)};
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T, typename U> std::vector<T> multi_vector(int n, U v) {
return std::vector<T>(n, v);
}
template <typename U, typename... Args> auto multi_vector(int n, Args... args) {
auto val = multi_vector<U>(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 1000010;
const int MOD = 998244353;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
class EColorfulBlocks {
public:
#define int ll
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int N, M, K;
cin >> N >> M >> K;
mint ans = mint(M).pow(N);
REP(i, N - K - 1)
ans -= (mint(M) * mint(M - 1).pow(i)) * mint(N - 1).choose(i);
print(ans);
}
};
#undef int
int main() {
EColorfulBlocks solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
solver.solve(in, out, err);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define VI vector<int>
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
int t; \
cin >> t; \
t; \
})
#define PII pair<int, int>
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define ERR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
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> istream &operator>>(istream &is, vector<T> &V) {
for (auto &&ele : V)
is >> ele;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]\n";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template <class F> struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args> decltype(auto) operator()(Args &&...args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F> y_combinator<std::decay_t<F>> recursive(F &&f) {
return {std::forward<F>(f)};
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T, typename U> std::vector<T> multi_vector(int n, U v) {
return std::vector<T>(n, v);
}
template <typename U, typename... Args> auto multi_vector(int n, Args... args) {
auto val = multi_vector<U>(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 1000010;
const int MOD = 998244353;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
class EColorfulBlocks {
public:
#define int ll
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int N, M, K;
cin >> N >> M >> K;
mint ans = mint(M).pow(N);
if (M == 1) {
if (K == N - 1)
print(1);
else
print(0);
} else {
REP(i, N - K - 1)
ans -= mint(M) * (mint(M - 1).pow(i)) * mint(N - 1).choose(i);
print(ans);
}
}
};
#undef int
int main() {
EColorfulBlocks solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
solver.solve(in, out, err);
return 0;
}
| replace | 438 | 441 | 438 | 448 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
/*** MOD CALCULATION ***/
const int MOD = 998244353;
const int MAX = 200100;
ll addM(ll a, ll b) { return (a + b) % MOD; }
ll mulM(ll a, ll b) {
ll temp = (a * b) % MOD;
while (temp < 0) {
temp += MOD;
}
return temp;
}
ll powM(ll a, ll b) {
if (b == 0)
return 1;
else if (b == 1)
return a % MOD;
else if (b % 2 == 0)
return mulM(powM(a, b / 2), powM(a, b / 2));
else
return mulM(a, mulM(powM(a, (b - 1) / 2), powM(a, (b - 1) / 2)));
}
// b^{-1} = b^{p-2} (mod p)
// a/b = a*b^{p-2} (mod p)
ll divM(ll a, ll b) { return mulM(a, powM(b, MOD - 2)); }
// n!, (n!)^{-1} のテーブル作成
ll fac[MAX], finv[MAX], inv[MAX];
void COMBinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep3(i, 2, MAX - 1) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll 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;
}
/*** MOD CALCULATION ここまで ***/
void Main() {
ll n, m, k;
cin >> n >> m >> k;
COMBinit();
ll ans = 0;
rep(i, k + 1) {
ll temp = m;
rep(j, n - i - 1) temp = mulM(temp, m - 1);
ll c = COMB(n - 1, i);
temp = mulM(temp, c);
ans = addM(ans, temp);
// cout << ans << endl;
}
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
/*** MOD CALCULATION ***/
const int MOD = 998244353;
const int MAX = 200100;
ll addM(ll a, ll b) { return (a + b) % MOD; }
ll mulM(ll a, ll b) {
ll temp = (a * b) % MOD;
while (temp < 0) {
temp += MOD;
}
return temp;
}
ll powM(ll a, ll b) {
if (b == 0)
return 1;
else if (b == 1)
return a % MOD;
else if (b % 2 == 0)
return mulM(powM(a, b / 2), powM(a, b / 2));
else
return mulM(a, mulM(powM(a, (b - 1) / 2), powM(a, (b - 1) / 2)));
}
// b^{-1} = b^{p-2} (mod p)
// a/b = a*b^{p-2} (mod p)
ll divM(ll a, ll b) { return mulM(a, powM(b, MOD - 2)); }
// n!, (n!)^{-1} のテーブル作成
ll fac[MAX], finv[MAX], inv[MAX];
void COMBinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep3(i, 2, MAX - 1) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll 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;
}
/*** MOD CALCULATION ここまで ***/
void Main() {
ll n, m, k;
cin >> n >> m >> k;
COMBinit();
ll ans = 0;
rep(i, k + 1) {
ll temp = m;
temp = mulM(temp, powM(m - 1, n - i - 1));
temp = mulM(temp, COMB(n - 1, i));
ans = addM(ans, temp);
// cout << ans << endl;
}
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
| replace | 83 | 86 | 83 | 85 | TLE | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
mint combination(int a, int b) {
mint ans = 1;
if (a - b > b) {
b = a - b;
}
for (int i = a; i > b; i--) {
ans *= i;
}
for (int i = a - b; i > 0; i--) {
ans /= i;
}
return ans;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
mint ans = 0;
mint mm = m;
mint mm1 = m - 1;
for (int i = 0; i <= k; i++) {
ans += mm * mm1.pow(n - 1 - i) * combination(n - 1, i);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
mint combination(int a, int b) {
mint ans = 1;
if (a - b > b) {
b = a - b;
}
for (int i = a; i > b; i--) {
ans *= i;
}
for (int i = a - b; i > 0; i--) {
ans /= i;
}
return ans;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
mint ans = 0;
mint mm = m;
mint mm1 = m - 1;
mint p = mm * mm1.pow(n - 1 - k);
mint c = combination(n - 1, k);
for (int i = k; i >= 0; i--) {
ans += p * c;
p *= mm1;
c *= i;
c /= (n - 1 - i + 1);
}
cout << ans << endl;
}
| replace | 67 | 69 | 67 | 74 | TLE | |
p02685 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(vector<long long int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(set<int> a) {
for (auto x : a)
cout << x << " ";
cout << endl;
}
// mod計算用のクラス
// ModInt a = {1,1000000007}みたいな定義もできる.
// modがデフォルト(1000000007)じゃない場合は(ModInt)a+(int)xみたいなものに注意.デフォルトを書き換えれば大丈夫.
// 「各メンバーに対して、コピーコンストラクターあるいは代入演算子を順に呼び出す」
// という仕様になっている.
// (int)1 + (ModInt)10
// みたいなことは出来ない.非メンバで定義する必要がある（と思う）.
class ModInt {
public:
long long int x;
long long int mod;
ModInt() {}
ModInt(long long int _x, long long int _mod = 998244353) {
this->x = ((_x % _mod) + _mod) % _mod;
this->mod = _mod;
}
ModInt operator-() const { return ModInt(-this->x, this->mod); }
ModInt operator+(const ModInt &other) const {
return ModInt(this->x + (other.x % this->mod), this->mod);
}
ModInt operator+=(const ModInt &other) {
*this = *this + other;
return *this;
}
ModInt operator-(const ModInt &other) const {
long long int res = this->x - (other.x % this->mod);
if (res < 0)
return ModInt(res + this->mod, this->mod);
return ModInt(res, this->mod);
}
ModInt operator-=(const ModInt &other) {
*this = *this - other;
return *this;
}
ModInt operator*(const ModInt &other) const {
return ModInt(this->x * (other.x % this->mod), this->mod);
}
ModInt operator*=(const ModInt &other) {
*this = *this * other;
return *this;
}
ModInt operator/(const ModInt &other) const {
return ModInt(*this * other.inv());
}
ModInt operator/=(const ModInt &other) {
*this = *this / other;
return *this;
}
ModInt pow(long long int n) const {
ModInt res(1, this->mod), a(this->x, this->mod);
while (n) {
if (n & 1) {
res = res * a;
}
n >>= 1;
a = a * a;
}
return res;
}
ModInt inv() const { return ModInt(this->pow(this->mod - 2)); }
void disp() { cout << this->x << endl; }
};
ostream &operator<<(ostream &stream, const ModInt m) {
stream << to_string(m.x);
return stream;
}
// mod nCrを返す関数.何回も計算するときはこっち.ModIntが必要.
class modcomb {
public:
vector<ModInt> fact;
vector<ModInt> ifact;
modcomb() {}
modcomb(int n) {
this->fact.resize(n + 1, ModInt(1));
this->ifact.resize(n + 1, ModInt(1));
for (int i = 1; i <= n; i++)
this->fact[i] = this->fact[i - 1] * i;
this->ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
this->ifact[i - 1] = ifact[i] * i;
}
ModInt operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return this->fact[n] * this->ifact[k] * this->ifact[n - k];
}
};
int main() {
int n, m, k;
cin >> n >> m >> k;
ll mod = 998244353;
ModInt ans = 0;
modcomb c(100005);
rep(i, k + 1) {
ans = ans + c(n - 1, i) * ModInt(m) * ModInt(m - 1).pow(n - i - 1);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long int;
const int inf = 1001001000;
const long long int Inf = 1001001001001001000;
void print(vector<vector<int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<vector<long long int>> a) {
for (int i = 0; i < a.size(); i++) {
for (int j = 0; j < a[i].size(); j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
void print(vector<int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(vector<long long int> a) {
int n = a.size();
for (int j = 0; j < n; j++) {
if (j != n - 1)
cout << a[j] << " ";
else
cout << a[j] << endl;
}
}
void print(set<int> a) {
for (auto x : a)
cout << x << " ";
cout << endl;
}
// mod計算用のクラス
// ModInt a = {1,1000000007}みたいな定義もできる.
// modがデフォルト(1000000007)じゃない場合は(ModInt)a+(int)xみたいなものに注意.デフォルトを書き換えれば大丈夫.
// 「各メンバーに対して、コピーコンストラクターあるいは代入演算子を順に呼び出す」
// という仕様になっている.
// (int)1 + (ModInt)10
// みたいなことは出来ない.非メンバで定義する必要がある（と思う）.
class ModInt {
public:
long long int x;
long long int mod;
ModInt() {}
ModInt(long long int _x, long long int _mod = 998244353) {
this->x = ((_x % _mod) + _mod) % _mod;
this->mod = _mod;
}
ModInt operator-() const { return ModInt(-this->x, this->mod); }
ModInt operator+(const ModInt &other) const {
return ModInt(this->x + (other.x % this->mod), this->mod);
}
ModInt operator+=(const ModInt &other) {
*this = *this + other;
return *this;
}
ModInt operator-(const ModInt &other) const {
long long int res = this->x - (other.x % this->mod);
if (res < 0)
return ModInt(res + this->mod, this->mod);
return ModInt(res, this->mod);
}
ModInt operator-=(const ModInt &other) {
*this = *this - other;
return *this;
}
ModInt operator*(const ModInt &other) const {
return ModInt(this->x * (other.x % this->mod), this->mod);
}
ModInt operator*=(const ModInt &other) {
*this = *this * other;
return *this;
}
ModInt operator/(const ModInt &other) const {
return ModInt(*this * other.inv());
}
ModInt operator/=(const ModInt &other) {
*this = *this / other;
return *this;
}
ModInt pow(long long int n) const {
ModInt res(1, this->mod), a(this->x, this->mod);
while (n) {
if (n & 1) {
res = res * a;
}
n >>= 1;
a = a * a;
}
return res;
}
ModInt inv() const { return ModInt(this->pow(this->mod - 2)); }
void disp() { cout << this->x << endl; }
};
ostream &operator<<(ostream &stream, const ModInt m) {
stream << to_string(m.x);
return stream;
}
// mod nCrを返す関数.何回も計算するときはこっち.ModIntが必要.
class modcomb {
public:
vector<ModInt> fact;
vector<ModInt> ifact;
modcomb() {}
modcomb(int n) {
this->fact.resize(n + 1, ModInt(1));
this->ifact.resize(n + 1, ModInt(1));
for (int i = 1; i <= n; i++)
this->fact[i] = this->fact[i - 1] * i;
this->ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
this->ifact[i - 1] = ifact[i] * i;
}
ModInt operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return this->fact[n] * this->ifact[k] * this->ifact[n - k];
}
};
int main() {
int n, m, k;
cin >> n >> m >> k;
ll mod = 998244353;
ModInt ans = 0;
modcomb c(200005);
rep(i, k + 1) {
ans = ans + c(n - 1, i) * ModInt(m) * ModInt(m - 1).pow(n - i - 1);
}
cout << ans << endl;
return 0;
} | replace | 164 | 165 | 164 | 165 | 0 | |
p02685 | C++ | Runtime Error | #include <iostream>
#include <vector>
uint32_t pow_mod(uint32_t base, uint32_t exp, uint32_t mod) {
if (exp == 1)
return base % mod;
uint64_t half = pow_mod(base, exp / 2, mod);
uint64_t ans = (half * half) % mod;
return (ans * (exp % 2 == 0 ? 1ll : base)) % mod;
}
uint32_t inv_mod(uint32_t x, uint32_t mod) { return pow_mod(x, mod - 2, mod); }
uint32_t comb_mod(uint32_t n, uint32_t k, const std::vector<uint64_t> &fact_mod,
uint32_t mod) {
if (n < k)
return -1;
return (fact_mod[n] * inv_mod((fact_mod[n - k] * fact_mod[k]) % mod, mod)) %
mod;
}
int main() {
const uint32_t mod = 998'244'353;
uint32_t N = 0, M = 0, K = 0;
std::cin >> N >> M >> K;
std::vector<uint64_t> fact_mod(N, 1);
for (size_t i = 1; i < fact_mod.size(); i++)
fact_mod[i] = (i * fact_mod[i - 1]) % mod;
uint32_t ans = 0;
for (size_t k = 0; k < K + 1; k++) {
uint64_t pow = pow_mod(M - 1, N - 1 - k, mod);
pow = (pow * M) % mod;
uint64_t comb = comb_mod(N - 1, k, fact_mod, mod);
ans = (ans + (pow * comb) % mod) % mod;
}
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
#include <vector>
uint32_t pow_mod(uint32_t base, uint32_t exp, uint32_t mod) {
if (exp == 0)
return 1;
uint64_t half = pow_mod(base, exp / 2, mod);
uint64_t ans = (half * half) % mod;
return (ans * (exp % 2 == 0 ? 1ll : base)) % mod;
}
uint32_t inv_mod(uint32_t x, uint32_t mod) { return pow_mod(x, mod - 2, mod); }
uint32_t comb_mod(uint32_t n, uint32_t k, const std::vector<uint64_t> &fact_mod,
uint32_t mod) {
if (n < k)
return -1;
return (fact_mod[n] * inv_mod((fact_mod[n - k] * fact_mod[k]) % mod, mod)) %
mod;
}
int main() {
const uint32_t mod = 998'244'353;
uint32_t N = 0, M = 0, K = 0;
std::cin >> N >> M >> K;
std::vector<uint64_t> fact_mod(N, 1);
for (size_t i = 1; i < fact_mod.size(); i++)
fact_mod[i] = (i * fact_mod[i - 1]) % mod;
uint32_t ans = 0;
for (size_t k = 0; k < K + 1; k++) {
uint64_t pow = pow_mod(M - 1, N - 1 - k, mod);
pow = (pow * M) % mod;
uint64_t comb = comb_mod(N - 1, k, fact_mod, mod);
ans = (ans + (pow * comb) % mod) % mod;
}
std::cout << ans << std::endl;
return 0;
} | replace | 4 | 6 | 4 | 6 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i) >= min((a), (b))) && ((i) <= max((a), (b))))
#define show(x) cout << #x << " is " << x << "\n";
typedef vector<ll> vi;
#define fi first
#define se second
const ll mod = 998244353;
const ll N = 1e5 + 1;
const ll inf = 1e18;
ll modfac[N];
ll modfacinv[N];
ll invsi[N];
ll power(ll x, ll y, ll M = inf) {
ll ans = 1;
x %= M;
while (y) {
if (y & 1)
ans = (x * ans) % M;
x = (x * x) % M;
y >>= 1;
}
return ans;
}
ll modInverse(ll n) { return power(n, mod - 2, mod); }
inline ll mul(ll a, ll b) { return (a * b) % mod; }
inline ll sub(ll a, ll b) {
ll c = a - b;
if (c < 0)
c += mod;
return c;
}
inline ll add(ll a, ll b) {
ll c = a + b;
if (c > mod)
c -= mod;
return c;
}
inline ll divi(ll a, ll b) { return mul(a, modInverse(b)); }
void simake() {
invsi[0] = 1;
invsi[1] = 1;
modfac[0] = 1;
modfac[1] = 1;
modfacinv[0] = 1;
modfacinv[1] = 1;
for (ll i = 2; i < N; i++) {
invsi[i] = mul(invsi[mod % i], (mod - (mod / i)));
modfac[i] = mul(i, modfac[i - 1]);
modfacinv[i] = mul(invsi[i], modfacinv[i - 1]);
}
}
ll nCrm(ll n, ll r) {
if (n == r || r == 0)
return 1;
if (n < r)
return 0;
return mul(mul(modfac[n], modfacinv[r]), modfacinv[n - r]);
}
// const ll N = 1e5 + 1;
// vector<ll> adj[N];
// bool visited[N];
int main() {
simake();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k, m;
cin >> n >> m >> k;
ll ans = 0;
for (int i = 0; i <= k; i++) {
ll x = mul(power(m - 1, n - i - 1, mod), nCrm(n - 1, i));
// cout<<x<<" ";
ans = add(ans, x);
}
cout << (ans * m) % mod;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(t) t.begin(), t.end()
#define inrange(i, a, b) (((i) >= min((a), (b))) && ((i) <= max((a), (b))))
#define show(x) cout << #x << " is " << x << "\n";
typedef vector<ll> vi;
#define fi first
#define se second
const ll mod = 998244353;
const ll N = 2e5 + 1;
const ll inf = 1e18;
ll modfac[N];
ll modfacinv[N];
ll invsi[N];
ll power(ll x, ll y, ll M = inf) {
ll ans = 1;
x %= M;
while (y) {
if (y & 1)
ans = (x * ans) % M;
x = (x * x) % M;
y >>= 1;
}
return ans;
}
ll modInverse(ll n) { return power(n, mod - 2, mod); }
inline ll mul(ll a, ll b) { return (a * b) % mod; }
inline ll sub(ll a, ll b) {
ll c = a - b;
if (c < 0)
c += mod;
return c;
}
inline ll add(ll a, ll b) {
ll c = a + b;
if (c > mod)
c -= mod;
return c;
}
inline ll divi(ll a, ll b) { return mul(a, modInverse(b)); }
void simake() {
invsi[0] = 1;
invsi[1] = 1;
modfac[0] = 1;
modfac[1] = 1;
modfacinv[0] = 1;
modfacinv[1] = 1;
for (ll i = 2; i < N; i++) {
invsi[i] = mul(invsi[mod % i], (mod - (mod / i)));
modfac[i] = mul(i, modfac[i - 1]);
modfacinv[i] = mul(invsi[i], modfacinv[i - 1]);
}
}
ll nCrm(ll n, ll r) {
if (n == r || r == 0)
return 1;
if (n < r)
return 0;
return mul(mul(modfac[n], modfacinv[r]), modfacinv[n - r]);
}
// const ll N = 1e5 + 1;
// vector<ll> adj[N];
// bool visited[N];
int main() {
simake();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k, m;
cin >> n >> m >> k;
ll ans = 0;
for (int i = 0; i <= k; i++) {
ll x = mul(power(m - 1, n - i - 1, mod), nCrm(n - 1, i));
// cout<<x<<" ";
ans = add(ans, x);
}
cout << (ans * m) % mod;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 998244353;
struct mint {
int64_t x;
mint(int64_t x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(int64_t n) const {
if (n == 0)
return 1;
mint t = pow(n >> 1);
t *= t;
if (n & 1)
t *= *this;
return t;
}
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
vector<mint> fac;
vector<mint> fac_inv;
vector<mint> inv;
void init_comb(int mx) {
fac = vector<mint>(mx + 1), fac_inv = vector<mint>(mx + 1),
inv = vector<mint>(mx + 1);
fac.at(0) = fac.at(1) = 1;
fac_inv.at(0) = fac_inv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i <= mx; i++) {
fac.at(i) = fac.at(i - 1) * i;
inv.at(i) = -inv.at(MOD % i) * (MOD / i);
fac_inv.at(i) = fac_inv.at(i - 1) * inv.at(i);
}
}
mint comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * fac_inv.at(k) * fac_inv.at(n - k);
}
int main() {
int N, M, K;
cin >> N >> M >> K;
init_comb(N - 1);
mint res = 0;
for (int i = 0; i < K + 1; i++) {
res += mint(M) * comb(N - 1, i) * mint(M - 1).pow(N - 1 - i);
}
cout << res.x << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 998244353;
struct mint {
int64_t x;
mint(int64_t x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(int64_t n) const {
if (n == 0)
return 1;
mint t = pow(n >> 1);
t *= t;
if (n & 1)
t *= *this;
return t;
}
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
vector<mint> fac;
vector<mint> fac_inv;
vector<mint> inv;
void init_comb(int mx) {
fac = vector<mint>(mx + 1), fac_inv = vector<mint>(mx + 1),
inv = vector<mint>(mx + 1);
fac.at(0) = fac.at(1) = 1;
fac_inv.at(0) = fac_inv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i <= mx; i++) {
fac.at(i) = fac.at(i - 1) * i;
inv.at(i) = -inv.at(MOD % i) * (MOD / i);
fac_inv.at(i) = fac_inv.at(i - 1) * inv.at(i);
}
}
mint comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * fac_inv.at(k) * fac_inv.at(n - k);
}
int main() {
int N, M, K;
cin >> N >> M >> K;
init_comb(2 * 1e5);
mint res = 0;
for (int i = 0; i < K + 1; i++) {
res += mint(M) * comb(N - 1, i) * mint(M - 1).pow(N - 1 - i);
}
cout << res.x << endl;
} | replace | 66 | 67 | 66 | 67 | 0 | |
p02685 | C++ | Runtime Error | // Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
const ll MOD = 998244353;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
struct mi {
ll v;
explicit operator ll() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
if (v < 0)
v += MOD;
}
friend bool operator==(const mi &a, const mi &b) { return a.v == b.v; }
friend bool operator!=(const mi &a, const mi &b) { return !(a == b); }
friend bool operator<(const mi &a, const mi &b) { return a.v < b.v; }
mi &operator+=(const mi &m) {
if ((v += m.v) >= MOD)
v -= MOD;
return *this;
}
mi &operator-=(const mi &m) {
if ((v -= m.v) < 0)
v += MOD;
return *this;
}
mi &operator*=(const mi &m) {
v = v * m.v % MOD;
return *this;
}
mi &operator/=(const mi &m) { return (*this) *= inv(m); }
friend mi pow(mi a, ll p) {
mi ans = 1;
assert(p >= 0);
for (; p; p /= 2, a *= a)
if (p & 1)
ans *= a;
return ans;
}
friend mi inv(const mi &a) {
assert(a.v != 0);
return pow(a, MOD - 2);
}
mi operator-() const { return mi(-v); }
mi &operator++() { return *this += 1; }
mi &operator--() { return *this -= 1; }
mi operator++(int) {
mi temp;
temp.v = v++;
return temp;
}
mi operator--(int) {
mi temp;
temp.v = v--;
return temp;
}
friend mi operator+(mi a, const mi &b) { return a += b; }
friend mi operator-(mi a, const mi &b) { return a -= b; }
friend mi operator*(mi a, const mi &b) { return a *= b; }
friend mi operator/(mi a, const mi &b) { return a /= b; }
friend ostream &operator<<(ostream &os, const mi &m) {
os << m.v;
return os;
}
friend istream &operator>>(istream &is, mi &m) {
ll x;
is >> x;
m.v = x;
return is;
}
};
typedef vector<mi> vmi;
typedef pair<mi, mi> pmi;
typedef vector<pmi> vpmi;
mi facs[MAX];
mi facInvs[MAX];
mi choose(mi _a, mi _b) {
ll a = (ll)_a, b = (ll)_b;
if (b > a)
return 0;
if (a < 0)
return 0;
if (b < 0)
return 0;
mi cur = facs[a];
cur = cur * facInvs[b];
cur = cur * facInvs[a - b];
return cur;
}
void initFacs() {
facs[0] = 1;
facInvs[0] = 1;
for (int i = 1; i < MAX; i++) {
facs[i] = (facs[i - 1] * i);
facInvs[i] = inv(facs[i]);
}
}
void solve() {
ll n, m, k;
cin >> n >> m >> k;
initFacs();
mi ans = 0;
mi mm = m;
for (int i = 0; i <= k; i++) {
ans += m * choose(n - 1, i) * pow(1, k) * pow(mm - 1, n - 1 - i);
}
cout << ans;
}
int main() {
hs;
ll t;
t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} | // Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
const ll MOD = 998244353;
const ll INF = 1e18;
const ll MAX = 200008;
//
//
struct mi {
ll v;
explicit operator ll() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-MOD < _v && _v < MOD) ? _v : _v % MOD;
if (v < 0)
v += MOD;
}
friend bool operator==(const mi &a, const mi &b) { return a.v == b.v; }
friend bool operator!=(const mi &a, const mi &b) { return !(a == b); }
friend bool operator<(const mi &a, const mi &b) { return a.v < b.v; }
mi &operator+=(const mi &m) {
if ((v += m.v) >= MOD)
v -= MOD;
return *this;
}
mi &operator-=(const mi &m) {
if ((v -= m.v) < 0)
v += MOD;
return *this;
}
mi &operator*=(const mi &m) {
v = v * m.v % MOD;
return *this;
}
mi &operator/=(const mi &m) { return (*this) *= inv(m); }
friend mi pow(mi a, ll p) {
mi ans = 1;
assert(p >= 0);
for (; p; p /= 2, a *= a)
if (p & 1)
ans *= a;
return ans;
}
friend mi inv(const mi &a) {
assert(a.v != 0);
return pow(a, MOD - 2);
}
mi operator-() const { return mi(-v); }
mi &operator++() { return *this += 1; }
mi &operator--() { return *this -= 1; }
mi operator++(int) {
mi temp;
temp.v = v++;
return temp;
}
mi operator--(int) {
mi temp;
temp.v = v--;
return temp;
}
friend mi operator+(mi a, const mi &b) { return a += b; }
friend mi operator-(mi a, const mi &b) { return a -= b; }
friend mi operator*(mi a, const mi &b) { return a *= b; }
friend mi operator/(mi a, const mi &b) { return a /= b; }
friend ostream &operator<<(ostream &os, const mi &m) {
os << m.v;
return os;
}
friend istream &operator>>(istream &is, mi &m) {
ll x;
is >> x;
m.v = x;
return is;
}
};
typedef vector<mi> vmi;
typedef pair<mi, mi> pmi;
typedef vector<pmi> vpmi;
mi facs[MAX];
mi facInvs[MAX];
mi choose(mi _a, mi _b) {
ll a = (ll)_a, b = (ll)_b;
if (b > a)
return 0;
if (a < 0)
return 0;
if (b < 0)
return 0;
mi cur = facs[a];
cur = cur * facInvs[b];
cur = cur * facInvs[a - b];
return cur;
}
void initFacs() {
facs[0] = 1;
facInvs[0] = 1;
for (int i = 1; i < MAX; i++) {
facs[i] = (facs[i - 1] * i);
facInvs[i] = inv(facs[i]);
}
}
void solve() {
ll n, m, k;
cin >> n >> m >> k;
initFacs();
mi ans = 0;
mi mm = m;
for (int i = 0; i <= k; i++) {
ans += m * choose(n - 1, i) * pow(1, k) * pow(mm - 1, n - 1 - i);
}
cout << ans;
}
int main() {
hs;
ll t;
t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define dcout cout << fixed << setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
constexpr int MOD = 998244353;
constexpr ll inf = 1LL << 60;
// lcm//
ll gcd(ll x, ll y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
// a^n mod p//
ll modpow(ll a, ll n, ll p) {
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
// inversemod//
long long modinv(long long a, long long m) {
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;
}
// Cmonp//
ll 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;
}
}
//
ll 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;
}
// LARGE n
ll com(ll n, ll m) {
if (n < m || n <= 0 || m < 0) {
return 0;
}
if (m == 0 || n == m) {
return 1;
}
ll k = 1;
for (ll i = 1; i <= m; i++) {
k *= (n - i + 1);
k %= MOD;
k *= modinv(i, MOD);
k %= MOD;
}
return k;
}
// radP
ll rad(ll u, ll p) {
ll cnt = 0;
while (u % p == 0) {
u /= p;
cnt++;
}
return cnt;
}
////////////////////////////////////////////////////////////////////
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll ans = 0;
COMinit();
for (ll i = 0; i <= k; i++) {
ll notc = n - 1 - i;
ll val = 1;
val *= m;
val *= modpow(m - 1, notc, MOD);
val %= MOD;
val *= COM(n - 1, i);
val %= MOD;
ans += val;
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define dcout cout << fixed << setprecision(15);
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
constexpr int MOD = 998244353;
constexpr ll inf = 1LL << 60;
// lcm//
ll gcd(ll x, ll y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
// a^n mod p//
ll modpow(ll a, ll n, ll p) {
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
// inversemod//
long long modinv(long long a, long long m) {
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;
}
// Cmonp//
ll 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;
}
}
//
ll 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;
}
// LARGE n
ll com(ll n, ll m) {
if (n < m || n <= 0 || m < 0) {
return 0;
}
if (m == 0 || n == m) {
return 1;
}
ll k = 1;
for (ll i = 1; i <= m; i++) {
k *= (n - i + 1);
k %= MOD;
k *= modinv(i, MOD);
k %= MOD;
}
return k;
}
// radP
ll rad(ll u, ll p) {
ll cnt = 0;
while (u % p == 0) {
u /= p;
cnt++;
}
return cnt;
}
////////////////////////////////////////////////////////////////////
int main() {
ll n, m, k;
cin >> n >> m >> k;
ll ans = 0;
COMinit();
for (ll i = 0; i <= k; i++) {
ll notc = n - 1 - i;
ll val = 1;
val *= m;
if (notc != 0) {
val *= modpow(m - 1, notc, MOD);
} else {
val *= 1;
}
val %= MOD;
val *= COM(n - 1, i);
val %= MOD;
ans += val;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 112 | 113 | 112 | 117 | 0 | |
p02685 | C++ | Runtime Error | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 998244353;
// 二分累乗法
template <typename T> T modpow(T a, T n, T mod) {
T ret = 1;
if (mod == 1) {
while (n > 0) {
if (n & 1) {
ret = ret * a;
}
a = a * a;
n >>= 1;
}
} else {
while (n > 0) {
if (n & 1) {
ret = ret * a % mod;
}
a = a * a % mod;
n >>= 1;
}
}
return ret;
}
vector<Int> factorials, invs;
bool is_ncr_table = false;
// modが素数の場合のみ
void calc_ncr_table(Int n, Int mod) {
is_ncr_table = true;
// 1! ~ n! の計算
Int f = 1;
factorials.push_back(f);
for (Int i = 1; i <= n; i++) {
f *= i;
f %= mod;
factorials.push_back(f);
}
// n!^-1 の計算
Int inv = modpow(factorials[n], mod - 2, mod);
// (n-1)!^-1 ~ 1!^-1 の計算
invs.assign(n, 1);
invs[n] = inv;
for (Int i = n; i >= 1; i--) {
inv *= i;
inv %= mod;
invs[i - 1] = inv;
}
}
// 一度だけnCrを計算するとき用の関数
Int factorial(Int n, Int mod = 1) {
Int ret = 1;
if (mod == 1) {
for (Int i = 1; i <= n; i++) {
ret *= i;
}
return ret;
} else {
for (Int i = 1; i <= n; i++) {
ret *= i;
ret %= mod;
}
return ret;
}
}
Int ncr(Int n, Int r, Int mod) {
if (n < r) {
return (Int)0;
} else {
if (is_ncr_table) {
// modが素数の場合のみ
return (factorials[n] * invs[r] % mod) * invs[n - r] % mod;
} else {
Int x = 1;
for (Int i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
return x * modpow(factorial(r, mod), mod - 2, mod) % mod;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
Int n, m, k;
cin >> n >> m >> k;
calc_ncr_table(n, MOD);
Int ans = 0;
for (Int i = k; i >= 0; --i) {
Int a, b, c;
a = m;
b = ncr(n - 1, n - i - 1, MOD);
c = modpow(m - 1, n - 1 - i, MOD);
a = (a * b) % MOD;
a = (a * c) % MOD;
ans = (ans + a) % MOD;
}
cout << ans << endl;
return 0;
} | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 998244353;
// 二分累乗法
template <typename T> T modpow(T a, T n, T mod) {
T ret = 1;
if (mod == 1) {
while (n > 0) {
if (n & 1) {
ret = ret * a;
}
a = a * a;
n >>= 1;
}
} else {
while (n > 0) {
if (n & 1) {
ret = ret * a % mod;
}
a = a * a % mod;
n >>= 1;
}
}
return ret;
}
vector<Int> factorials, invs;
bool is_ncr_table = false;
// modが素数の場合のみ
void calc_ncr_table(Int n, Int mod) {
is_ncr_table = true;
// 1! ~ n! の計算
Int f = 1;
factorials.push_back(f);
for (Int i = 1; i <= n; i++) {
f *= i;
f %= mod;
factorials.push_back(f);
}
// n!^-1 の計算
Int inv = modpow(factorials[n], mod - 2, mod);
// (n-1)!^-1 ~ 1!^-1 の計算
invs.assign(n + 1, 1);
invs[n] = inv;
for (Int i = n; i >= 1; i--) {
inv *= i;
inv %= mod;
invs[i - 1] = inv;
}
}
// 一度だけnCrを計算するとき用の関数
Int factorial(Int n, Int mod = 1) {
Int ret = 1;
if (mod == 1) {
for (Int i = 1; i <= n; i++) {
ret *= i;
}
return ret;
} else {
for (Int i = 1; i <= n; i++) {
ret *= i;
ret %= mod;
}
return ret;
}
}
Int ncr(Int n, Int r, Int mod) {
if (n < r) {
return (Int)0;
} else {
if (is_ncr_table) {
// modが素数の場合のみ
return (factorials[n] * invs[r] % mod) * invs[n - r] % mod;
} else {
Int x = 1;
for (Int i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
return x * modpow(factorial(r, mod), mod - 2, mod) % mod;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
Int n, m, k;
cin >> n >> m >> k;
calc_ncr_table(n, MOD);
Int ans = 0;
for (Int i = k; i >= 0; --i) {
Int a, b, c;
a = m;
b = ncr(n - 1, n - i - 1, MOD);
c = modpow(m - 1, n - 1 - i, MOD);
a = (a * b) % MOD;
a = (a * c) % MOD;
ans = (ans + a) % MOD;
}
cout << ans << endl;
return 0;
} | replace | 72 | 73 | 72 | 73 | -6 | munmap_chunk(): invalid pointer
|
p02685 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define All(v) (v).begin(), (v).end()
int dy[8] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int mod = 998244353;
const int inf = mod * mod;
const int d5 = 100100;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
ModInt pow(int e) {
long long a = 1, p = x;
while (e > 0) {
if (e % 2 == 0) {
p = (p * p) % mod;
e /= 2;
} else {
a = (a * p) % mod;
e--;
}
}
return ModInt(a);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
using modint = ModInt<mod>;
modint f[d5];
void makef() {
f[0] = 1;
for (int i = 1; i < d5; i++)
f[i] = f[i - 1] * i;
}
modint nCr(int n, int r) {
if (n < r || r < 0)
return 0;
return f[n] / (f[r] * f[n - r]);
}
int beki(int a, int b) {
a %= mod;
if (b == 0)
return 1;
int ans = beki(a, b / 2);
ans = ans * ans % mod;
if (b % 2 == 1)
ans = ans * a % mod;
return ans;
}
int combination(int a, int b) {
if ((a == b) || (b == 0))
return 1;
if (a < b)
return 0;
int ret = 1;
for (int i = 0; i < b; i++) {
ret *= (a - i);
ret %= mod;
ret *= beki(i + 1, mod - 2);
ret %= mod;
}
return ret;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
makef();
modint res = 0;
for (int i = 0; i <= k; i++) {
modint a = modint(m - 1).pow(n - i - 1);
a *= nCr(n - 1, i);
a *= m;
res += a;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define All(v) (v).begin(), (v).end()
int dy[8] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int mod = 998244353;
const int inf = mod * mod;
const int d5 = 200100;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
ModInt pow(int e) {
long long a = 1, p = x;
while (e > 0) {
if (e % 2 == 0) {
p = (p * p) % mod;
e /= 2;
} else {
a = (a * p) % mod;
e--;
}
}
return ModInt(a);
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
using modint = ModInt<mod>;
modint f[d5];
void makef() {
f[0] = 1;
for (int i = 1; i < d5; i++)
f[i] = f[i - 1] * i;
}
modint nCr(int n, int r) {
if (n < r || r < 0)
return 0;
return f[n] / (f[r] * f[n - r]);
}
int beki(int a, int b) {
a %= mod;
if (b == 0)
return 1;
int ans = beki(a, b / 2);
ans = ans * ans % mod;
if (b % 2 == 1)
ans = ans * a % mod;
return ans;
}
int combination(int a, int b) {
if ((a == b) || (b == 0))
return 1;
if (a < b)
return 0;
int ret = 1;
for (int i = 0; i < b; i++) {
ret *= (a - i);
ret %= mod;
ret *= beki(i + 1, mod - 2);
ret %= mod;
}
return ret;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
makef();
modint res = 0;
for (int i = 0; i <= k; i++) {
modint a = modint(m - 1).pow(n - i - 1);
a *= nCr(n - 1, i);
a *= m;
res += a;
}
cout << res << endl;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define so(v) sort(v.begin(), v.end())
using ll = long long;
using vi = vector<int>;
using vii = vector<vi>;
const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll f(ll n, ll m) {
// k=0の時の答え
ll ans = m;
rep(i, n - 1) {
ans *= m - 1;
ans %= MOD;
}
return ans;
}
int main() {
// 前処理
COMinit();
ll n, m, k;
cin >> n >> m >> k;
ll answer = 0;
rep(i, k + 1) {
answer += (COM(n - 1, i) % MOD) * (f(n - i, m) % MOD) % MOD;
answer %= MOD;
}
cout << answer << endl;
// cout<<COM(n-1,1)%MOD<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define so(v) sort(v.begin(), v.end())
using ll = long long;
using vi = vector<int>;
using vii = vector<vi>;
const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll f(ll n, ll m) {
// k=0の時の答え
ll ans = m;
rep(i, n - 1) {
ans *= m - 1;
ans %= MOD;
}
return ans;
}
int main() {
// 前処理
COMinit();
ll n, m, k;
cin >> n >> m >> k;
ll answer = 0;
ll ff = f(n - k, m);
for (int i = k; i >= 0; i--) {
answer += (COM(n - 1, i) % MOD) * (ff % MOD) % MOD;
ff = (ff * (m - 1)) % MOD;
answer %= MOD;
}
cout << answer << endl;
// cout<<COM(n-1,1)%MOD<<endl;
} | replace | 48 | 50 | 48 | 52 | TLE | |
p02685 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
struct mint {
ll v;
mint(ll a = 0) : v((a % mod + mod) % mod) {}
mint operator-() const { return mint(-v); }
mint &operator+=(const mint a) {
if ((v += a.v) >= mod)
v -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((v += mod - a.v) >= mod)
v -= mod;
return *this;
}
mint &operator*=(const mint a) {
(v *= a.v) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
// v^t
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
// Fermat's little theorem : a^(p-1) = 1 (mod p) when p is prime and a = 1
// (mod p)
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
// k < 10^6, n < 10^9
static mint comb(ll n, ll k) {
mint num(1), den(1);
for (int i = 0; i < k; i++) {
num *= mint(n - i);
den *= mint(i + 1);
}
return num / den;
}
};
// for cout <<
ostream &operator<<(ostream &stream, const mint a) {
stream << a.v;
return stream;
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
mint ans(0);
for (ll i = 0; i <= k; i++) {
ans += mint(m) * mint::comb(n - 1, i) * mint(m - 1).pow(n - i - 1);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
struct mint {
ll v;
mint(ll a = 0) : v((a % mod + mod) % mod) {}
mint operator-() const { return mint(-v); }
mint &operator+=(const mint a) {
if ((v += a.v) >= mod)
v -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((v += mod - a.v) >= mod)
v -= mod;
return *this;
}
mint &operator*=(const mint a) {
(v *= a.v) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
// v^t
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
// Fermat's little theorem : a^(p-1) = 1 (mod p) when p is prime and a = 1
// (mod p)
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
// k < 10^6, n < 10^9
static mint comb(ll n, ll k) {
mint num(1), den(1);
for (int i = 0; i < k; i++) {
num *= mint(n - i);
den *= mint(i + 1);
}
return num / den;
}
};
// for cout <<
ostream &operator<<(ostream &stream, const mint a) {
stream << a.v;
return stream;
}
int main() {
ll n, m, k;
cin >> n >> m >> k;
mint ans(0), mm(m), m1(m - 1);
mint comb = mint::comb(n - 1, k);
mint powk = mint(m - 1).pow(n - k - 1);
for (ll i = k; i >= 0; i--) {
// ans += mint(m) * mint::comb(n-1, i) * mint(m-1).pow(n-i-1);
ans += mm * comb * powk;
powk *= m1;
comb *= i;
comb /= (n - i);
}
cout << ans << endl;
return 0;
} | replace | 76 | 79 | 76 | 85 | TLE | |
p02686 | C++ | Runtime Error | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int ll
#define mod 100
#define gcd(m, n) __gcd(m, n)
#define rep(i, j, n) for (int i = j; i <= n; i++)
#define red(i, n, j) for (int i = n; i >= j; i--)
#define ME(x, y) memset(x, y, sizeof(x))
// int lcm(int a , int b){return a*b/gcd(a,b);}
// ll quickpow(ll a , ll b){ll
// ans=1;while(b){if(b&1)ans=ans*a%mod;b>>=1,a=a*a%mod;}return ans;} int
// euler1(int x){int ans=x;for(int
// i=2;i*i<=x;i++)if(x%i==0){ans-=ans/i;while(x%i==0)x/=i;}if(x>1)ans-=ans/x;return
// ans;} const int N = 1e7+9; int vis[n],prime[n],phi[N];int euler2(int
// n){ME(vis,true);int
// len=1;rep(i,2,n){if(vis[i]){prime[len++]=i,phi[i]=i-1;}for(int
// j=1;j<len&&prime[j]*i<=n;j++){vis[i*prime[j]]=0;if(i%prime[j]==0){phi[i*prime[j]]=phi[i]*prime[j];break;}else{phi[i*prime[j]]=phi[i]*phi[prime[j]];}}}return
// len}
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define pii pair<int, int>
#define fi first
#define se second
#define lson l, mid, root << 1
#define rson mid + 1, r, root << 1 | 1
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define size(v) (int)(v.size())
#define cin(x) scanf("%lld", &x);
const int N = 1e6 + 9;
const int maxn = 1e5 + 9;
const double esp = 1e-6;
char s[maxn];
int cnt;
struct node {
int l, r;
} a[maxn];
bool cmp(node a, node b) {
if (a.l >= a.r && b.l < b.r) { // 左括号多的放前面
return true;
}
if (a.l < a.r && b.l >= b.r) { // 右括号多的放后面
return false;
}
if (a.l >= a.r && b.l >= b.r) { // 同样是左括号多，右括号更少的放前面
return a.r < b.r;
}
if (a.r >= a.l && b.r >= b.l) // 同样是右括号多，左括号更多的放前面
return a.l > b.l;
}
void solve() {
int n, ans = 0, q = 0;
scanf("%lld", &n);
rep(i, 1, n) {
scanf("%s", s + 1);
int len = strlen(s + 1);
q += len;
stack<char> st;
a[i].l = a[i].r = 0;
rep(j, 1, len) {
if (s[j] == '(') {
a[i].l++;
} else {
if (a[i].l > 0) {
a[i].l--;
ans += 2;
} else {
a[i].r++;
}
}
}
}
sort(a + 1, a + 1 + n, cmp);
int l = 0;
rep(i, 1, n) {
int t = min(l, a[i].r);
l -= t;
ans += 2 * t;
l += a[i].l;
}
if (ans == q)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
signed main() {
// ios::sync_with_stdio(false);
solve();
}
| // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int ll
#define mod 100
#define gcd(m, n) __gcd(m, n)
#define rep(i, j, n) for (int i = j; i <= n; i++)
#define red(i, n, j) for (int i = n; i >= j; i--)
#define ME(x, y) memset(x, y, sizeof(x))
// int lcm(int a , int b){return a*b/gcd(a,b);}
// ll quickpow(ll a , ll b){ll
// ans=1;while(b){if(b&1)ans=ans*a%mod;b>>=1,a=a*a%mod;}return ans;} int
// euler1(int x){int ans=x;for(int
// i=2;i*i<=x;i++)if(x%i==0){ans-=ans/i;while(x%i==0)x/=i;}if(x>1)ans-=ans/x;return
// ans;} const int N = 1e7+9; int vis[n],prime[n],phi[N];int euler2(int
// n){ME(vis,true);int
// len=1;rep(i,2,n){if(vis[i]){prime[len++]=i,phi[i]=i-1;}for(int
// j=1;j<len&&prime[j]*i<=n;j++){vis[i*prime[j]]=0;if(i%prime[j]==0){phi[i*prime[j]]=phi[i]*prime[j];break;}else{phi[i*prime[j]]=phi[i]*phi[prime[j]];}}}return
// len}
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define pii pair<int, int>
#define fi first
#define se second
#define lson l, mid, root << 1
#define rson mid + 1, r, root << 1 | 1
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define size(v) (int)(v.size())
#define cin(x) scanf("%lld", &x);
const int N = 1e6 + 9;
const int maxn = 1e6 + 9;
const double esp = 1e-6;
char s[maxn];
int cnt;
struct node {
int l, r;
} a[maxn];
bool cmp(node a, node b) {
if (a.l >= a.r && b.l < b.r) { // 左括号多的放前面
return true;
}
if (a.l < a.r && b.l >= b.r) { // 右括号多的放后面
return false;
}
if (a.l >= a.r && b.l >= b.r) { // 同样是左括号多，右括号更少的放前面
return a.r < b.r;
}
if (a.r >= a.l && b.r >= b.l) // 同样是右括号多，左括号更多的放前面
return a.l > b.l;
}
void solve() {
int n, ans = 0, q = 0;
scanf("%lld", &n);
rep(i, 1, n) {
scanf("%s", s + 1);
int len = strlen(s + 1);
q += len;
stack<char> st;
a[i].l = a[i].r = 0;
rep(j, 1, len) {
if (s[j] == '(') {
a[i].l++;
} else {
if (a[i].l > 0) {
a[i].l--;
ans += 2;
} else {
a[i].r++;
}
}
}
}
sort(a + 1, a + 1 + n, cmp);
int l = 0;
rep(i, 1, n) {
int t = min(l, a[i].r);
l -= t;
ans += 2 * t;
l += a[i].l;
}
if (ans == q)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
signed main() {
// ios::sync_with_stdio(false);
solve();
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p02686 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> P(0);
vector<pair<int, int>> M(0);
int l, r, pp, pm, pos, n, b, h;
string s;
bool flgL = true, flgR = true;
for (int i = 0; i < N; i++) {
cin >> s;
b = 0, h = 0;
n = s.size();
for (int j = 0; j < n; j++) {
if (s[i] == '(') {
h++;
} else {
h--;
if (b > h) {
b = h;
}
}
}
if (h < 0) {
M.push_back(make_pair(b - h, -h));
} else if (h == 0) {
if (b < 0) {
M.push_back(make_pair(b - h, -h));
} else {
P.push_back(make_pair(b, h));
}
} else {
P.push_back(make_pair(b, h));
}
}
sort(P.rbegin(), P.rend());
sort(M.rbegin(), M.rend());
l = P.size(), r = M.size();
pp = 0, pm = 0;
for (int i = 0; i < l; i++) {
if (P[i].first + pp < 0) {
flgL = false;
break;
} else {
pp += P[i].second;
}
}
for (int i = 0; i < r; i++) {
if (M[i].first + pm < 0) {
flgR = false;
break;
} else {
pm += M[i].second;
}
}
if (flgL && flgR && pp == pm) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> P(0);
vector<pair<int, int>> M(0);
int l, r, pp, pm, pos, n, b, h;
string s;
bool flgL = true, flgR = true;
for (int i = 0; i < N; i++) {
cin >> s;
b = 0, h = 0;
n = s.size();
for (int j = 0; j < n; j++) {
if (s[j] == '(') {
h++;
} else {
h--;
if (b > h) {
b = h;
}
}
}
if (h < 0) {
M.push_back(make_pair(b - h, -h));
} else if (h == 0) {
if (b < 0) {
M.push_back(make_pair(b - h, -h));
} else {
P.push_back(make_pair(b, h));
}
} else {
P.push_back(make_pair(b, h));
}
}
sort(P.rbegin(), P.rend());
sort(M.rbegin(), M.rend());
l = P.size(), r = M.size();
pp = 0, pm = 0;
for (int i = 0; i < l; i++) {
if (P[i].first + pp < 0) {
flgL = false;
break;
} else {
pp += P[i].second;
}
}
for (int i = 0; i < r; i++) {
if (M[i].first + pm < 0) {
flgR = false;
break;
} else {
pm += M[i].second;
}
}
if (flgL && flgR && pp == pm) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02686 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5;
vector<pair<int, int>> negg, tot;
pair<int, int> seg[4 * M];
int small = -1e9;
pair<int, int> build(int l, int r, int i) {
if (l == r)
seg[i] = tot[l];
else
seg[i] = max(build(l, (l + r) / 2, i * 2 + 1),
build((l + r) / 2 + 1, r, i * 2 + 2));
return seg[i];
}
pair<int, int> update(int l, int r, int i, int x) {
if (x < l || x > r)
return seg[i];
if (l == r)
seg[i] = tot[l];
else
seg[i] = max(update(l, (l + r) / 2, i * 2 + 1, x),
update((l + r) / 2 + 1, r, i * 2 + 2, x));
return seg[i];
}
pair<int, int> get(int l, int r, int L, int R, int i) {
if (R < l || L > r)
return make_pair(small, small);
if (L >= l && R <= r)
return seg[i];
return max(get(l, r, L, (L + R) / 2, i * 2 + 1),
get(l, r, (L + R) / 2 + 1, R, i * 2 + 2));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, pos = 0, neg = 0;
cin >> n;
while (n--) {
string s;
cin >> s;
stack<char> st;
int curPos = 0, curNeg = 0;
for (char c : s)
if (!st.empty() && st.top() == '(' && c == ')')
st.pop();
else
st.push(c);
while (!st.empty())
st.top() == '(' ? curPos++ : curNeg--, st.pop();
if (curPos && curNeg)
negg.push_back(make_pair(-curNeg, curPos + curNeg));
else
pos += curPos, neg += curNeg;
}
if (!negg.empty()) {
sort(negg.begin(), negg.end());
for (int i = 0; i < negg.size(); i++)
tot.push_back(make_pair(negg[i].second, i));
build(0, tot.size() - 1, 0);
for (int i = 0; i < negg.size(); i++) {
int last = upper_bound(negg.begin(), negg.end(), make_pair(pos, -small)) -
negg.begin() - 1;
if (last == -1)
return cout << "No\n", 0;
pair<int, int> cur = get(0, last, 0, tot.size() - 1, 0);
pos += cur.first;
tot[cur.second] = make_pair(small, cur.second);
update(0, tot.size() - 1, 0, cur.second);
}
}
cout << (pos + neg == 0 ? "Yes\n" : "No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int M = 1e6;
vector<pair<int, int>> negg, tot;
pair<int, int> seg[4 * M];
int small = -1e9;
pair<int, int> build(int l, int r, int i) {
if (l == r)
seg[i] = tot[l];
else
seg[i] = max(build(l, (l + r) / 2, i * 2 + 1),
build((l + r) / 2 + 1, r, i * 2 + 2));
return seg[i];
}
pair<int, int> update(int l, int r, int i, int x) {
if (x < l || x > r)
return seg[i];
if (l == r)
seg[i] = tot[l];
else
seg[i] = max(update(l, (l + r) / 2, i * 2 + 1, x),
update((l + r) / 2 + 1, r, i * 2 + 2, x));
return seg[i];
}
pair<int, int> get(int l, int r, int L, int R, int i) {
if (R < l || L > r)
return make_pair(small, small);
if (L >= l && R <= r)
return seg[i];
return max(get(l, r, L, (L + R) / 2, i * 2 + 1),
get(l, r, (L + R) / 2 + 1, R, i * 2 + 2));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, pos = 0, neg = 0;
cin >> n;
while (n--) {
string s;
cin >> s;
stack<char> st;
int curPos = 0, curNeg = 0;
for (char c : s)
if (!st.empty() && st.top() == '(' && c == ')')
st.pop();
else
st.push(c);
while (!st.empty())
st.top() == '(' ? curPos++ : curNeg--, st.pop();
if (curPos && curNeg)
negg.push_back(make_pair(-curNeg, curPos + curNeg));
else
pos += curPos, neg += curNeg;
}
if (!negg.empty()) {
sort(negg.begin(), negg.end());
for (int i = 0; i < negg.size(); i++)
tot.push_back(make_pair(negg[i].second, i));
build(0, tot.size() - 1, 0);
for (int i = 0; i < negg.size(); i++) {
int last = upper_bound(negg.begin(), negg.end(), make_pair(pos, -small)) -
negg.begin() - 1;
if (last == -1)
return cout << "No\n", 0;
pair<int, int> cur = get(0, last, 0, tot.size() - 1, 0);
pos += cur.first;
tot[cur.second] = make_pair(small, cur.second);
update(0, tot.size() - 1, 0, cur.second);
}
}
cout << (pos + neg == 0 ? "Yes\n" : "No\n");
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02686 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
// 最下点、最終的な和
vector<pair<int, int>> p_plus; // 最終的な和がプラスのもの
vector<pair<int, int>> p_minus; // 最終的な和がマイナスのもの
int sum = 0;
rep(i, n) {
string s;
cin >> s;
pair<int, int> p(0, 0);
rep(i, s.size()) {
if (s[i] == '(')
p.second++;
else {
p.second--;
chmin(p.first, p.second);
}
}
sum += p.second;
if (p.second >= 0)
p_plus.push_back(p);
else
p_minus.push_back(p);
}
if (sum != 0) {
cout << "No" << endl;
return 0;
}
int now_pos = 0;
sort(p_plus.begin(), p_plus.end(), greater<pair<int, int>>());
rep(i, p_plus.size()) {
if (now_pos + p_plus[i].first < 0) {
cout << "No" << endl;
return 0;
}
now_pos += p_plus[i].second;
}
now_pos = 0;
rep(i, p_minus.size()) {
p_minus[i].second *= -1;
p_minus[i].first += p_minus[i].second;
}
sort(p_minus.begin(), p_minus.end(), greater<pair<int, int>>());
rep(i, p_plus.size()) {
if (now_pos + p_minus[i].first < 0) {
cout << "No" << endl;
return 0;
}
now_pos += p_minus[i].second;
}
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
// 最下点、最終的な和
vector<pair<int, int>> p_plus; // 最終的な和がプラスのもの
vector<pair<int, int>> p_minus; // 最終的な和がマイナスのもの
int sum = 0;
rep(i, n) {
string s;
cin >> s;
pair<int, int> p(0, 0);
rep(i, s.size()) {
if (s[i] == '(')
p.second++;
else {
p.second--;
chmin(p.first, p.second);
}
}
sum += p.second;
if (p.second >= 0)
p_plus.push_back(p);
else
p_minus.push_back(p);
}
if (sum != 0) {
cout << "No" << endl;
return 0;
}
int now_pos = 0;
sort(p_plus.begin(), p_plus.end(), greater<pair<int, int>>());
rep(i, p_plus.size()) {
if (now_pos + p_plus[i].first < 0) {
cout << "No" << endl;
return 0;
}
now_pos += p_plus[i].second;
}
now_pos = 0;
rep(i, p_minus.size()) {
p_minus[i].second *= -1;
p_minus[i].first += p_minus[i].second;
}
sort(p_minus.begin(), p_minus.end(), greater<pair<int, int>>());
rep(i, p_minus.size()) {
if (now_pos + p_minus[i].first < 0) {
cout << "No" << endl;
return 0;
}
now_pos += p_minus[i].second;
}
cout << "Yes" << endl;
} | replace | 65 | 66 | 65 | 66 | 0 | |
p02686 | C++ | Time Limit Exceeded | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
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;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
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 n;
vector<string> s;
/*
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second)
{
return a.first < b.first;
}
else
{
return a.second > b.second;
}
}
*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
string temp;
cin >> temp;
s.push_back(temp);
}
vector<int> close(n, 0);
vector<int> open(n, 0);
rep(i, n) {
int count = 0;
rep(j, s[i].size()) {
if (s[i][j] == ')') {
if (count) {
count--;
} else {
close[i]++;
}
} else {
count++;
}
}
open[i] = count;
}
// debug(open);
// debug(close);
vector<pair<int, int>> v;
int ccount = 0;
int ocount = 0;
rep(i, n) {
if (open[i] == 0)
ccount += close[i];
else if (close[i] == 0)
ocount += open[i];
else
v.push_back(make_pair(close[i] - open[i], i));
}
sort(ALL(v));
int count = ocount;
deque<int> d;
rep(i, v.size()) {
while (!d.empty()) {
int j = d.front();
if (count >= close[j]) {
d.pop_front();
count -= close[j];
count += open[j];
}
}
if (count < close[v[i].second]) {
d.push_back(v[i].second);
} else {
count -= close[v[i].second];
count += open[v[i].second];
}
}
if (d.empty() && count == ccount)
yes;
else
no;
}
| // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
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;
}
// cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
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 n;
vector<string> s;
/*
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second)
{
return a.first < b.first;
}
else
{
return a.second > b.second;
}
}
*/
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
string temp;
cin >> temp;
s.push_back(temp);
}
vector<int> close(n, 0);
vector<int> open(n, 0);
rep(i, n) {
int count = 0;
rep(j, s[i].size()) {
if (s[i][j] == ')') {
if (count) {
count--;
} else {
close[i]++;
}
} else {
count++;
}
}
open[i] = count;
}
// debug(open);
// debug(close);
vector<pair<int, int>> v;
int ccount = 0;
int ocount = 0;
rep(i, n) {
if (open[i] == 0)
ccount += close[i];
else if (close[i] == 0)
ocount += open[i];
else
v.push_back(make_pair(close[i] - open[i], i));
}
sort(ALL(v));
int count = ocount;
deque<int> d;
rep(i, v.size()) {
while (!d.empty()) {
int j = d.front();
if (count >= close[j]) {
d.pop_front();
count -= close[j];
count += open[j];
} else
break;
}
if (count < close[v[i].second]) {
d.push_back(v[i].second);
} else {
count -= close[v[i].second];
count += open[v[i].second];
}
}
if (d.empty() && count == ccount)
yes;
else
no;
}
| replace | 106 | 107 | 106 | 108 | TLE | |
p02686 | C++ | Runtime Error | // #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
// #define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21,
// stdin), p1 == p2) ? EOF : *p1++) char buf[(1 << 21) + 1], * p1 = buf, * p2 =
// buf; #define int long long
#define lowbit(x) (x & (-x))
#define lson root << 1, l, mid
#define rson root << 1 | 1, mid + 1, r
#define pb push_back
typedef unsigned long long ull;
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::vector<ll> VI;
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define SZ(x) ((int)((x).size()))
#define bug puts("BUG")
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const double eps = 1e-6;
template <class T> inline void read(T &x) {
int sign = 1;
char c = getchar();
x = 0;
while (c > '9' || c < '0') {
if (c == '-')
sign = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
x *= sign;
}
#ifdef LOCAL
FILE *_INPUT = freopen("input.txt", "r", stdin);
// FILE* _OUTPUT=freopen("output.txt", "w", stdout);
#endif
using namespace std;
const int maxn = 2e6 + 10;
char s[maxn];
pii bracket[maxn];
bool cmp(pii a, pii b) { return b.first + a.second >= a.first + b.second; }
int main() {
int n;
int sum = 0;
read(n);
for (int i = 0; i < n; ++i) {
scanf("%s", s);
int cur = 0, minn = inf;
for (int j = 0; s[j]; ++j) {
cur += s[j] == '(' ? 1 : -1;
minn = min(minn, cur);
}
bracket[i] = pii(cur, minn);
sum += cur;
}
if (sum)
puts("No");
else {
sort(bracket, bracket + n, cmp);
int cur = 0;
bool ok = 1;
for (int i = 0; i < n; ++i) {
if (bracket[i].second + cur < 0) {
ok = 0;
break;
}
cur += bracket[i].first;
}
puts(ok ? "Yes" : "No");
}
} | // #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
// #define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21,
// stdin), p1 == p2) ? EOF : *p1++) char buf[(1 << 21) + 1], * p1 = buf, * p2 =
// buf; #define int long long
#define lowbit(x) (x & (-x))
#define lson root << 1, l, mid
#define rson root << 1 | 1, mid + 1, r
#define pb push_back
typedef unsigned long long ull;
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
typedef std::vector<ll> VI;
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define SZ(x) ((int)((x).size()))
#define bug puts("BUG")
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
const double eps = 1e-6;
template <class T> inline void read(T &x) {
int sign = 1;
char c = getchar();
x = 0;
while (c > '9' || c < '0') {
if (c == '-')
sign = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
x *= sign;
}
#ifdef LOCAL
FILE *_INPUT = freopen("input.txt", "r", stdin);
// FILE* _OUTPUT=freopen("output.txt", "w", stdout);
#endif
using namespace std;
const int maxn = 2e6 + 10;
char s[maxn];
pii bracket[maxn];
bool cmp(pii a, pii b) {
return min(a.second, a.first + b.second) > min(b.second, b.first + a.second);
}
int main() {
int n;
int sum = 0;
read(n);
for (int i = 0; i < n; ++i) {
scanf("%s", s);
int cur = 0, minn = inf;
for (int j = 0; s[j]; ++j) {
cur += s[j] == '(' ? 1 : -1;
minn = min(minn, cur);
}
bracket[i] = pii(cur, minn);
sum += cur;
}
if (sum)
puts("No");
else {
sort(bracket, bracket + n, cmp);
int cur = 0;
bool ok = 1;
for (int i = 0; i < n; ++i) {
if (bracket[i].second + cur < 0) {
ok = 0;
break;
}
cur += bracket[i].first;
}
puts(ok ? "Yes" : "No");
}
} | replace | 61 | 62 | 61 | 64 | 0 | |
p02686 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
auto f = [](string s) {
int left = 0, right = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
right++;
if (s[i] == ')') {
if (right > 0)
right--;
else
left++;
}
}
return make_pair(left, right);
};
int N;
cin >> N;
pair<int, int> bra[N];
for (int i = 0; i < N; i++) {
string S;
cin >> S;
bra[i] = f(S);
}
auto comp = [](pair<int, int> l, pair<int, int> r) {
if (l.first == 0)
return true;
if (r.first == 0)
return false;
if (r.second == 0)
return true;
if (l.second == 0)
return false;
return l.first == r.first ? l.second > r.second : l.first < r.first;
};
sort(bra, bra + N, comp);
debugArray(bra, N);
int buf = 0;
bool isok = true;
for (int i = 0; i < N; i++) {
debug(buf);
debug(bra[i].first);
if (buf < bra[i].first) {
isok = false;
break;
}
buf += bra[i].second - bra[i].first;
}
debug(buf);
isok &= buf == 0;
debug(buf);
cout << (isok ? "Yes" : "No") << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) \
cerr << __LINE__ << ": " << #x << " = {"; \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << ((hoge) ? "," : "") << x[hoge]; \
cerr << "}" << endl
#else
#define debug(x) (void(0))
#define debugArray(x, n) (void(0))
#endif
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
auto f = [](string s) {
int left = 0, right = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '(')
right++;
if (s[i] == ')') {
if (right > 0)
right--;
else
left++;
}
}
return make_pair(left, right);
};
int N;
cin >> N;
pair<int, int> bra[N];
for (int i = 0; i < N; i++) {
string S;
cin >> S;
bra[i] = f(S);
}
auto comp = [](pair<int, int> l, pair<int, int> r) {
if (l.first - l.second < 0 && r.first - r.second < 0)
return l.first < r.first;
if (l.first - l.second > 0 && r.first - r.second > 0)
return l.second > r.second;
return l.first - l.second < r.first - r.second;
};
sort(bra, bra + N, comp);
debugArray(bra, N);
int buf = 0;
bool isok = true;
for (int i = 0; i < N; i++) {
debug(buf);
debug(bra[i].first);
if (buf < bra[i].first) {
isok = false;
break;
}
buf += bra[i].second - bra[i].first;
}
debug(buf);
isok &= buf == 0;
debug(buf);
cout << (isok ? "Yes" : "No") << endl;
return 0;
}
| replace | 45 | 54 | 45 | 50 | 0 | |
p02686 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template <typename T> void print(const vector<T> &x) {
int n = x.size();
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i, n) {
rep(j, x[i].size()) { cout << x[i][j] << " "; }
cout << endl;
}
}
template <typename T> void print(const vector<T> &x, int n) {
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x, int n, int m) {
rep(i, n) {
rep(j, m) { cout << x[i][j] << " "; }
cout << endl;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void input_init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<P> a(n);
rep(i, n) {
string s;
cin >> s;
int sum = 0;
int mini = INF;
for (auto &&e : s) {
if (e == '(')
sum++;
else
sum--;
chmin(mini, sum);
}
a[i].first = mini;
a[i].second = sum;
}
auto print = [&]() {
for (auto &&e : a)
cout << e.first << ", " << e.second << '\n';
};
vector<P> ans;
sort(a.begin(), a.end(), greater<>());
for (auto &&e : a) {
if (e.second >= 0) {
ans.push_back(e);
}
}
sort(a.begin(), a.end(),
[](const P &l, const P &r) { return l.second - l.first; });
for (auto &&e : a) {
if (e.second < 0) {
ans.push_back(e);
}
}
P c;
bool ok = true;
for (auto &&e : ans) {
if (c.second + e.first < 0)
ok = false;
c.second += e.second;
}
if (c.second != 0)
ok = false;
if (ok) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
template <typename T> void print(const vector<T> &x) {
int n = x.size();
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x) {
int n = x.size();
rep(i, n) {
rep(j, x[i].size()) { cout << x[i][j] << " "; }
cout << endl;
}
}
template <typename T> void print(const vector<T> &x, int n) {
rep(i, n) {
cout << x[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
template <typename T> void print(const vector<vector<T>> &x, int n, int m) {
rep(i, n) {
rep(j, m) { cout << x[i][j] << " "; }
cout << endl;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
void input_init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<P> a(n);
rep(i, n) {
string s;
cin >> s;
int sum = 0;
int mini = INF;
for (auto &&e : s) {
if (e == '(')
sum++;
else
sum--;
chmin(mini, sum);
}
a[i].first = mini;
a[i].second = sum;
}
auto print = [&]() {
for (auto &&e : a)
cout << e.first << ", " << e.second << '\n';
};
vector<P> ans;
sort(a.begin(), a.end(), greater<>());
for (auto &&e : a) {
if (e.second >= 0) {
ans.push_back(e);
}
}
sort(a.begin(), a.end(), [](const P &l, const P &r) {
return l.second - l.first > r.second - r.first;
});
for (auto &&e : a) {
if (e.second < 0) {
ans.push_back(e);
}
}
P c;
bool ok = true;
for (auto &&e : ans) {
if (c.second + e.first < 0)
ok = false;
c.second += e.second;
}
if (c.second != 0)
ok = false;
if (ok) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
return 0;
} | replace | 102 | 104 | 102 | 105 | TLE | |
p02686 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define DEBUG_VLL(vec) \
REP(sz, vec.size()) \
std::cerr << vec[sz] << (sz == vec.size() - 1 ? '\n' : ' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
V<P<ll, ll>> ps, ms, zero;
ll ttttt = 0;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
ll total = 0, mini = 0;
for (ll j = 0; j < (ll)s.size(); j++) {
if (s[j] == '(')
total++;
else
total--;
chmin(mini, total);
}
if (total < 0) {
ms.emplace_back(make_pair(total, mini));
} else if (total > 0) {
ps.emplace_back(make_pair(total, mini));
} else {
zero.emplace_back(make_pair(total, mini));
}
ttttt += total;
}
cerr << ttttt << '\n';
if (ttttt != 0) {
cout << "No\n";
return 0;
}
sort(ALL(ps), [&](P<ll, ll> i, P<ll, ll> j) {
if (i.second == j.second)
return i.first > j.first;
return i.second > j.second;
});
ll tmp = 0;
for (ll i = 0; i < (ll)ps.size(); i++) {
if (tmp + ps[i].second < 0) {
cout << "No\n";
return 0;
} else {
tmp += ps[i].first;
}
}
for (ll i = 0; i < (ll)zero.size(); i++) {
if (tmp + zero[i].second < 0) {
cout << "No\n";
return 0;
}
}
sort(ALL(ms), [&](P<ll, ll> i, P<ll, ll> j) { return i.second - i.first; });
for (ll i = 0; i < (ll)ms.size(); i++) {
if (tmp + ms[i].second < 0) {
cout << "No\n";
return 0;
} else {
tmp += ms[i].first;
}
}
cout << "Yes\n";
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i = k; i < (ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(), v.end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define DEBUG_VLL(vec) \
REP(sz, vec.size()) \
std::cerr << vec[sz] << (sz == vec.size() - 1 ? '\n' : ' ');
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
V<P<ll, ll>> ps, ms, zero;
ll ttttt = 0;
for (ll i = 0; i < n; i++) {
string s;
cin >> s;
ll total = 0, mini = 0;
for (ll j = 0; j < (ll)s.size(); j++) {
if (s[j] == '(')
total++;
else
total--;
chmin(mini, total);
}
if (total < 0) {
ms.emplace_back(make_pair(total, mini));
} else if (total > 0) {
ps.emplace_back(make_pair(total, mini));
} else {
zero.emplace_back(make_pair(total, mini));
}
ttttt += total;
}
cerr << ttttt << '\n';
if (ttttt != 0) {
cout << "No\n";
return 0;
}
sort(ALL(ps), [&](P<ll, ll> i, P<ll, ll> j) {
if (i.second == j.second)
return i.first > j.first;
return i.second > j.second;
});
ll tmp = 0;
for (ll i = 0; i < (ll)ps.size(); i++) {
if (tmp + ps[i].second < 0) {
cout << "No\n";
return 0;
} else {
tmp += ps[i].first;
}
}
for (ll i = 0; i < (ll)zero.size(); i++) {
if (tmp + zero[i].second < 0) {
cout << "No\n";
return 0;
}
}
sort(ALL(ms), [&](P<ll, ll> i, P<ll, ll> j) {
return i.second - i.first < j.second - j.first;
});
for (ll i = 0; i < (ll)ms.size(); i++) {
if (tmp + ms[i].second < 0) {
cout << "No\n";
return 0;
} else {
tmp += ms[i].first;
}
}
cout << "Yes\n";
return 0;
}
| replace | 113 | 114 | 113 | 116 | TLE | |
p02686 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
// #define int long long
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
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> std::string printVector(const std::vector<T> &data) {
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
template <typename T> void print_array(const T &ary, int size) {
REP(i, size) { cout << ary[i] << " "; }
cout << endl;
}
const int MOD = 1e9 + 7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
bool cmp(const PII &a, const PII &b) {
int af = a.first, as = a.second;
int bf = b.first, bs = b.second;
if (as > 0 and bs > 0) {
return af >= bf;
} else if (as > 0 and bs <= 0) {
return true;
} else if (as <= 0 and bs > 0) {
return false;
} else {
// int da = -af - (-as);
// int db = -bf - (-bs);
// return da >= db;
return af - as < bf - bs;
}
// if(as > 0 and bs <= 0) return true;
// if(as <= 0 and bs > 0) return false;
// if(as < 0) return af - as < bf - bs;
// else return af > bf;
}
signed main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12);
int N;
cin >> N;
vector<pair<int, int>> S;
int sum = 0;
REP(i, N) {
string s;
cin >> s;
int acc = 0;
int tmin = 0;
for (char c : s) {
if (c == '(') {
acc++;
} else {
acc--;
}
chmin(tmin, acc);
}
S.eb(tmin, acc);
sum += acc;
}
if (sum != 0) {
cout << "No" << endl;
return 0;
}
sort(S.begin(), S.end(), cmp);
int now = 0;
int tmin = 0;
REP(i, N) {
int a, b;
tie(a, b) = S[i];
chmin(tmin, now + a);
now += b;
}
if (tmin == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
// #define int long long
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
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> std::string printVector(const std::vector<T> &data) {
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
template <typename T> void print_array(const T &ary, int size) {
REP(i, size) { cout << ary[i] << " "; }
cout << endl;
}
const int MOD = 1e9 + 7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
bool cmp(const PII &a, const PII &b) {
int af = a.first, as = a.second;
int bf = b.first, bs = b.second;
if (as > 0 and bs > 0) {
return af > bf;
} else if (as > 0 and bs <= 0) {
return true;
} else if (as <= 0 and bs > 0) {
return false;
} else {
// int da = -af - (-as);
// int db = -bf - (-bs);
// return da >= db;
return af - as < bf - bs;
}
// if(as > 0 and bs <= 0) return true;
// if(as <= 0 and bs > 0) return false;
// if(as < 0) return af - as < bf - bs;
// else return af > bf;
}
signed main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12);
int N;
cin >> N;
vector<pair<int, int>> S;
int sum = 0;
REP(i, N) {
string s;
cin >> s;
int acc = 0;
int tmin = 0;
for (char c : s) {
if (c == '(') {
acc++;
} else {
acc--;
}
chmin(tmin, acc);
}
S.eb(tmin, acc);
sum += acc;
}
if (sum != 0) {
cout << "No" << endl;
return 0;
}
sort(S.begin(), S.end(), cmp);
int now = 0;
int tmin = 0;
REP(i, N) {
int a, b;
tie(a, b) = S[i];
chmin(tmin, now + a);
now += b;
}
if (tmin == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 84 | 85 | 84 | 85 | 0 | |
p02686 | C++ | Runtime Error | // by szh
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define SZ(x) (int((x).size()))
#define se second
#define ll long long
#define pq priority_queue
#define MP make_pair
#define pii pair<int, int>
#define mod 998244353
#define inf 0x3f3f3f3f
#define debug(x) cerr << #x << "=" << x << '\n'
#define rep(i, a, b) for (int i = a; i < (b); i++)
const int maxn = 1e6 + 10;
int n;
pii a[maxn];
bool cmp(pii x, pii y) {
return (x.se > y.se || y.fi < 0) && (y.se - y.fi > x.se - x.fi || x.fi > 0);
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
int mn = mod, val = 0;
rep(j, 0, SZ(s)) {
if (s[i] == '(')
val++;
else
val--;
mn = min(val, mn);
}
a[i] = MP(val, mn);
}
sort(a, a + n, cmp);
int sum = 0;
rep(i, 0, n) {
if (sum + a[i].se < 0) {
cout << "No";
return 0;
}
sum += a[i].fi;
}
if (sum == 0)
cout << "Yes";
else
cout << "No";
return 0;
}
| // by szh
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define SZ(x) (int((x).size()))
#define se second
#define ll long long
#define pq priority_queue
#define MP make_pair
#define pii pair<int, int>
#define mod 998244353
#define inf 0x3f3f3f3f
#define debug(x) cerr << #x << "=" << x << '\n'
#define rep(i, a, b) for (int i = a; i < (b); i++)
const int maxn = 1e6 + 10;
int n;
pii a[maxn];
bool cmp(pii x, pii y) {
return (x.se > y.se || y.fi < 0) && (y.se - y.fi > x.se - x.fi || x.fi > 0);
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
rep(i, 0, n) {
string s;
cin >> s;
int mn = mod, val = 0;
rep(j, 0, SZ(s)) {
if (s[j] == '(')
val++;
else
val--;
mn = min(val, mn);
}
a[i] = MP(val, mn);
}
sort(a, a + n, cmp);
int sum = 0;
rep(i, 0, n) {
if (sum + a[i].se < 0) {
cout << "No";
return 0;
}
sum += a[i].fi;
}
if (sum == 0)
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02686 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define fi first
#define se second
#define eb emplace_back
#define ef emplace_front
#define pof pop_front()
#define pob pop_back()
#define Rep(i, n) for (li i = 0, nn = (li)(n); i != nn; ++i)
#define Rep1(i, n) for (li i = 1, nn = (li)(n) + 1; i != nn; ++i)
#define Size(v) (li)(v.size())
#define SortA(v) sort(v.begin(), v.end())
#define SortD(v) sort(v.rbegin(), v.rend())
#define All(a) (a).begin(), (a).end()
#define Input(a) \
for (li ii = 0, nn = (li)(a.size()); ii != nn; ++ii) { \
cin >> (a).at(ii); \
}
#define Input2(a, b) \
for (li ii = 0, nn = (li)(a.size()); ii != nn; ++ii) { \
cin >> (a).at(ii) >> (b).at(ii); \
}
#define mp make_pair
using li = int64_t;
using intl = int64_t;
using vi = vec<li>;
using vb = vec<bool>;
using vvi = vec<vi>;
using qi = deque<li>;
using pi = pair<li, li>;
using vpi = vec<pi>;
using si = set<li>;
using vsi = vec<si>;
using mii = map<li, li>;
using vmii = vec<mii>;
vec<li> dx = {0, 1, 0, -1, 1, 1, -1, -1};
vec<li> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr li INF = 9223372036854775807;
void Yes(li b) {
if (b)
cout << "Yes";
else
cout << "No";
}
void yes(li b) {
if (b)
cout << "yes";
else
cout << "no";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
cin >> N;
deque<pi> plus, zero, minus;
string S;
pi p;
Rep(i, N) {
cin >> S;
p = mp(0, 0);
for (auto &&s : S) {
if (s == ')') {
if (p.se)
p.se--;
else
p.fi++;
} else
p.se++;
}
if (p.se > p.fi)
plus.eb(p);
else if (p.se == p.fi)
zero.eb(p);
else {
swap(p.fi, p.se);
minus.eb(p);
}
}
SortA(plus);
SortD(minus);
li c = 0;
for (auto pl : plus) {
if (pl.fi > c) {
Yes(0);
return 0;
} else
c = c - pl.fi + pl.se;
}
for (auto z : zero) {
if (z.fi > c) {
Yes(0);
return 0;
}
}
for (auto m : minus) {
if (m.se > c) {
Yes(0);
return 0;
} else
c = c - m.se + m.fi;
}
Yes(!c);
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define fi first
#define se second
#define eb emplace_back
#define ef emplace_front
#define pof pop_front()
#define pob pop_back()
#define Rep(i, n) for (li i = 0, nn = (li)(n); i != nn; ++i)
#define Rep1(i, n) for (li i = 1, nn = (li)(n) + 1; i != nn; ++i)
#define Size(v) (li)(v.size())
#define SortA(v) sort(v.begin(), v.end())
#define SortD(v) sort(v.rbegin(), v.rend())
#define All(a) (a).begin(), (a).end()
#define Input(a) \
for (li ii = 0, nn = (li)(a.size()); ii != nn; ++ii) { \
cin >> (a).at(ii); \
}
#define Input2(a, b) \
for (li ii = 0, nn = (li)(a.size()); ii != nn; ++ii) { \
cin >> (a).at(ii) >> (b).at(ii); \
}
#define mp make_pair
using li = int64_t;
using intl = int64_t;
using vi = vec<li>;
using vb = vec<bool>;
using vvi = vec<vi>;
using qi = deque<li>;
using pi = pair<li, li>;
using vpi = vec<pi>;
using si = set<li>;
using vsi = vec<si>;
using mii = map<li, li>;
using vmii = vec<mii>;
vec<li> dx = {0, 1, 0, -1, 1, 1, -1, -1};
vec<li> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr li INF = 9223372036854775807;
void Yes(li b) {
if (b)
cout << "Yes";
else
cout << "No";
}
void yes(li b) {
if (b)
cout << "yes";
else
cout << "no";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
cin >> N;
deque<pi> plus, zero, minus;
string S;
pi p;
Rep(i, N) {
cin >> S;
p = mp(0, 0);
for (auto &&s : S) {
if (s == ')') {
if (p.se)
p.se--;
else
p.fi++;
} else
p.se++;
}
if (p.se > p.fi)
plus.eb(p);
else if (p.se == p.fi)
zero.eb(p);
else {
swap(p.fi, p.se);
minus.eb(p);
}
}
SortA(plus);
SortD(minus);
li c = 0;
for (auto pl : plus) {
if (pl.fi > c) {
Yes(0);
return 0;
} else
c = c - pl.fi + pl.se;
}
for (auto z : zero) {
if (z.fi > c) {
Yes(0);
return 0;
}
}
for (auto m : minus) {
if (m.se > c) {
Yes(0);
return 0;
} else
c = c - m.se + m.fi;
}
Yes(!c);
} | replace | 0 | 1 | 0 | 1 | TLE | |
p02686 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define debug(x) cerr << #x << ":" << (x) << endl
#define fix cout << fixed << setprecision(20);
#define int long long
const int maxn = (int)1e6 + 5;
int a[maxn], b[maxn], idx[maxn];
bool cmp(int i, int j) {
if ((b[i] - a[i]) * (b[j] - a[j]) < 0) {
return b[i] - a[i] > 0;
}
if (b[i] - a[i] > 0) {
return a[i] < a[j];
}
return b[i] > b[j];
}
string ss[maxn];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
rep(i, 1, n) {
string s;
cin >> s;
int now = 0;
int mx = 0, mn = 0;
for (auto c : s) {
if (c == ')')
now++;
else
now--;
mx = max(mx, now);
}
reverse(s.begin(), s.end());
now = 0;
for (auto c : s) {
if (c == '(')
now++;
else
now--;
mn = max(mn, now);
}
a[i] = mx, b[i] = mn;
reverse(s.begin(), s.end());
ss[i] = s;
}
rep(i, 1, n) idx[i] = i;
sort(idx + 1, idx + 1 + n, cmp);
int now = 0;
int flag = 1;
rep(i, 1, n) {
int j = idx[i];
// debug(j);
// debug(a[j]),debug(b[j]);
for (auto c : ss[j]) {
if (c == '(')
now++;
else
now--;
if (now < 0)
flag = 0;
}
// debug(now);
}
if (now != 0)
flag = 0;
cout << (flag ? "Yes" : "No") << endl;
}
/*
4
)))((
)))(
))(((
)(((
需要查询区间最大值的位置，单点删除
换种思路，
1.删除多余的，必定剩下 ))(((， 否则在后缀的)会被消掉
2。 前面放（多的，
3.前面）越少越前面，后面（越少越后面
*/ | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define debug(x) cerr << #x << ":" << (x) << endl
#define fix cout << fixed << setprecision(20);
#define int long long
const int maxn = (int)1e6 + 5;
int a[maxn], b[maxn], idx[maxn];
bool cmp(int i, int j) { // 逻辑较复杂
if (b[i] == a[i] and a[j] == b[j]) {
return a[i] < b[j];
}
if (b[i] == a[i])
return b[j] - a[j] < 0;
if (b[j] == a[j])
return b[i] - a[i] > 0;
if ((b[i] - a[i]) * (b[j] - a[j]) < 0) {
return b[i] - a[i] > 0;
}
if (b[i] - a[i] > 0) {
return a[i] < a[j];
}
return b[i] > b[j];
}
string ss[maxn];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
rep(i, 1, n) {
string s;
cin >> s;
int now = 0;
int mx = 0, mn = 0;
for (auto c : s) {
if (c == ')')
now++;
else
now--;
mx = max(mx, now);
}
reverse(s.begin(), s.end());
now = 0;
for (auto c : s) {
if (c == '(')
now++;
else
now--;
mn = max(mn, now);
}
a[i] = mx, b[i] = mn;
reverse(s.begin(), s.end());
ss[i] = s;
}
rep(i, 1, n) idx[i] = i;
sort(idx + 1, idx + 1 + n, cmp);
int now = 0;
int flag = 1;
rep(i, 1, n) {
int j = idx[i];
// debug(j);
// debug(a[j]),debug(b[j]);
for (auto c : ss[j]) {
if (c == '(')
now++;
else
now--;
if (now < 0)
flag = 0;
}
// debug(now);
}
if (now != 0)
flag = 0;
cout << (flag ? "Yes" : "No") << endl;
}
/*
4
)))((
)))(
))(((
)(((
需要查询区间最大值的位置，单点删除
换种思路，
1.删除多余的，必定剩下 ))(((， 否则在后缀的)会被消掉
2。 前面放（多的，
3.前面）越少越前面，后面（越少越后面
*/ | replace | 8 | 9 | 8 | 16 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.