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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02548 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i < n; i++) {
int temp = n - i;
for (int f = 1; f * f <= temp; f++) {
if (temp % f == 0)
ans += 2;
if (f * f == temp)
ans -= 1;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
long long temp = (i * j);
if (temp >= n)
break;
ans++;
}
}
cout << ans << endl;
}
| replace | 7 | 14 | 7 | 13 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
using namespace std;
long long GCD(long long x, long long y) {
long long r, tmp;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
long long LCM(long long x, long long y) {
long long lcm = (x * y) / GCD(x, y);
return lcm;
}
int bubblesort(int n) {
vector<int> data(n);
int num = 0;
for (int end = n - 1; end > 0; end--) {
for (int j = 0; j < end; j++) {
if (data[j + 1] < data[j]) {
int temp = data[j];
data[j] = data[j + 1];
data[j + 1] = temp;
num++;
}
}
}
return num;
}
int main() {
ll n;
cin >> n;
ll fx = n;
ll ans = 0;
for (ll i = 1; i < fx; i++) {
n--;
;
for (ll j = 1; j < fx; j++) {
if (n % j == 0) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define ALL(obj) (obj).begin(), (obj).end()
#define MOD 1000000007
using namespace std;
long long GCD(long long x, long long y) {
long long r, tmp;
if (x < y) {
tmp = x;
x = y;
y = tmp;
}
while (y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
long long LCM(long long x, long long y) {
long long lcm = (x * y) / GCD(x, y);
return lcm;
}
int bubblesort(int n) {
vector<int> data(n);
int num = 0;
for (int end = n - 1; end > 0; end--) {
for (int j = 0; j < end; j++) {
if (data[j + 1] < data[j]) {
int temp = data[j];
data[j] = data[j + 1];
data[j + 1] = temp;
num++;
}
}
}
return num;
}
int main() {
ll n;
cin >> n;
ll ans = n - 1;
for (ll i = 2; i < n; i++) {
ans += n / i;
if (n % i == 0) {
ans--;
}
}
cout << ans << endl;
return 0;
}
| replace | 62 | 71 | 62 | 67 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
int N;
cin >> N;
LL ans = 0;
for (int C = 1; C < N; C++) {
int val = N - C;
int valsqrt = (int)round(sqrt(val));
int a = 1;
while (a <= valsqrt) {
if (val % a != 0) {
a++;
continue;
}
int b = val / a;
if (a == b) {
ans++;
} else {
ans += 2;
}
a++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long LL;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
int N;
cin >> N;
int ans = 0;
for (int a = 1; a <= N - 1; a++) {
int count = (N - 1) / a;
ans += count;
}
cout << ans << endl;
return 0;
} | replace | 23 | 44 | 23 | 27 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer(x) cout << endl << "answer : " << x << endl << endl;
#define op(x) cout << x << endl;
#define maxn 500005
#define lld_max 5000000000000000000
#define messi \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
messi lld t = 1; // cin>>t;
while (t--) {
lld n = 0, m = 0, k = 0, i = 0, j = 0, p = 0, q = 0, x = 0, y = 0, z = 0,
ans = 0, cnt = 0, l = 0, r = 0, mid = 0, lo = 0, hi = 0;
string s;
bool flag = false;
cin >> n;
for (i = 1; i < n; i++) {
for (j = 1; j * j <= i; j++) {
if (i % j == 0) {
if (j == (i / j))
cnt++;
else
cnt += 2;
}
}
}
op(cnt);
}
return 0;
}
/* CODED BY:-
________________________________________
| __ __ |
| /\ /\ |__) /\ | \ |__| \ / /\ |
| /~~\ /~~\ | \ /~~\ |__/ | | | /~~\ |
|________________________________________|
*/
| #include <bits/stdc++.h>
#define lld long long int
#define vec vector<lld>
#define pll pair<lld, lld>
#define pb push_back
#define ss second
#define ff first
#define mp make_pair
#define mod 1000000007
#define answer(x) cout << endl << "answer : " << x << endl << endl;
#define op(x) cout << x << endl;
#define maxn 500005
#define lld_max 5000000000000000000
#define messi \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
messi lld t = 1; // cin>>t;
while (t--) {
lld n = 0, m = 0, k = 0, i = 0, j = 0, p = 0, q = 0, x = 0, y = 0, z = 0,
ans = 0, cnt = 0, l = 0, r = 0, mid = 0, lo = 0, hi = 0;
string s;
bool flag = false;
cin >> n;
for (i = 1; i < n; i++)
cnt += (n - 1) / i;
op(cnt);
}
return 0;
}
/* CODED BY:-
________________________________________
| __ __ |
| /\ /\ |__) /\ | \ |__| \ / /\ |
| /~~\ /~~\ | \ /~~\ |__/ | | | /~~\ |
|________________________________________|
*/
| replace | 26 | 36 | 26 | 28 | TLE | |
p02548 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto &e : a)
#ifdef LOCAL
#define logv(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << e << " "; } \
cerr << "\n"; \
}
#define logvp(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << "(" << e.first << ", " << e.second << ") "; } \
cerr << "\n"; \
}
#define logvv(a) \
{ \
cerr << #a << " = \n"; \
fore(r, a) { \
fore(e, r) { cerr << e << " "; } \
cerr << "\n"; \
} \
}
#define logvf(a, field) \
{ \
cerr << #a "." #field << " = \n"; \
fore(e, a) { cerr << e.field << " "; } \
cerr << "\n"; \
}
#define logvff(a, f1, f2) \
{ \
cerr << #a ".{" #f1 << ", " #f2 << "} = \n"; \
fore(e, a) { cerr << "(" << e.f1 << ", " << e.f2 << ") "; } \
cerr << "\n"; \
}
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) \
cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) \
cerr << #a << " = " \
<< "(" << a.first << ", " << a.second << ")" \
<< "\n";
#define cond(pred, stmt) \
if (pred) { \
stmt \
}
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template <typename T> using vec = vector<T>;
template <typename T, typename Dim> auto make_vec(T value, Dim dim) {
return vector<T>(dim, value);
}
template <typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) {
return make_vec(make_vec(value, dims...), dim1);
}
template <typename T> bool uax(T &v, const T &newv) {
if (v < newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> bool uin(T &v, const T &newv) {
if (v > newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> istream &operator>>(istream &is, vector<T> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename T, size_t N>
istream &operator>>(istream &is, array<T, N> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename... T> istream &read(T &...args) {
return (cin >> ... >> args);
}
static mt19937 rande(123123);
template <typename T> T rand_int(T from, T to) {
uniform_int_distribution<T> distr(from, to);
return distr(rande);
}
// const i64 INF = 1e18;
const int INF = 2e9;
const i64 M = 1e9 + 7;
const int MXB = 20;
using bin = bitset<MXB + 1>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
rande.seed(chrono::steady_clock::now().time_since_epoch().count());
int n;
while (read(n)) {
i64 ans = 0;
forr(c, 1, n) {
i64 ab = n - c;
for (i64 i = 1; i * i <= ab; i++) {
if (ab % i == 0) {
if (i * i == ab) {
ans++;
} else {
ans += 2;
}
}
}
}
cout << ans << endl;
}
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto &e : a)
#ifdef LOCAL
#define logv(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << e << " "; } \
cerr << "\n"; \
}
#define logvp(a) \
{ \
cerr << #a << " = "; \
fore(e, a) { cerr << "(" << e.first << ", " << e.second << ") "; } \
cerr << "\n"; \
}
#define logvv(a) \
{ \
cerr << #a << " = \n"; \
fore(r, a) { \
fore(e, r) { cerr << e << " "; } \
cerr << "\n"; \
} \
}
#define logvf(a, field) \
{ \
cerr << #a "." #field << " = \n"; \
fore(e, a) { cerr << e.field << " "; } \
cerr << "\n"; \
}
#define logvff(a, f1, f2) \
{ \
cerr << #a ".{" #f1 << ", " #f2 << "} = \n"; \
fore(e, a) { cerr << "(" << e.f1 << ", " << e.f2 << ") "; } \
cerr << "\n"; \
}
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) \
cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) \
cerr << #a << " = " \
<< "(" << a.first << ", " << a.second << ")" \
<< "\n";
#define cond(pred, stmt) \
if (pred) { \
stmt \
}
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template <typename T> using vec = vector<T>;
template <typename T, typename Dim> auto make_vec(T value, Dim dim) {
return vector<T>(dim, value);
}
template <typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) {
return make_vec(make_vec(value, dims...), dim1);
}
template <typename T> bool uax(T &v, const T &newv) {
if (v < newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> bool uin(T &v, const T &newv) {
if (v > newv) {
v = newv;
return true;
} else
return false;
}
template <typename T> istream &operator>>(istream &is, vector<T> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename T, size_t N>
istream &operator>>(istream &is, array<T, N> &c) {
for (auto &e : c)
is >> e;
return is;
}
template <typename... T> istream &read(T &...args) {
return (cin >> ... >> args);
}
static mt19937 rande(123123);
template <typename T> T rand_int(T from, T to) {
uniform_int_distribution<T> distr(from, to);
return distr(rande);
}
// const i64 INF = 1e18;
const int INF = 2e9;
const i64 M = 1e9 + 7;
const int MXB = 20;
using bin = bitset<MXB + 1>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
rande.seed(chrono::steady_clock::now().time_since_epoch().count());
int n;
while (read(n)) {
i64 ans = 0;
for (i64 a = 1; a * a < n; a++) {
i64 d1 = (n - 1) / a;
i64 d2 = a;
i64 d = 2 * max(0ll, d1 - d2) + 1;
ans += d;
}
cout << ans << endl;
}
} | replace | 132 | 143 | 132 | 137 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
// -2.1e-9 <= int <= 2.1e9
// -9.2e-18 <= long long <= 9.2e18
// 0 <= unsigned int <= 4.2e9
// 0 <= unsigned long long <= 18.4e18
// cout << fixed << setprecision(10);
int main() {
int N;
cin >> N;
int cnt = 0;
for (int c = 1; c <= N - 1; ++c) {
int target = N - c;
double dThr = sqrt(target);
for (int a = 1; a <= dThr; ++a) {
// int ia = int(round(da));
if (target % a == 0) {
int b = target / a;
if (a == b)
++cnt;
else
cnt += 2;
}
}
}
cout << cnt << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
// -2.1e-9 <= int <= 2.1e9
// -9.2e-18 <= long long <= 9.2e18
// 0 <= unsigned int <= 4.2e9
// 0 <= unsigned long long <= 18.4e18
// cout << fixed << setprecision(10);
int main() {
int N;
cin >> N;
int cnt = 0;
for (int c = 1; c <= N - 1; ++c) {
int target = N - c;
double dThr = sqrt(target);
for (int a = 1; a <= dThr; ++a) {
// int ia = int(round(da));
int b = target / a;
if (a * b == target) {
if (a == b)
++cnt;
else
cnt += 2;
}
}
}
cout << cnt << endl;
}
| replace | 31 | 33 | 31 | 33 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int main() {
int N;
cin >> N;
int cou = 0;
int nn = N;
for (int i = 1; i <= N - 1; i++) {
nn = N - i;
for (ll i = 1; i * i <= nn; i++) {
if (nn % i == 0 && nn != i * i) {
cou = cou + 2;
}
if (nn % i == 0 && nn == i * i) {
cou = cou + 1;
}
}
}
cout << cou << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int main() {
int N;
cin >> N;
int cou = 0;
int nn = N - 1;
for (int i = 1; i <= N; i++) {
cou = cou + nn / i;
}
cout << cou << endl;
} | replace | 25 | 36 | 25 | 28 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
using namespace std;
int main() {
uint64 ans = 0;
int n;
cin >> n;
rep(i, 1, n) {
rep(j, 1, i * j < n) { ans++; }
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
using namespace std;
int main() {
uint64 ans = 0;
int n;
cin >> n;
rep(i, 1, n) {
for (int j = 1; j * i < n; j++) {
ans++;
}
}
cout << ans << endl;
} | replace | 19 | 20 | 19 | 22 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int c = 1; c < n; c++) {
int num = n - c;
for (int i = 1; i <= sqrt(num); ++i) {
if (num % i == 0)
if (num / i == i) {
ans++;
} else {
ans++;
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i < n; i++) {
ans += (n - 1) / i;
}
cout << ans << endl;
} | replace | 10 | 22 | 10 | 12 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2, 62);
ll yakusuu(ll x) {
ll sum = 0;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
sum += 1;
if (i * i != x) {
sum++;
}
}
}
// 約数の個数
return sum;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int c = 1; c < n; c++) {
ans += yakusuu(n - c);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2, 62);
ll yakusuu(ll x) {
ll sum = 0;
for (int i = 1; i * i <= x; i++) {
if (x % i == 0) {
sum += 1;
if (i * i != x) {
sum++;
}
}
}
// 約数の個数
return sum;
}
int main() {
ll n;
cin >> n;
ll ans = 0;
/*for(int c = 1;c < n;c++){
ans += yakusuu(n-c);
}*/
for (int a = 1; a < n; a++) {
if (n % a == 0) {
ans += (n / a) - 1;
} else {
ans += n / a;
}
}
cout << ans << endl;
}
| replace | 28 | 30 | 28 | 37 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define ini(a, i) memset(a, i, sizeof(a))
#define inin(a, n, i) memset(a, i, sizeof(a[0]) * (n))
#define contains(c, i) ((c).find(i) != (c).end())
#define present(i, c) (find(all(c), i) != (c).end())
#define trav(x, c) for (auto &x : c)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repa(i, b, e) \
for (int i = (b) - ((b) > (e)); i != (e) - ((b) > (e)); \
i += 1 - 2 * ((b) > (e)))
template <class T> bool chkmax(T &x, T y) {
return x < y ? x = y, true : false;
}
template <class T> bool chkmin(T &x, T y) {
return x > y ? x = y, true : false;
}
template <class A, class B> A cvt(B x) {
stringstream s;
s << x;
A r;
s >> r;
return r;
}
void read() {}
void print() {}
template <class T, class... Args> void read(T &a, Args &...args) {
cin >> a;
read(args...);
}
template <class T, class... Args> void print(T a, Args... args) {
cout << a << ' ';
print(args...);
}
template <class... Args> void println(Args... args) {
print(args...);
cout << '\n';
}
#define debug(args...) \
{ \
string s_(#args); \
replace(all(s_), ',', ' '); \
stringstream ss_(s_); \
istream_iterator<string> it_(ss_); \
cerr_(it_, args); \
}
void cerr_(istream_iterator<string> it) { (void)it; }
template <class T, class... Args>
void cerr_(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
cerr_(++it, args...);
}
template <class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
os << '{';
string sep;
for (const auto &x : s)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T, class S>
ostream &operator<<(ostream &os, const map<T, S> &m) {
os << '{';
string sep;
for (const auto &x : m)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
os << '{';
string sep;
for (const auto &x : arr)
os << sep << x, sep = ", ";
return os << '}';
}
const int INF = 0x3F3F3F3F;
const int MAXN = (int)1e6;
const int MOD = (int)1e9 + 7;
//=========================
void run_test() {
ll n;
read(n);
int ans = 0;
for (int c = 1; c < n; c++) {
int sq = sqrt(n - c) + 1;
for (int a = 1; a <= sq; a++) {
int b = (n - c) / a;
if (b < a)
break;
if (a * b + c == n) {
ans += 2;
if (a == b)
ans--;
}
}
}
println(ans);
}
//=========================
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// int t_ = 1, t__; cin >> t__; while(t_ <= t__) { cout << "Case #" << t_++ <<
// ": "; run_test(); }
// int t_; cin >> t_; while(t_--) run_test();
run_test();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define ini(a, i) memset(a, i, sizeof(a))
#define inin(a, n, i) memset(a, i, sizeof(a[0]) * (n))
#define contains(c, i) ((c).find(i) != (c).end())
#define present(i, c) (find(all(c), i) != (c).end())
#define trav(x, c) for (auto &x : c)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repa(i, b, e) \
for (int i = (b) - ((b) > (e)); i != (e) - ((b) > (e)); \
i += 1 - 2 * ((b) > (e)))
template <class T> bool chkmax(T &x, T y) {
return x < y ? x = y, true : false;
}
template <class T> bool chkmin(T &x, T y) {
return x > y ? x = y, true : false;
}
template <class A, class B> A cvt(B x) {
stringstream s;
s << x;
A r;
s >> r;
return r;
}
void read() {}
void print() {}
template <class T, class... Args> void read(T &a, Args &...args) {
cin >> a;
read(args...);
}
template <class T, class... Args> void print(T a, Args... args) {
cout << a << ' ';
print(args...);
}
template <class... Args> void println(Args... args) {
print(args...);
cout << '\n';
}
#define debug(args...) \
{ \
string s_(#args); \
replace(all(s_), ',', ' '); \
stringstream ss_(s_); \
istream_iterator<string> it_(ss_); \
cerr_(it_, args); \
}
void cerr_(istream_iterator<string> it) { (void)it; }
template <class T, class... Args>
void cerr_(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
cerr_(++it, args...);
}
template <class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
os << '{';
string sep;
for (const auto &x : s)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T, class S>
ostream &operator<<(ostream &os, const map<T, S> &m) {
os << '{';
string sep;
for (const auto &x : m)
os << sep << x, sep = ", ";
return os << '}';
}
template <class T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
os << '{';
string sep;
for (const auto &x : arr)
os << sep << x, sep = ", ";
return os << '}';
}
const int INF = 0x3F3F3F3F;
const int MAXN = (int)1e6;
const int MOD = (int)1e9 + 7;
//=========================
void run_test() {
ll n;
read(n);
int ans = 0;
for (int a = 1; a < n; a++)
ans += (n - 1) / a;
println(ans);
}
//=========================
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// int t_ = 1, t__; cin >> t__; while(t_ <= t__) { cout << "Case #" << t_++ <<
// ": "; run_test(); }
// int t_; cin >> t_; while(t_--) run_test();
run_test();
return 0;
}
| replace | 119 | 132 | 119 | 121 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
int ab;
int m = 0;
for (c = 1; c < n; ++c) {
ab = n - c;
for (a = 1; a * a <= ab; ++a) {
b = ab / a;
if (a * b == ab) {
m += 2;
if (a == b)
m--;
}
}
}
cout << m << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c;
int ab;
int m = 0;
for (c = 1; c < n; ++c) {
for (a = 1; a * a <= c; ++a) {
b = c / a;
if (a * b == c) {
m += 2;
if (a == b)
m--;
}
}
}
cout << m << endl;
}
| replace | 11 | 15 | 11 | 14 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int c = 1; c < N; c++) {
int T = N - c;
for (int b = 1; b <= T; b++) {
if (T % b == 0) {
count++;
}
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int a = 1; a < N; a++) {
count += (N - 1) / a;
}
cout << count << endl;
return 0;
} | replace | 8 | 15 | 8 | 10 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 0;
for (int a = 1; a < n; a++) {
for (int c = 1; c < n; c++) {
if ((n - c) % a == 0)
ans++;
}
}
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
ans += (n - 1) / i;
}
cout << ans << endl;
}
| replace | 6 | 11 | 6 | 9 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i * j < n)
ans++;
// for(int k=1;k<=n-i*j;k++)
// {
// if(i*j+k==n)ans++;
//// cout<<i<<' '<<j<<' '<<k ;
// }
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= int(n / i); j++) {
if (i * j != n)
ans++;
// for(int k=1;k<=n-i*j;k++)
// {
// if(i*j+k==n)ans++;
//// cout<<i<<' '<<j<<' '<<k ;
// }
}
}
cout << ans;
return 0;
} | replace | 5 | 8 | 5 | 8 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr int inf = 1 << 30;
constexpr int mo = 1e9 + 7;
constexpr ll infl = 1ll << 60;
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int pat = 0;
for (int c = 1; c <= n; ++c) {
int tmp = n - c;
for (int a = 1; a * a <= tmp; ++a)
if (tmp % a == 0) {
if (a != tmp / a)
pat += 2;
else
pat++;
}
}
cout << pat << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr int inf = 1 << 30;
constexpr int mo = 1e9 + 7;
constexpr ll infl = 1ll << 60;
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int pat = 0;
for (int a = 1; a < n; ++a) {
pat += (n - 1) / a;
}
cout << pat << endl;
return 0;
} | replace | 16 | 25 | 16 | 18 | TLE | |
p02548 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1000005;
std::vector<ll> num_divisor(MAX_N, 0);
ll init_num_divisor() {
for (int i = 1; i < MAX_N; ++i) {
for (int j = i; j < MAX_N; j += i) {
num_divisor[j]++;
}
}
}
int main() {
init_num_divisor();
int N;
cin >> N;
ll cnt = 0;
for (int c = 1; c < N; ++c)
cnt += num_divisor[c];
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 1000005;
std::vector<ll> num_divisor(MAX_N, 0);
void init_num_divisor() {
for (int i = 1; i < MAX_N; ++i) {
for (int j = i; j < MAX_N; j += i) {
num_divisor[j]++;
}
}
}
int main() {
init_num_divisor();
int N;
cin >> N;
ll cnt = 0;
for (int c = 1; c < N; ++c)
cnt += num_divisor[c];
cout << cnt << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x, v) \
(lower_bound(x.begin(), x.end(), v) - x.begin()) // xi>=v x is sorted
#define POSU(x, v) \
(upper_bound(x.begin(), x.end(), v) - x.begin()) // xi>v x is sorted
#define NUM(x, v) (POSU(x, v) - POSL(x, v)) // x is sorted
#define REV(x) (reverse(x.begin(), x.end())) // reverse
ll gcd_(ll a, ll b) {
if (a % b == 0)
return b;
return gcd_(b, a % b);
}
ll lcm_(ll a, ll b) {
ll c = gcd_(a, b);
return ((a / c) * b);
}
#define NEXTP(x) next_permutation(x.begin(), x.end())
const ll INF = ll(1e16) + ll(7);
const ll MOD = 1000000007LL;
#define out(a) cout << fixed << setprecision((a))
// tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a) {
ll r = 0;
while (a) {
a /= 10;
r++;
}
return r;
}
template <typename T> class Seg_Tree {
public: // 0-index
vector<T> dat;
T initial, M;
int n;
T unite(T a, T b) { //
return a + b;
}
Seg_Tree(int n0_ = 1, T initial_ = 1, T M_ = 1) {
initsize(n0_, initial_, M_);
}
void initsize(int n0, T initial_, T M_) {
M = M_;
initial = initial_;
int k = 1;
while (1) {
if (n0 <= k) {
n = k;
dat.resize(2 * n - 1);
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = initial;
break;
}
k *= 2;
}
}
// i banme wo x nisuru
void update(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = unite(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
//[a,b)
T query0(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return initial;
if (a <= l && r <= b)
return dat[k];
else {
T vl = query0(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = query0(a, b, k * 2 + 2, (l + r) / 2, r);
return unite(vl, vr);
}
}
// return [a,b)
T query(int a, int b) { return query0(a, b, 0, 0, n); }
};
vector<ll> enum_div(ll n) { // yakusu
vector<ll> 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);
}
}
return ret;
}
map<ll, ll> soinsubunkai(ll x) { // x = {first^second}*...
map<ll, ll> ans;
if (x == 1) {
ans[1]++;
return ans;
}
ll p = x;
for (ll i = 2; i * i <= x; i++) {
while (p % i == 0) {
p /= i;
ans[i]++;
}
}
if (p != 1)
ans[p]++;
return ans;
}
int main() {
ll N;
cin >> N;
ll ans = 0;
FOR(c, 1, N) {
ll k = N - c;
for (ll i = 1; i * i <= k; ++i) {
if (k % i == 0) {
ans++;
if (i * i != k)
ans++;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x, v) \
(lower_bound(x.begin(), x.end(), v) - x.begin()) // xi>=v x is sorted
#define POSU(x, v) \
(upper_bound(x.begin(), x.end(), v) - x.begin()) // xi>v x is sorted
#define NUM(x, v) (POSU(x, v) - POSL(x, v)) // x is sorted
#define REV(x) (reverse(x.begin(), x.end())) // reverse
ll gcd_(ll a, ll b) {
if (a % b == 0)
return b;
return gcd_(b, a % b);
}
ll lcm_(ll a, ll b) {
ll c = gcd_(a, b);
return ((a / c) * b);
}
#define NEXTP(x) next_permutation(x.begin(), x.end())
const ll INF = ll(1e16) + ll(7);
const ll MOD = 1000000007LL;
#define out(a) cout << fixed << setprecision((a))
// tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a) {
ll r = 0;
while (a) {
a /= 10;
r++;
}
return r;
}
template <typename T> class Seg_Tree {
public: // 0-index
vector<T> dat;
T initial, M;
int n;
T unite(T a, T b) { //
return a + b;
}
Seg_Tree(int n0_ = 1, T initial_ = 1, T M_ = 1) {
initsize(n0_, initial_, M_);
}
void initsize(int n0, T initial_, T M_) {
M = M_;
initial = initial_;
int k = 1;
while (1) {
if (n0 <= k) {
n = k;
dat.resize(2 * n - 1);
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = initial;
break;
}
k *= 2;
}
}
// i banme wo x nisuru
void update(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = unite(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
//[a,b)
T query0(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return initial;
if (a <= l && r <= b)
return dat[k];
else {
T vl = query0(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = query0(a, b, k * 2 + 2, (l + r) / 2, r);
return unite(vl, vr);
}
}
// return [a,b)
T query(int a, int b) { return query0(a, b, 0, 0, n); }
};
vector<ll> enum_div(ll n) { // yakusu
vector<ll> 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);
}
}
return ret;
}
map<ll, ll> soinsubunkai(ll x) { // x = {first^second}*...
map<ll, ll> ans;
if (x == 1) {
ans[1]++;
return ans;
}
ll p = x;
for (ll i = 2; i * i <= x; i++) {
while (p % i == 0) {
p /= i;
ans[i]++;
}
}
if (p != 1)
ans[p]++;
return ans;
}
int main() {
ll N;
cin >> N;
ll ans = 0;
FOR(a, 1, N) {
ll b_max = N / a;
if (b_max * a == N)
b_max--;
ans += b_max;
}
cout << ans << endl;
}
| replace | 130 | 139 | 130 | 135 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int c = 1; c < n; c++) {
ll d = n - c;
for (int a = 1; a * a <= d; a++) {
if (d % a == 0 && d / a != a)
ans += 2;
else if (d % a == 0 && a * a == d)
ans++;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
typedef pair<int, int> p;
int main() {
ll n;
cin >> n;
ll ans = 0;
for (int i = 1; i <= n - 1; i++) {
ans += (n - 1) / i;
}
cout << ans;
}
| replace | 10 | 18 | 10 | 12 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //PBDS
#include <ext/pb_ds/tree_policy.hpp> //PBDS
#define int long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pi pair<int, int>
#define deb(x) cerr << #x << " : " << x << endl;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mi map<int, int>
#define PI 3.141592653589
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define f(i, x, n) for (int i = x; i < n; i++)
#define rf(i, x, n) for (int i = n - 1; i >= x; i--)
#define check(x) cerr << #x << " : " << x << endl;
#define ordered_set \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define fbo find_by_order // return iterator PBDS
#define ook order_of_key // return number :)) PBDS
#define baar exit(0)
#define INF 1000000000000000000
using namespace __gnu_pbds;
using namespace std;
signed main() {
fast int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= sqrt(i); j++) {
if (i % j == 0) {
if (i / j == j)
ans++;
else
ans += 2;
}
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //PBDS
#include <ext/pb_ds/tree_policy.hpp> //PBDS
#define int long long int
#define vi vector<int>
#define vii vector<pair<int, int>>
#define pi pair<int, int>
#define deb(x) cerr << #x << " : " << x << endl;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mi map<int, int>
#define PI 3.141592653589
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define f(i, x, n) for (int i = x; i < n; i++)
#define rf(i, x, n) for (int i = n - 1; i >= x; i--)
#define check(x) cerr << #x << " : " << x << endl;
#define ordered_set \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define fbo find_by_order // return iterator PBDS
#define ook order_of_key // return number :)) PBDS
#define baar exit(0)
#define INF 1000000000000000000
using namespace __gnu_pbds;
using namespace std;
signed main() {
fast int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
int val = n / i;
ans += val;
if (n % i == 0)
ans--;
}
cout << ans;
return 0;
}
| replace | 37 | 45 | 37 | 41 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e9;
// マクロ定義
#define vvint(vec, n, m, l) \
vector<vector<int>> vec(n, vector<int>(m, l)); // lで初期化
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>
#define pint pair<int, int>
#define rep(i, a) for (ll i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause") // デバッグ用
#define ret return 0
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;
}
using Graph = vector<vector<ll>>;
#define ketasitei setprecision(15) // 15桁表示
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << ketasitei;
ll n;
cin >> n;
ll ans = 0;
for (ll c = 1; c <= n; c++) {
for (ll a = 1; a * a <= n - c; a++) {
ll b = (n - c) / a;
if (a * b + c == n) {
if (a == b)
ans++;
else
ans += 2;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e9;
// マクロ定義
#define vvint(vec, n, m, l) \
vector<vector<int>> vec(n, vector<int>(m, l)); // lで初期化
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>
#define pint pair<int, int>
#define rep(i, a) for (ll i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause") // デバッグ用
#define ret return 0
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;
}
using Graph = vector<vector<ll>>;
#define ketasitei setprecision(15) // 15桁表示
const ll MOD = 1000000007;
const double PI = 3.1415926535897932;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << ketasitei;
ll n;
cin >> n;
ll ans = 0;
for (ll a = 1; a <= n; a++) {
ll b = n / a;
if (a * b == n)
ans += max(0LL, b - 1);
else
ans += b;
}
cout << ans << endl;
return 0;
} | replace | 68 | 78 | 68 | 74 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
long long n;
cin >> n;
long long ans = 0;
for (long long i = 1; i <= n - 1; i++) {
for (long long j = 1; j <= (n - 1); j++) {
if (i * j <= n - 1)
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
long long n;
cin >> n;
long long ans = 0;
for (long long i = 1; i < n; i++) {
ans += (n - 1) / i;
}
cout << ans << endl;
} | replace | 16 | 21 | 16 | 18 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define sz(a) (int)(a.size())
#define pb push_back
#define all(c) c.begin(), c.end()
#define tr(it, a, c) for (auto it = c.begin() + a; it != c.end(); it++)
#define fr(i, a, n) for (int i = a; i < n; i++)
#define present(c, x) (c.find(x) != c.end()) // for set/map etc.
#define cpresent(c, x) (find(all(c), x) != c.end())
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vp;
int N = 100001;
int mod = 1e9 + 7;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int power(int a, int b) {
int res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
int gcd(int p, int q) {
if (p % q == 0)
return q;
else {
return gcd(q, p % q);
}
}
bool comp(int a, int b) { return (a > b); }
bool comp1(pi a, pi b) {
if (a.first == b.first)
return a.second < b.second;
else
return a.first > b.first;
}
template <typename T> istream &operator>>(istream &in, vector<T> &v) {
for (T &x : v)
in >> x;
return in;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> &v) {
for (T &x : v)
out << x << " ";
return out;
}
// template<typename T>
int sum1(vector<int> &v) {
int sum = 0;
// for(auto x: v)sum+=x;
fr(i, 0, v.size()) sum += v[i];
return sum;
}
void solve() {
int n;
cin >> n;
int a = 0;
fr(i, 1, n) {
fr(j, 1, floor(sqrt(i)) + 1) {
if (i % j == 0)
a = a + 2;
}
if (sqrt(i) == floor(sqrt(i)))
a--;
}
cout << a;
}
signed main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// int t;
// cin>>t;
// while(t--)
// {
// solve();
// cout<<endl;
// }
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define sz(a) (int)(a.size())
#define pb push_back
#define all(c) c.begin(), c.end()
#define tr(it, a, c) for (auto it = c.begin() + a; it != c.end(); it++)
#define fr(i, a, n) for (int i = a; i < n; i++)
#define present(c, x) (c.find(x) != c.end()) // for set/map etc.
#define cpresent(c, x) (find(all(c), x) != c.end())
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vp;
int N = 100001;
int mod = 1e9 + 7;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int power(int a, int b) {
int res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
int gcd(int p, int q) {
if (p % q == 0)
return q;
else {
return gcd(q, p % q);
}
}
bool comp(int a, int b) { return (a > b); }
bool comp1(pi a, pi b) {
if (a.first == b.first)
return a.second < b.second;
else
return a.first > b.first;
}
template <typename T> istream &operator>>(istream &in, vector<T> &v) {
for (T &x : v)
in >> x;
return in;
}
template <typename T> ostream &operator<<(ostream &out, vector<T> &v) {
for (T &x : v)
out << x << " ";
return out;
}
// template<typename T>
int sum1(vector<int> &v) {
int sum = 0;
// for(auto x: v)sum+=x;
fr(i, 0, v.size()) sum += v[i];
return sum;
}
void solve() {
int n;
cin >> n;
int a = 0;
fr(i, 1, n) { a = a + floor((n - 1) / i); }
cout << a;
}
signed main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// int t;
// cin>>t;
// while(t--)
// {
// solve();
// cout<<endl;
// }
solve();
return 0;
} | replace | 82 | 90 | 82 | 83 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i < n; i++) {
int a = n - i;
for (int j = 1; j * j <= a; j++) {
if (j * (a / j) == a)
count += 2;
if (j * (a / j) == a && j == a / j)
count--;
}
}
cout << count;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i < n; i++) {
count += (n - 1) / i;
}
cout << count;
return 0;
}
| replace | 8 | 15 | 8 | 9 | TLE | |
p02548 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define FOA(x) for(int i=0;i<x;i++)
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
count = count + (N / i - 1);
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
// #define FOA(x) for(int i=0;i<x;i++)
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 1; i < N; i++) {
count = count + (N - 1) / i;
}
cout << count << endl;
} | replace | 8 | 10 | 8 | 10 | -8 | |
p02548 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N; i++) {
int n = N - i;
for (int j = 1; j <= sqrt(n); j++) {
if (n % j == 0) {
ans += 2;
}
}
if (sqrt(n) == floor(sqrt(n))) {
ans--;
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N - 1; i++) {
ans += (N - 1) / i;
}
cout << ans << endl;
return 0;
}
| replace | 10 | 20 | 10 | 12 | TLE | |
p02548 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll expo(ll a, ll b) {
ll ex = 1;
rep(i, b) { ex *= a; }
return ex;
}
ll fact(ll a) {
ll fc = 1;
REP(i, 1, a + 1) { fc *= i; }
return fc;
}
int main() {
ll n;
cin >> n;
ll cnt = 0;
rep(c, n) {
rep(a, n - c + 1) {
rep(b, (n - c) / a + 1) {
if (a * b + c == n) {
cnt++;
}
}
}
}
cout << cnt << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll expo(ll a, ll b) {
ll ex = 1;
rep(i, b) { ex *= a; }
return ex;
}
ll fact(ll a) {
ll fc = 1;
REP(i, 1, a + 1) { fc *= i; }
return fc;
}
int main() {
ll n;
cin >> n;
ll cnt = 0;
REP(a, 1, n) { cnt += (n - 1) / a; }
cout << cnt << endl;
} | replace | 28 | 37 | 28 | 29 | -8 | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
time:
wa:
反省:
考察:
*/
int main() {
int n;
cin >> n;
long long count = 0;
for (int c = 1; c <= n - 1; c++) {
for (int a = 1; a <= sqrt(n - c); a++) {
if ((n - c) % a == 0 && a != sqrt(n - c))
count += 2;
else if ((n - c) % a == 0 && a == sqrt(n - c))
count++;
}
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
time:
wa:
反省:
考察:
*/
int main() {
int n;
cin >> n;
long long count = 0;
for (int a = 1; a <= n - 1; a++) {
count += (n - 1) / a;
}
cout << count << endl;
return 0;
} | replace | 17 | 24 | 17 | 19 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
typedef std::vector<std::vector<int64_t>> Graph;
#define rep(i, n) for (int64_t i = 0; i < n; ++i)
#define rep2(i, n) for (int64_t i = 1; i <= n; ++i)
#define repb(i, l, n) for (int64_t i = l; i < n; ++i)
#define repb2(i, l, n) for (int64_t i = l; i <= n; ++i)
#define repe(a, b) for (auto &(a) : (b))
#define ALL(v) (v).begin(), (v).end()
#define Sort(x) sort(ALL(x))
#define Sort_rev(x) \
Sort(x); \
reverse(ALL(x))
#define mp(a, b) make_pair((a), (b))
#define Push_back(a, b) push_back(mp((a), (b)))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename V, typename T> bool find_num(V v, T num) {
if (find(ALL(v), num) == v.end()) {
return false;
}
return true;
}
const int inf = 0x3fffffff;
const int64_t INF = 0x3fffffffffffffff;
const int64_t MOD = 1e9 + 7;
int64_t enum_div(int64_t n) {
vector<int64_t> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
return ret.size();
}
int64_t enum_div2(int64_t n) {
vector<int64_t> ret;
rep2(i, n - 1) {
for (int j = 1; j * j <= i; ++j) {
if (i % j == 0) {
ret.push_back(j);
if (j * j != i) {
ret.push_back(i / j);
}
}
}
// ans += ret.size();
}
return ret.size();
}
int main() {
int64_t n;
cin >> n;
// std::vector<int64_t> v;
/*
int64_t ans = 0;
rep2(i, n-1) {
ans += enum_div(i);
}
cout << ans << endl;
*/
cout << enum_div2(n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int64_t i6;
typedef std::vector<std::vector<int64_t>> Graph;
#define rep(i, n) for (int64_t i = 0; i < n; ++i)
#define rep2(i, n) for (int64_t i = 1; i <= n; ++i)
#define repb(i, l, n) for (int64_t i = l; i < n; ++i)
#define repb2(i, l, n) for (int64_t i = l; i <= n; ++i)
#define repe(a, b) for (auto &(a) : (b))
#define ALL(v) (v).begin(), (v).end()
#define Sort(x) sort(ALL(x))
#define Sort_rev(x) \
Sort(x); \
reverse(ALL(x))
#define mp(a, b) make_pair((a), (b))
#define Push_back(a, b) push_back(mp((a), (b)))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename V, typename T> bool find_num(V v, T num) {
if (find(ALL(v), num) == v.end()) {
return false;
}
return true;
}
const int inf = 0x3fffffff;
const int64_t INF = 0x3fffffffffffffff;
const int64_t MOD = 1e9 + 7;
int64_t enum_div(int64_t n) {
vector<int64_t> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
return ret.size();
}
int64_t enum_div2(int64_t n) {
vector<int64_t> ret;
rep2(i, n - 1) {
for (int j = 1; j * j <= i; ++j) {
if (i % j == 0) {
ret.push_back(j);
if (j * j != i) {
ret.push_back(i / j);
}
}
}
// ans += ret.size();
}
return ret.size();
}
int main() {
int64_t n;
cin >> n;
// std::vector<int64_t> v;
/*
int64_t ans = 0;
rep2(i, n-1) {
ans += enum_div(i);
}
cout << ans << endl;
*/
// cout << enum_div2(n) << endl;
int64_t ans = 0;
rep2(i, n - 1) { ans += (n - 1) / i; }
cout << ans << endl;
return 0;
}
| replace | 86 | 87 | 86 | 90 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl ("\n")
#define pi (3.141592653589)
#define mod 1000000007
#define INF 1000000009
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define so sizeof
#define pii pair<ll, ll>
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, b))
#define min4(a, b, c, d) min(d, min(c, min(a, b)))
#define max3(a, b, c) max(c, max(a, b))
#define max4(a, b, c, d) max(d, max(c, max(a, b)))
#define repe(i, a) for (auto i : a)
#define st string
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define rrep(i, a, b) for (ll i = b; i >= a; i--)
#define fast \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
void solve() {
ll n;
cin >> n;
ll cnt = 0;
rep(i, 1, n - 1) {
for (ll j = 1; j * j <= n - i; j++) {
if ((j * ((n - i) / j)) == (n - i)) {
// cout<<j<<" "<<(n-i)/j<<" "<<i<<endl;
if (j != (n - i) / j)
cnt += 2;
else
cnt++;
}
}
}
cout << cnt << endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
// ll t;
// cin>>t;
// while(t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl ("\n")
#define pi (3.141592653589)
#define mod 1000000007
#define INF 1000000009
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define so sizeof
#define pii pair<ll, ll>
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, b))
#define min4(a, b, c, d) min(d, min(c, min(a, b)))
#define max3(a, b, c) max(c, max(a, b))
#define max4(a, b, c, d) max(d, max(c, max(a, b)))
#define repe(i, a) for (auto i : a)
#define st string
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define rrep(i, a, b) for (ll i = b; i >= a; i--)
#define fast \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
void solve() {
ll n;
cin >> n;
ll cnt = 0;
rep(i, 1, n - 1) { cnt += (n - 1) / i; }
//}
cout << cnt << endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
// ll t;
// cin>>t;
// while(t--)
solve();
return 0;
} | replace | 29 | 40 | 29 | 31 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long long count = 0;
long long f1 = 1;
long long f2 = 1; /*ここを変える*/
long long temp;
if (d == 1) {
count = f1;
} else if (d == 2) {
count = f2;
} else if (d == 0) {
count = 1;
} else {
for (int i = 0; i < d - 2; i++) {
temp = f1 + f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L, long long R) {
if (L > R) {
long long temp = R;
R = L;
L = temp;
}
unsigned long long pp = 0, ppt = 0;
unsigned long long ans = 0;
if (R % L == 0) {
ans = L;
} else {
while (true) {
ppt = pp;
pp = R % L;
if (pp == 0) {
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L, long long R) {
unsigned long long ans;
unsigned long long gcd = GCD(L, R);
ans = (L / gcd) * R;
return ans;
}
/*Combination set*/
#define mod 1000000007
#define maxcomb 1000000 /*大きいものを求めるときはここを変える*/
vector<long long> fc(maxcomb + 1);
vector<long long> ifc(maxcomb + 1);
/*modpowは(10,N)>(9,N)とは限らず、(10,N)-(9,N)をするときは必ずans =
* (ans+mod)%mod;をして正の値に*/
long long modpow(long long x, long long n) {
long long ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
void Conb() {
fc[0] = 1;
ifc[0] = 1;
for (long long i = 0; i < maxcomb; i++) {
fc[i + 1] = fc[i] * (i + 1) % mod; // n!(mod)
ifc[i + 1] = ifc[i] * modpow(i + 1, mod - 2) % mod; // k!^{M-2} (mod)
}
}
unsigned long long Combination(long long L, long long R) {
unsigned long long up = 1, ans;
Conb();
if (L == 0 && R == 0) {
return 1;
} else if (L < R || L < 0) {
return 0;
} else {
long long t = ifc[L - R] * ifc[R] % mod;
ans = t * fc[L] % mod;
}
return ans;
}
/*Combination set ここまで*/
/*ここから*/
long countYak(long long K) {
long N = sqrt(K);
bool b = false;
if (sqrt(K) - N == 0) {
b = true;
}
long count = 1;
if (K == 1) {
return 1;
}
if (K == 2) {
return 2;
}
if (K == 3) {
return 2;
}
if (K == 4) {
return 3;
}
if (K == 6) {
return 4;
}
if (K % 2 != 0) {
if (K % 3 != 0) {
for (int i = 4; i < N; i += 2) {
if (K % (i + 1) == 0) {
count++;
}
}
} else {
count += 1;
for (int i = 4; i < N; i += 2) {
if (K % (i + 1) == 0) {
count++;
}
}
}
} else {
count += 1;
if (K % 3 != 0) {
for (int i = 3; i < N; i++) {
if (K % (i + 1) == 0) {
count++;
}
}
} else {
count += 1;
for (int i = 3; i < N; i++) {
if (K % (i + 1) == 0) {
count++;
}
}
}
}
if (b == false) {
count *= 2;
} else {
count = (count - 1) * 2 + 1;
}
return count;
}
int main() {
ll N;
cin >> N;
ll A = 1, B = 1, C = 1, count = 0;
for (int i = 0; i < N - 1; i++) {
count += countYak(i + 1);
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long long count = 0;
long long f1 = 1;
long long f2 = 1; /*ここを変える*/
long long temp;
if (d == 1) {
count = f1;
} else if (d == 2) {
count = f2;
} else if (d == 0) {
count = 1;
} else {
for (int i = 0; i < d - 2; i++) {
temp = f1 + f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L, long long R) {
if (L > R) {
long long temp = R;
R = L;
L = temp;
}
unsigned long long pp = 0, ppt = 0;
unsigned long long ans = 0;
if (R % L == 0) {
ans = L;
} else {
while (true) {
ppt = pp;
pp = R % L;
if (pp == 0) {
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L, long long R) {
unsigned long long ans;
unsigned long long gcd = GCD(L, R);
ans = (L / gcd) * R;
return ans;
}
/*Combination set*/
#define mod 1000000007
#define maxcomb 1000000 /*大きいものを求めるときはここを変える*/
vector<long long> fc(maxcomb + 1);
vector<long long> ifc(maxcomb + 1);
/*modpowは(10,N)>(9,N)とは限らず、(10,N)-(9,N)をするときは必ずans =
* (ans+mod)%mod;をして正の値に*/
long long modpow(long long x, long long n) {
long long ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
void Conb() {
fc[0] = 1;
ifc[0] = 1;
for (long long i = 0; i < maxcomb; i++) {
fc[i + 1] = fc[i] * (i + 1) % mod; // n!(mod)
ifc[i + 1] = ifc[i] * modpow(i + 1, mod - 2) % mod; // k!^{M-2} (mod)
}
}
unsigned long long Combination(long long L, long long R) {
unsigned long long up = 1, ans;
Conb();
if (L == 0 && R == 0) {
return 1;
} else if (L < R || L < 0) {
return 0;
} else {
long long t = ifc[L - R] * ifc[R] % mod;
ans = t * fc[L] % mod;
}
return ans;
}
/*Combination set ここまで*/
/*ここから*/
long countYak(long long K) {
long N = sqrt(K);
bool b = false;
if (sqrt(K) - N == 0) {
b = true;
}
long count = 1;
if (K == 1) {
return 1;
}
if (K == 2) {
return 2;
}
if (K == 3) {
return 2;
}
if (K == 4) {
return 3;
}
if (K == 6) {
return 4;
}
if (K % 2 != 0) {
if (K % 3 != 0) {
for (int i = 4; i < N; i += 2) {
if (K % (i + 1) == 0) {
count++;
}
}
} else {
count += 1;
for (int i = 4; i < N; i += 2) {
if (K % (i + 1) == 0) {
count++;
}
}
}
} else {
count += 1;
if (K % 3 != 0) {
for (int i = 3; i < N; i++) {
if (K % (i + 1) == 0) {
count++;
}
}
} else {
count += 1;
for (int i = 3; i < N; i++) {
if (K % (i + 1) == 0) {
count++;
}
}
}
}
if (b == false) {
count *= 2;
} else {
count = (count - 1) * 2 + 1;
}
return count;
}
int main() {
ll N;
cin >> N;
ll A = 1, B = 1, C = 1, count = 0;
for (int i = 1; i < N; i++) {
count += (N - 1) / i;
}
cout << count << endl;
return 0;
} | replace | 184 | 186 | 184 | 186 | TLE | |
p02548 | C++ | Time Limit Exceeded | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using numr = std::numeric_limits<T>;
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;
}
const int INF = 1e9;
const ll LLINF = 1e16;
const int mod = 1000000007;
const int mod2 = 998244353;
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#if DEBUG
#define debug(...) \
do { \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::istream &operator>>(std::istream &is, Container &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::ostream &operator<<(std::ostream &os, Container const &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
os << (it != v.begin() ? "," : "") << *it;
}
return os << "}";
}
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t 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);
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for (int a = 1; a < n; a++) {
ans += divisor(a).size();
}
cout << ans << endl;
} | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> using numr = std::numeric_limits<T>;
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;
}
const int INF = 1e9;
const ll LLINF = 1e16;
const int mod = 1000000007;
const int mod2 = 998244353;
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#if DEBUG
#define debug(...) \
do { \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::istream &operator>>(std::istream &is, Container &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <typename Container, typename Value = typename Container::value_type,
std::enable_if_t<!std::is_same<Container, std::string>::value,
std::nullptr_t> = nullptr>
std::ostream &operator<<(std::ostream &os, Container const &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
os << (it != v.begin() ? "," : "") << *it;
}
return os << "}";
}
vector<int64_t> divisor(int64_t n) {
vector<int64_t> ret;
for (int64_t 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);
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int ans = 0;
for (int a = 1; a <= n; a++) {
for (int b = 1; a * b < n; b++) {
ans++;
}
}
cout << ans << endl;
} | replace | 87 | 89 | 87 | 91 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define FORD(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-9
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define sq5(x) ((x) * (x) * (x) * (x) * (x))
int main(void) {
int n;
scanf("%d", &n);
ll cnt = 0;
FOR(i, 1, n) {
for (int j = 1; j * j <= i; j++) {
if (i % j == 0) {
if (j * j == i)
cnt += 1;
else
cnt += 2;
}
}
}
printf("%lld\n", cnt);
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define FORD(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-9
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define sq5(x) ((x) * (x) * (x) * (x) * (x))
int main(void) {
int n;
scanf("%d", &n);
ll cnt = 0;
for (int a = 1; a < n; a++) {
cnt += (n - 1) / a;
}
printf("%lld\n", cnt);
} | replace | 54 | 63 | 54 | 56 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = s; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main() {
ll n;
cin >> n;
ll ans = 0;
ll tmp, j;
REP(i, 1, n) {
tmp = n - i;
for (j = 1; j * j <= tmp; j++) {
if (tmp % j == 0) {
if (j == sqrt(tmp))
ans++;
else
ans += 2;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = s; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main() {
ll n;
cin >> n;
ll ans = 0;
REP(i, 1, n + 1) { ans += (n - 1) / i; }
cout << ans << endl;
return 0;
}
| replace | 12 | 25 | 12 | 13 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// 整数の入力
int N;
int cnt = 0;
int a, b;
cin >> N;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= int(sqrt(N - i)); j++) {
a = (N - i) % j;
b = (N - i) / j;
// cout << i <<" "<< j <<" " << (N-i)%j<< endl;
if (a == 0) {
if (b == j) {
cnt += 1;
} else {
cnt += 2;
}
}
}
}
cout << cnt << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
// 整数の入力
int N;
int cnt = 0;
int a, b;
cin >> N;
for (int i = 1; i < N; i++) {
for (int j = 1; j * j <= N - i; j++) {
a = (N - i) % j;
b = (N - i) / j;
// cout << i <<" "<< j <<" " << (N-i)%j<< endl;
if (a == 0) {
if (b == j) {
cnt += 1;
} else {
cnt += 2;
}
}
}
}
cout << cnt << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD1 1000000007
#define MOD2 998244353
#define nl cout << endl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() \
ll t; \
cin >> t; \
while (t--)
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define s(ar, n) sort(ar, ar + n)
#define rs(ar, n) sort(ar, ar + n, greater<ll>())
#define oa(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define cn(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define ov(a, n) \
for (ll i = n - 1; i >= 0; i--) \
cout << a[i] << " "; \
nl
#define ovp(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i].ff << " " << a[i].ss << endl;
#define maxa(ar, N) *max_element(ar, ar + N)
#define mina(ar, N) *min_element(ar, ar + N)
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<ll, ll> pii;
ll powe(ll n, ll m) {
if (m == 0)
return 1;
ll t = powe(n, m / 2);
if (m % 2 == 0)
return (t * t);
return (((t * t)) * n);
}
ll mpowe(ll n, ll m, ll MOD) {
if (m == 0)
return 1;
ll t = mpowe(n, m / 2, MOD);
t %= MOD;
if (m % 2 == 0)
return (t * t) % MOD;
return (((t * t) % MOD) * n) % MOD;
}
ll logtwo(ll n) {
if (n == 1)
return 0;
if (n == 0)
return -1;
return logtwo(n / 2) + 1;
}
int main() {
fastio();
ll n;
cin >> n;
ll ans = 1;
for (int i = 2; i < n; i++) {
ll temp = 1, x = i;
for (int j = 2; j * j <= i; j++) {
ll c = 0;
if (x % j == 0) {
while (x % j == 0) {
c++;
x = x / j;
}
temp *= (c + 1);
}
}
if (x > 1)
temp *= 2;
// cout<<i<<" "<<temp<<endl;
ans += temp;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD1 1000000007
#define MOD2 998244353
#define nl cout << endl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() \
ll t; \
cin >> t; \
while (t--)
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define s(ar, n) sort(ar, ar + n)
#define rs(ar, n) sort(ar, ar + n, greater<ll>())
#define oa(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define cn(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define ov(a, n) \
for (ll i = n - 1; i >= 0; i--) \
cout << a[i] << " "; \
nl
#define ovp(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i].ff << " " << a[i].ss << endl;
#define maxa(ar, N) *max_element(ar, ar + N)
#define mina(ar, N) *min_element(ar, ar + N)
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<ll, ll> pii;
ll powe(ll n, ll m) {
if (m == 0)
return 1;
ll t = powe(n, m / 2);
if (m % 2 == 0)
return (t * t);
return (((t * t)) * n);
}
ll mpowe(ll n, ll m, ll MOD) {
if (m == 0)
return 1;
ll t = mpowe(n, m / 2, MOD);
t %= MOD;
if (m % 2 == 0)
return (t * t) % MOD;
return (((t * t) % MOD) * n) % MOD;
}
ll logtwo(ll n) {
if (n == 1)
return 0;
if (n == 0)
return -1;
return logtwo(n / 2) + 1;
}
int main() {
fastio();
ll n;
cin >> n;
ll ans = 1;
for (int i = 2; i < n; i++) {
ll temp = 1, x = i;
for (int j = 2; j * j <= x; j++) {
ll c = 0;
if (x % j == 0) {
while (x % j == 0) {
c++;
x = x / j;
}
temp *= (c + 1);
}
}
if (x > 1)
temp *= 2;
// cout<<i<<" "<<temp<<endl;
ans += temp;
}
cout << ans << endl;
} | replace | 74 | 75 | 74 | 75 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int count = 0;
for (long long i = 1; i < N; i++) {
int a = sqrt(N - i);
for (int j = 1; j <= a; j++) {
if ((N - i) % j == 0) {
long long b = (N - i) / j;
if (b == j) {
count++;
} else {
count++;
count++;
}
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
int count = 0;
for (int i = 1; i <= N - 1; i++) {
count += (N - 1) / i;
}
cout << count << endl;
} | replace | 7 | 20 | 7 | 9 | TLE | |
p02548 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL << 60; // 仮想的な無限大の値;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// const int mod = 1000000007;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
rep2(i, 1, N) {
int x = i;
if (x == 1) {
++ans;
continue;
}
// if(x <= 3){
// ans += 2;continue;
// }
ans += 2;
for (ll a = 2; a * a <= x; ++a) {
if (x % a != 0)
continue;
if (a * a == x) {
++ans;
continue;
}
ans += 2;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL << 60; // 仮想的な無限大の値;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// const int mod = 1000000007;
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
rep2(i, 1, N) {
int a = N / i;
int b = N % i;
if (b != 0) {
ans += a;
// if(a >=i) --ans;
} else {
--a;
ans += a;
// if(a >=i) --ans;
}
}
cout << ans << endl;
return 0;
} | replace | 57 | 74 | 57 | 66 | TLE | |
p02549 | C++ | Runtime Error | #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << endl;
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cerr << v[i] << " "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge {
ll x, c;
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll N, K;
cin >> N >> K;
llvec L(K), R(K);
rep(i, K) { cin >> L[i] >> R[i]; }
llvec dp(N, 0);
llvec a(N, 0);
dp[0] = 1;
rep(i, N) {
if (i > 0)
a[i] = mod(a[i] + a[i - 1], MOD);
dp[i] = mod(dp[i] + a[i], MOD);
rep(j, K) {
if (L[j] + 1 < N)
a[i + L[j]] = mod(a[i + L[j]] + dp[i], MOD);
if (i + R[j] + 1 < N)
a[i + R[j] + 1] = mod(a[i + R[j] + 1] - dp[i], MOD);
}
}
cout << dp[N - 1];
return 0;
}
| #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << endl;
#define DUMP(i, v) \
for (ll i = 0; i < v.size(); i++) \
cerr << v[i] << " "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge {
ll x, c;
};
ll mod(ll a, ll mod) {
ll res = a % mod;
if (res < 0)
res = res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
ll gcd(ll a, ll b) {
ll r = a % b;
if (r == 0)
return b;
else
return gcd(b, a % b);
}
bool is_prime(ll n) {
ll i = 2;
if (n == 1)
return false;
if (n == 2)
return true;
bool res = true;
while (i * i < n) {
if (n % i == 0) {
res = false;
}
i = i + 1;
}
// if(i==1)res = false;
if (n % i == 0)
res = false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main() {
ll N, K;
cin >> N >> K;
llvec L(K), R(K);
rep(i, K) { cin >> L[i] >> R[i]; }
llvec dp(N, 0);
llvec a(N, 0);
dp[0] = 1;
rep(i, N) {
if (i > 0)
a[i] = mod(a[i] + a[i - 1], MOD);
dp[i] = mod(dp[i] + a[i], MOD);
rep(j, K) {
if (L[j] + i < N)
a[i + L[j]] = mod(a[i + L[j]] + dp[i], MOD);
if (i + R[j] + 1 < N)
a[i + R[j] + 1] = mod(a[i + R[j] + 1] - dp[i], MOD);
}
}
cout << dp[N - 1];
return 0;
}
| replace | 101 | 102 | 101 | 102 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##end = (b); i <= i##end; i++)
#define temT template <typename T>
using namespace std;
typedef long long ll;
const ll mo = 998244353;
const int N = int(2e5) + 10;
int n, K, a[11][2];
temT inline T add(T x, T y) { return (x += y, x >= mo) ? x -= mo : x; }
temT inline T dec(T x, T y) { return (x -= y, x < 0) ? x += mo : x; }
temT inline T mul(T x, T y) { return T((ll)x * y % mo); }
#define RT 1, 1, n
#define LS p << 1, l, mid
#define RS p << 1 | 1, mid + 1, r
int sum[N * 2], tag[N * 2];
void mt(int p) { sum[p] = add(sum[p << 1], sum[p << 1 | 1]); }
void fill(int p, int l, int r, int v) {
sum[p] = add(sum[p], mul(r - l + 1, v));
tag[p] = add(tag[p], v);
}
void pd(int p, int l, int r) {
int mid = (l + r) >> 1;
fill(LS, tag[p]);
fill(RS, tag[p]);
tag[p] = 0;
}
void upd(int p, int l, int r, int el, int er, int v) {
if (el <= l && r <= er)
return fill(p, l, r, v), void();
pd(p, l, r);
int mid = (l + r) >> 1;
if (el <= mid)
upd(LS, el, er, v);
if (er >= mid + 1)
upd(RS, el, er, v);
mt(p);
}
int ask(int p, int l, int r, int ep) {
if (l == r)
return sum[p];
pd(p, l, r);
int mid = (l + r) >> 1;
if (ep <= mid)
return ask(LS, ep);
if (ep >= mid + 1)
return ask(RS, ep);
}
int main() {
cin >> n >> K;
FOR(i, 1, K) cin >> a[i][0] >> a[i][1];
upd(RT, 1, 1, 1);
FOR(i, 1, n - 1) {
int x = ask(RT, i);
FOR(j, 1, K) {
int l = i + a[j][0], r = i + a[j][1];
if (l > n)
continue;
l = min(l, n), r = min(r, n);
upd(RT, l, r, x);
}
}
cout << ask(RT, n);
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##end = (b); i <= i##end; i++)
#define temT template <typename T>
using namespace std;
typedef long long ll;
const ll mo = 998244353;
const int N = int(2e5) + 10;
int n, K, a[11][2];
temT inline T add(T x, T y) { return (x += y, x >= mo) ? x -= mo : x; }
temT inline T dec(T x, T y) { return (x -= y, x < 0) ? x += mo : x; }
temT inline T mul(T x, T y) { return T((ll)x * y % mo); }
#define RT 1, 1, n
#define LS p << 1, l, mid
#define RS p << 1 | 1, mid + 1, r
int sum[N * 4], tag[N * 4];
void mt(int p) { sum[p] = add(sum[p << 1], sum[p << 1 | 1]); }
void fill(int p, int l, int r, int v) {
sum[p] = add(sum[p], mul(r - l + 1, v));
tag[p] = add(tag[p], v);
}
void pd(int p, int l, int r) {
int mid = (l + r) >> 1;
fill(LS, tag[p]);
fill(RS, tag[p]);
tag[p] = 0;
}
void upd(int p, int l, int r, int el, int er, int v) {
if (el <= l && r <= er)
return fill(p, l, r, v), void();
pd(p, l, r);
int mid = (l + r) >> 1;
if (el <= mid)
upd(LS, el, er, v);
if (er >= mid + 1)
upd(RS, el, er, v);
mt(p);
}
int ask(int p, int l, int r, int ep) {
if (l == r)
return sum[p];
pd(p, l, r);
int mid = (l + r) >> 1;
if (ep <= mid)
return ask(LS, ep);
if (ep >= mid + 1)
return ask(RS, ep);
}
int main() {
cin >> n >> K;
FOR(i, 1, K) cin >> a[i][0] >> a[i][1];
upd(RT, 1, 1, 1);
FOR(i, 1, n - 1) {
int x = ask(RT, i);
FOR(j, 1, K) {
int l = i + a[j][0], r = i + a[j][1];
if (l > n)
continue;
l = min(l, n), r = min(r, n);
upd(RT, l, r, x);
}
}
cout << ask(RT, n);
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
const ll mod = 998244353;
using namespace std;
#define int ll
struct node {
ll val = 0;
ll lz = 0;
} st[1 << 19];
void push(int p, int l = 0, int r = 0) {
st[p].val %= mod;
st[p].val += st[p].lz * (r - l + 1);
st[p].val %= mod;
st[p * 2].lz += st[p].lz;
st[p * 2].lz %= mod;
st[p * 2 + 1].lz += st[p].lz;
st[p * 2 + 1].lz %= mod;
st[p].lz = 0;
}
void update(int p, int l, int r, int i, int j, ll val) {
push(p);
if (r < i || j < l)
return;
if (i <= l && r <= j) {
st[p].lz = val;
push(p, l, r);
} else {
int m = (l + r) / 2;
update(p * 2, l, m, i, j, val);
update(p * 2 + 1, m + 1, r, i, j, val);
}
}
int qry(int p, int l, int r, int i) {
push(p);
if (l == r) {
return st[p].val;
} else {
int m = (l + r) / 2;
if (i <= m) {
return qry(p * 2, l, m, i);
} else {
return qry(p * 2 + 1, m + 1, r, i);
}
}
}
signed main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> segs;
while (k--) {
int l, r;
cin >> l >> r;
segs.emplace_back(l, r);
}
update(1, 0, n - 1, 0, 0, 1);
for (int i = 0; i < n - 1; i++) {
for (auto p : segs) {
int l, r;
l = p.first;
r = p.second;
if (i + l < n) {
update(1, 0, n - 1, i + l, min(n - 1, i + r),
qry(1, 0, n - 1, i) % mod);
}
}
}
cout << qry(1, 0, n - 1, n - 1);
} | #include <bits/stdc++.h>
using ll = long long;
const ll mod = 998244353;
using namespace std;
#define int ll
struct node {
ll val = 0;
ll lz = 0;
} st[8000001];
void push(int p, int l = 0, int r = 0) {
st[p].val %= mod;
st[p].val += st[p].lz * (r - l + 1);
st[p].val %= mod;
st[p * 2].lz += st[p].lz;
st[p * 2].lz %= mod;
st[p * 2 + 1].lz += st[p].lz;
st[p * 2 + 1].lz %= mod;
st[p].lz = 0;
}
void update(int p, int l, int r, int i, int j, ll val) {
push(p);
if (r < i || j < l)
return;
if (i <= l && r <= j) {
st[p].lz = val;
push(p, l, r);
} else {
int m = (l + r) / 2;
update(p * 2, l, m, i, j, val);
update(p * 2 + 1, m + 1, r, i, j, val);
}
}
int qry(int p, int l, int r, int i) {
push(p);
if (l == r) {
return st[p].val;
} else {
int m = (l + r) / 2;
if (i <= m) {
return qry(p * 2, l, m, i);
} else {
return qry(p * 2 + 1, m + 1, r, i);
}
}
}
signed main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> segs;
while (k--) {
int l, r;
cin >> l >> r;
segs.emplace_back(l, r);
}
update(1, 0, n - 1, 0, 0, 1);
for (int i = 0; i < n - 1; i++) {
for (auto p : segs) {
int l, r;
l = p.first;
r = p.second;
if (i + l < n) {
update(1, 0, n - 1, i + l, min(n - 1, i + r),
qry(1, 0, n - 1, i) % mod);
}
}
}
cout << qry(1, 0, n - 1, n - 1);
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int mod = 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, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int n, k;
int l[11], r[11];
mint dp[200005]; // マスNに行く方法
mint sum[200005];
int main() {
cin >> n >> k;
rep(i, k) { cin >> l[i] >> r[i]; }
dp[1] = 1;
sum[1] = 1;
for (int i = 2; i <= n; i++) {
mint cnt = 0;
rep(j, k) {
if (i - r[j] - 1 > 0) {
cnt += sum[i - l[j]] - sum[i - r[j] - 1];
} else {
cnt += sum[i - l[j]];
}
}
dp[i] = cnt;
sum[i] = sum[i - 1] + cnt;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int mod = 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, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
int n, k;
int l[11], r[11];
mint dp[200005]; // マスNに行く方法
mint sum[200005];
int main() {
cin >> n >> k;
rep(i, k) { cin >> l[i] >> r[i]; }
dp[1] = 1;
sum[1] = 1;
for (int i = 2; i <= n; i++) {
mint cnt = 0;
rep(j, k) {
if (i - r[j] - 1 > 0) {
cnt += sum[i - l[j]] - sum[i - r[j] - 1];
} else if (i - l[j] > 0) {
cnt += sum[i - l[j]];
}
}
dp[i] = cnt;
sum[i] = sum[i - 1] + cnt;
}
cout << dp[n] << endl;
return 0;
} | replace | 61 | 62 | 61 | 62 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> t, ans(n + 100000, {0, 0});
for (ll _ = 0; _ < k; ++_) {
pair<ll, ll> p;
cin >> p.first >> p.second;
t.push_back(p);
}
ll f = 0;
for (ll i = 1; i <= n; i++) {
f += ans[i].first;
if (i == 1 || f > 0) {
for (auto p : t) {
ans[i + p.first].first =
ans[i + p.first].first + (i == 1 ? 1 : f) % mod;
ans[i + p.second].second =
ans[i + p.second].second + (i == 1 ? 1 : f) % mod;
}
}
f -= ans[i].second;
}
ll aaaa = 0;
for (ll i = 1; i < n; i++) {
aaaa = ((aaaa + ans[i].first) % mod - (ans[i].second)) % mod;
}
aaaa = (aaaa + ans[n].first) % mod;
cout << aaaa;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> t, ans(n + 250000, {0, 0});
for (ll _ = 0; _ < k; ++_) {
pair<ll, ll> p;
cin >> p.first >> p.second;
t.push_back(p);
}
ll f = 0;
for (ll i = 1; i <= n; i++) {
f += ans[i].first;
if (i == 1 || f > 0) {
for (auto p : t) {
ans[i + p.first].first =
ans[i + p.first].first + (i == 1 ? 1 : f) % mod;
ans[i + p.second].second =
ans[i + p.second].second + (i == 1 ? 1 : f) % mod;
}
}
f -= ans[i].second;
}
ll aaaa = 0;
for (ll i = 1; i < n; i++) {
aaaa = ((aaaa + ans[i].first) % mod - (ans[i].second)) % mod;
}
aaaa = (aaaa + ans[n].first) % mod;
cout << aaaa;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
// Definitions
#define MAXN 210
// #define MAXN 200010
#define MOD 998244353
#define elif else if
typedef long long int64;
#define File(s) freopen(#s ".in", "r", stdin), freopen(#s ".out", "w", stdout)
// Variables
int n, k, l[MAXN], r[MAXN];
// Pynamic Programming
int dp[MAXN], pfxsum[MAXN];
inline void DP() {
dp[1] = 1;
for (int cur = 1, begin, end; cur <= n; cur++) {
for (int idx = 1; idx <= k; idx++) {
begin = max(1, cur - r[idx]);
end = max(0, cur - l[idx]);
// for (int last = begin; last <= end; last++) {
// dp[cur] = (dp[cur] + dp[last]) % MOD;
// }
if (begin <= end) {
dp[cur] = dp[cur] + (pfxsum[end] + MOD - pfxsum[begin - 1]) % MOD;
dp[cur] %= MOD;
}
}
pfxsum[cur] = (pfxsum[cur - 1] + dp[cur]) % MOD;
}
}
// Functions
inline void Monitor() {
for (int i = 1; i <= n; i++) {
printf("%d ", dp[i]);
}
puts("");
}
inline void Process() { DP(); }
inline void ReadIn() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d %d", l + i, r + i);
}
}
inline void PrintAns() {
// Monitor();
printf("%d\n", dp[n]);
}
int main() {
#ifndef ONLINE_JUDGE
File(data);
#endif
ReadIn();
Process();
PrintAns();
return 0;
}
/*
==== O(n^2) {Diffuse} ====
> dp[1] = 1;
> for (int cur = 1; cur <= n; cur++) {
> for (int idx = 1; idx <= k; idx++) {
> for (int add = l[idx]; add <= r[idx]; add++) {
> dp[cur + add] = (dp[cur + add] + dp[cur]) % MOD;
> }
> }
> }
==== O(n^2) {Collect} ===
> dp[1] = 1;
> for (int cur = 1, begin, end; cur <= n; cur++) {
> for (int idx = 1; idx <= k; idx++) {
> begin = max(1, cur - r[idx]);
> end = max(0, cur - l[idx]);
> for (int last = begin; last <= end; last++) {
> dp[cur] = (dp[cur] + dp[last]) % MOD;
> }
> }
> }
*/ | #include <algorithm>
#include <cstdio>
using namespace std;
// Definitions
// #define MAXN 210
#define MAXN 200010
#define MOD 998244353
#define elif else if
typedef long long int64;
#define File(s) freopen(#s ".in", "r", stdin), freopen(#s ".out", "w", stdout)
// Variables
int n, k, l[MAXN], r[MAXN];
// Pynamic Programming
int dp[MAXN], pfxsum[MAXN];
inline void DP() {
dp[1] = 1;
for (int cur = 1, begin, end; cur <= n; cur++) {
for (int idx = 1; idx <= k; idx++) {
begin = max(1, cur - r[idx]);
end = max(0, cur - l[idx]);
// for (int last = begin; last <= end; last++) {
// dp[cur] = (dp[cur] + dp[last]) % MOD;
// }
if (begin <= end) {
dp[cur] = dp[cur] + (pfxsum[end] + MOD - pfxsum[begin - 1]) % MOD;
dp[cur] %= MOD;
}
}
pfxsum[cur] = (pfxsum[cur - 1] + dp[cur]) % MOD;
}
}
// Functions
inline void Monitor() {
for (int i = 1; i <= n; i++) {
printf("%d ", dp[i]);
}
puts("");
}
inline void Process() { DP(); }
inline void ReadIn() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d %d", l + i, r + i);
}
}
inline void PrintAns() {
// Monitor();
printf("%d\n", dp[n]);
}
int main() {
#ifndef ONLINE_JUDGE
File(data);
#endif
ReadIn();
Process();
PrintAns();
return 0;
}
/*
==== O(n^2) {Diffuse} ====
> dp[1] = 1;
> for (int cur = 1; cur <= n; cur++) {
> for (int idx = 1; idx <= k; idx++) {
> for (int add = l[idx]; add <= r[idx]; add++) {
> dp[cur + add] = (dp[cur + add] + dp[cur]) % MOD;
> }
> }
> }
==== O(n^2) {Collect} ===
> dp[1] = 1;
> for (int cur = 1, begin, end; cur <= n; cur++) {
> for (int idx = 1; idx <= k; idx++) {
> begin = max(1, cur - r[idx]);
> end = max(0, cur - l[idx]);
> for (int last = begin; last <= end; last++) {
> dp[cur] = (dp[cur] + dp[last]) % MOD;
> }
> }
> }
*/ | replace | 5 | 7 | 5 | 7 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
int mod = 998244353;
// int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.F << " " << p.S;
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
rep(i, sz(vec)) {
if (i)
os << " ";
os << vec[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
for (auto si : s)
os << si << " ";
return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
rep(j, sz(v)) is >> v[j];
return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
(a += (b % mod + mod)) %= mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
rep(i, sz(v2)) v.eb(v2[i]);
}
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
int T;
T = 1;
while (T--)
solve();
}
struct mint {
ll x;
mint(ll x = 0) : x((mod + x % mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) { // コンストラクタの、modで割った余りがくる
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += -a.x + mod) >= 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 { // mint(a).pow(t) tは余りとったりしたらあかん
if (t == 0)
return 1;
mint a = pow(t >> 1); // 再帰
a *= a;
if (t & 1)
a *= *this;
return a;
}
// 逆元
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { // invを利用
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &s, mint a) { return s << a.x; }
};
void solve() {
int n, k;
cin >> n >> k;
vector<pii> v(k);
rep(i, k) cin >> v[i].F >> v[i].S;
vector<mint> acc(n), dp(n);
dp[0] = 1;
rep(i, n) {
if (i) {
acc[i] += acc[i - 1];
dp[i] = acc[i];
}
rep(j, k) {
if (i + v[j].F >= n)
continue;
acc[i + v[j].F] += dp[i];
acc[min(n - 1, i + v[j].S) + 1] -= dp[i];
}
// cerr << dp[i] << " " << acc << endl;
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
int mod = 998244353;
// int mod = 1000000007;
const double eps = 1e-8;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T, typename U> T pow_(T a, U b) {
return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
ll modpow(ll a, ll b, ll _mod) {
return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.F << " " << p.S;
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
rep(i, sz(vec)) {
if (i)
os << " ";
os << vec[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &s) {
for (auto si : s)
os << si << " ";
return os;
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &v) {
rep(j, sz(v)) is >> v[j];
return is;
}
template <class T, class T2> inline void add(T &a, T2 b) {
(a += (b % mod + mod)) %= mod;
}
template <class T> void operator+=(vector<T> &v, vector<T> v2) {
rep(i, sz(v2)) v.eb(v2[i]);
}
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
int T;
T = 1;
while (T--)
solve();
}
struct mint {
ll x;
mint(ll x = 0) : x((mod + x % mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) { // コンストラクタの、modで割った余りがくる
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += -a.x + mod) >= 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 { // mint(a).pow(t) tは余りとったりしたらあかん
if (t == 0)
return 1;
mint a = pow(t >> 1); // 再帰
a *= a;
if (t & 1)
a *= *this;
return a;
}
// 逆元
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { // invを利用
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &s, mint a) { return s << a.x; }
};
void solve() {
int n, k;
cin >> n >> k;
vector<pii> v(k);
rep(i, k) cin >> v[i].F >> v[i].S;
vector<mint> acc(n + 1), dp(n + 1);
dp[0] = 1;
rep(i, n) {
if (i) {
acc[i] += acc[i - 1];
dp[i] = acc[i];
}
rep(j, k) {
if (i + v[j].F >= n)
continue;
acc[i + v[j].F] += dp[i];
acc[min(n - 1, i + v[j].S) + 1] -= dp[i];
}
// cerr << dp[i] << " " << acc << endl;
}
cout << dp[n - 1] << endl;
}
| replace | 148 | 149 | 148 | 149 | -11 | |
p02549 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
struct _IO {
_IO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} _io;
typedef long long ll;
typedef long double db;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
ll d = exgcd(b, a % b, x, y);
ll t = x;
x = y;
y = t - (a / b) * y;
return d;
}
ll getInv(ll a, ll mod) {
ll x, y;
return exgcd(a, mod, x, y) == 1 ? (x % mod + mod) % mod : -1;
}
const ll maxn = 2e5 + 5, mod = 998244353;
ll dp[maxn], sum[maxn];
bool used[maxn];
int main() {
ll n, k;
vector<ll> s;
vector<pair<ll, ll>> seg;
cin >> n >> k;
while (k--) {
ll a, b;
cin >> a >> b;
seg.push_back({a, b});
}
sort(seg.begin(), seg.end());
dp[1] = 1;
sum[1] = 1;
for (ll i = 1; i <= n; ++i) {
for (pair<ll, ll> &j : seg) {
if (i - j.second - 1 >= 0)
dp[i] = (dp[i] + sum[i - j.first] - sum[i - j.second - 1]) % mod;
else
dp[i] = (dp[i] + sum[i - j.first] - sum[0]) % mod;
}
sum[i] = sum[i - 1] + dp[i];
}
cout << dp[n] % mod << endl;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
struct _IO {
_IO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} _io;
typedef long long ll;
typedef long double db;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1;
y = 0;
return a;
}
ll d = exgcd(b, a % b, x, y);
ll t = x;
x = y;
y = t - (a / b) * y;
return d;
}
ll getInv(ll a, ll mod) {
ll x, y;
return exgcd(a, mod, x, y) == 1 ? (x % mod + mod) % mod : -1;
}
const ll maxn = 2e5 + 5, mod = 998244353;
ll dp[maxn], sum[maxn];
bool used[maxn];
int main() {
ll n, k;
vector<ll> s;
vector<pair<ll, ll>> seg;
cin >> n >> k;
while (k--) {
ll a, b;
cin >> a >> b;
seg.push_back({a, b});
}
sort(seg.begin(), seg.end());
dp[1] = 1;
sum[1] = 1;
for (ll i = 1; i <= n; ++i) {
for (pair<ll, ll> &j : seg) {
if (i - j.second - 1 >= 0)
dp[i] = (dp[i] + sum[i - j.first] - sum[i - j.second - 1]) % mod;
else if (i - j.first >= 0)
dp[i] = (dp[i] + sum[i - j.first] - sum[0]) % mod;
}
sum[i] = sum[i - 1] + dp[i];
}
cout << dp[n] % mod << endl;
return 0;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
ll mod = 998244353;
ll inf = 1e18;
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
vector<ll> f(n + 5), a(n + 5);
vector<bool> num(n + 5);
rep(i, k) {
cin >> l[i] >> r[i];
for (int j = l[i]; j <= r[i]; j++)
num[j] = true;
}
a[0] = 0;
f[0] = 0;
rep2(i, 1, n) {
if (num[i]) {
a[i]++;
a[i + 1]--;
}
f[i] = f[i - 1] + a[i];
f[i] %= mod;
rep(j, k) {
a[i + l[j]] += f[i];
a[i + l[j]] %= mod;
a[i + r[j] + 1] -= f[i];
a[i + r[j] + 1] = (a[i + r[j] + 1] + mod) % mod;
}
}
// rep2(i,1,n) cout << i << ' ' << a[i] << ' ' << f[i] << endl;
cout << f[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
ll mod = 998244353;
ll inf = 1e18;
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
vector<ll> f(2 * n + 5), a(2 * n + 5);
vector<bool> num(2 * n + 5);
rep(i, k) {
cin >> l[i] >> r[i];
for (int j = l[i]; j <= r[i]; j++)
num[j] = true;
}
a[0] = 0;
f[0] = 0;
rep2(i, 1, n) {
if (num[i]) {
a[i]++;
a[i + 1]--;
}
f[i] = f[i - 1] + a[i];
f[i] %= mod;
rep(j, k) {
a[i + l[j]] += f[i];
a[i + l[j]] %= mod;
a[i + r[j] + 1] -= f[i];
a[i + r[j] + 1] = (a[i + r[j] + 1] + mod) % mod;
}
}
// rep2(i,1,n) cout << i << ' ' << a[i] << ' ' << f[i] << endl;
cout << f[n - 1] << endl;
return 0;
} | replace | 14 | 16 | 14 | 16 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio \
cin.tie(nullptr); \
ios_base::sync_with_stdio(false);
#define endl '\n'
template <class T> bool updmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> bool updmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> T permutation(ll n, ll k) {
T f(1);
for (ll i = 0; i < k; ++i, --n)
f *= n;
return f;
}
template <class T> T factorial(ll n) { return permutation<T>(n, n); }
template <class T> T binomial(ll n, ll k) {
return permutation<T>(n, k) /= factorial<T>(k);
}
template <ll Mod> class modint {
public:
ll n = 0;
modint() {}
modint(ll n) : n(n) { clamp(); }
modint &operator=(modint const &a) = default;
modint &operator=(int a) {
n = a;
clamp();
return *this;
}
modint operator-() {
modint t = *this;
t.n = -t.n;
t.clamp();
return t;
}
modint &operator*=(modint const &a) {
n *= a.n;
clamp();
return *this;
}
modint &operator*=(ll a) {
n *= a;
clamp();
return *this;
}
modint &operator/=(modint const &a) {
*this *= a.inv();
return *this;
}
modint &operator+=(modint const &a) {
n += a.n;
if (n >= Mod)
n -= Mod;
return *this;
}
modint &operator-=(modint const &a) {
n -= a.n;
if (n < 0)
n += Mod;
return *this;
}
modint &operator%=(modint const &a) {
n %= a.n;
clamp();
return *this;
}
friend modint operator*(modint a, modint b) {
modint t(a);
t.n *= b.n;
t.clamp();
return t;
}
friend modint operator+(modint a, modint b) {
modint t(a);
t.n += b.n;
t.clamp();
return t;
}
friend modint operator-(modint a, modint b) {
modint t(a);
t.n -= b.n;
t.clamp();
return t;
}
friend ostream &operator<<(ostream &os, modint const &a) {
os << a.n;
return os;
}
friend bool operator==(modint const &a, int b) { return a.n == b; }
void clamp() {
n %= Mod;
if (n < 0)
n += Mod;
}
modint inv() const { return this->pow(Mod - 2); }
ll get() { return n; }
modint pow(ll p) const {
ll a = 1, e = n;
while (p > 0) {
if (p & 1) {
a *= e;
a %= Mod;
}
e *= e;
e %= Mod;
p >>= 1;
}
return modint(a);
}
};
const ll Mod = 998244353;
using mint = modint<Mod>;
mint dp[100005];
mint sum[100005];
int main() {
fastio;
ll ans = 0;
ll N, K;
cin >> N >> K;
vector<pair<int, int>> v;
rep(i, K) {
int l, r;
cin >> l >> r;
v.push_back({l, r});
}
dp[1] = 1;
sum[1] = 1;
for (int i = 2; i <= N; ++i) {
for (auto p : v) {
int lpos = max(i - p.second - 1, 0);
int rpos = max(i - p.first, 0);
mint s = sum[rpos] - sum[lpos];
dp[i] += s;
}
sum[i] += dp[i] + sum[i - 1];
}
cout << dp[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define revrep(i, n) for (ll i = n - 1; i >= 0; --i)
inline constexpr ll Inf = (1ULL << 62) - 1;
#define fastio \
cin.tie(nullptr); \
ios_base::sync_with_stdio(false);
#define endl '\n'
template <class T> bool updmax(T &a, T b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> bool updmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> T permutation(ll n, ll k) {
T f(1);
for (ll i = 0; i < k; ++i, --n)
f *= n;
return f;
}
template <class T> T factorial(ll n) { return permutation<T>(n, n); }
template <class T> T binomial(ll n, ll k) {
return permutation<T>(n, k) /= factorial<T>(k);
}
template <ll Mod> class modint {
public:
ll n = 0;
modint() {}
modint(ll n) : n(n) { clamp(); }
modint &operator=(modint const &a) = default;
modint &operator=(int a) {
n = a;
clamp();
return *this;
}
modint operator-() {
modint t = *this;
t.n = -t.n;
t.clamp();
return t;
}
modint &operator*=(modint const &a) {
n *= a.n;
clamp();
return *this;
}
modint &operator*=(ll a) {
n *= a;
clamp();
return *this;
}
modint &operator/=(modint const &a) {
*this *= a.inv();
return *this;
}
modint &operator+=(modint const &a) {
n += a.n;
if (n >= Mod)
n -= Mod;
return *this;
}
modint &operator-=(modint const &a) {
n -= a.n;
if (n < 0)
n += Mod;
return *this;
}
modint &operator%=(modint const &a) {
n %= a.n;
clamp();
return *this;
}
friend modint operator*(modint a, modint b) {
modint t(a);
t.n *= b.n;
t.clamp();
return t;
}
friend modint operator+(modint a, modint b) {
modint t(a);
t.n += b.n;
t.clamp();
return t;
}
friend modint operator-(modint a, modint b) {
modint t(a);
t.n -= b.n;
t.clamp();
return t;
}
friend ostream &operator<<(ostream &os, modint const &a) {
os << a.n;
return os;
}
friend bool operator==(modint const &a, int b) { return a.n == b; }
void clamp() {
n %= Mod;
if (n < 0)
n += Mod;
}
modint inv() const { return this->pow(Mod - 2); }
ll get() { return n; }
modint pow(ll p) const {
ll a = 1, e = n;
while (p > 0) {
if (p & 1) {
a *= e;
a %= Mod;
}
e *= e;
e %= Mod;
p >>= 1;
}
return modint(a);
}
};
const ll Mod = 998244353;
using mint = modint<Mod>;
mint dp[200005];
mint sum[200005];
int main() {
fastio;
ll ans = 0;
ll N, K;
cin >> N >> K;
vector<pair<int, int>> v;
rep(i, K) {
int l, r;
cin >> l >> r;
v.push_back({l, r});
}
dp[1] = 1;
sum[1] = 1;
for (int i = 2; i <= N; ++i) {
for (auto p : v) {
int lpos = max(i - p.second - 1, 0);
int rpos = max(i - p.first, 0);
mint s = sum[rpos] - sum[lpos];
dp[i] += s;
}
sum[i] += dp[i] + sum[i - 1];
}
cout << dp[N] << endl;
}
| replace | 132 | 134 | 132 | 134 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A> string to_string(A);
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool f = 1;
string r = "{";
for (const auto &x : v) {
if (!f)
r += ", ";
f = 0;
r += to_string(x);
}
return r + "}";
}
void debug_out() { cout << endl; }
void show() { cout << endl; }
void pret() {
cout << endl;
exit(0);
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << " " << to_string(H);
debug_out(T...);
}
template <typename Head, typename... Tail> void show(Head H, Tail... T) {
cout << H << " ";
show(T...);
}
template <typename Head, typename... Tail> void pret(Head H, Tail... T) {
cout << H << " ";
pret(T...);
}
#define pr(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef long long ll;
#define int ll
typedef long double ld;
typedef vector<int> vi;
#define disp(x) cout << x << " ";
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define fo(i, a, b) for (int i = a; i <= (int)b; i++)
#define rf(i, a, b) for (int i = a; i >= (int)b; i--)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
#define endl '\n'
// cout.setf(ios::fixed);cout.precision(18)
const int MOD = 998244353;
const int maxn = 3e5 + 10;
int dp[maxn];
void add(int l, int r, int x) {
dp[l] += x;
dp[l] %= MOD;
if (r >= maxn)
return;
dp[r + 1] -= x;
dp[r + 1] %= MOD;
}
int32_t main() {
fast_io;
int n, k;
cin >> n >> k;
vector<pair<int, int>> v;
for (int i = 0; i < k; ++i) {
int l, r;
cin >> l >> r;
v.emplace_back(l, r);
}
add(1, 1, 1);
fo(i, 1, n) {
dp[i] += dp[i - 1];
dp[i] %= MOD;
// show(i, dp[i]);
for (const auto &it : v) {
add(i + it.first, i + it.second, dp[i]);
}
}
if (dp[n] < 0)
dp[n] += MOD;
show(dp[n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fast_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A> string to_string(A);
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool f = 1;
string r = "{";
for (const auto &x : v) {
if (!f)
r += ", ";
f = 0;
r += to_string(x);
}
return r + "}";
}
void debug_out() { cout << endl; }
void show() { cout << endl; }
void pret() {
cout << endl;
exit(0);
}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << " " << to_string(H);
debug_out(T...);
}
template <typename Head, typename... Tail> void show(Head H, Tail... T) {
cout << H << " ";
show(T...);
}
template <typename Head, typename... Tail> void pret(Head H, Tail... T) {
cout << H << " ";
pret(T...);
}
#define pr(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
typedef long long ll;
#define int ll
typedef long double ld;
typedef vector<int> vi;
#define disp(x) cout << x << " ";
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define fo(i, a, b) for (int i = a; i <= (int)b; i++)
#define rf(i, a, b) for (int i = a; i >= (int)b; i--)
#define mp make_pair
#define pb emplace_back
#define F first
#define S second
#define endl '\n'
// cout.setf(ios::fixed);cout.precision(18)
const int MOD = 998244353;
const int maxn = 3e5 + 10;
int dp[maxn];
void add(int l, int r, int x) {
if (l >= maxn)
return;
dp[l] += x;
dp[l] %= MOD;
if (r >= maxn)
return;
dp[r + 1] -= x;
dp[r + 1] %= MOD;
}
int32_t main() {
fast_io;
int n, k;
cin >> n >> k;
vector<pair<int, int>> v;
for (int i = 0; i < k; ++i) {
int l, r;
cin >> l >> r;
v.emplace_back(l, r);
}
add(1, 1, 1);
fo(i, 1, n) {
dp[i] += dp[i - 1];
dp[i] %= MOD;
// show(i, dp[i]);
for (const auto &it : v) {
add(i + it.first, i + it.second, dp[i]);
}
}
if (dp[n] < 0)
dp[n] += MOD;
show(dp[n]);
return 0;
} | insert | 63 | 63 | 63 | 65 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pair<long, long>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 998244353
#define all(vec) vec.begin(), vec.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;
}
int main() {
long n, k;
cin >> n >> k;
vector<pll> data(k);
rep(i, k) cin >> data.at(i).first >> data.at(i).second;
vector<long> dp(200010, 0);
vector<long> imos(200010, 0);
dp.at(1) = 1;
long acm = 0;
REP(v, 1, n) {
if (v == 1) {
rep(i, k) {
imos.at(v + data.at(i).first) += 1;
imos.at(v + data.at(i).second + 1) -= 1;
}
} else {
acm += imos.at(v);
acm %= MOD;
dp.at(v) = acm;
rep(i, k) {
imos.at(v + data.at(i).first) += acm;
imos.at(v + data.at(i).first) % MOD;
imos.at(v + data.at(i).second + 1) -= acm;
imos.at(v + data.at(i).second + 1) += MOD;
imos.at(v + data.at(i).second + 1) %= MOD;
}
}
}
// rep(i,n+1) cout << dp.at(i) << " ";
// cout << endl;
// cout << imos.at(n) << endl;
cout << (acm + imos.at(n)) % MOD << endl;
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pair<long, long>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 998244353
#define all(vec) vec.begin(), vec.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;
}
int main() {
long n, k;
cin >> n >> k;
vector<pll> data(k);
rep(i, k) cin >> data.at(i).first >> data.at(i).second;
vector<long> dp(500010, 0);
vector<long> imos(500010, 0);
dp.at(1) = 1;
long acm = 0;
REP(v, 1, n) {
if (v == 1) {
rep(i, k) {
imos.at(v + data.at(i).first) += 1;
imos.at(v + data.at(i).second + 1) -= 1;
}
} else {
acm += imos.at(v);
acm %= MOD;
dp.at(v) = acm;
rep(i, k) {
imos.at(v + data.at(i).first) += acm;
imos.at(v + data.at(i).first) % MOD;
imos.at(v + data.at(i).second + 1) -= acm;
imos.at(v + data.at(i).second + 1) += MOD;
imos.at(v + data.at(i).second + 1) %= MOD;
}
}
}
// rep(i,n+1) cout << dp.at(i) << " ";
// cout << endl;
// cout << imos.at(n) << endl;
cout << (acm + imos.at(n)) % MOD << endl;
} | replace | 41 | 43 | 41 | 43 | 0 | |
p02549 | C++ | Runtime Error | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; i--)
#define all(vec) vec.begin(), vec.end()
#define sortt(vec) sort((vec).begin(), (vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;
typedef tuple<int, int, int> tiii;
const ll mod = 998244353;
const int inf = 1 << 30;
const ll lnf = 1ll << 60;
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, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
mint dp[10];
int main() {
itn n, k;
cin >> n >> k;
dp[0] = 1;
dp[1] = -1;
vector<int> l(k);
vector<int> r(k);
rep(i, k) cin >> l[i] >> r[i];
rep(i, n) {
if (i > 0)
dp[i] += dp[i - 1];
rep(j, k) {
mint x = dp[i];
if (i + l[j] < n)
dp[i + l[j]] += x;
if (i + r[j] + 1 < n)
dp[i + r[j] + 1] -= x;
}
}
cout << dp[n - 1] << endl;
} | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define itn int
#define fi first
#define se second
#define intmax numeric_limits<int>::max()
#define llmax numeric_limits<ll>::max()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; i--)
#define all(vec) vec.begin(), vec.end()
#define sortt(vec) sort((vec).begin(), (vec).end())
#define rsort(vec) sort((vec).rbegin(), (vec).rend())
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;
typedef tuple<int, int, int> tiii;
const ll mod = 998244353;
const int inf = 1 << 30;
const ll lnf = 1ll << 60;
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, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
mint dp[1000010];
int main() {
itn n, k;
cin >> n >> k;
dp[0] = 1;
dp[1] = -1;
vector<int> l(k);
vector<int> r(k);
rep(i, k) cin >> l[i] >> r[i];
rep(i, n) {
if (i > 0)
dp[i] += dp[i - 1];
rep(j, k) {
mint x = dp[i];
if (i + l[j] < n)
dp[i + l[j]] += x;
if (i + r[j] + 1 < n)
dp[i + r[j] + 1] -= x;
}
}
cout << dp[n - 1] << endl;
} | replace | 80 | 81 | 80 | 81 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i < g; i++)
using namespace std;
using ll = long long;
using ss = stringstream;
const ll mod = 1000000000 + 7; // 10^9
const ll llmax = pow(10, 18);
// bool is_integer(double x){
// return floor(x) == x;
// }
// struct factorial
// {
// vector<ll> fac, finv, inv;
// factorial(int n) : fac(2, 1), finv(2, 1), inv(2, 1)
// {
// int i;
// rep(i, 2, n + 1)
// {
// fac.push_back(fac[i - 1] * i % mod);
// inv.push_back(mod - inv[mod % i] * (mod / i) % mod);
// finv.push_back(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;
// }
// ll perm(int n, int k)
// {
// if (n < k)
// {
// return 0;
// }
// if (n < 0 || k < 0)
// {
// return 0;
// }
// return fac[n] * finv[n - k] % mod;
// }
// };
// ll power(ll x, ll y)
// {
// ll ans = 1;
// while (y)
// {
// if (y & 1)
// ans = (ans * x) % mod;
// x = (x * x) % mod;
// y >>= 1;
// }
// return ans;
// }
// ll mod_conb(ll n, ll k)
// {
// ll ans = 1;
// if (n < k || n < 0 || k < 0)
// {
// return 0;
// }
// for (long long i = 0; i < k; i++)
// {
// ans *= n - i;
// ans %= mod;
// ans *= power(i + 1, mod - 2);
// ans %= mod;
// }
// return ans;
// }
// struct unionfind
// {
// vector<long long> d;
// unionfind(long long n) : d(n, -1) {}
// long long root(long long x)
// {
// if (d[x] < 0)
// {
// return x;
// }
// else
// {
// return d[x] = root(d[x]);
// }
// }
// bool unite(long long x, long long y)
// {
// x = root(x);
// y = root(y);
// if (x == y)
// {
// return false;
// }
// if (d[x] > d[y])
// {
// swap(x, y);
// }
// d[x] += d[y];
// d[y] = x;
// return true;
// }
// bool same(long long x, long long y)
// {
// return root(x) == root(y);
// }
// long long size(long long x)
// {
// return -d[root(x)];
// }
// };
/*逆元 あまりの割り算をするときにこいつをかける(a/b→a*modinv(b))*/
// mod. m での a の逆元 a^{-1} を計算する
// ll modinv(ll a,ll 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;
// }
// bool IsPrime(ll num)
// {
// if (num < 2) return false;
// else if (num == 2) return true;
// else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
// double sqrtNum = sqrt(num);
// for (int i = 3; i <= sqrtNum; i += 2)
// {
// if (num % i == 0)
// {
// 素数ではない
// return false;
// }
// }
// 素数である
// return true;
// }
/*階乗*/
// ll facctorialMethod(ll k){
// ll sum = 1;
// for (ll i = 1; i <= k; ++i)
// {
// sum *= i;
// sum%=MOD;//あまりを出力せよ問題の時はこれもやる
// }
// return sum;
// }
vector<int> Eratosthenes(ll N) {
vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
vector<ll> L(K);
vector<ll> R(K);
ll mll = 998244353;
vector<ll> DP(N, 0);
vector<ll> A(N + 1); // i = 0〜i-1番目までのDPが入ってる
A[0] = 0;
A[1] = 1;
DP[0] = 1; // 0マス目に行くまでの通り
for (ll i = 0; i < K; i++) {
cin >> L[i];
cin >> R[i];
}
for (ll i = 1; i < N; i++) {
for (ll j = 0; j < K; j++) {
if (i - L[j] < 0)
continue;
DP[i] += A[i - L[j] + 1] - A[i - R[j]] + mll;
DP[i] %= mll;
}
A[i + 1] = (A[i] + DP[i]) % mll;
}
ll ans = DP[N - 1];
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i < g; i++)
using namespace std;
using ll = long long;
using ss = stringstream;
const ll mod = 1000000000 + 7; // 10^9
const ll llmax = pow(10, 18);
// bool is_integer(double x){
// return floor(x) == x;
// }
// struct factorial
// {
// vector<ll> fac, finv, inv;
// factorial(int n) : fac(2, 1), finv(2, 1), inv(2, 1)
// {
// int i;
// rep(i, 2, n + 1)
// {
// fac.push_back(fac[i - 1] * i % mod);
// inv.push_back(mod - inv[mod % i] * (mod / i) % mod);
// finv.push_back(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;
// }
// ll perm(int n, int k)
// {
// if (n < k)
// {
// return 0;
// }
// if (n < 0 || k < 0)
// {
// return 0;
// }
// return fac[n] * finv[n - k] % mod;
// }
// };
// ll power(ll x, ll y)
// {
// ll ans = 1;
// while (y)
// {
// if (y & 1)
// ans = (ans * x) % mod;
// x = (x * x) % mod;
// y >>= 1;
// }
// return ans;
// }
// ll mod_conb(ll n, ll k)
// {
// ll ans = 1;
// if (n < k || n < 0 || k < 0)
// {
// return 0;
// }
// for (long long i = 0; i < k; i++)
// {
// ans *= n - i;
// ans %= mod;
// ans *= power(i + 1, mod - 2);
// ans %= mod;
// }
// return ans;
// }
// struct unionfind
// {
// vector<long long> d;
// unionfind(long long n) : d(n, -1) {}
// long long root(long long x)
// {
// if (d[x] < 0)
// {
// return x;
// }
// else
// {
// return d[x] = root(d[x]);
// }
// }
// bool unite(long long x, long long y)
// {
// x = root(x);
// y = root(y);
// if (x == y)
// {
// return false;
// }
// if (d[x] > d[y])
// {
// swap(x, y);
// }
// d[x] += d[y];
// d[y] = x;
// return true;
// }
// bool same(long long x, long long y)
// {
// return root(x) == root(y);
// }
// long long size(long long x)
// {
// return -d[root(x)];
// }
// };
/*逆元 あまりの割り算をするときにこいつをかける(a/b→a*modinv(b))*/
// mod. m での a の逆元 a^{-1} を計算する
// ll modinv(ll a,ll 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;
// }
// bool IsPrime(ll num)
// {
// if (num < 2) return false;
// else if (num == 2) return true;
// else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
// double sqrtNum = sqrt(num);
// for (int i = 3; i <= sqrtNum; i += 2)
// {
// if (num % i == 0)
// {
// 素数ではない
// return false;
// }
// }
// 素数である
// return true;
// }
/*階乗*/
// ll facctorialMethod(ll k){
// ll sum = 1;
// for (ll i = 1; i <= k; ++i)
// {
// sum *= i;
// sum%=MOD;//あまりを出力せよ問題の時はこれもやる
// }
// return sum;
// }
vector<int> Eratosthenes(ll N) {
vector<bool> is_prime(N + 1);
for (int i = 0; i <= N; i++) {
is_prime[i] = true;
}
vector<int> P;
for (int i = 2; i <= N; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= N; j += i) {
is_prime[j] = false;
}
P.emplace_back(i);
}
}
return P;
}
int main() {
ll N;
cin >> N;
ll K;
cin >> K;
vector<ll> L(K);
vector<ll> R(K);
ll mll = 998244353;
vector<ll> DP(N, 0);
vector<ll> A(N + 1); // i = 0〜i-1番目までのDPが入ってる
A[0] = 0;
A[1] = 1;
DP[0] = 1; // 0マス目に行くまでの通り
for (ll i = 0; i < K; i++) {
cin >> L[i];
cin >> R[i];
}
for (ll i = 1; i < N; i++) {
for (ll j = 0; j < K; j++) {
if (i - L[j] < 0)
continue;
DP[i] += A[i - L[j] + 1] - A[max(i - R[j], ll(0))] + mll;
DP[i] %= mll;
}
A[i + 1] = (A[i] + DP[i]) % mll;
}
ll ans = DP[N - 1];
cout << ans << endl;
}
| replace | 243 | 244 | 243 | 244 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, k;
int l[200005], r[200005];
int dp[200005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d %d", &l[i], &r[i]);
}
dp[1] = 1;
dp[2] = -1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i] + dp[i - 1]) % mod;
for (int j = 1; j <= k; j++) {
dp[i + l[j]] = (dp[i + l[j]] + dp[i]) % mod;
dp[i + r[j] + 1] = (dp[i + r[j] + 1] - dp[i] + mod) % mod;
}
}
printf("%d", dp[n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int n, k;
int l[200005], r[200005];
int dp[2000005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d %d", &l[i], &r[i]);
}
dp[1] = 1;
dp[2] = -1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i] + dp[i - 1]) % mod;
for (int j = 1; j <= k; j++) {
dp[i + l[j]] = (dp[i + l[j]] + dp[i]) % mod;
dp[i + r[j] + 1] = (dp[i + r[j] + 1] - dp[i] + mod) % mod;
}
}
printf("%d", dp[n]);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 998244353
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> v, tmp;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
tmp.push_back({x, y});
}
sort(all(tmp));
int px = 0, py = 0;
for (auto g : tmp) {
if (g.ff <= py) {
py = g.ss;
} else {
if (px != 0 && py != 0)
v.push_back({px, py});
px = g.ff;
py = g.ss;
}
}
v.push_back({px, py});
vector<int> A(n + 1);
A[1] = 1;
A[2] = -1;
for (int i = 1; i <= n; i++) {
A[i] += A[i - 1];
if (A[i] >= MOD)
A[i] -= MOD;
for (auto g : v) {
A[i + g.ff] += A[i];
if (A[i + g.ff] >= MOD)
A[i + g.ff] -= MOD;
A[i + g.ss + 1] -= A[i];
if (A[i + g.ss + 1] < 0)
A[i + g.ss + 1] += MOD;
}
}
cout << A[n];
} | #include <algorithm>
#include <iostream>
#include <vector>
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define MOD 998244353
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> v, tmp;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
tmp.push_back({x, y});
}
sort(all(tmp));
int px = 0, py = 0;
for (auto g : tmp) {
if (g.ff <= py) {
py = g.ss;
} else {
if (px != 0 && py != 0)
v.push_back({px, py});
px = g.ff;
py = g.ss;
}
}
v.push_back({px, py});
vector<int> A(n + 1);
A[1] = 1;
A[2] = -1;
for (int i = 1; i <= n; i++) {
A[i] += A[i - 1];
if (A[i] >= MOD)
A[i] -= MOD;
for (auto g : v) {
if (i + g.ff <= n) {
A[i + g.ff] += A[i];
if (A[i + g.ff] >= MOD)
A[i + g.ff] -= MOD;
}
if (i + g.ss + 1 <= n) {
A[i + g.ss + 1] -= A[i];
if (A[i + g.ss + 1] < 0)
A[i + g.ss + 1] += MOD;
}
}
}
cout << A[n];
} | replace | 39 | 45 | 39 | 49 | -6 | munmap_chunk(): invalid pointer
|
p02549 | C++ | Runtime Error | /*
******
Author: Nguyen Phuc Chuong
******
*/
#include <bits/stdc++.h>
using namespace std;
long long a[10][2];
long long dp[200000];
const long long mod = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> a[i][0] >> a[i][1];
}
dp[0] = 1;
dp[1] = -1;
for (int i = 0; i < n; i++) {
if (i > 0) {
dp[i] = (dp[i] + dp[i - 1]) % mod;
}
for (int j = 0; j < k; j++) {
dp[i + a[j][0]] = (dp[i + a[j][0]] + dp[i]) % mod;
dp[i + a[j][1] + 1] = (dp[i + a[j][1] + 1] - dp[i]) % mod;
if (dp[i + a[j][1] + 1] < 0) {
dp[i + a[j][1] + 1] += mod;
}
}
}
cout << dp[n - 1];
return 0;
}
| /*
******
Author: Nguyen Phuc Chuong
******
*/
#include <bits/stdc++.h>
using namespace std;
long long a[10][2];
long long dp[200000];
const long long mod = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> a[i][0] >> a[i][1];
}
dp[0] = 1;
dp[1] = -1;
for (int i = 0; i < n; i++) {
if (i > 0) {
dp[i] = (dp[i] + dp[i - 1]) % mod;
}
for (int j = 0; j < k; j++) {
if (i + a[j][0] < n) {
dp[i + a[j][0]] = (dp[i + a[j][0]] + dp[i]) % mod;
}
if (i + a[j][1] + 1 < n) {
dp[i + a[j][1] + 1] = (dp[i + a[j][1] + 1] - dp[i]) % mod;
if (dp[i + a[j][1] + 1] < 0) {
dp[i + a[j][1] + 1] += mod;
}
}
}
}
cout << dp[n - 1];
return 0;
}
| replace | 31 | 35 | 31 | 39 | 0 | |
p02549 | 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;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
// 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 {
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;
}
};
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) cin >> l[i] >> r[i];
vector<mint> dp(n + 1);
vector<mint> dpsum(n + 1);
dp[1] = 1;
dpsum[1] = 1;
for (int i = 2; i <= n; i++) {
rep(j, k) {
int li = i - r[j];
int ri = i - l[i];
if (ri < 0)
continue;
li = max(li, 1);
dp[i] += dpsum[ri] - dpsum[li - 1];
}
dpsum[i] = dpsum[i - 1] + dp[i];
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
// 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 {
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;
}
};
istream &operator>>(istream &i, mint &a) {
i >> a.x;
return i;
}
ostream &operator<<(ostream &o, const mint &a) {
o << a.x;
return o;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) cin >> l[i] >> r[i];
vector<mint> dp(n + 1);
vector<mint> dpsum(n + 1);
dp[1] = 1;
dpsum[1] = 1;
for (int i = 2; i <= n; i++) {
rep(j, k) {
int li = i - r[j];
int ri = i - l[j];
if (ri < 0)
continue;
li = max(li, 1);
dp[i] += dpsum[ri] - dpsum[li - 1];
}
dpsum[i] = dpsum[i - 1] + dp[i];
}
cout << dp[n] << endl;
return 0;
} | replace | 85 | 86 | 85 | 86 | 0 | |
p02549 | 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 = 9223372036854775800;
const int MAXN = 100001;
const int LOGN = 22;
const int MAXBIT = 62;
const long double PI = 3.141592653589793;
const int DIGITSIZE = 18;
ll mod = 1e9 + 7;
ll MOD = 998244353;
int x4[] = {1, -1, 0, 0};
int y4[] = {0, 0, 1, -1};
int x8[] = {1, 1, 1, -1, -1, -1, 0, 0};
int y8[] = {1, 0, -1, 1, 0, -1, 1, -1};
bool takeTestCases = 0;
bool printCaseNo = 0;
ll bit[MAXN + 1];
void update(int pos, int val) {
while (pos <= MAXN) {
bit[pos] += val % MOD;
bit[pos] %= MOD;
pos += (pos & -pos);
}
}
int query(int pos) {
ll ans = 0;
while (pos > 0) {
ans += bit[pos] % MOD;
ans %= MOD;
pos -= (pos & -pos);
}
return ans;
}
void getac(int T) {
int n, k;
cin >> n >> k;
vector<pii> q;
for (int i = 0; i < k; i++) {
int l, r;
cin >> l >> r;
q.pb({l, r});
}
ll dp[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 0;
}
dp[0] = 0;
dp[1] = 1;
update(1, 1);
for (int i = 2; i <= n; i++) {
for (int j = 0; j < k; j++) {
int l = q[j].first;
int r = q[j].second;
l = max(i - l, 0);
r = max(i - r - 1, 0);
// cout << j << ' ' << l << ' ' << r << '\n';
dp[i] += query(l);
dp[i] -= query(r);
dp[i] += MOD;
dp[i] %= MOD;
}
update(i, dp[i]);
// cout << '\n';
}
cout << dp[n] << '\n';
}
int main() {
fastio;
int t = 1;
if (takeTestCases) {
cin >> t;
}
int t_t = 1;
while (t--) {
if (printCaseNo)
case (t_t);
getac(t_t);
t_t++;
}
cerr << "Total time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms" << '\n';
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 = 9223372036854775800;
const int MAXN = 200005;
const int LOGN = 22;
const int MAXBIT = 62;
const long double PI = 3.141592653589793;
const int DIGITSIZE = 18;
ll mod = 1e9 + 7;
ll MOD = 998244353;
int x4[] = {1, -1, 0, 0};
int y4[] = {0, 0, 1, -1};
int x8[] = {1, 1, 1, -1, -1, -1, 0, 0};
int y8[] = {1, 0, -1, 1, 0, -1, 1, -1};
bool takeTestCases = 0;
bool printCaseNo = 0;
ll bit[MAXN + 1];
void update(int pos, int val) {
while (pos <= MAXN) {
bit[pos] += val % MOD;
bit[pos] %= MOD;
pos += (pos & -pos);
}
}
int query(int pos) {
ll ans = 0;
while (pos > 0) {
ans += bit[pos] % MOD;
ans %= MOD;
pos -= (pos & -pos);
}
return ans;
}
void getac(int T) {
int n, k;
cin >> n >> k;
vector<pii> q;
for (int i = 0; i < k; i++) {
int l, r;
cin >> l >> r;
q.pb({l, r});
}
ll dp[n + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 0;
}
dp[0] = 0;
dp[1] = 1;
update(1, 1);
for (int i = 2; i <= n; i++) {
for (int j = 0; j < k; j++) {
int l = q[j].first;
int r = q[j].second;
l = max(i - l, 0);
r = max(i - r - 1, 0);
// cout << j << ' ' << l << ' ' << r << '\n';
dp[i] += query(l);
dp[i] -= query(r);
dp[i] += MOD;
dp[i] %= MOD;
}
update(i, dp[i]);
// cout << '\n';
}
cout << dp[n] << '\n';
}
int main() {
fastio;
int t = 1;
if (takeTestCases) {
cin >> t;
}
int t_t = 1;
while (t--) {
if (printCaseNo)
case (t_t);
getac(t_t);
t_t++;
}
cerr << "Total time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms" << '\n';
return 0;
}
| replace | 68 | 69 | 68 | 69 | 0 | Total time elapsed :20.829 ms
|
p02549 | C++ | Runtime Error | #include <iostream>
#include <set>
#define N_MAX (2 * 1000)
#define MOD (998244353)
unsigned int dp[N_MAX];
int main() {
int N, K;
std::cin >> N >> K;
int L[10], R[10];
for (int i = 0; i < K; i++) {
std::cin >> L[i] >> R[i];
}
dp[0] = 1;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1];
for (int k = 0; k < K; k++) {
if (i - L[k] >= 0 && i - R[k] - 1 >= 0) {
dp[i] += (MOD + dp[i - L[k]] - dp[i - R[k] - 1]) % MOD;
} else if (i - L[k] >= 0) {
dp[i] += dp[i - L[k]];
}
dp[i] %= MOD;
}
}
std::cout << (MOD + dp[N - 1] - dp[N - 2]) % MOD << std::endl;
return 0;
}
| #include <iostream>
#include <set>
#define N_MAX (2 * 100000)
#define MOD (998244353)
unsigned int dp[N_MAX];
int main() {
int N, K;
std::cin >> N >> K;
int L[10], R[10];
for (int i = 0; i < K; i++) {
std::cin >> L[i] >> R[i];
}
dp[0] = 1;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1];
for (int k = 0; k < K; k++) {
if (i - L[k] >= 0 && i - R[k] - 1 >= 0) {
dp[i] += (MOD + dp[i - L[k]] - dp[i - R[k] - 1]) % MOD;
} else if (i - L[k] >= 0) {
dp[i] += dp[i - L[k]];
}
dp[i] %= MOD;
}
}
std::cout << (MOD + dp[N - 1] - dp[N - 2]) % MOD << std::endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long N, K, l[11], r[11], memo[200010], prefix[400010];
void Input() {
cin >> N >> K;
for (long long i = 1; i <= K; i++) {
cin >> l[i] >> r[i];
}
}
void Solve() {
memset(prefix, 0, sizeof prefix);
prefix[N] = 1;
memo[N] = 1;
for (long long i = N - 1; i >= 1; i--) {
long long total = 0;
for (long long j = 1; j <= K; j++) {
long long nl = l[i], nr = r[i];
total += (prefix[i + nl] - prefix[i + nr + 1]) % MOD;
total = total % MOD;
}
memo[i] = total;
prefix[i] = (prefix[i + 1] + total) % MOD;
}
cout << memo[1] << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
Input();
Solve();
} | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long N, K, l[11], r[11], memo[200010], prefix[400010];
void Input() {
cin >> N >> K;
for (long long i = 1; i <= K; i++) {
cin >> l[i] >> r[i];
}
}
void Solve() {
memset(prefix, 0, sizeof prefix);
prefix[N] = 1;
memo[N] = 1;
for (long long i = N - 1; i >= 1; i--) {
long long total = 0;
for (long long j = 1; j <= K; j++) {
long long nl = l[j], nr = r[j];
total += (prefix[i + nl] - prefix[i + nr + 1] + MOD) % MOD;
total = total % MOD;
}
memo[i] = total;
prefix[i] = (prefix[i + 1] + total) % MOD;
}
cout << memo[1] << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
Input();
Solve();
} | replace | 20 | 22 | 20 | 22 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
const ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) { cin >> l[i] >> r[i]; }
vector<int> dp(n + 10);
dp[1] = 1;
for (int i = 1; i < n; i++) {
dp[i] += dp[i - 1];
dp[i] %= mod;
rep(j, k) {
int num = min(i + r[j] + 1, (int)(n + 1));
dp[i + l[j]] += dp[i];
dp[i + l[j]] %= mod;
dp[num] -= dp[i];
if (dp[num] < 0)
dp[num] += mod;
}
}
dp[n] %= mod;
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
const ll mod = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) { cin >> l[i] >> r[i]; }
vector<int> dp(n + 10);
dp[1] = 1;
for (int i = 1; i < n; i++) {
dp[i] += dp[i - 1];
dp[i] %= mod;
rep(j, k) {
int num = min(i + r[j] + 1, (int)(n + 1));
int nu = min(i + l[j], (int)(n + 1));
dp[nu] += dp[i];
dp[nu] %= mod;
dp[num] -= dp[i];
if (dp[num] < 0)
dp[num] += mod;
}
}
dp[n] %= mod;
cout << dp[n] << endl;
return 0;
}
| replace | 18 | 20 | 18 | 21 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, x, n) for (int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
// const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
const ll mod = 998244353;
vector<ll> dp(220000);
int main(void) {
ll n, k;
cin >> n >> k;
vector<P> a(k);
rep(i, k) {
ll l, r;
cin >> l >> r;
r++;
a[i] = {l, r};
}
dp[1] = 1;
dp[2] = -1;
REP(i, 1, n + 1) {
dp[i] += dp[i - 1];
rep(j, k) {
ll l, r;
l = a[j].first;
r = a[j].second;
dp[i + l] += dp[i];
dp[i + l] %= mod;
dp[i + r] -= dp[i];
dp[i + r] = (dp[i + r] + mod) % mod;
}
}
cout << (dp[n] % mod + mod) % mod << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, x, n) for (int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
// const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
const ll mod = 998244353;
vector<ll> dp(440000);
int main(void) {
ll n, k;
cin >> n >> k;
vector<P> a(k);
rep(i, k) {
ll l, r;
cin >> l >> r;
r++;
a[i] = {l, r};
}
dp[1] = 1;
dp[2] = -1;
REP(i, 1, n + 1) {
dp[i] += dp[i - 1];
rep(j, k) {
ll l, r;
l = a[j].first;
r = a[j].second;
dp[i + l] += dp[i];
dp[i + l] %= mod;
dp[i + r] -= dp[i];
dp[i + r] = (dp[i + r] + mod) % mod;
}
}
cout << (dp[n] % mod + mod) % mod << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
typedef long long ll;
using namespace std;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() { return mint(-x); }
mint operator+=(mint rhs) {
x += rhs.x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint operator-=(mint rhs) {
x -= rhs.x;
if (x < 0)
x += MOD;
return *this;
}
mint operator*=(mint rhs) {
x = x * rhs.x % MOD;
return *this;
}
mint operator+(mint rhs) { return mint(*this) += rhs; }
mint operator-(mint rhs) { return mint(*this) -= rhs; }
mint operator*(mint rhs) { return mint(*this) *= rhs; }
};
// ostream &operator<<(ostream &os, const mint &dt) {
// os << dt.x;
// return os;
// }
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
for (int i = 0; i < k; i++) {
cin >> l[i] >> r[i];
}
vector<mint> dp(n + 10, 0);
vector<mint> sum(n + 10, 0);
dp[0] = 1;
mint p = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
// if (i + l[j] > n + 1) continue;
sum[i + l[j]] += dp[i];
sum[i + r[j] + 1] -= dp[i];
}
p += sum[i + 1];
dp[i + 1] = p;
// cout << "p:" << p << endl;
// cout << "sum:";
// for (int ii = 0; ii <= n; ii++) {
// cout << sum[ii];
// if (ii == n)
// cout << endl;
// else
// cout << " ";
// }
// cout << "dp:";
// for (int ii = 0; ii <= n; ii++) {
// cout << dp[ii];
// if (ii == n)
// cout << endl;
// else
// cout << " ";
// }
}
// for (int i = 0; i <= n; i++) {
// cout << dp[i];
// if (i == n)
// cout << endl;
// else
// cout << " ";
// }
cout << dp[n - 1].x << endl;
return 0;
} | #include <bits/stdc++.h>
#define MOD 998244353
typedef long long ll;
using namespace std;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() { return mint(-x); }
mint operator+=(mint rhs) {
x += rhs.x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint operator-=(mint rhs) {
x -= rhs.x;
if (x < 0)
x += MOD;
return *this;
}
mint operator*=(mint rhs) {
x = x * rhs.x % MOD;
return *this;
}
mint operator+(mint rhs) { return mint(*this) += rhs; }
mint operator-(mint rhs) { return mint(*this) -= rhs; }
mint operator*(mint rhs) { return mint(*this) *= rhs; }
};
// ostream &operator<<(ostream &os, const mint &dt) {
// os << dt.x;
// return os;
// }
int main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
for (int i = 0; i < k; i++) {
cin >> l[i] >> r[i];
}
vector<mint> dp(n + 10, 0);
vector<mint> sum(n + 10, 0);
dp[0] = 1;
mint p = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
if (i + l[j] <= n + 1)
sum[i + l[j]] += dp[i];
if (i + r[j] + 1 <= n + 1)
sum[i + r[j] + 1] -= dp[i];
}
p += sum[i + 1];
dp[i + 1] = p;
// cout << "p:" << p << endl;
// cout << "sum:";
// for (int ii = 0; ii <= n; ii++) {
// cout << sum[ii];
// if (ii == n)
// cout << endl;
// else
// cout << " ";
// }
// cout << "dp:";
// for (int ii = 0; ii <= n; ii++) {
// cout << dp[ii];
// if (ii == n)
// cout << endl;
// else
// cout << " ";
// }
}
// for (int i = 0; i <= n; i++) {
// cout << dp[i];
// if (i == n)
// cout << endl;
// else
// cout << " ";
// }
cout << dp[n - 1].x << endl;
return 0;
} | replace | 45 | 48 | 45 | 49 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define debug_value(x) \
cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x \
<< endl;
#define debug(x) \
cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int N, K;
int L[10], R[10];
ll cnt[200005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> L[i] >> R[i];
}
cnt[0] = 1;
cnt[1] = -1;
for (int i = 0; i < N; i++) {
if (i > 0)
cnt[i] += cnt[i - 1];
cnt[i] %= MOD;
for (int j = 0; j < K; j++) {
cnt[i + L[j]] += cnt[i];
cnt[i + L[j]] %= MOD;
cnt[i + R[j] + 1] -= cnt[i];
cnt[i + R[j] + 1] %= MOD;
}
}
cout << (cnt[N - 1] + MOD) % MOD << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define debug_value(x) \
cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x \
<< endl;
#define debug(x) \
cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
int N, K;
int L[10], R[10];
ll cnt[500005];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> L[i] >> R[i];
}
cnt[0] = 1;
cnt[1] = -1;
for (int i = 0; i < N; i++) {
if (i > 0)
cnt[i] += cnt[i - 1];
cnt[i] %= MOD;
for (int j = 0; j < K; j++) {
cnt[i + L[j]] += cnt[i];
cnt[i + L[j]] %= MOD;
cnt[i + R[j] + 1] -= cnt[i];
cnt[i + R[j] + 1] %= MOD;
}
}
cout << (cnt[N - 1] + MOD) % MOD << endl;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define N 200005
int n, k;
vector<pair<int, int>> d;
long dp[N], sumdp[N];
int dcnt = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
d.reserve(k + 1);
for (int i = 0; i < k; i++) {
int s, e;
cin >> s >> e;
d.push_back({s, e});
}
dp[1] = 1;
sumdp[1] = 1;
for (int i = 2; i <= n; i++) {
for (const auto § : d) {
if (sect.first > i)
continue;
int ubound = i - sect.first;
int lbound = min(i - sect.second, i);
dp[i] = (dp[i] + MOD + sumdp[ubound] - sumdp[lbound - 1]) % MOD;
}
sumdp[i] = (sumdp[i - 1] + dp[i]) % MOD;
}
cout << dp[n] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define N 200005
int n, k;
vector<pair<int, int>> d;
long dp[N], sumdp[N];
int dcnt = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> k;
d.reserve(k + 1);
for (int i = 0; i < k; i++) {
int s, e;
cin >> s >> e;
d.push_back({s, e});
}
dp[1] = 1;
sumdp[1] = 1;
for (int i = 2; i <= n; i++) {
for (const auto § : d) {
if (sect.first > i)
continue;
int ubound = i - sect.first;
int lbound = max(i - sect.second, 1);
dp[i] = (dp[i] + MOD + sumdp[ubound] - sumdp[lbound - 1]) % MOD;
}
sumdp[i] = (sumdp[i - 1] + dp[i]) % MOD;
}
cout << dp[n] << '\n';
return 0;
}
| replace | 25 | 26 | 25 | 26 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 998244353;
const int N = 200005;
int a[N], b[N];
LL f[N], c[20];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
f[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < m; j++) {
c[j] += (i - a[j] >= 1 ? f[i - a[j]] : 0) -
(f[i - b[j] - 1] >= 1 ? f[i - b[j] - 1] : 0);
f[i] = (f[i] + c[j]) % mod;
}
}
cout << (f[n] + mod) % mod << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const LL mod = 998244353;
const int N = 200005;
int a[N], b[N];
LL f[N], c[20];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
f[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < m; j++) {
c[j] += (i - a[j] >= 1 ? f[i - a[j]] : 0) -
(i - b[j] - 1 >= 1 ? f[i - b[j] - 1] : 0);
f[i] = (f[i] + c[j]) % mod;
}
}
cout << (f[n] + mod) % mod << endl;
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 5;
const int mod = 998244353;
LL tr[MAXN], dp[MAXN];
int n, k, L[15], R[15];
void update(int x, LL y) {
for (; x <= n; x += (x & (-x)))
tr[x] = (tr[x] + y) % mod;
}
LL find(int x) {
if (!x)
return 0;
LL res = 0;
for (; x; x -= (x & (-x)))
res = (res + tr[x]) % mod;
return res;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; ++i) {
scanf("%d %d", &L[i], &R[i]);
}
dp[1] = 1;
update(1, 1);
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i <= L[j])
continue;
dp[i] = (dp[i] + find(i - L[j]) - find(max(i - R[j] - 1, 0))) % mod;
dp[i] = (dp[i] + mod) % mod;
}
update(i, dp[i]);
}
printf("%lld", dp[n]);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 5;
const int mod = 998244353;
LL tr[MAXN], dp[MAXN];
int n, k, L[15], R[15];
void update(int x, LL y) {
for (; x <= n; x += (x & (-x)))
tr[x] = (tr[x] + y) % mod;
}
LL find(int x) {
if (!x)
return 0;
LL res = 0;
for (; x; x -= (x & (-x)))
res = (res + tr[x]) % mod;
return res;
}
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; ++i) {
scanf("%d %d", &L[i], &R[i]);
}
dp[1] = 1;
update(1, 1);
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i <= L[j])
continue;
dp[i] = (dp[i] + find(i - L[j]) - find(max(i - R[j] - 1, 0))) % mod;
dp[i] = (dp[i] + mod) % mod;
}
update(i, dp[i]);
}
printf("%lld", dp[n]);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define mkp(x, y) make_pair(x, y)
#define L length()
#define int long long
#define bs binary_search
#define mod 1e9 + 7
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define F first
#define S second
#define pii pair<int, int>
#define vi vector<int>
#define vs size()
#define endl '\n'
#define atoi stoi
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define si set<int>
#define vpii vector<pair<int, int>>
#define memf(a) memset(a, false, sizeof(a))
#define memt(a) memset(a, true, sizeof(a))
#define xxx 998244353
#define pi 3.141592653589
#define ninf INT_MIN
#define inf INT_MAX
#define sz(v) ((int)(v).size())
#define rep(i, a, b) for (int i = a; i <= b; i++)
int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int min(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
int power(int b, int e) {
if (e == 0)
return 1;
if (e % 2)
return ((b * power((b) * (b), (e - 1) / 2)));
else
return power((b) * (b), e / 2);
}
int modpower(int b, int e, int q) {
int MOD = q;
if (e == 0)
return 1;
if (e % 2)
return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD;
else
return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD;
}
void dpv(vi v) {
for (int i = 0; i < v.vs; i++) {
cout << v[i] << " ";
}
cout << endl;
}
void dpv(vpii v) {
for (int i = 0; i < v.vs; i++) {
cout << v[i].F << " " << v[i].S << endl;
}
}
void dpv(set<int> v) {
for (auto i : v) {
cout << i << " ";
}
cout << endl;
}
//////////////////////**TREE MOVES STARTS**//////////////////////////////
///// **TREE MOVES ENDS**////////////////////////////
////*SOLUTION TO THE QUESTION STARTS HERE*///////
vi pref(100001, 0);
vi dp(100001, 0);
int sum(int l, int r) {
l = max(l, 0);
return (pref[r] - (l == 0 ? 0 : pref[l - 1]));
}
void oblivious() {
int m1 = 998244353;
int n, k;
cin >> n >> k;
int l[k], r[k];
pref[1] = 1;
dp[1] = 1;
for (int i = 0; i < k; i++) {
cin >> l[i] >> r[i];
}
for (int i = 2; i <= n; i++) {
for (int j = 0; j < k; j++) {
if (i - l[j] >= 0) {
int cur = sum(i - r[j], i - l[j]) % m1;
dp[i] += cur % m1;
dp[i] %= m1;
}
}
pref[i] = (pref[i - 1] % m1 + dp[i] % m1) % m1;
}
dp[n] %= m1;
cout << (dp[n] + m1) % m1 << endl;
}
signed main() {
IOS;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
int t = 1;
// cin>>t;
// int z=t;
while (t--) {
// cout<<"Case #"<<(z-t)<<": ";
oblivious();
}
return 0;
}
// Editorial
/*
*/ | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define mkp(x, y) make_pair(x, y)
#define L length()
#define int long long
#define bs binary_search
#define mod 1e9 + 7
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))
#define F first
#define S second
#define pii pair<int, int>
#define vi vector<int>
#define vs size()
#define endl '\n'
#define atoi stoi
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define si set<int>
#define vpii vector<pair<int, int>>
#define memf(a) memset(a, false, sizeof(a))
#define memt(a) memset(a, true, sizeof(a))
#define xxx 998244353
#define pi 3.141592653589
#define ninf INT_MIN
#define inf INT_MAX
#define sz(v) ((int)(v).size())
#define rep(i, a, b) for (int i = a; i <= b; i++)
int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
int min(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
int power(int b, int e) {
if (e == 0)
return 1;
if (e % 2)
return ((b * power((b) * (b), (e - 1) / 2)));
else
return power((b) * (b), e / 2);
}
int modpower(int b, int e, int q) {
int MOD = q;
if (e == 0)
return 1;
if (e % 2)
return ((b % MOD) * modpower((b % MOD) * (b % MOD), (e - 1) / 2, q)) % MOD;
else
return modpower((b % MOD) * (b % MOD), e / 2, q) % MOD;
}
void dpv(vi v) {
for (int i = 0; i < v.vs; i++) {
cout << v[i] << " ";
}
cout << endl;
}
void dpv(vpii v) {
for (int i = 0; i < v.vs; i++) {
cout << v[i].F << " " << v[i].S << endl;
}
}
void dpv(set<int> v) {
for (auto i : v) {
cout << i << " ";
}
cout << endl;
}
//////////////////////**TREE MOVES STARTS**//////////////////////////////
///// **TREE MOVES ENDS**////////////////////////////
////*SOLUTION TO THE QUESTION STARTS HERE*///////
vi pref(200001, 0);
vi dp(200001, 0);
int sum(int l, int r) {
l = max(l, 0);
return (pref[r] - (l == 0 ? 0 : pref[l - 1]));
}
void oblivious() {
int m1 = 998244353;
int n, k;
cin >> n >> k;
int l[k], r[k];
pref[1] = 1;
dp[1] = 1;
for (int i = 0; i < k; i++) {
cin >> l[i] >> r[i];
}
for (int i = 2; i <= n; i++) {
for (int j = 0; j < k; j++) {
if (i - l[j] >= 0) {
int cur = sum(i - r[j], i - l[j]) % m1;
dp[i] += cur % m1;
dp[i] %= m1;
}
}
pref[i] = (pref[i - 1] % m1 + dp[i] % m1) % m1;
}
dp[n] %= m1;
cout << (dp[n] + m1) % m1 << endl;
}
signed main() {
IOS;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
int t = 1;
// cin>>t;
// int z=t;
while (t--) {
// cout<<"Case #"<<(z-t)<<": ";
oblivious();
}
return 0;
}
// Editorial
/*
*/ | replace | 87 | 89 | 87 | 89 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); i++)
#define REP(i, n) rep(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
typedef pair<ll, ll> P;
constexpr long double m_pi = 3.1415926535897932L;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 61;
constexpr long double EPS = 1e-10;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> using vector3 = vector<vector2<T>>;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
string operator*(const string &s, int k) {
if (k == 0)
return "";
string p = (s + s) * (k / 2);
if (k % 2 == 1)
p += s;
return p;
}
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;
}
struct Edge { // グラフ
int to, rev;
ll cap;
Edge(int _to, ll _cap, int _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &G, int from, int to, ll cap, bool revFlag,
ll revCap) { // 最大フロー求める Ford-fulkerson
G[from].push_back(Edge(to, cap, (ll)G[to].size() + (from == to)));
if (revFlag)
G[to].push_back(Edge(
from, revCap, (ll)G[from].size() - 1)); // 最小カットの場合逆辺は0にする
}
ll max_flow_dfs(Graph &G, ll v, ll t, ll f, vector<bool> &used) {
if (v == t)
return f;
used[v] = true;
for (int i = 0; i < G[v].size(); ++i) {
Edge &e = G[v][i];
if (!used[e.to] && e.cap > 0) {
ll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
// 二分グラフの最大マッチングを求めたりも出来る また二部グラフの最大独立集合は頂点数-最大マッチングのサイズ
ll max_flow(Graph &G, ll s, ll t) // O(V(V+E))
{
ll flow = 0;
for (;;) {
vector<bool> used(G.size());
REP(i, used.size()) used[i] = false;
ll f = max_flow_dfs(G, s, t, INF, used);
if (f == 0) {
return flow;
}
flow += f;
}
}
void BellmanFord(Graph &G, ll s, Array &d, Array &negative) { // O(|E||V|)
d.resize(G.size());
negative.resize(G.size());
REP(i, d.size()) d[i] = INF;
REP(i, d.size()) negative[i] = false;
d[s] = 0;
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
}
}
}
}
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
negative[G[i][j].to] = true;
}
if (negative[i] == true)
negative[G[i][j].to] = true;
}
}
}
}
void Dijkstra(Graph &G, ll s, Array &d) { // O(|E|log|V|)
d.resize(G.size());
REP(i, d.size()) d[i] = INF;
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> q;
q.push(make_pair(0, s));
while (!q.empty()) {
P a = q.top();
q.pop();
if (d[a.second] < a.first)
continue;
REP(i, G[a.second].size()) {
Edge e = G[a.second][i];
if (d[e.to] > d[a.second] + e.cap) {
d[e.to] = d[a.second] + e.cap;
q.push(make_pair(d[e.to], e.to));
}
}
}
}
void WarshallFloyd(Graph &G, Matrix &d) { // O(V^3)
d.resize(G.size());
REP(i, d.size()) d[i].resize(G.size());
REP(i, d.size()) {
REP(j, d[i].size()) { d[i][j] = ((i != j) ? INF : 0); }
}
REP(i, G.size()) {
REP(j, G[i].size()) { chmin(d[i][G[i][j].to], G[i][j].cap); }
}
REP(i, G.size()) {
REP(j, G.size()) {
REP(k, G.size()) {
if (d[j][i] != INF && d[i][k] != INF)
chmin(d[j][k], d[j][i] + d[i][k]);
}
}
}
}
bool tsort(Graph &graph, vector<int> &order) { // トポロジカルソートO(E+V)
int n = graph.size(), k = 0;
vector<int> in(n);
for (auto &es : graph)
for (auto &e : es)
in[e.to]++;
priority_queue<int, vector<int>, greater<int>> que;
REP(i, n)
if (in[i] == 0)
que.push(i);
while (que.size()) {
int v = que.top();
que.pop();
order.push_back(v);
for (auto &e : graph[v])
if (--in[e.to] == 0)
que.push(e.to);
}
if (order.size() != n)
return false;
else
return true;
}
class Lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
Lca() {}
Lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p)
dfs(g, e.to, v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
class UnionFind {
vector<int> data;
int n;
public:
UnionFind(int size) : data(size, -1), n(size) {}
bool merge(int x, int y) { // xとyの集合を統合する
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
n -= (x != y);
return x != y;
}
bool same(int x, int y) { // xとyが同じ集合か返す
return root(x) == root(y);
}
int root(int x) { // xのルートを返す
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) { // xの集合のサイズを返す
return -data[root(x)];
}
int num() { // 集合の数を返す
return n;
}
};
template <typename T, typename F> class SegmentTree {
private:
T identity;
F merge;
ll n;
vector<T> dat;
public:
SegmentTree(F f, T id, vector<T> v) : merge(f), identity(id) {
int _n = v.size();
n = 1;
while (n < _n)
n *= 2;
dat.resize(2 * n - 1, identity);
REP(i, _n) dat[n + i - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
dat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);
}
SegmentTree(F f, T id, int _n) : merge(f), identity(id) {
n = 1;
while (n < _n)
n *= 2;
dat.resize(2 * n - 1, identity);
}
void set_val(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
T query(int l, int r) {
T left = identity, right = identity;
l += n - 1;
r += n - 1;
while (l < r) {
if ((l & 1) == 0)
left = merge(left, dat[l]);
if ((r & 1) == 0)
right = merge(dat[r - 1], right);
l = l / 2;
r = (r - 1) / 2;
}
return merge(left, right);
}
};
template <typename T> class FenwickTree {
vector<T> data;
int n;
int p;
public:
FenwickTree(int n) : n(n) {
data.resize(n + 1LL, 0);
p = 1;
while (p < data.size())
p *= 2;
}
T sum(int k) {
T ret = 0;
for (; k > 0; k -= k & -k)
ret += data[k];
return (ret);
}
T sum(int a, int b) { return sum(b) - sum(a); } //[a,b)
void add(int k, T x) {
for (++k; k <= n; k += k & -k)
data[k] += x;
}
int lower_bound(ll w) {
if (w <= 0)
return -1;
int x = 0;
for (int k = p / 2; k > 0; k /= 2) {
if (x + k <= n && data[x + k] < w)
w -= data[x + k], x += k;
}
return x;
}
};
// 約数求める //約数
void divisor(ll n, vector<ll> &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(ret.begin(), ret.end());
}
void prime_factorization(ll n, vector<P> &ret) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back({i, 0});
while (n % i == 0) {
n /= i;
ret[ret.size() - 1].second++;
}
}
}
if (n != 1)
ret.push_back({n, 1});
}
inline 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;
}
inline ll mod_inv(ll x, ll mod) { return mod_pow(x, mod - 2, mod); }
class Combination {
public:
Array fact;
Array fact_inv;
ll mod;
// if n >= mod use lucas
ll nCr(ll n, ll r) {
if (n < r)
return 0;
if (n < mod)
return ((fact[n] * fact_inv[r] % mod) * fact_inv[n - r]) % mod;
ll ret = 1;
while (n || r) {
ll _n = n % mod, _r = r % mod;
n /= mod;
r /= mod;
(ret *= nCr(_n, _r)) %= mod;
}
return ret;
}
ll nPr(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % mod; }
ll nHr(ll n, ll r) { return nCr(r + n - 1, r); }
Combination(ll _n, ll _mod) {
mod = _mod;
ll n = min(_n + 1, mod);
fact.resize(n);
fact[0] = 1;
REP(i, n - 1) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
fact_inv.resize(n);
fact_inv[n - 1] = mod_inv(fact[n - 1], mod);
for (int i = n - 1; i > 0; i--) {
fact_inv[i - 1] = fact_inv[i] * i % mod;
}
}
};
ll popcount(ll x) {
x = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555);
x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333);
x = (x & 0x0F0F0F0F0F0F0F0F) + (x >> 4 & 0x0F0F0F0F0F0F0F0F);
x = (x & 0x00FF00FF00FF00FF) + (x >> 8 & 0x00FF00FF00FF00FF);
x = (x & 0x0000FFFF0000FFFF) + (x >> 16 & 0x0000FFFF0000FFFF);
x = (x & 0x00000000FFFFFFFF) + (x >> 32 & 0x00000000FFFFFFFF);
return x;
}
ll dp[202020];
int main() {
ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
constexpr ll mod = 998244353;
ll n, k;
cin >> n >> k;
Array l(k), r(k);
REP(i, k) cin >> l[i] >> r[i];
dp[1] = 1;
rep(i, 1, n) {
(dp[i] += dp[i - 1]) %= mod;
REP(j, k) {
(dp[i + l[j]] += dp[i]) %= mod;
(dp[i + r[j] + 1] += mod - dp[i]) %= mod;
}
}
cout << dp[n] << "\n";
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define rep(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); i++)
#define REP(i, n) rep(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
typedef pair<ll, ll> P;
constexpr long double m_pi = 3.1415926535897932L;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 61;
constexpr long double EPS = 1e-10;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> using vector3 = vector<vector2<T>>;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
string operator*(const string &s, int k) {
if (k == 0)
return "";
string p = (s + s) * (k / 2);
if (k % 2 == 1)
p += s;
return p;
}
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;
}
struct Edge { // グラフ
int to, rev;
ll cap;
Edge(int _to, ll _cap, int _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &G, int from, int to, ll cap, bool revFlag,
ll revCap) { // 最大フロー求める Ford-fulkerson
G[from].push_back(Edge(to, cap, (ll)G[to].size() + (from == to)));
if (revFlag)
G[to].push_back(Edge(
from, revCap, (ll)G[from].size() - 1)); // 最小カットの場合逆辺は0にする
}
ll max_flow_dfs(Graph &G, ll v, ll t, ll f, vector<bool> &used) {
if (v == t)
return f;
used[v] = true;
for (int i = 0; i < G[v].size(); ++i) {
Edge &e = G[v][i];
if (!used[e.to] && e.cap > 0) {
ll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
// 二分グラフの最大マッチングを求めたりも出来る また二部グラフの最大独立集合は頂点数-最大マッチングのサイズ
ll max_flow(Graph &G, ll s, ll t) // O(V(V+E))
{
ll flow = 0;
for (;;) {
vector<bool> used(G.size());
REP(i, used.size()) used[i] = false;
ll f = max_flow_dfs(G, s, t, INF, used);
if (f == 0) {
return flow;
}
flow += f;
}
}
void BellmanFord(Graph &G, ll s, Array &d, Array &negative) { // O(|E||V|)
d.resize(G.size());
negative.resize(G.size());
REP(i, d.size()) d[i] = INF;
REP(i, d.size()) negative[i] = false;
d[s] = 0;
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
}
}
}
}
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
negative[G[i][j].to] = true;
}
if (negative[i] == true)
negative[G[i][j].to] = true;
}
}
}
}
void Dijkstra(Graph &G, ll s, Array &d) { // O(|E|log|V|)
d.resize(G.size());
REP(i, d.size()) d[i] = INF;
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> q;
q.push(make_pair(0, s));
while (!q.empty()) {
P a = q.top();
q.pop();
if (d[a.second] < a.first)
continue;
REP(i, G[a.second].size()) {
Edge e = G[a.second][i];
if (d[e.to] > d[a.second] + e.cap) {
d[e.to] = d[a.second] + e.cap;
q.push(make_pair(d[e.to], e.to));
}
}
}
}
void WarshallFloyd(Graph &G, Matrix &d) { // O(V^3)
d.resize(G.size());
REP(i, d.size()) d[i].resize(G.size());
REP(i, d.size()) {
REP(j, d[i].size()) { d[i][j] = ((i != j) ? INF : 0); }
}
REP(i, G.size()) {
REP(j, G[i].size()) { chmin(d[i][G[i][j].to], G[i][j].cap); }
}
REP(i, G.size()) {
REP(j, G.size()) {
REP(k, G.size()) {
if (d[j][i] != INF && d[i][k] != INF)
chmin(d[j][k], d[j][i] + d[i][k]);
}
}
}
}
bool tsort(Graph &graph, vector<int> &order) { // トポロジカルソートO(E+V)
int n = graph.size(), k = 0;
vector<int> in(n);
for (auto &es : graph)
for (auto &e : es)
in[e.to]++;
priority_queue<int, vector<int>, greater<int>> que;
REP(i, n)
if (in[i] == 0)
que.push(i);
while (que.size()) {
int v = que.top();
que.pop();
order.push_back(v);
for (auto &e : graph[v])
if (--in[e.to] == 0)
que.push(e.to);
}
if (order.size() != n)
return false;
else
return true;
}
class Lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
Lca() {}
Lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p)
dfs(g, e.to, v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
class UnionFind {
vector<int> data;
int n;
public:
UnionFind(int size) : data(size, -1), n(size) {}
bool merge(int x, int y) { // xとyの集合を統合する
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
n -= (x != y);
return x != y;
}
bool same(int x, int y) { // xとyが同じ集合か返す
return root(x) == root(y);
}
int root(int x) { // xのルートを返す
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) { // xの集合のサイズを返す
return -data[root(x)];
}
int num() { // 集合の数を返す
return n;
}
};
template <typename T, typename F> class SegmentTree {
private:
T identity;
F merge;
ll n;
vector<T> dat;
public:
SegmentTree(F f, T id, vector<T> v) : merge(f), identity(id) {
int _n = v.size();
n = 1;
while (n < _n)
n *= 2;
dat.resize(2 * n - 1, identity);
REP(i, _n) dat[n + i - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
dat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);
}
SegmentTree(F f, T id, int _n) : merge(f), identity(id) {
n = 1;
while (n < _n)
n *= 2;
dat.resize(2 * n - 1, identity);
}
void set_val(int i, T x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = merge(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
T query(int l, int r) {
T left = identity, right = identity;
l += n - 1;
r += n - 1;
while (l < r) {
if ((l & 1) == 0)
left = merge(left, dat[l]);
if ((r & 1) == 0)
right = merge(dat[r - 1], right);
l = l / 2;
r = (r - 1) / 2;
}
return merge(left, right);
}
};
template <typename T> class FenwickTree {
vector<T> data;
int n;
int p;
public:
FenwickTree(int n) : n(n) {
data.resize(n + 1LL, 0);
p = 1;
while (p < data.size())
p *= 2;
}
T sum(int k) {
T ret = 0;
for (; k > 0; k -= k & -k)
ret += data[k];
return (ret);
}
T sum(int a, int b) { return sum(b) - sum(a); } //[a,b)
void add(int k, T x) {
for (++k; k <= n; k += k & -k)
data[k] += x;
}
int lower_bound(ll w) {
if (w <= 0)
return -1;
int x = 0;
for (int k = p / 2; k > 0; k /= 2) {
if (x + k <= n && data[x + k] < w)
w -= data[x + k], x += k;
}
return x;
}
};
// 約数求める //約数
void divisor(ll n, vector<ll> &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(ret.begin(), ret.end());
}
void prime_factorization(ll n, vector<P> &ret) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back({i, 0});
while (n % i == 0) {
n /= i;
ret[ret.size() - 1].second++;
}
}
}
if (n != 1)
ret.push_back({n, 1});
}
inline 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;
}
inline ll mod_inv(ll x, ll mod) { return mod_pow(x, mod - 2, mod); }
class Combination {
public:
Array fact;
Array fact_inv;
ll mod;
// if n >= mod use lucas
ll nCr(ll n, ll r) {
if (n < r)
return 0;
if (n < mod)
return ((fact[n] * fact_inv[r] % mod) * fact_inv[n - r]) % mod;
ll ret = 1;
while (n || r) {
ll _n = n % mod, _r = r % mod;
n /= mod;
r /= mod;
(ret *= nCr(_n, _r)) %= mod;
}
return ret;
}
ll nPr(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % mod; }
ll nHr(ll n, ll r) { return nCr(r + n - 1, r); }
Combination(ll _n, ll _mod) {
mod = _mod;
ll n = min(_n + 1, mod);
fact.resize(n);
fact[0] = 1;
REP(i, n - 1) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
fact_inv.resize(n);
fact_inv[n - 1] = mod_inv(fact[n - 1], mod);
for (int i = n - 1; i > 0; i--) {
fact_inv[i - 1] = fact_inv[i] * i % mod;
}
}
};
ll popcount(ll x) {
x = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555);
x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333);
x = (x & 0x0F0F0F0F0F0F0F0F) + (x >> 4 & 0x0F0F0F0F0F0F0F0F);
x = (x & 0x00FF00FF00FF00FF) + (x >> 8 & 0x00FF00FF00FF00FF);
x = (x & 0x0000FFFF0000FFFF) + (x >> 16 & 0x0000FFFF0000FFFF);
x = (x & 0x00000000FFFFFFFF) + (x >> 32 & 0x00000000FFFFFFFF);
return x;
}
ll dp[502020];
int main() {
ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
constexpr ll mod = 998244353;
ll n, k;
cin >> n >> k;
Array l(k), r(k);
REP(i, k) cin >> l[i] >> r[i];
dp[1] = 1;
rep(i, 1, n) {
(dp[i] += dp[i - 1]) %= mod;
REP(j, k) {
(dp[i + l[j]] += dp[i]) %= mod;
(dp[i + r[j] + 1] += mod - dp[i]) %= mod;
}
}
cout << dp[n] << "\n";
return 0;
} | replace | 458 | 459 | 458 | 459 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
int n, k, lft[N], rgt[N];
int dp[N];
int add(int x, int y) {
if (x + y >= mod) {
return x + y - mod;
}
return x + y;
}
int sub(int x, int y) {
if (x - y < 0) {
return x - y + mod;
}
return x - y;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> lft[i] >> rgt[i];
}
dp[1] = 1;
for (int i = 1; i <= n; i++) {
if (i > 2) {
dp[i] = add(dp[i], dp[i - 1]);
}
for (int j = 0; j < k; j++) {
int l = i + lft[j];
int r = i + rgt[j] + 1;
dp[l] = add(dp[l], dp[i]);
dp[r] = sub(dp[r], dp[i]);
}
}
cout << dp[n] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
int n, k, lft[N], rgt[N];
int dp[N];
int add(int x, int y) {
if (x + y >= mod) {
return x + y - mod;
}
return x + y;
}
int sub(int x, int y) {
if (x - y < 0) {
return x - y + mod;
}
return x - y;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> lft[i] >> rgt[i];
}
dp[1] = 1;
for (int i = 1; i <= n; i++) {
if (i > 2) {
dp[i] = add(dp[i], dp[i - 1]);
}
for (int j = 0; j < k; j++) {
int l = i + lft[j];
int r = i + rgt[j] + 1;
if (l < N) {
dp[l] = add(dp[l], dp[i]);
}
if (r < N) {
dp[r] = sub(dp[r], dp[i]);
}
}
}
cout << dp[n] << '\n';
return 0;
}
| replace | 41 | 43 | 41 | 47 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <map>
#include <set>
#include <vector>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMIT2 500010
#define LIMIT3 1000010
#define INF ((1 << 30) - 1)
#define LLINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef long double ld;
typedef const void cv;
typedef pair<ll, ll> P;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define per(i, n) for ((i) = (n)-1; (i) >= 0; (i)--)
template <class T, class C> T max(T a, C b) {
return ((a) > (T)(b) ? (a) : (T)(b));
}
template <class T, class C> T min(T a, C b) {
return ((a) < (T)(b) ? (a) : (T)(b));
}
#define zt(a, b) (max((a), (b)) - min((a), (b)))
#define setpre(n) fixed << setprecision(n)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int upint(cv *a, cv *b) {
return *(int *)a < *(int *)b ? -1 : *(int *)a > *(int *)b ? 1 : 0;
}
int downint(cv *a, cv *b) {
return *(int *)a < *(int *)b ? 1 : *(int *)a > *(int *)b ? -1 : 0;
}
int upchar(cv *left, cv *right) { return strcmp((char *)left, (char *)right); }
int downchar(cv *left, cv *right) {
return strcmp((char *)right, (char *)left);
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res *= a;
if (mod >= 1)
res %= mod;
}
a *= a;
if (mod >= 1)
a %= mod;
n >>= 1;
}
return res;
}
void initialize() {}
const int MAX_N = LIMIT2;
int bit[MAX_N + 1] = {0}, n;
// 1-indexed BIT
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & (-i);
}
return s;
}
void add(int i, ll x) {
while (i <= n) {
bit[i] += x;
i += i & (-i);
}
}
ll rangesum(int l, int r) {
if (l > r)
return 0;
return sum(r) - sum(l - 1);
}
int main(void) {
initialize();
ll m, i, j, k, result = 0;
ll l[LIMIT1] = {0}, r[LIMIT1] = {0};
ll dp[LIMIT1] = {0};
string s;
cin >> n >> k;
rep(i, k) { cin >> l[i] >> r[i]; }
dp[1] = 1;
for (i = 1; i <= n; i++) {
dp[i] += dp[i - 1];
rep(j, k) {
if (i + l[j] <= n) {
dp[i + l[j]] += dp[i];
dp[i + l[j]] %= MOD2;
if (i + r[j] <= n)
dp[i + r[j] + 1] -= dp[i];
if (dp[i + r[j] + 1] < 0)
dp[i + r[j] + 1] += MOD2;
// cout << i << ":" << i+l[j] << ":" << i+r[j] << endl;
}
}
}
result = dp[n] - dp[n - 1];
cout << result << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <map>
#include <set>
#include <vector>
#define MOD1 1000000007
#define MOD2 998244353
#define LIMIT1 200010
#define LIMIT2 500010
#define LIMIT3 1000010
#define INF ((1 << 30) - 1)
#define LLINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef long double ld;
typedef const void cv;
typedef pair<ll, ll> P;
#define rep(i, n) for ((i) = 0; (i) < (n); (i)++)
#define per(i, n) for ((i) = (n)-1; (i) >= 0; (i)--)
template <class T, class C> T max(T a, C b) {
return ((a) > (T)(b) ? (a) : (T)(b));
}
template <class T, class C> T min(T a, C b) {
return ((a) < (T)(b) ? (a) : (T)(b));
}
#define zt(a, b) (max((a), (b)) - min((a), (b)))
#define setpre(n) fixed << setprecision(n)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int upint(cv *a, cv *b) {
return *(int *)a < *(int *)b ? -1 : *(int *)a > *(int *)b ? 1 : 0;
}
int downint(cv *a, cv *b) {
return *(int *)a < *(int *)b ? 1 : *(int *)a > *(int *)b ? -1 : 0;
}
int upchar(cv *left, cv *right) { return strcmp((char *)left, (char *)right); }
int downchar(cv *left, cv *right) {
return strcmp((char *)right, (char *)left);
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res *= a;
if (mod >= 1)
res %= mod;
}
a *= a;
if (mod >= 1)
a %= mod;
n >>= 1;
}
return res;
}
void initialize() {}
const int MAX_N = LIMIT2;
int bit[MAX_N + 1] = {0}, n;
// 1-indexed BIT
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & (-i);
}
return s;
}
void add(int i, ll x) {
while (i <= n) {
bit[i] += x;
i += i & (-i);
}
}
ll rangesum(int l, int r) {
if (l > r)
return 0;
return sum(r) - sum(l - 1);
}
int main(void) {
initialize();
ll m, i, j, k, result = 0;
ll l[LIMIT1] = {0}, r[LIMIT1] = {0};
ll dp[LIMIT1] = {0};
string s;
cin >> n >> k;
rep(i, k) { cin >> l[i] >> r[i]; }
dp[1] = 1;
for (i = 1; i <= n; i++) {
dp[i] += dp[i - 1];
rep(j, k) {
if (i + l[j] <= n) {
dp[i + l[j]] += dp[i];
dp[i + l[j]] %= MOD2;
if (i + r[j] <= n)
dp[i + r[j] + 1] -= dp[i];
if (i + r[j] + 1 <= n && dp[i + r[j] + 1] < 0)
dp[i + r[j] + 1] += MOD2;
// cout << i << ":" << i+l[j] << ":" << i+r[j] << endl;
}
}
}
result = dp[n] - dp[n - 1];
cout << result << endl;
return 0;
} | replace | 103 | 104 | 103 | 104 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define M 998244353
long long tree[400005], dp[200001], lazy[400005];
void build(int node, int start, int end) {
if (start == end) {
// Leaf node will have a single element
tree[node] = dp[start];
} else {
int mid = (start + end) / 2;
// Recurse on the left child
build(2 * node, start, mid);
// Recurse on the right child
build(2 * node + 1, mid + 1, end);
// Internal node will have the sum of both of its children
tree[node] = (tree[2 * node] + tree[2 * node + 1]) % M;
}
}
void updateRange(int node, int start, int end, int l, int r, int val) {
if (lazy[node] != 0) {
// This node needs to be updated
tree[node] += (end - start + 1) * lazy[node]; // Update it
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2] %= M; // Mark child as lazy
lazy[node * 2 + 1] += lazy[node];
lazy[node * 2 + 1] %= M; // Mark child as lazy
}
lazy[node] = 0; // Reset it
}
if (start > end or start > r or
end < l) // Current segment is not within range [l, r]
return;
if (start >= l and end <= r) {
// Segment is fully within range
tree[node] += ((end - start + 1) * val) % M;
tree[node] %= M;
if (start != end) {
// Not leaf node
lazy[node * 2] += val;
lazy[node * 2] %= M;
lazy[node * 2 + 1] += val;
lazy[node * 2 + 1] %= M;
}
return;
}
int mid = (start + end) / 2;
updateRange(node * 2, start, mid, l, r, val); // Updating left child
updateRange(node * 2 + 1, mid + 1, end, l, r, val); // Updating right child
tree[node] =
(tree[node * 2] + tree[node * 2 + 1]) % M; // Updating root with max value
}
int queryRange(int node, int start, int end, int l, int r) {
if (start > end or start > r or end < l)
return 0; // Out of range
if (lazy[node] != 0) {
// This node needs to be updated
tree[node] += ((end - start + 1) * lazy[node]) % M;
tree[node] %= M; // Update it
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2] %= M; // Mark child as lazy
lazy[node * 2 + 1] += lazy[node];
lazy[node * 2 + 1] %= M; // Mark child as lazy
}
lazy[node] = 0; // Reset it
}
if (start >= l and end <= r) // Current segment is totally within range [l, r]
return tree[node];
int mid = (start + end) / 2;
int p1 = queryRange(node * 2, start, mid, l, r); // Query left child
int p2 = queryRange(node * 2 + 1, mid + 1, end, l, r); // Query right child
return (p1 + p2) % M;
}
int main() {
// your code goes here
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("res.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int l[k], r[k], li = 0;
for (int i = 0; i < k; i++)
cin >> l[i] >> r[i];
for (int i = 0; i <= n; i++)
dp[i] = 0;
dp[1] = 1;
build(1, 1, n);
// cout<<tree[5]<<endl;
for (int i = 1; i <= n; i++) {
dp[i] = queryRange(1, 1, n, i, i) % M;
// cout<<dp[i]<<endl;
for (int j = 0; j < k; j++) {
if (i + l[j] <= n)
updateRange(1, 1, n, i + l[j], min(i + r[j], n), dp[i] % M);
}
}
// for(int i=1;i<n;i++)
// dp[i]+=dp[i-1];
cout << dp[n] % M;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define M 998244353
long long tree[5000050], dp[3000005], lazy[5000050];
void build(int node, int start, int end) {
if (start == end) {
// Leaf node will have a single element
tree[node] = dp[start];
} else {
int mid = (start + end) / 2;
// Recurse on the left child
build(2 * node, start, mid);
// Recurse on the right child
build(2 * node + 1, mid + 1, end);
// Internal node will have the sum of both of its children
tree[node] = (tree[2 * node] + tree[2 * node + 1]) % M;
}
}
void updateRange(int node, int start, int end, int l, int r, int val) {
if (lazy[node] != 0) {
// This node needs to be updated
tree[node] += (end - start + 1) * lazy[node]; // Update it
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2] %= M; // Mark child as lazy
lazy[node * 2 + 1] += lazy[node];
lazy[node * 2 + 1] %= M; // Mark child as lazy
}
lazy[node] = 0; // Reset it
}
if (start > end or start > r or
end < l) // Current segment is not within range [l, r]
return;
if (start >= l and end <= r) {
// Segment is fully within range
tree[node] += ((end - start + 1) * val) % M;
tree[node] %= M;
if (start != end) {
// Not leaf node
lazy[node * 2] += val;
lazy[node * 2] %= M;
lazy[node * 2 + 1] += val;
lazy[node * 2 + 1] %= M;
}
return;
}
int mid = (start + end) / 2;
updateRange(node * 2, start, mid, l, r, val); // Updating left child
updateRange(node * 2 + 1, mid + 1, end, l, r, val); // Updating right child
tree[node] =
(tree[node * 2] + tree[node * 2 + 1]) % M; // Updating root with max value
}
int queryRange(int node, int start, int end, int l, int r) {
if (start > end or start > r or end < l)
return 0; // Out of range
if (lazy[node] != 0) {
// This node needs to be updated
tree[node] += ((end - start + 1) * lazy[node]) % M;
tree[node] %= M; // Update it
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2] %= M; // Mark child as lazy
lazy[node * 2 + 1] += lazy[node];
lazy[node * 2 + 1] %= M; // Mark child as lazy
}
lazy[node] = 0; // Reset it
}
if (start >= l and end <= r) // Current segment is totally within range [l, r]
return tree[node];
int mid = (start + end) / 2;
int p1 = queryRange(node * 2, start, mid, l, r); // Query left child
int p2 = queryRange(node * 2 + 1, mid + 1, end, l, r); // Query right child
return (p1 + p2) % M;
}
int main() {
// your code goes here
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("res.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int l[k], r[k], li = 0;
for (int i = 0; i < k; i++)
cin >> l[i] >> r[i];
for (int i = 0; i <= n; i++)
dp[i] = 0;
dp[1] = 1;
build(1, 1, n);
// cout<<tree[5]<<endl;
for (int i = 1; i <= n; i++) {
dp[i] = queryRange(1, 1, n, i, i) % M;
// cout<<dp[i]<<endl;
for (int j = 0; j < k; j++) {
if (i + l[j] <= n)
updateRange(1, 1, n, i + l[j], min(i + r[j], n), dp[i] % M);
}
}
// for(int i=1;i<n;i++)
// dp[i]+=dp[i-1];
cout << dp[n] % M;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
static const ll mod = 998244353;
ll N, K;
ll dp[100005];
ll sum[100005];
int main() {
cin >> N >> K;
vector<P> A(K);
for (ll i = 0; i < K; i++) {
ll l, r;
cin >> l >> r;
P p(l, r);
A[i] = p;
}
dp[0] = 1;
sum[0] = 1;
for (ll i = 1; i < N; i++) {
for (ll j = 0; j < K; j++) {
ll l = A[j].first;
ll r = A[j].second;
if (i - l < 0) {
} else if (0 <= i - l && 0 <= i - r - 1) {
dp[i] = (dp[i] + sum[i - l] - sum[i - r - 1] + 2 * mod) % mod;
} else
dp[i] = (dp[i] + sum[i - l]) % mod;
}
sum[i] = (sum[i - 1] + dp[i]) % mod;
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
static const ll mod = 998244353;
ll N, K;
ll dp[200005];
ll sum[200005];
int main() {
cin >> N >> K;
vector<P> A(K);
for (ll i = 0; i < K; i++) {
ll l, r;
cin >> l >> r;
P p(l, r);
A[i] = p;
}
dp[0] = 1;
sum[0] = 1;
for (ll i = 1; i < N; i++) {
for (ll j = 0; j < K; j++) {
ll l = A[j].first;
ll r = A[j].second;
if (i - l < 0) {
} else if (0 <= i - l && 0 <= i - r - 1) {
dp[i] = (dp[i] + sum[i - l] - sum[i - r - 1] + 2 * mod) % mod;
} else
dp[i] = (dp[i] + sum[i - l]) % mod;
}
sum[i] = (sum[i - 1] + dp[i]) % mod;
}
cout << dp[N - 1] << endl;
return 0;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 998244353;
const long double PI = 3.14159265358979;
const ll MAX = 0;
ll DP[200020];
int main() {
ll N, K;
cin >> N >> K;
ll L[K];
ll R[K];
rep(i, K) { cin >> L[i] >> R[i]; }
DP[0] = 1;
DP[1] = -1;
rep(i, N) {
rep(j, K) {
DP[i + L[j]] += DP[i];
DP[i + L[j]] %= MOD;
DP[i + R[j] + 1] -= DP[i];
DP[i + R[j] + 1] %= MOD;
}
DP[i + 1] += DP[i];
DP[i + 1] %= MOD;
}
while (DP[N - 1] < 0) {
DP[N - 1] += MOD;
}
cout << DP[N - 1];
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
const ll MOD = 998244353;
const long double PI = 3.14159265358979;
const ll MAX = 0;
ll DP[600020];
int main() {
ll N, K;
cin >> N >> K;
ll L[K];
ll R[K];
rep(i, K) { cin >> L[i] >> R[i]; }
DP[0] = 1;
DP[1] = -1;
rep(i, N) {
rep(j, K) {
DP[i + L[j]] += DP[i];
DP[i + L[j]] %= MOD;
DP[i + R[j] + 1] -= DP[i];
DP[i + R[j] + 1] %= MOD;
}
DP[i + 1] += DP[i];
DP[i + 1] %= MOD;
}
while (DP[N - 1] < 0) {
DP[N - 1] += MOD;
}
cout << DP[N - 1];
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long dp[200001];
long long pre[200001];
int main() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> S;
for (long long i = 0; i < k; i++) {
long long l, r;
cin >> l >> r;
S.push_back({l, r});
}
dp[0] = 0;
dp[1] = 1;
dp[2] = -1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i] % mod + dp[i - 1] % mod) % mod;
for (int j = 0; j < k; j++) {
int l = S[j].first;
int r = S[j].second;
if (i + l <= n) {
dp[i + l] += dp[i];
dp[i + r + 1] %= mod;
}
if (i + r + 1 <= n) {
dp[i + r + 1] = (dp[i + r + 1] - dp[i] + mod) % mod;
dp[i + r + 1] %= mod;
}
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long dp[200001];
long long pre[200001];
int main() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> S;
for (long long i = 0; i < k; i++) {
long long l, r;
cin >> l >> r;
S.push_back({l, r});
}
dp[0] = 0;
dp[1] = 1;
dp[2] = -1;
for (int i = 1; i <= n; i++) {
dp[i] = (dp[i] % mod + dp[i - 1] % mod) % mod;
for (int j = 0; j < k; j++) {
int l = S[j].first;
int r = S[j].second;
if (i + l <= n) {
dp[i + l] += dp[i];
dp[i + l] %= mod;
}
if (i + r + 1 <= n) {
dp[i + r + 1] = (dp[i + r + 1] - dp[i] + mod) % mod;
dp[i + r + 1] %= mod;
}
}
}
cout << dp[n] << endl;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02549 | C++ | Runtime Error | // clear adj and visited vector declared globally after each test case
// check for long long overflow
// while adding and subs check if mod becomes -ve
// while using an integer directly in a builtin function add ll
// Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
// Dont keep array name as size or any other key word
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); \
cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 998244353ll
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rep(i, x, y) for (int i = x; i < y; i++)
#define fill(a, b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define print2d(dp, n, m) \
for (int i = 0; i <= n; i++) { \
for (int j = 0; j <= m; j++) \
cout << dp[i][j] << " "; \
cout << "\n"; \
}
typedef std::numeric_limits<double> dbl;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const long long N = 100005, INF = 2000000000000000000;
lld pi = 3.1415926535897932;
int lcm(int a, int b) {
int g = __gcd(a, b);
return a / g * b;
}
int power(int a, int b, int p) {
if (a == 0)
return 0;
int res = 1;
a %= p;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
b >>= 1;
a = (a * a) % p;
}
return res;
}
int dp[N], ans[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
int l[k], r[k];
for (int i = 0; i < k; i++)
cin >> l[i] >> r[i];
dp[0] = 1;
ans[0] = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
int m1 = i - r[j], m2 = i - l[j];
if (m2 >= 0)
ans[i] = (ans[i] + dp[m2]) % mod;
m1--;
if (m1 >= 0)
ans[i] = (ans[i] - dp[m1] + mod) % mod;
}
dp[i] = (dp[i - 1] + ans[i]) % mod;
}
cout << ans[n - 1];
} | // clear adj and visited vector declared globally after each test case
// check for long long overflow
// while adding and subs check if mod becomes -ve
// while using an integer directly in a builtin function add ll
// Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
// Dont keep array name as size or any other key word
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL); \
cout.precision(dbl::max_digits10);
#define pb push_back
#define mod 998244353ll
#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rep(i, x, y) for (int i = x; i < y; i++)
#define fill(a, b) memset(a, b, sizeof(a))
#define vi vector<int>
#define setbits(x) __builtin_popcountll(x)
#define print2d(dp, n, m) \
for (int i = 0; i <= n; i++) { \
for (int j = 0; j <= m; j++) \
cout << dp[i][j] << " "; \
cout << "\n"; \
}
typedef std::numeric_limits<double> dbl;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const long long N = 200005, INF = 2000000000000000000;
lld pi = 3.1415926535897932;
int lcm(int a, int b) {
int g = __gcd(a, b);
return a / g * b;
}
int power(int a, int b, int p) {
if (a == 0)
return 0;
int res = 1;
a %= p;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
b >>= 1;
a = (a * a) % p;
}
return res;
}
int dp[N], ans[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
int l[k], r[k];
for (int i = 0; i < k; i++)
cin >> l[i] >> r[i];
dp[0] = 1;
ans[0] = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
int m1 = i - r[j], m2 = i - l[j];
if (m2 >= 0)
ans[i] = (ans[i] + dp[m2]) % mod;
m1--;
if (m1 >= 0)
ans[i] = (ans[i] - dp[m1] + mod) % mod;
}
dp[i] = (dp[i - 1] + ans[i]) % mod;
}
cout << ans[n - 1];
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<int, int>> imos(k);
rep(i, k) {
int L, R;
cin >> L >> R;
imos[i] = make_pair(L, R + 1);
}
vector<ll> dp(500000, 0);
dp[1] = 1;
dp[2] = -1;
rep(i, 500000) {
if (i > 0)
dp[i] += dp[i - 1];
dp[i] %= MOD;
rep(j, k) {
int L = imos[j].first;
int R = imos[j].second;
dp[i + L] += dp[i];
dp[i + L] %= MOD;
dp[i + R] -= dp[i];
dp[i + R] = (dp[i + R] + MOD) % MOD;
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<int, int>> imos(k);
rep(i, k) {
int L, R;
cin >> L >> R;
imos[i] = make_pair(L, R + 1);
}
vector<ll> dp(500000, 0);
dp[1] = 1;
dp[2] = -1;
rep(i, 300000) {
if (i > 0)
dp[i] += dp[i - 1];
dp[i] %= MOD;
rep(j, k) {
int L = imos[j].first;
int R = imos[j].second;
dp[i + L] += dp[i];
dp[i + L] %= MOD;
dp[i + R] -= dp[i];
dp[i + R] = (dp[i + R] + MOD) % MOD;
}
}
cout << dp[n] << endl;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02549 | 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;
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 {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
int N, K;
cin >> N >> K;
vector<int> L(K);
vector<int> R(K);
rep(i, K) cin >> L[i] >> R[i];
vector<mint> dp(N + 100);
dp[1] = 1;
for (int i = 1; i < N + 1; i++) {
dp[i] += dp[i - 1];
rep(j, K) {
int l = L[j] + i;
int r = min(R[j] + i, N + 10);
dp[l] += dp[i];
dp[r + 1] -= dp[i];
}
}
cout << (dp[N] - dp[N - 1]).x << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
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 {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
int N, K;
cin >> N >> K;
vector<int> L(K);
vector<int> R(K);
rep(i, K) cin >> L[i] >> R[i];
vector<mint> dp(N + 100);
dp[1] = 1;
for (int i = 1; i < N + 1; i++) {
dp[i] += dp[i - 1];
rep(j, K) {
int l = min(L[j] + i, N + 10);
int r = min(R[j] + i, N + 10);
dp[l] += dp[i];
dp[r + 1] -= dp[i];
}
}
cout << (dp[N] - dp[N - 1]).x << endl;
return 0;
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t Q = 998244353;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> p(K);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
vector<int64_t> dp(N + 1);
vector<int64_t> rui(N + 1);
dp[1] = 1;
rui[1] = 1;
for (int i = 2; i <= N; i++) {
int64_t A = 0;
for (int j = 0; j < K; j++) {
int a, b;
tie(a, b) = p[j];
if (i <= a) {
break;
}
A += rui[i - a] - rui[max(i - b - 1, 0)];
A += Q;
A %= Q;
}
dp[i] = A;
rui[i] = (dp[i] + rui[i - 1]) % Q;
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t Q = 998244353;
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> p(K);
for (int i = 0; i < K; i++) {
int a, b;
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
vector<int64_t> dp(N + 1);
vector<int64_t> rui(N + 1);
dp[1] = 1;
rui[1] = 1;
for (int i = 2; i <= N; i++) {
int64_t A = 0;
for (int j = 0; j < K; j++) {
int a, b;
tie(a, b) = p[j];
if (i <= a) {
break;
}
A += rui[i - a] - rui[max(i - b - 1, 0)];
A += Q;
A %= Q;
}
dp[i] = A;
rui[i] = (dp[i] + rui[i - 1]) % Q;
}
cout << dp[N] << endl;
} | replace | 9 | 10 | 9 | 10 | -6 | malloc(): corrupted top size
|
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 200005
#define mod 998244353
ll tree[MAX] = {0};
ll lazy[MAX] = {0};
void updateRangeUtil(ll si, ll ss, ll se, ll us, ll ue, ll diff) {
if (lazy[si] != 0) {
tree[si] += (se - ss + 1) * lazy[si];
tree[si] %= mod;
if (ss != se) {
lazy[si * 2 + 1] += lazy[si];
lazy[si * 2 + 1] %= mod;
lazy[si * 2 + 2] += lazy[si];
lazy[si * 2 + 2] %= mod;
}
lazy[si] = 0;
}
if (ss > se || ss > ue || se < us)
return;
if (ss >= us && se <= ue) {
tree[si] += (se - ss + 1) * diff;
tree[si] %= mod;
if (ss != se) {
lazy[si * 2 + 1] += diff;
lazy[si * 2 + 1] %= mod;
lazy[si * 2 + 2] += diff;
lazy[si * 2 + 2] %= mod;
}
return;
}
ll mid = (ss + se) / 2;
updateRangeUtil(si * 2 + 1, ss, mid, us, ue, diff);
updateRangeUtil(si * 2 + 2, mid + 1, se, us, ue, diff);
tree[si] = tree[si * 2 + 1] + tree[si * 2 + 2];
tree[si] %= mod;
}
void updateRange(ll n, ll us, ll ue, ll diff) {
updateRangeUtil(0, 0, n - 1, us, ue, diff);
}
ll getSumUtil(ll ss, ll se, ll qs, ll qe, ll si) {
if (lazy[si] != 0) {
tree[si] += (se - ss + 1) * lazy[si];
tree[si] %= mod;
if (ss != se) {
lazy[si * 2 + 1] += lazy[si];
lazy[si * 2 + 1] %= mod;
lazy[si * 2 + 2] += lazy[si];
lazy[si * 2 + 2] %= mod;
}
lazy[si] = 0;
}
if (ss > se || ss > qe || se < qs)
return 0;
if (ss >= qs && se <= qe)
return tree[si];
ll mid = (ss + se) / 2;
ll mkp = getSumUtil(ss, mid, qs, qe, 2 * si + 1) +
getSumUtil(mid + 1, se, qs, qe, 2 * si + 2);
mkp %= mod;
return mkp;
}
ll getSum(ll n, ll qs, ll qe) {
if (qs < 0 || qe > n - 1 || qs > qe) {
exit(78);
}
return getSumUtil(0, n - 1, qs, qe, 0);
}
void constructSTUtil(ll arr[], ll ss, ll se, ll si) {
if (ss > se)
return;
if (ss == se) {
tree[si] = arr[ss];
return;
}
ll mid = (ss + se) / 2;
constructSTUtil(arr, ss, mid, si * 2 + 1);
constructSTUtil(arr, mid + 1, se, si * 2 + 2);
tree[si] = tree[si * 2 + 1] + tree[si * 2 + 2];
}
void constructST(ll arr[], ll n) { constructSTUtil(arr, 0, n - 1, 0); }
int main() {
// freopen("in", "r", stdin);
ll n, k;
cin >> n >> k;
ll arr[n + 10];
for (int i = 0; i < n + 5; i++)
arr[i] = 0;
arr[0] = 1;
constructST(arr, n);
vector<pair<ll, ll>> ami(k);
for (auto &a : ami) {
cin >> a.first;
cin >> a.second;
}
for (int i = 0; i < n; i++) {
for (auto a : ami) {
if (i + a.first >= n)
continue;
updateRange(n, i + a.first, min(i + a.second, n - 1), getSum(n, i, i));
}
}
cout << getSum(n, n - 1, n - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MAX 2000005
#define mod 998244353
ll tree[MAX] = {0};
ll lazy[MAX] = {0};
void updateRangeUtil(ll si, ll ss, ll se, ll us, ll ue, ll diff) {
if (lazy[si] != 0) {
tree[si] += (se - ss + 1) * lazy[si];
tree[si] %= mod;
if (ss != se) {
lazy[si * 2 + 1] += lazy[si];
lazy[si * 2 + 1] %= mod;
lazy[si * 2 + 2] += lazy[si];
lazy[si * 2 + 2] %= mod;
}
lazy[si] = 0;
}
if (ss > se || ss > ue || se < us)
return;
if (ss >= us && se <= ue) {
tree[si] += (se - ss + 1) * diff;
tree[si] %= mod;
if (ss != se) {
lazy[si * 2 + 1] += diff;
lazy[si * 2 + 1] %= mod;
lazy[si * 2 + 2] += diff;
lazy[si * 2 + 2] %= mod;
}
return;
}
ll mid = (ss + se) / 2;
updateRangeUtil(si * 2 + 1, ss, mid, us, ue, diff);
updateRangeUtil(si * 2 + 2, mid + 1, se, us, ue, diff);
tree[si] = tree[si * 2 + 1] + tree[si * 2 + 2];
tree[si] %= mod;
}
void updateRange(ll n, ll us, ll ue, ll diff) {
updateRangeUtil(0, 0, n - 1, us, ue, diff);
}
ll getSumUtil(ll ss, ll se, ll qs, ll qe, ll si) {
if (lazy[si] != 0) {
tree[si] += (se - ss + 1) * lazy[si];
tree[si] %= mod;
if (ss != se) {
lazy[si * 2 + 1] += lazy[si];
lazy[si * 2 + 1] %= mod;
lazy[si * 2 + 2] += lazy[si];
lazy[si * 2 + 2] %= mod;
}
lazy[si] = 0;
}
if (ss > se || ss > qe || se < qs)
return 0;
if (ss >= qs && se <= qe)
return tree[si];
ll mid = (ss + se) / 2;
ll mkp = getSumUtil(ss, mid, qs, qe, 2 * si + 1) +
getSumUtil(mid + 1, se, qs, qe, 2 * si + 2);
mkp %= mod;
return mkp;
}
ll getSum(ll n, ll qs, ll qe) {
if (qs < 0 || qe > n - 1 || qs > qe) {
exit(78);
}
return getSumUtil(0, n - 1, qs, qe, 0);
}
void constructSTUtil(ll arr[], ll ss, ll se, ll si) {
if (ss > se)
return;
if (ss == se) {
tree[si] = arr[ss];
return;
}
ll mid = (ss + se) / 2;
constructSTUtil(arr, ss, mid, si * 2 + 1);
constructSTUtil(arr, mid + 1, se, si * 2 + 2);
tree[si] = tree[si * 2 + 1] + tree[si * 2 + 2];
}
void constructST(ll arr[], ll n) { constructSTUtil(arr, 0, n - 1, 0); }
int main() {
// freopen("in", "r", stdin);
ll n, k;
cin >> n >> k;
ll arr[n + 10];
for (int i = 0; i < n + 5; i++)
arr[i] = 0;
arr[0] = 1;
constructST(arr, n);
vector<pair<ll, ll>> ami(k);
for (auto &a : ami) {
cin >> a.first;
cin >> a.second;
}
for (int i = 0; i < n; i++) {
for (auto a : ami) {
if (i + a.first >= n)
continue;
updateRange(n, i + a.first, min(i + a.second, n - 1), getSum(n, i, i));
}
}
cout << getSum(n, n - 1, n - 1) << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;
int l[10], r[10];
// dp[i] = 範囲 [1, i] に到着する場合の数
ll dp[201] = {};
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i)
cin >> l[i] >> r[i];
dp[1] = 1;
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1];
for (int j = 0; j < k; ++j) {
int ll = max(1, i - r[j]);
int rr = min(i - 1, i - l[j]);
if (ll <= rr) {
dp[i] += dp[rr] - dp[ll - 1];
}
}
dp[i] = (dp[i] % MOD + MOD) % MOD;
}
cout << (dp[n] - dp[n - 1] + MOD) % MOD << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;
int l[10], r[10];
// dp[i] = 範囲 [1, i] に到着する場合の数
ll dp[200001] = {};
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i)
cin >> l[i] >> r[i];
dp[1] = 1;
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1];
for (int j = 0; j < k; ++j) {
int ll = max(1, i - r[j]);
int rr = min(i - 1, i - l[j]);
if (ll <= rr) {
dp[i] += dp[rr] - dp[ll - 1];
}
}
dp[i] = (dp[i] % MOD + MOD) % MOD;
}
cout << (dp[n] - dp[n - 1] + MOD) % MOD << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
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...);
}
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
// #########################################
const int mod = 998244353;
void add(int &a, int b) {
a = (a + b) % mod;
a = (a % mod + mod) % mod;
}
signed main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) cin >> l[i] >> r[i];
vector<int> dp(n + 3);
dp[1] = 1;
add(dp[2], -1);
int sum = 0;
for (int i = 1; i <= n; i++) {
add(sum, dp[i]);
rep(j, k) {
add(dp[r[j] + 1 + i], -sum);
add(dp[l[j] + i], sum);
}
// trace(i,sum,dp);
}
for (int i = 1; i <= n; i++)
add(dp[i + 1], dp[i]);
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) {
out << "[";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "]";
return out;
}
template <typename T, class Cmp>
ostream &operator<<(ostream &out, const set<T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &v : a) {
out << (first ? "" : ", ");
out << v;
first = 0;
}
out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream &operator<<(ostream &out, const map<U, T, Cmp> &a) {
out << "{";
bool first = true;
for (auto &p : a) {
out << (first ? "" : ", ");
out << p.first << ":" << p.second;
first = 0;
}
out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
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...);
}
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
#define int long long
using P = pair<int, int>;
// #########################################
const int mod = 998244353;
void add(int &a, int b) {
a = (a + b) % mod;
a = (a % mod + mod) % mod;
}
signed main() {
int n, k;
cin >> n >> k;
vector<int> l(k), r(k);
rep(i, k) cin >> l[i] >> r[i];
vector<int> dp(n + 3);
dp[1] = 1;
add(dp[2], -1);
int sum = 0;
for (int i = 1; i <= n; i++) {
add(sum, dp[i]);
rep(j, k) {
if (r[j] + 1 + i < n + 3)
add(dp[r[j] + 1 + i], -sum);
if (l[j] + i < n + 3)
add(dp[l[j] + i], sum);
}
// trace(i,sum,dp);
}
for (int i = 1; i <= n; i++)
add(dp[i + 1], dp[i]);
cout << dp[n] << endl;
return 0;
} | replace | 92 | 94 | 92 | 96 | 0 | |
p02549 | C++ | Runtime Error | // {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
namespace {
namespace unolight {
// Read Input
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
// Write Output
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
#pragma endregion
// }}}
// {{{ ModInt
template <int _MOD> struct ModInt {
static const auto MOD = _MOD;
template <class T>
using integral_only = typename enable_if<is_integral<T>::value>::type;
int x;
constexpr ModInt() : x() {}
template <class T, integral_only<T> * = nullptr> ModInt(T _x = 0) {
x = _x % MOD;
if (x < 0)
x += MOD;
}
ModInt operator-() const { return {x == 0 ? 0 : MOD - x}; }
ModInt &operator+=(const ModInt a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(const ModInt a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator*=(const ModInt a) {
x = (long long)x * a.x % MOD;
return *this;
}
ModInt &operator/=(const ModInt a) { return (*this) *= a.inv(); }
ModInt operator+(const ModInt a) const { return ModInt(*this) += a; }
ModInt operator-(const ModInt a) const { return ModInt(*this) -= a; }
ModInt operator*(const ModInt a) const { return ModInt(*this) *= a; }
ModInt operator/(const ModInt a) const { return ModInt(*this) /= a; }
ModInt inv() const {
// for prime MOD
return pow(MOD - 2);
}
ModInt inv2() const {
// work for non-prime MOD if gcd(x,MOD) = 1
int a = x, b = MOD, u = 1, v = 0;
while (b != 0) {
int t = a / b;
a -= t * b;
u -= t * v;
swap(a, b);
swap(u, v);
}
return u;
}
template <class T, integral_only<T> * = nullptr> ModInt pow(T t) const {
ModInt r = 1, p = *this;
while (t) {
if (t & 1)
r *= p;
p *= p;
t >>= 1;
}
return r;
}
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
bool operator<(ModInt rhs) const { return x < rhs.x; }
bool operator<=(ModInt rhs) const { return x <= rhs.x; }
bool operator>(ModInt rhs) const { return x > rhs.x; }
bool operator>=(ModInt rhs) const { return x >= rhs.x; }
friend string to_string(ModInt i) { return to_string(i.x); }
friend istream &operator>>(istream &i, ModInt &a) { return i >> a.x; }
friend ostream &operator<<(ostream &o, const ModInt &a) { return o << a.x; }
};
const int MOD = 998244353;
using mint = ModInt<MOD>;
// }}}
void main() {
int n, k;
R(n, k);
vector<mint> dp(n * 2, 0);
vector<PII> a(k);
for (int i = 0; i < k; i++) {
R(a[i].first, a[i].second);
}
dp[0] = 1;
mint sum = 0;
for (int i = 0; i < n; i++) {
// if ( dp[i]==0 ) continue;
sum += dp[i];
for (int j = 0; j < k; j++) {
int l = a[j].first, r = a[j].second;
dp[i + l] += sum;
dp[i + r + 1] -= sum;
}
// W(dp);
}
W(dp[n - 1]);
}
} // namespace unolight
} // namespace
int main() {
unolight::main();
return 0;
}
// }}}
| // {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
namespace {
namespace unolight {
// Read Input
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
_R(head);
R(tail...);
}
// Write Output
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T> void _W(const vector<T> &x) {
for (auto i = x.begin(); i != x.end(); _W(*i++))
if (i != x.cbegin())
putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
_W(head);
putchar(sizeof...(tail) ? ' ' : '\n');
W(tail...);
}
#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif
template <class T> inline bool chmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
sort(begin(v), end(v), f);
v.resize(unique(begin(v), end(v)) - begin(v));
}
#pragma endregion
// }}}
// {{{ ModInt
template <int _MOD> struct ModInt {
static const auto MOD = _MOD;
template <class T>
using integral_only = typename enable_if<is_integral<T>::value>::type;
int x;
constexpr ModInt() : x() {}
template <class T, integral_only<T> * = nullptr> ModInt(T _x = 0) {
x = _x % MOD;
if (x < 0)
x += MOD;
}
ModInt operator-() const { return {x == 0 ? 0 : MOD - x}; }
ModInt &operator+=(const ModInt a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator-=(const ModInt a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
ModInt &operator*=(const ModInt a) {
x = (long long)x * a.x % MOD;
return *this;
}
ModInt &operator/=(const ModInt a) { return (*this) *= a.inv(); }
ModInt operator+(const ModInt a) const { return ModInt(*this) += a; }
ModInt operator-(const ModInt a) const { return ModInt(*this) -= a; }
ModInt operator*(const ModInt a) const { return ModInt(*this) *= a; }
ModInt operator/(const ModInt a) const { return ModInt(*this) /= a; }
ModInt inv() const {
// for prime MOD
return pow(MOD - 2);
}
ModInt inv2() const {
// work for non-prime MOD if gcd(x,MOD) = 1
int a = x, b = MOD, u = 1, v = 0;
while (b != 0) {
int t = a / b;
a -= t * b;
u -= t * v;
swap(a, b);
swap(u, v);
}
return u;
}
template <class T, integral_only<T> * = nullptr> ModInt pow(T t) const {
ModInt r = 1, p = *this;
while (t) {
if (t & 1)
r *= p;
p *= p;
t >>= 1;
}
return r;
}
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
bool operator<(ModInt rhs) const { return x < rhs.x; }
bool operator<=(ModInt rhs) const { return x <= rhs.x; }
bool operator>(ModInt rhs) const { return x > rhs.x; }
bool operator>=(ModInt rhs) const { return x >= rhs.x; }
friend string to_string(ModInt i) { return to_string(i.x); }
friend istream &operator>>(istream &i, ModInt &a) { return i >> a.x; }
friend ostream &operator<<(ostream &o, const ModInt &a) { return o << a.x; }
};
const int MOD = 998244353;
using mint = ModInt<MOD>;
// }}}
void main() {
int n, k;
R(n, k);
vector<mint> dp(n * 2, 0);
vector<PII> a(k);
for (int i = 0; i < k; i++) {
R(a[i].first, a[i].second);
}
dp[0] = 1;
mint sum = 0;
for (int i = 0; i < n; i++) {
// if ( dp[i]==0 ) continue;
sum += dp[i];
for (int j = 0; j < k; j++) {
int l = a[j].first, r = a[j].second;
if (i + l <= n)
dp[i + l] += sum;
if (i + r + 1 <= n)
dp[i + r + 1] -= sum;
}
// W(dp);
}
W(dp[n - 1]);
}
} // namespace unolight
} // namespace
int main() {
unolight::main();
return 0;
}
// }}}
| replace | 165 | 167 | 165 | 169 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll mod = 998244353;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> lr(k);
for (auto &v : lr) {
ll l, r;
cin >> l >> r;
v = make_pair(l, r);
}
vector<ll> vec1(3e5, 0), vec2(3e5, 0), vec3(3e5, 0);
vec1[1] = 1;
vec2[1] = 1;
vec3[1] = 1;
for (ll i = 1; i < n; ++i) {
for (auto &v : lr) {
ll l = v.first;
ll r = v.second;
vec1[i + l] = (vec1[i + l] + vec3[i]) % mod;
vec2[i + r] = (vec2[i + r] + vec3[i]) % mod;
}
vec3[i + 1] = (vec3[i] - vec2[i]) % mod;
if (vec3[i + 1] < 0)
vec3[i + 1] += mod;
vec3[i + 1] = (vec3[i + 1] + vec1[i + 1]) % mod;
}
cout << vec3[n] << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll mod = 998244353;
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> lr(k);
for (auto &v : lr) {
ll l, r;
cin >> l >> r;
v = make_pair(l, r);
}
vector<ll> vec1(5e5, 0), vec2(5e5, 0), vec3(5e5, 0);
vec1[1] = 1;
vec2[1] = 1;
vec3[1] = 1;
for (ll i = 1; i < n; ++i) {
for (auto &v : lr) {
ll l = v.first;
ll r = v.second;
vec1[i + l] = (vec1[i + l] + vec3[i]) % mod;
vec2[i + r] = (vec2[i + r] + vec3[i]) % mod;
}
vec3[i + 1] = (vec3[i] - vec2[i]) % mod;
if (vec3[i + 1] < 0)
vec3[i + 1] += mod;
vec3[i + 1] = (vec3[i + 1] + vec1[i + 1]) % mod;
}
cout << vec3[n] << endl;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> ranges(K);
vector<ll> diffs(N + 1, 0);
vector<ll> paths(N + 1, 0);
paths[1] = 1;
ll cur = 0;
for (ll i = 0; i < K; i++) {
int l, r;
cin >> l >> r;
ranges[i] = make_pair(l, r);
}
for (ll i = 1; i <= N; i++) {
cur += diffs[i];
paths[i] += cur;
paths[i] = paths[i] % 998244353;
if (paths[i] > 0) {
for (ll j = 0; j < K; j++) {
if (i + ranges[j].first <= N) {
diffs[i + ranges[j].first] += paths[i];
diffs[min(N + 1, i + ranges[j].second + 1)] -= paths[i];
}
}
}
}
cout << paths[N] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll N, K;
cin >> N >> K;
vector<pair<ll, ll>> ranges(K);
vector<ll> diffs(N + 2, 0);
vector<ll> paths(N + 2, 0);
paths[1] = 1;
ll cur = 0;
for (ll i = 0; i < K; i++) {
int l, r;
cin >> l >> r;
ranges[i] = make_pair(l, r);
}
for (ll i = 1; i <= N; i++) {
cur += diffs[i];
paths[i] += cur;
paths[i] = paths[i] % 998244353;
if (paths[i] > 0) {
for (ll j = 0; j < K; j++) {
if (i + ranges[j].first <= N) {
diffs[i + ranges[j].first] += paths[i];
diffs[min(N + 1, i + ranges[j].second + 1)] -= paths[i];
}
}
}
}
cout << paths[N] << endl;
return 0;
} | replace | 13 | 15 | 13 | 15 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define int long long
#define mod 998244353
int L[11], R[11];
int dp[100005];
int sum[100005];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
for (int i = 1; i <= K; i++) {
cin >> L[i] >> R[i];
}
sum[1] = dp[1] = 1;
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= K; j++) {
if (i - L[j] < 1)
continue;
else if (i - R[j] < 1) {
dp[i] = (dp[i] + sum[i - L[j]]) % mod;
} else {
dp[i] = (dp[i] + sum[i - L[j]]) % mod;
dp[i] = (dp[i] - sum[i - R[j] - 1] + mod) % mod;
}
}
sum[i] = (sum[i - 1] + dp[i]) % mod;
}
cout << dp[N] << endl;
} | #include <iostream>
using namespace std;
#define int long long
#define mod 998244353
int L[11], R[11];
int dp[200005];
int sum[200005];
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
for (int i = 1; i <= K; i++) {
cin >> L[i] >> R[i];
}
sum[1] = dp[1] = 1;
for (int i = 2; i <= N; i++) {
for (int j = 1; j <= K; j++) {
if (i - L[j] < 1)
continue;
else if (i - R[j] < 1) {
dp[i] = (dp[i] + sum[i - L[j]]) % mod;
} else {
dp[i] = (dp[i] + sum[i - L[j]]) % mod;
dp[i] = (dp[i] - sum[i - R[j] - 1] + mod) % mod;
}
}
sum[i] = (sum[i - 1] + dp[i]) % mod;
}
cout << dp[N] << endl;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02549 | C++ | Time Limit Exceeded | #ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) \
cerr << #mp << ":" << endl; \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cerr << i->first << ":" << i->second << endl; \
}
#define dbgset(st) \
cerr << #st << ":" << endl; \
for (auto i = st.begin(); i != st.end(); ++i) { \
cerr << *i << " "; \
} \
cerr << endl;
#define dbgarr(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j] << " "; } \
cerr << endl; \
}
#define dbgdp(n, arr) \
rep(i, n) { cerr << arr[i] << " "; } \
cerr << endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v) \
rep(i, v.size()) { cout << v[i] << " "; } \
cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> istream &operator>>(istream &i, vector<T> &v) {
rep(j, v.size()) i >> v[j];
return i;
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// mint
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; }
typedef vector<mint> Vmint;
typedef vector<vector<mint>> VVmint;
typedef vector<vector<vector<mint>>> VVVmint;
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];
}
};
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;
}
void debug(ll n) {
Vec segv;
rep(i, n) { segv.pb(query(i, i + 1)); }
dbg(segv);
}
};
int solve() {
ll n;
cin >> n;
SegmentTree<ll> seg(
n + 1, [](ll a, ll b) { return (a + b) % MOD; }, 0);
ll k;
cin >> k;
VP span(k);
rep(i, k) {
ll l, r;
cin >> l >> r;
span[i] = mp(l, r);
}
sort(ALL(span));
seg.update(0, 1);
dbg(span);
REP(i, 1, n) {
rep(j, k) {
auto [l, r] = span[j];
ll il = i - r;
ll ir = i - l;
ir++;
dbg(mp(il, ir));
chmax(il, 0LL);
chmax(ir, 0LL);
ll sum = seg.query(il, ir);
dbg(mp(i, sum));
ll now = seg.query(i, i + 1);
seg.update(i, sum + now);
}
seg.debug(n);
}
dbg(span);
out(seg.query(n - 1, n));
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
// ll T;
// cin>>T;
// while(T--)
solve();
}
| #ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) \
cerr << #mp << ":" << endl; \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cerr << i->first << ":" << i->second << endl; \
}
#define dbgset(st) \
cerr << #st << ":" << endl; \
for (auto i = st.begin(); i != st.end(); ++i) { \
cerr << *i << " "; \
} \
cerr << endl;
#define dbgarr(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j] << " "; } \
cerr << endl; \
}
#define dbgdp(n, arr) \
rep(i, n) { cerr << arr[i] << " "; } \
cerr << endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v) \
rep(i, v.size()) { cout << v[i] << " "; } \
cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <typename T> istream &operator>>(istream &i, vector<T> &v) {
rep(j, v.size()) i >> v[j];
return i;
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// mint
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; }
typedef vector<mint> Vmint;
typedef vector<vector<mint>> VVmint;
typedef vector<vector<vector<mint>>> VVVmint;
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];
}
};
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;
}
void debug(ll n) {
Vec segv;
rep(i, n) { segv.pb(query(i, i + 1)); }
dbg(segv);
}
};
int solve() {
ll n;
cin >> n;
SegmentTree<ll> seg(
n + 1, [](ll a, ll b) { return (a + b) % MOD; }, 0);
ll k;
cin >> k;
VP span(k);
rep(i, k) {
ll l, r;
cin >> l >> r;
span[i] = mp(l, r);
}
sort(ALL(span));
seg.update(0, 1);
dbg(span);
REP(i, 1, n) {
rep(j, k) {
auto [l, r] = span[j];
ll il = i - r;
ll ir = i - l;
ir++;
dbg(mp(il, ir));
chmax(il, 0LL);
chmax(ir, 0LL);
ll sum = seg.query(il, ir);
dbg(mp(i, sum));
ll now = seg.query(i, i + 1);
seg.update(i, sum + now);
}
// seg.debug(n);
}
dbg(span);
out(seg.query(n - 1, n));
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
// ll T;
// cin>>T;
// while(T--)
solve();
}
| replace | 316 | 317 | 316 | 317 | TLE | |
p02549 | C++ | Runtime Error | // $%D%$.$%M%$.$%Y%$
// $%h%$:$%m%$:$%s%$
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define ll long long
#define ld long double
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define per(i, a, n) for (int i = (int)(n - 1); i >= (int)(a); i--)
#define mp(a, b) make_pair(a, b)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define fi first
#define se second
const int MOD = 998244353; // = (119<<23)+1
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = 4 * atan((ld)1);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n + 1);
dp[0] = 1;
vector<int> pref(n + 1);
pref[1] = 1;
vector<pii> da(k);
for (int i = 0; i < k; ++i) {
cin >> da[i].first >> da[i].second;
}
for (int i = 1; i <= n; ++i) {
for (auto x : da) {
int l = i - x.second;
int r = i - x.first + 1;
dp[i] = (dp[i] + (pref[max(0, r)] - pref[max(0, l)] + MOD) % MOD) % MOD;
}
pref[i + 1] = (pref[i] + dp[i]) % MOD;
}
cout << dp[n - 1] << '\n';
} | // $%D%$.$%M%$.$%Y%$
// $%h%$:$%m%$:$%s%$
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define ll long long
#define ld long double
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define per(i, a, n) for (int i = (int)(n - 1); i >= (int)(a); i--)
#define mp(a, b) make_pair(a, b)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define fi first
#define se second
const int MOD = 998244353; // = (119<<23)+1
const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = 4 * atan((ld)1);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n + 1);
dp[0] = 1;
vector<int> pref(n + 2);
pref[1] = 1;
vector<pii> da(k);
for (int i = 0; i < k; ++i) {
cin >> da[i].first >> da[i].second;
}
for (int i = 1; i <= n; ++i) {
for (auto x : da) {
int l = i - x.second;
int r = i - x.first + 1;
dp[i] = (dp[i] + (pref[max(0, r)] - pref[max(0, l)] + MOD) % MOD) % MOD;
}
pref[i + 1] = (pref[i] + dp[i]) % MOD;
}
cout << dp[n - 1] << '\n';
} | replace | 38 | 39 | 38 | 39 | -6 | munmap_chunk(): invalid pointer
|
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <atcoder/all>
#define FOR(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for (int(i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for (int(i) = (int)(n); (i) >= (int)(a); --(i))
#define REP(i, n) FOR((i), 0, (n))
#define REPe(i, n) FORe((i), 1, (n))
#define REPo(i, n) FORe((i), 0, (n))
#define rREP(i, n) rFOR((i), 0, (n))
#define rREPe(i, n) rFORe((i), 1, (n))
#define rREPo(i, n) rFORe((i), 0, (n))
#define rep(i, n) FOR((i), 0, (n))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define dup(x, y) (((x) + (y)-1) / (y))
#define vc(T) vector<T>
#define vv(T) vc(vc(T))
using namespace std;
// using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using pll = pair<ll, ll>;
using T = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vs = vector<string>;
using vp = vector<P>;
using vt = vector<T>;
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;
}
// auto mod int
// const int mod = 1000000007;
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; }
int main() {
int n, k;
cin >> n >> k;
vp lr(k);
REP(i, k) cin >> lr[i].first >> lr[i].second;
vc(mint) dp(n + 1);
vl imo(n);
dp[0] = 1;
mint sum = 0;
REP(i, n) {
sum += dp[i];
REP(j, k) {
int l = min(lr[j].first, n);
int r = min(lr[j].second + 1, n);
dp[i + l] += sum;
dp[i + r] -= sum;
}
// REPo(t, n) printf("%lld%c", dp[t], (t==n ? '\n' : ' '));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
#define FOR(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define FORe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define rFOR(i, a, n) for (int(i) = (int)(n)-1; (i) >= (int)(a); --(i))
#define rFORe(i, a, n) for (int(i) = (int)(n); (i) >= (int)(a); --(i))
#define REP(i, n) FOR((i), 0, (n))
#define REPe(i, n) FORe((i), 1, (n))
#define REPo(i, n) FORe((i), 0, (n))
#define rREP(i, n) rFOR((i), 0, (n))
#define rREPe(i, n) rFORe((i), 1, (n))
#define rREPo(i, n) rFORe((i), 0, (n))
#define rep(i, n) FOR((i), 0, (n))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define fi first
#define se second
#define dup(x, y) (((x) + (y)-1) / (y))
#define vc(T) vector<T>
#define vv(T) vc(vc(T))
using namespace std;
// using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using pll = pair<ll, ll>;
using T = tuple<int, int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vs = vector<string>;
using vp = vector<P>;
using vt = vector<T>;
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;
}
// auto mod int
// const int mod = 1000000007;
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; }
int main() {
int n, k;
cin >> n >> k;
vp lr(k);
REP(i, k) cin >> lr[i].first >> lr[i].second;
vc(mint) dp(n + 1);
vl imo(n);
dp[0] = 1;
mint sum = 0;
REP(i, n) {
sum += dp[i];
REP(j, k) {
int l = min(i + lr[j].first, n);
int r = min(i + lr[j].second + 1, n);
dp[l] += sum;
dp[r] -= sum;
}
// REPo(t, n) printf("%lld%c", dp[t], (t==n ? '\n' : ' '));
}
cout << dp[n - 1] << endl;
return 0;
} | replace | 103 | 107 | 103 | 107 | -6 | munmap_chunk(): invalid pointer
|
p02549 | Python | Runtime Error | p = 998244353
n, k = map(int, input().split())
LRs = [tuple(map(int, input().split())) for _ in range(k)]
A = [0] * (2 * n)
for lj, rj in LRs:
A[lj] += 1
A[rj + 1] -= 1
s = 0
for i in range(1, n):
s = (s + A[i]) % p
for lj, rj in LRs:
A[i + lj] += s
A[i + rj + 1] -= s
print(s)
| p = 998244353
n, k = map(int, input().split())
LRs = [tuple(map(int, input().split())) for _ in range(k)]
A = [0] * (2 * n + 1)
for lj, rj in LRs:
A[lj] += 1
A[rj + 1] -= 1
s = 0
for i in range(1, n):
s = (s + A[i]) % p
for lj, rj in LRs:
A[i + lj] += s
A[i + rj + 1] -= s
print(s)
| replace | 3 | 4 | 3 | 4 | 0 | |
p02549 | Python | Runtime Error | p = 998244353
n, k = map(int, input().split())
LRs = []
for j in range(k):
lj, rj = map(int, input().split())
LRs.append((lj, rj))
A = [0] * n
i0 = min(lj for lj, rj in LRs)
A[0] = 1
A[i0] = 1
for i in range(i0 + 1, n):
A[i] = A[i - 1]
for j in range(k):
lj, rj = LRs[j]
if i - lj >= 0:
A[i] += A[i - lj]
if i - 1 - rj >= 0:
A[i] -= A[i - 1 - rj]
A[i] %= p
print(A[n - 1])
| p = 998244353
n, k = map(int, input().split())
LRs = []
for j in range(k):
lj, rj = map(int, input().split())
LRs.append((lj, rj))
A = [0] * (n + 1)
i0 = min(lj for lj, rj in LRs)
A[0] = 1
A[i0] = 1
for i in range(i0 + 1, n):
A[i] = A[i - 1]
for j in range(k):
lj, rj = LRs[j]
if i - lj >= 0:
A[i] += A[i - lj]
if i - 1 - rj >= 0:
A[i] -= A[i - 1 - rj]
A[i] %= p
print(A[n - 1])
| replace | 6 | 7 | 6 | 7 | 0 | |
p02549 | Python | Time Limit Exceeded | def main():
n, k = map(int, input().split())
mod = 998244353
dp = [0] * (n + 1)
dp[1] = 1
delta = []
for _ in range(k):
l, r = map(int, input().split())
for i in range(l, r + 1):
delta.append(i)
delta.sort()
for i in range(n):
for d in delta:
if i + d > n:
break
dp[i + d] += dp[i]
dp[i + d] %= mod
print(dp[n])
if __name__ == "__main__":
main()
| def main():
n, k = map(int, input().split())
mod = 998244353
dp = [0] * (n + 1)
dp[1] = 1
dp[2] = -1
left = [0] * k
right = [0] * k
for i in range(k):
left[i], right[i] = map(int, input().split())
right[i] += 1
for i in range(1, n + 1):
dp[i] += dp[i - 1]
for j in range(k):
if i + left[j] <= n:
dp[i + left[j]] += dp[i]
if i + right[j] <= n:
dp[i + right[j]] -= dp[i]
dp[i] %= mod
print(dp[n])
if __name__ == "__main__":
main()
| replace | 5 | 17 | 5 | 19 | TLE | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long k;
cin >> k;
long long diff[200005];
memset(diff, 0, sizeof diff);
vector<pair<long long, long long>> v;
for (long long i = 0; i < k; i++) {
long long x;
cin >> x;
long long y;
cin >> y;
v.push_back({x, y});
}
diff[0] = 0;
diff[1] = 1;
long long last = 0;
for (long long i = 1; i <= n + 5; i++) {
if (i > 2) {
diff[i] += diff[i - 1];
}
long long cur = diff[i] % 998244353;
for (long long j = 0; j < v.size(); j++) {
diff[i + v[j].first] += cur;
diff[i + v[j].second + 1] -= cur;
}
}
cout << diff[n] % 998244353 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long k;
cin >> k;
long long diff[4 * 200005];
memset(diff, 0, sizeof diff);
vector<pair<long long, long long>> v;
for (long long i = 0; i < k; i++) {
long long x;
cin >> x;
long long y;
cin >> y;
v.push_back({x, y});
}
diff[0] = 0;
diff[1] = 1;
long long last = 0;
for (long long i = 1; i <= n + 5; i++) {
if (i > 2) {
diff[i] += diff[i - 1];
}
long long cur = diff[i] % 998244353;
for (long long j = 0; j < v.size(); j++) {
diff[i + v[j].first] += cur;
diff[i + v[j].second + 1] -= cur;
}
}
cout << diff[n] % 998244353 << '\n';
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
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<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (ll 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 fi first
#define se second
// #include <atcoder/all>
// using namespace atcoder;
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' : ' '); }
}
template <class T, class U> inline void dump(map<T, U> &v) {
irep(i, v) { cout << i->first << " " << i->second << '\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 << 61;
constexpr ll MOD = 998244353; // 1000000007;
constexpr ld EPS = 1e-11;
/* -------------------- ここまでテンプレ -------------------- */
struct mint {
ll x;
mint(ll _x = 0) : x((_x % MOD + MOD) % MOD) {}
/* 初期化子 */
mint operator+() const { return mint(x); }
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) {
x *= modinv(a).x;
x %= MOD;
return (*this);
}
mint &operator%=(const mint a) {
x %= a.x;
return (*this);
}
mint &operator++() {
++x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint &operator--() {
if (!x)
x += MOD;
--x;
return *this;
}
mint &operator&=(const mint a) {
x &= a.x;
return (*this);
}
mint &operator|=(const mint a) {
x |= a.x;
return (*this);
}
mint &operator^=(const mint a) {
x ^= a.x;
return (*this);
}
mint &operator<<=(const mint a) {
x *= pow(2, a).x;
return (*this);
}
mint &operator>>=(const mint a) {
x /= pow(2, a).x;
return (*this);
}
/* 算術演算子 */
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator%(const mint a) const {
mint res(*this);
return res %= a;
}
mint operator&(const mint a) const {
mint res(*this);
return res &= a;
}
mint operator|(const mint a) const {
mint res(*this);
return res |= a;
}
mint operator^(const mint a) const {
mint res(*this);
return res ^= a;
}
mint 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 mint a) const noexcept { return x == a.x; }
bool operator!=(const mint a) const noexcept { return x != a.x; }
bool operator<(const mint a) const noexcept { return x < a.x; }
bool operator>(const mint a) const noexcept { return x > a.x; }
bool operator<=(const mint a) const noexcept { return x <= a.x; }
bool operator>=(const mint a) const noexcept { return x >= a.x; }
/* ストリーム挿入演算子 */
friend istream &operator>>(istream &is, mint &m) {
is >> m.x;
m.x = (m.x % MOD + MOD) % MOD;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
/* その他の関数 */
mint modinv(mint a) { return pow(a, MOD - 2); }
mint pow(mint x, mint n) {
mint res = 1;
while (n.x > 0) {
if ((n % 2).x)
res *= x;
x *= x;
n.x /= 2;
}
return res;
}
};
template <typename T> class Sum {
public:
// 単位元
T unit;
Sum(void) {
// 単位元
unit = 0;
}
// 演算関数
T calc(T a, T b) { return a + b; }
};
template <typename T> struct Min {
public:
// 単位元
T unit;
Min(void) {
// 単位元
unit = INF;
}
// 演算関数
T calc(T a, T b) { return min(a, b); }
};
template <typename T, class MONOID> class SegmentTree {
public:
// セグメント木の葉の要素数
int n;
// セグメント木
vector<T> tree;
// モノイド
MONOID mono;
SegmentTree(vector<T> &v)
: n(1 << (int)ceil(log2(v.size()))), tree(vector<T>(n << 1)) {
for (int i = 0; i < v.size(); ++i) {
update(i, v[i]);
}
for (int i = v.size(); i < n; ++i) {
update(i, mono.unit);
}
}
// k番目の値(0-indexed)をxに変更
void update(int k, T x) {
k += n;
tree[k] = x;
for (k = k >> 1; k > 0; k >>= 1) {
tree[k] = mono.calc(tree[k << 1 | 0], tree[k << 1 | 1]);
}
}
// [l, r)の最小値(0-indexed)を求める．
T query(int l, int r) {
T res = mono.unit;
l += n;
r += n;
while (l < r) {
if (l & 1) {
res = mono.calc(res, tree[l++]);
}
if (r & 1) {
res = mono.calc(res, tree[--r]);
}
l >>= 1;
r >>= 1;
}
return res;
}
T operator[](int k) {
// st[i]で添字iの要素の値を返す
if (k - n >= 0 || k < 0) {
return -INF;
}
return tree[tree.size() - n + k];
}
void show(void) {
int ret = 2;
for (int i = 1; i < 2 * n; ++i) {
if (tree[i] == mono.unit)
cout << "UNIT ";
else
cout << tree[i] << " ";
if (i == ret - 1) {
cout << endl;
ret <<= 1;
}
}
cout << endl;
}
};
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> r(k);
rep(i, k) { cin >> r[i].fi >> r[i].se; }
// セグメント木の作成
vector<mint> v(n + 10, 0);
SegmentTree<mint, Sum<mint>> st(v);
{
// dp[1] = 1;
st.update(0, st[0] + 1);
st.update(1, st[1] - 1);
}
// st.show();
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
int s = r[j].first + i;
int t = r[j].second + i;
mint x = st.query(0, i + 1);
st.update(s, st[s] + x);
st.update(t + 1, st[t + 1] - x);
}
// st.show();
}
cout << st.query(0, n).x << endl;
/*
int n, q;
int query, s, t, x, i;
cin >> n >> q;
while (q--) {
scanf("%d", &query);
if (query) {
// クエリget(i)の時
scanf("%d", &i);
printf("%d\n", st.query(0, i));
} else {
// クエリadd(s, t, x)の時
scanf("%d %d %d", &s, &t, &x);
// 私のセグメント木の更新処理は加算ではなく代入なので，
// これはs - 1番目の値をx足しているのと同義です．
st.update(s - 1, st[s - 1] + x);
st.update(t, st[t] - x);
}
}*/
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
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<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int, int> mii;
typedef set<int> si;
#define rep(i, n) for (ll 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 fi first
#define se second
// #include <atcoder/all>
// using namespace atcoder;
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' : ' '); }
}
template <class T, class U> inline void dump(map<T, U> &v) {
irep(i, v) { cout << i->first << " " << i->second << '\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 << 61;
constexpr ll MOD = 998244353; // 1000000007;
constexpr ld EPS = 1e-11;
/* -------------------- ここまでテンプレ -------------------- */
struct mint {
ll x;
mint(ll _x = 0) : x((_x % MOD + MOD) % MOD) {}
/* 初期化子 */
mint operator+() const { return mint(x); }
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) {
x *= modinv(a).x;
x %= MOD;
return (*this);
}
mint &operator%=(const mint a) {
x %= a.x;
return (*this);
}
mint &operator++() {
++x;
if (x >= MOD)
x -= MOD;
return *this;
}
mint &operator--() {
if (!x)
x += MOD;
--x;
return *this;
}
mint &operator&=(const mint a) {
x &= a.x;
return (*this);
}
mint &operator|=(const mint a) {
x |= a.x;
return (*this);
}
mint &operator^=(const mint a) {
x ^= a.x;
return (*this);
}
mint &operator<<=(const mint a) {
x *= pow(2, a).x;
return (*this);
}
mint &operator>>=(const mint a) {
x /= pow(2, a).x;
return (*this);
}
/* 算術演算子 */
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator%(const mint a) const {
mint res(*this);
return res %= a;
}
mint operator&(const mint a) const {
mint res(*this);
return res &= a;
}
mint operator|(const mint a) const {
mint res(*this);
return res |= a;
}
mint operator^(const mint a) const {
mint res(*this);
return res ^= a;
}
mint 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 mint a) const noexcept { return x == a.x; }
bool operator!=(const mint a) const noexcept { return x != a.x; }
bool operator<(const mint a) const noexcept { return x < a.x; }
bool operator>(const mint a) const noexcept { return x > a.x; }
bool operator<=(const mint a) const noexcept { return x <= a.x; }
bool operator>=(const mint a) const noexcept { return x >= a.x; }
/* ストリーム挿入演算子 */
friend istream &operator>>(istream &is, mint &m) {
is >> m.x;
m.x = (m.x % MOD + MOD) % MOD;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
/* その他の関数 */
mint modinv(mint a) { return pow(a, MOD - 2); }
mint pow(mint x, mint n) {
mint res = 1;
while (n.x > 0) {
if ((n % 2).x)
res *= x;
x *= x;
n.x /= 2;
}
return res;
}
};
template <typename T> class Sum {
public:
// 単位元
T unit;
Sum(void) {
// 単位元
unit = 0;
}
// 演算関数
T calc(T a, T b) { return a + b; }
};
template <typename T> struct Min {
public:
// 単位元
T unit;
Min(void) {
// 単位元
unit = INF;
}
// 演算関数
T calc(T a, T b) { return min(a, b); }
};
template <typename T, class MONOID> class SegmentTree {
public:
// セグメント木の葉の要素数
int n;
// セグメント木
vector<T> tree;
// モノイド
MONOID mono;
SegmentTree(vector<T> &v)
: n(1 << (int)ceil(log2(v.size()))), tree(vector<T>(n << 1)) {
for (int i = 0; i < v.size(); ++i) {
update(i, v[i]);
}
for (int i = v.size(); i < n; ++i) {
update(i, mono.unit);
}
}
// k番目の値(0-indexed)をxに変更
void update(int k, T x) {
k += n;
tree[k] = x;
for (k = k >> 1; k > 0; k >>= 1) {
tree[k] = mono.calc(tree[k << 1 | 0], tree[k << 1 | 1]);
}
}
// [l, r)の最小値(0-indexed)を求める．
T query(int l, int r) {
T res = mono.unit;
l += n;
r += n;
while (l < r) {
if (l & 1) {
res = mono.calc(res, tree[l++]);
}
if (r & 1) {
res = mono.calc(res, tree[--r]);
}
l >>= 1;
r >>= 1;
}
return res;
}
T operator[](int k) {
// st[i]で添字iの要素の値を返す
if (k - n >= 0 || k < 0) {
return -INF;
}
return tree[tree.size() - n + k];
}
void show(void) {
int ret = 2;
for (int i = 1; i < 2 * n; ++i) {
if (tree[i] == mono.unit)
cout << "UNIT ";
else
cout << tree[i] << " ";
if (i == ret - 1) {
cout << endl;
ret <<= 1;
}
}
cout << endl;
}
};
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> r(k);
rep(i, k) { cin >> r[i].fi >> r[i].se; }
// セグメント木の作成
vector<mint> v(n + 10, 0);
SegmentTree<mint, Sum<mint>> st(v);
{
// dp[1] = 1;
st.update(0, st[0] + 1);
st.update(1, st[1] - 1);
}
// st.show();
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
int s = r[j].first + i;
int t = r[j].second + i;
chmin(s, n + 5);
chmin(t, n + 5);
mint x = st.query(0, i + 1);
st.update(s, st[s] + x);
st.update(t + 1, st[t + 1] - x);
}
// st.show();
}
cout << st.query(0, n).x << endl;
/*
int n, q;
int query, s, t, x, i;
cin >> n >> q;
while (q--) {
scanf("%d", &query);
if (query) {
// クエリget(i)の時
scanf("%d", &i);
printf("%d\n", st.query(0, i));
} else {
// クエリadd(s, t, x)の時
scanf("%d %d %d", &s, &t, &x);
// 私のセグメント木の更新処理は加算ではなく代入なので，
// これはs - 1番目の値をx足しているのと同義です．
st.update(s - 1, st[s - 1] + x);
st.update(t, st[t] - x);
}
}*/
}
| insert | 359 | 359 | 359 | 361 | 0 | |
p02549 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int N, K;
int L[15], R[15];
long long imos[202020];
long long now = 1;
int main() {
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> L[i] >> R[i];
}
for (int i = 1; i <= N; i++) {
now += imos[i];
now %= 998244353LL;
for (int j = 0; j < K; j++) {
if (i + L[j] < 202020) {
imos[i + L[j]] += now;
}
if (i + R[j] < 202020) {
imos[i + R[j] + 1] -= now;
}
}
if (i == N) {
while (imos[N] < 0LL) {
imos[N] += 998244353LL;
}
cout << imos[N] % 998244353LL << endl;
}
}
} | #include <iostream>
#include <vector>
using namespace std;
int N, K;
int L[15], R[15];
long long imos[202020];
long long now = 1;
int main() {
cin >> N >> K;
for (int i = 0; i < K; i++) {
cin >> L[i] >> R[i];
}
for (int i = 1; i <= N; i++) {
now += imos[i];
now %= 998244353LL;
for (int j = 0; j < K; j++) {
if (i + L[j] < 202020) {
imos[i + L[j]] += now;
}
if (i + R[j] + 1 < 202020) {
imos[i + R[j] + 1] -= now;
}
}
if (i == N) {
while (imos[N] < 0LL) {
imos[N] += 998244353LL;
}
cout << imos[N] % 998244353LL << endl;
}
}
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02549 | C++ | Runtime Error | #define LOCAL
#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(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const int INTINF = (INT_MAX >> 1); // 10^9 + 10^7
static const ll LLINF = (LLONG_MAX >> 1);
static const int MAX = 201001;
static const ll MOD = 998244353;
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 T int_ceil(T a, T b) {
T res = a / b;
if (a % b != 0)
res++;
return res;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool b) { return b ? "true" : "false"; }
template <size_t N> string to_string(bitset<N> bs) {
string res;
for (size_t i = 0; i < N; ++i)
res += '0' + bs[i];
return res;
}
string to_string(vector<bool> v) {
string res = "{";
for (bool e : v)
res += to_string(e) + ", ";
return res += "}";
}
template <class T, class U> string to_string(pair<T, U> p);
template <class C> string to_string(C c) {
string res = "{";
for (auto e : c)
res += to_string(e) + ", ";
return res += "}";
}
template <class T, class U> string to_string(pair<T, U> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
void debug() { cerr << '\n'; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << '\t' << to_string(head), debug(tail...);
}
#ifdef LOCAL
#define print(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define print(...)
#endif
ll dp[MAX];
ll dp_minus[MAX];
int main(int argc, const char *argv[]) {
std::cout << std::fixed << std::setprecision(15);
memr(dp, 0);
dp[0] = 1;
dp_minus[1] = 1;
int N, K;
cin >> N >> K;
vector<pair<int, int>> lr(K);
rep(i, K) {
int l, r;
cin >> l >> r;
lr[i] = {l, r};
}
rep(i, N) {
// rep(i, N){
// if(i) cout << " ";
// cout << dp[i];
// }
// cout << endl;
rep(j, K) {
dp[i + lr[j].first] = (dp[i + lr[j].first] + dp[i]) % MOD;
dp_minus[i + lr[j].second + 1] =
(dp_minus[i + lr[j].second + 1] + dp[i]) % MOD;
}
dp[i + 1] = (dp[i] + dp[i + 1]) % MOD;
dp[i + 1] = (dp[i + 1] - dp_minus[i + 1]) % MOD;
while (dp[i + 1] < 0)
dp[i + 1] += MOD;
}
// rep(i, N){
// if(i) cout << " ";
// cout << dp[i];
// }
// cout << endl;
cout << dp[N - 1] << endl;
return 0;
}
| #define LOCAL
#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(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const int INTINF = (INT_MAX >> 1); // 10^9 + 10^7
static const ll LLINF = (LLONG_MAX >> 1);
static const int MAX = 201001;
static const ll MOD = 998244353;
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 T int_ceil(T a, T b) {
T res = a / b;
if (a % b != 0)
res++;
return res;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(bool b) { return b ? "true" : "false"; }
template <size_t N> string to_string(bitset<N> bs) {
string res;
for (size_t i = 0; i < N; ++i)
res += '0' + bs[i];
return res;
}
string to_string(vector<bool> v) {
string res = "{";
for (bool e : v)
res += to_string(e) + ", ";
return res += "}";
}
template <class T, class U> string to_string(pair<T, U> p);
template <class C> string to_string(C c) {
string res = "{";
for (auto e : c)
res += to_string(e) + ", ";
return res += "}";
}
template <class T, class U> string to_string(pair<T, U> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
void debug() { cerr << '\n'; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << '\t' << to_string(head), debug(tail...);
}
#ifdef LOCAL
#define print(...) cerr << "[" << #__VA_ARGS__ << "]:", debug(__VA_ARGS__)
#else
#define print(...)
#endif
ll dp[MAX];
ll dp_minus[MAX];
int main(int argc, const char *argv[]) {
std::cout << std::fixed << std::setprecision(15);
memr(dp, 0);
dp[0] = 1;
dp_minus[1] = 1;
int N, K;
cin >> N >> K;
vector<pair<int, int>> lr(K);
rep(i, K) {
int l, r;
cin >> l >> r;
lr[i] = {l, r};
}
rep(i, N) {
// rep(i, N){
// if(i) cout << " ";
// cout << dp[i];
// }
// cout << endl;
rep(j, K) {
if (i + lr[j].first >= MAX)
continue;
dp[i + lr[j].first] = (dp[i + lr[j].first] + dp[i]) % MOD;
dp_minus[i + lr[j].second + 1] =
(dp_minus[i + lr[j].second + 1] + dp[i]) % MOD;
}
dp[i + 1] = (dp[i] + dp[i + 1]) % MOD;
dp[i + 1] = (dp[i + 1] - dp_minus[i + 1]) % MOD;
while (dp[i + 1] < 0)
dp[i + 1] += MOD;
}
// rep(i, N){
// if(i) cout << " ";
// cout << dp[i];
// }
// cout << endl;
cout << dp[N - 1] << endl;
return 0;
}
| insert | 95 | 95 | 95 | 97 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define en "\n"
#define INF (int)9e18
#define HELL 998244353LL
#define int long long
#define double long double
#define uint unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fs first
#define sc second
#define size(a) (int)a.size()
#define deb(x) cerr << #x << " => " << x << en
#define debp(a) \
cerr << #a << " => " \
<< "(" << a.fs << ", " << a.sc << ") " << en;
#define deba(x) \
cerr << #x << en; \
for (auto a : x) \
cerr << a << " "; \
cerr << en;
#define debpa(x) \
cerr << #x << en; \
for (auto a : x) \
cerr << "(" << a.fs << ", " << a.sc << ") "; \
cerr << en;
#define debm(x) \
cerr << #x << en; \
for (auto a : x) { \
for (auto b : a) \
cerr << b << " "; \
cerr << en; \
}
#define getMat(x, n, m, val) vector<vector<int>> x(n, vector<int>(m, val))
#define fastio \
ios_base ::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define pout cout << fixed << setprecision(10)
int fastpow(int a, int b, int m = HELL) {
int res = 1;
a %= m;
while (b > 0) {
if (b & 1)
res = (res * a) % m;
a = (a * a) % m;
b >>= 1;
}
return res;
}
#define inv(a) fastpow(a, HELL - 2)
#define mul(a, b) ((a % HELL) * (b % HELL)) % HELL
int n;
const int maxN = 1e5 + 5;
int tree[maxN];
void update(int index, int val) {
while (index <= n) {
tree[index] = (tree[index] + val) % HELL;
index += (index & -index);
}
}
int read(int index) {
int sum = 0;
while (index) {
sum = (sum + tree[index]) % HELL;
index -= (index & -index);
}
return sum;
}
int getSum(int low, int high) {
if (high <= 0) {
return 0;
}
if (low <= 1) {
return read(high);
}
return (read(high) - read(low - 1) + HELL) % HELL;
}
int32_t main() {
fastio;
int k, a, b;
cin >> n >> k;
vector<vector<int>> s;
while (k--) {
cin >> a >> b;
s.pb({a, b});
}
update(1, 1);
for (int i = 2; i <= n; i++) {
for (auto x : s) {
update(i, getSum(i - x[1], i - x[0]));
}
}
cout << (read(n) - read(n - 1) + HELL) % HELL << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define en "\n"
#define INF (int)9e18
#define HELL 998244353LL
#define int long long
#define double long double
#define uint unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fs first
#define sc second
#define size(a) (int)a.size()
#define deb(x) cerr << #x << " => " << x << en
#define debp(a) \
cerr << #a << " => " \
<< "(" << a.fs << ", " << a.sc << ") " << en;
#define deba(x) \
cerr << #x << en; \
for (auto a : x) \
cerr << a << " "; \
cerr << en;
#define debpa(x) \
cerr << #x << en; \
for (auto a : x) \
cerr << "(" << a.fs << ", " << a.sc << ") "; \
cerr << en;
#define debm(x) \
cerr << #x << en; \
for (auto a : x) { \
for (auto b : a) \
cerr << b << " "; \
cerr << en; \
}
#define getMat(x, n, m, val) vector<vector<int>> x(n, vector<int>(m, val))
#define fastio \
ios_base ::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define pout cout << fixed << setprecision(10)
int fastpow(int a, int b, int m = HELL) {
int res = 1;
a %= m;
while (b > 0) {
if (b & 1)
res = (res * a) % m;
a = (a * a) % m;
b >>= 1;
}
return res;
}
#define inv(a) fastpow(a, HELL - 2)
#define mul(a, b) ((a % HELL) * (b % HELL)) % HELL
int n;
const int maxN = 2e5 + 5;
int tree[maxN];
void update(int index, int val) {
while (index <= n) {
tree[index] = (tree[index] + val) % HELL;
index += (index & -index);
}
}
int read(int index) {
int sum = 0;
while (index) {
sum = (sum + tree[index]) % HELL;
index -= (index & -index);
}
return sum;
}
int getSum(int low, int high) {
if (high <= 0) {
return 0;
}
if (low <= 1) {
return read(high);
}
return (read(high) - read(low - 1) + HELL) % HELL;
}
int32_t main() {
fastio;
int k, a, b;
cin >> n >> k;
vector<vector<int>> s;
while (k--) {
cin >> a >> b;
s.pb({a, b});
}
update(1, 1);
for (int i = 2; i <= n; i++) {
for (auto x : s) {
update(i, getSum(i - x[1], i - x[0]));
}
}
cout << (read(n) - read(n - 1) + HELL) % HELL << endl;
return 0;
} | replace | 56 | 57 | 56 | 57 | 0 | |
p02549 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
const double EPS = 1e-10;
const int64_t INF = 1e9;
// typedef long long ll;
typedef int ll;
const int QMAX = 530000;
const int MOD = 998244353;
int n;
ll dat[QMAX];
void init(int _n) {
n = 1;
while (n < _n)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = 0;
}
ll val(int k) {
k += n - 1;
ll ans = dat[k];
while (k > 0) {
k = (k - 1) / 2;
ans = (ans + dat[k]) % MOD;
}
}
void add(int a, int b, ll x, int k, int l, int r) {
if (r <= a || b <= l)
return;
if (a <= l && r <= b) {
dat[k] = (dat[k] + x) % MOD;
} else {
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
int main() {
int m, k;
int l[10], r[10];
scanf("%d%d", &m, &k);
for (int i = 0; i < k; ++i) {
scanf("%d%d", &l[i], &r[i]);
}
init(m + 2);
add(1, 2, 1, 0, 0, n);
for (int i = 1; i < m; ++i) {
ll a = val(i);
for (int j = 0; j < k; ++j) {
if (i + l[j] > n)
continue;
int ed = min(i + r[j], n);
add(i + l[j], ed + 1, a, 0, 0, n);
}
/*
for (int j = 0; j <= m; ++j) {
printf("%d: %d\n", j, val(j));
}
printf("\n");
*/
}
printf("%lld\n", val(m));
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
const double EPS = 1e-10;
const int64_t INF = 1e9;
// typedef long long ll;
typedef int ll;
const int QMAX = 530000;
const int MOD = 998244353;
int n;
ll dat[QMAX];
void init(int _n) {
n = 1;
while (n < _n)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = 0;
}
ll val(int k) {
k += n - 1;
ll ans = dat[k];
while (k > 0) {
k = (k - 1) / 2;
ans = (ans + dat[k]) % MOD;
}
return ans;
}
void add(int a, int b, ll x, int k, int l, int r) {
if (r <= a || b <= l)
return;
if (a <= l && r <= b) {
dat[k] = (dat[k] + x) % MOD;
} else {
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
int main() {
int m, k;
int l[10], r[10];
scanf("%d%d", &m, &k);
for (int i = 0; i < k; ++i) {
scanf("%d%d", &l[i], &r[i]);
}
init(m + 2);
add(1, 2, 1, 0, 0, n);
for (int i = 1; i < m; ++i) {
ll a = val(i);
for (int j = 0; j < k; ++j) {
if (i + l[j] > n)
continue;
int ed = min(i + r[j], n);
add(i + l[j], ed + 1, a, 0, 0, n);
}
/*
for (int j = 0; j <= m; ++j) {
printf("%d: %d\n", j, val(j));
}
printf("\n");
*/
}
printf("%lld\n", val(m));
return 0;
}
| insert | 63 | 63 | 63 | 64 | TLE | |
p02549 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 998244353;
const ll INF = (1ll << 60);
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> l(k), r(k), dp(n, 0), s(n + 1, 0);
for (int i = 0; i < k; i++) {
cin >> l[i] >> r[i];
}
dp[0] = 1;
s[1] = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
ll x, y;
if (i - l[j] < 0) {
continue;
}
x = i - l[j] + 1; // big
y = i - r[j]; // small
dp[i] += s[x] - s[y] + MOD;
dp[i] %= MOD;
}
s[i + 1] = s[i] + dp[i] + MOD;
s[i + 1] %= MOD;
}
cout << dp[n - 1] << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 998244353;
const ll INF = (1ll << 60);
int main(void) {
int n, k;
cin >> n >> k;
vector<ll> l(k), r(k), dp(n, 0), s(n + 1, 0);
for (int i = 0; i < k; i++) {
cin >> l[i] >> r[i];
}
dp[0] = 1;
s[1] = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
ll x, y;
if (i - l[j] < 0) {
continue;
}
x = max(i - l[j], 0ll) + 1; // big
y = max(i - r[j], 0ll); // small
dp[i] += s[x] - s[y] + MOD;
dp[i] %= MOD;
}
s[i + 1] = s[i] + dp[i] + MOD;
s[i + 1] %= MOD;
}
cout << dp[n - 1] << endl;
}
| replace | 45 | 47 | 45 | 47 | 0 | |
p02549 | C++ | Runtime Error | // {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define ALL(A) (A).begin(), (A).end()
#define MOD 998244353
using namespace std;
// }}}
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> seg;
FOR(i, 0, K) {
int L, R;
cin >> L >> R;
seg.push_back(pair<int, int>(L, R));
}
long long cur = 0;
long long a[300000];
FOR(i, 0, N + 1) a[i] = 0;
a[0] = 1;
a[1] = -1;
FOR(i, 0, N) {
cur = (cur + a[i]) % MOD;
FOR(j, 0, seg.size()) {
a[i + seg[j].first] = (a[i + seg[j].first] + cur) % MOD;
a[i + seg[j].second + 1] = (a[i + seg[j].second + 1] - cur) % MOD;
}
}
cout << (cur + MOD) % MOD << endl;
}
| // {{{ Boilerplate Code <--------------------------------------------------
// vim:filetype=cpp:foldmethod=marker:foldmarker={{{,}}}
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define ALL(A) (A).begin(), (A).end()
#define MOD 998244353
using namespace std;
// }}}
int main() {
int N, K;
cin >> N >> K;
vector<pair<int, int>> seg;
FOR(i, 0, K) {
int L, R;
cin >> L >> R;
seg.push_back(pair<int, int>(L, R));
}
long long cur = 0;
long long a[500000];
FOR(i, 0, N + 1) a[i] = 0;
a[0] = 1;
a[1] = -1;
FOR(i, 0, N) {
cur = (cur + a[i]) % MOD;
FOR(j, 0, seg.size()) {
a[i + seg[j].first] = (a[i + seg[j].first] + cur) % MOD;
a[i + seg[j].second + 1] = (a[i + seg[j].second + 1] - cur) % MOD;
}
}
cout << (cur + MOD) % MOD << endl;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p02549 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
#define ll long long
using namespace std;
ll ff[200100];
#define MAXN 100010
int x[200100], y[200100];
unsigned ll n, m, ans[MAXN << 2], tag[MAXN << 2];
inline ll ls(ll x) { return x << 1; }
inline ll rs(ll x) { return x << 1 | 1; }
inline void push_up(ll p) { ans[p] = ans[ls(p)] + ans[rs(p)]; }
void build(ll p, ll l, ll r) {
tag[p] = 0;
if (l == r) {
ans[p] = ff[l];
return;
}
ll mid = (l + r) >> 1;
build(ls(p), l, mid);
build(rs(p), mid + 1, r);
push_up(p);
}
inline void f(ll p, ll l, ll r, ll k) {
tag[p] = (tag[p] + k) % MOD;
ans[p] = ans[p] % MOD + k % MOD * (r - l + 1) % MOD;
}
inline void push_down(ll p, ll l, ll r) {
ll mid = (l + r) >> 1;
f(ls(p), l, mid, tag[p]);
f(rs(p), mid + 1, r, tag[p]);
tag[p] = 0;
}
inline void update(ll nl, ll nr, ll l, ll r, ll p, ll k) {
if (nl <= l && r <= nr) {
ans[p] += (k * (r - l + 1) % MOD);
tag[p] += k % MOD;
return;
}
push_down(p, l, r);
ll mid = (l + r) >> 1;
if (nl <= mid)
update(nl, nr, l, mid, ls(p), k);
if (nr > mid)
update(nl, nr, mid + 1, r, rs(p), k);
push_up(p);
}
ll query(ll q_x, ll q_y, ll l, ll r, ll p) {
if (q_x + q_y == 0)
return 0;
ll res = 0;
if (q_x <= l && r <= q_y)
return ans[p];
ll mid = (l + r) >> 1;
push_down(p, l, r);
if (q_x <= mid)
res += query(q_x, q_y, l, mid, ls(p));
if (q_y > mid)
res += query(q_x, q_y, mid + 1, r, rs(p));
return res;
}
int main() {
int n, m;
cin >> n >> m;
memset(ff, 0, sizeof ff);
ff[1] = 1;
ff[0] = 0;
build(1, 1, n);
for (int i = 1; i <= m; i++) {
int p, q;
cin >> p >> q;
x[i] = p, y[i] = q;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ll g = max(0, i - x[j]), yy = max(0, i - y[j]);
ll ans = (query(yy, g, 1, n, 1)) % MOD;
update(i, i, 1, n, 1, ans);
}
}
cout << (query(n, n, 1, n, 1) % MOD);
return 0;
} | #include <bits/stdc++.h>
#define MOD 998244353
#define ll long long
using namespace std;
ll ff[200100];
#define MAXN 200010
int x[200100], y[200100];
unsigned ll n, m, ans[MAXN << 2], tag[MAXN << 2];
inline ll ls(ll x) { return x << 1; }
inline ll rs(ll x) { return x << 1 | 1; }
inline void push_up(ll p) { ans[p] = ans[ls(p)] + ans[rs(p)]; }
void build(ll p, ll l, ll r) {
tag[p] = 0;
if (l == r) {
ans[p] = ff[l];
return;
}
ll mid = (l + r) >> 1;
build(ls(p), l, mid);
build(rs(p), mid + 1, r);
push_up(p);
}
inline void f(ll p, ll l, ll r, ll k) {
tag[p] = (tag[p] + k) % MOD;
ans[p] = ans[p] % MOD + k % MOD * (r - l + 1) % MOD;
}
inline void push_down(ll p, ll l, ll r) {
ll mid = (l + r) >> 1;
f(ls(p), l, mid, tag[p]);
f(rs(p), mid + 1, r, tag[p]);
tag[p] = 0;
}
inline void update(ll nl, ll nr, ll l, ll r, ll p, ll k) {
if (nl <= l && r <= nr) {
ans[p] += (k * (r - l + 1) % MOD);
tag[p] += k % MOD;
return;
}
push_down(p, l, r);
ll mid = (l + r) >> 1;
if (nl <= mid)
update(nl, nr, l, mid, ls(p), k);
if (nr > mid)
update(nl, nr, mid + 1, r, rs(p), k);
push_up(p);
}
ll query(ll q_x, ll q_y, ll l, ll r, ll p) {
if (q_x + q_y == 0)
return 0;
ll res = 0;
if (q_x <= l && r <= q_y)
return ans[p];
ll mid = (l + r) >> 1;
push_down(p, l, r);
if (q_x <= mid)
res += query(q_x, q_y, l, mid, ls(p));
if (q_y > mid)
res += query(q_x, q_y, mid + 1, r, rs(p));
return res;
}
int main() {
int n, m;
cin >> n >> m;
memset(ff, 0, sizeof ff);
ff[1] = 1;
ff[0] = 0;
build(1, 1, n);
for (int i = 1; i <= m; i++) {
int p, q;
cin >> p >> q;
x[i] = p, y[i] = q;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= m; j++) {
ll g = max(0, i - x[j]), yy = max(0, i - y[j]);
ll ans = (query(yy, g, 1, n, 1)) % MOD;
update(i, i, 1, n, 1, ans);
}
}
cout << (query(n, n, 1, n, 1) % MOD);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.