text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T>
ostream &operator<<(ostream &out, vector<T> &v) {
out << "{";
for (int i = 0; i < v.size(); i++) {
if (i > 0) out << ", ";
out << v[i];
}
return out << "}";
}
template <typename A, typename B>
ostream &operator<<(ostream &out, pair<A, B> &p) {
return out << "(" << p.fi << ", " << p.se << ")";
}
const int N = 100005;
ll a[N];
void print_op(int l, int r, vector<ll> v) {
cout << l << " " << r << "\n";
for (auto x : v) {
cout << x << " ";
}
cout << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << "1 1\n" << -a[0] << "\n1 1\n0\n1 1\n0\n";
return 0;
}
vector<ll> op1, op2, op3;
for (int i = 0; i < n - 1; i++) {
ll m = a[i] % n;
op1.push_back(m * (n - 1));
a[i] += m * (n - 1);
}
for (int i = 1; i < n; i++) {
ll m = a[i] % n;
op2.push_back(m * (n - 1));
a[i] += m * (n - 1);
}
for (int i = 0; i < n; i++) {
op3.push_back(-a[i]);
}
print_op(1, n - 1, op1);
print_op(2, n, op2);
print_op(1, n, op3);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long arr[N];
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", arr + i);
}
puts("1 1");
printf("%lld\n", -arr[1]);
printf("1 %d\n0", n);
for (int i = 2; i <= n; i++) {
printf(" %lld", -arr[i] * n);
arr[i] *= 1 - n;
}
if (n == 1) {
puts("\n1 1");
printf("0");
return 0;
}
printf("\n2 %d\n", n);
for (int i = 2; i <= n; i++) {
printf("%lld ", -arr[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& cout, pair<T1, T2>& p) {
cout << p.first << "\t" << p.second << "\n";
return cout;
}
template <class T>
istream& operator>>(istream& cin, vector<T>& arr) {
for (long long i = 0; i < arr.size(); i++) cin >> arr[i];
return cin;
}
template <class T>
ostream& operator<<(ostream& cout, vector<T>& arr) {
for (long long i = 0; i < arr.size(); i++) cout << arr[i] << " ";
cout << "\n";
return cout;
}
template <class T>
ostream& operator<<(ostream& cout, vector<vector<T>>& arr) {
for (long long i = 0; i < arr.size(); i++) {
for (long long j = 0; j < arr[i].size(); j++) {
cout << arr[i][j] << " ";
}
cout << "\n";
}
return cout;
}
template <class T1, class T2>
ostream& operator<<(ostream& cout, vector<pair<T1, T2>>& arr) {
for (long long i = 0; i < arr.size(); i++)
cout << arr[i].first << "\t" << arr[i].second << "\n";
return cout;
}
long long dirx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long diry[] = {-1, 0, 1, -1, 1, -1, 0, 1};
long long dx[] = {-1, 1, 0, 0};
long long dy[] = {0, 0, -1, 1};
long long min(long long a, long long b) {
if (a < b) return a;
return b;
}
long long max(long long a, long long b) {
if (a > b) return a;
return b;
}
void solve() {
long long n;
cin >> n;
vector<long long> arr(n);
cin >> arr;
if (n == 1) {
cout << "1 1\n" << arr[0] * (-1) << "\n";
cout << "1 1\n0\n";
cout << "1 1\n0\n";
} else {
cout << "1 " << n - 1 << "\n";
for (long long i = 0; i < n - 1; i++) {
cout << arr[i] * (n - 1) << " ";
arr[i] += arr[i] * (n - 1);
}
cout << "\n";
cout << n << " " << n << "\n";
cout << arr[n - 1] * (-1) << "\n";
arr[n - 1] = 0;
cout << "1 " << n << "\n";
for (auto e : arr) cout << (-1) * e << " ";
cout << "\n";
}
}
int32_t main() {
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
long long testCases = 1;
for (long long i = 1; i <= testCases; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int test = 1;
while (test--) {
long long N;
cin >> N;
long long A[N + 1];
for (int i = 1; i < N + 1; i++) cin >> A[i];
cout << "1 1\n" << A[1] * (N - 1) << "\n";
(N == 1) ? cout << "1 1"
<< "\n"
<< "0"
: cout << "2 " << N << "\n";
for (int i = 2; i < N + 1; i++) cout << A[i] * (N - 1) << " ";
cout << "\n"
<< "1 " << N << "\n";
for (int i = 1; i < N + 1; i++) cout << -A[i] * N << " ";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long power(long long a, long long b) {
if (b == 0) return 1LL;
long long res = 1;
while (b) {
if (b & 1) res *= a;
a = a * a;
b /= 2;
}
return res;
}
void solve() {
long long n, i;
cin >> n;
vector<long long> a(n);
for (long long &x : a) cin >> x;
if (n == 1) {
cout << "1 1" << endl;
cout << -a[0] << endl;
cout << "1 1" << endl;
cout << 0 << endl;
cout << "1 1" << endl;
cout << 0 << endl;
return;
}
cout << 1 << " " << n - 1 << endl;
for (i = 0; i < n - 1; i++) {
long long temp = 0;
if (a[i] % n != 0) {
temp = (n - 1) * a[i];
a[i] += temp;
}
cout << temp << " ";
}
cout << endl;
cout << 2 << " " << n << endl;
for (i = 1; i < n; i++) {
long long temp = 0;
if (a[i] % n != 0) {
temp = (n - 1) * a[i];
a[i] += temp;
}
cout << temp << " ";
}
cout << endl;
cout << 1 << " " << n << endl;
for (i = 0; i < n; i++) {
long long temp = -a[i];
cout << temp << " ";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long nOdd;
int n;
cin >> n;
long long arr[n];
cin >> arr[0];
cout << "1 1\n" << (arr[0] == 0 ? 0 : -arr[0]) << endl;
arr[0] = 0;
if (n > 1) {
if (n % 2 == 0)
cout << 2 << " " << n << endl;
else
cout << 1 << " " << n << endl << 0 << " ";
} else {
cout << "1 1\n0\n1 1\n0\n";
return 0;
}
nOdd = n % 2 != 0 ? n : n - 1;
for (int i = 1; i < n; i++) {
cin >> arr[i];
if (n % 2 == 0) {
cout << nOdd * arr[i] << " ";
arr[i] += nOdd * arr[i];
} else {
cout << nOdd * -arr[i] << " ";
arr[i] += nOdd * -arr[i];
}
}
cout << endl;
if (n % 2 == 0)
cout << 1 << " " << n << endl << (arr[0] == 0 ? 0 : -arr[0]) << " ";
else
cout << 2 << " " << n << endl;
for (int i = 1; i < n; i++) {
cout << (arr[i] == 0 ? 0 : -arr[i]) << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
long long power(long long a, long long n) {
long long res = 1;
while (n) {
if (n % 2) {
res *= a;
}
n >>= 1;
a *= a;
}
return res;
}
long long powerm(long long a, long long n, long long m) {
long long res = 1;
while (n) {
if (n % 2) {
res = (res * a) % m;
}
n >>= 1;
a = (a * a) % m;
}
return res;
}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << "1 1"
<< "\n";
cout << 0 << "\n";
cout << "1 1"
<< "\n";
cout << 0 << "\n";
cout << "1 1"
<< "\n";
cout << -a[0] << "\n";
} else {
cout << "1 1"
<< "\n";
cout << -a[0] << "\n";
a[0] = 0;
cout << "2 " << n << "\n";
for (int i = 1; i < n; i++) {
long long len = n - 1LL;
long long val = (a[i] % n) * len;
a[i] += val;
cout << val << " ";
}
cout << "\n";
cout << "1 " << n << "\n";
for (int i = 0; i < n; i++) {
cout << -a[i] << " ";
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void IO() {}
int ar[200005];
char ch[200005];
int m, n, k, ii;
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &ar[i]);
if (n == 1) {
printf("1 1\n%d\n", (-1) * ar[1]);
printf("1 1\n%d\n", 0);
printf("1 1\n%d\n", 0);
return;
}
if (n == 2) {
printf("1 1\n%d\n", (-1) * ar[1]);
printf("2 2\n%d\n", (-1) * ar[2]);
printf("1 1\n%d\n", 0);
return;
}
if (n == 3) {
printf("1 1\n%d\n", (-1) * ar[1]);
printf("2 2\n%d\n", (-1) * ar[2]);
printf("3 3\n%d\n", (-1) * ar[3]);
return;
}
printf("1 1\n%d\n", (-1) * ar[1]);
int val = n - 1;
vector<long long> v;
for (int i = 2; i <= n; i++) {
long long tem = (long long)val * ar[i];
v.push_back(tem);
}
printf("2 %d\n", n);
for (long long i : v) printf("%lld ", i);
printf("\n");
printf("1 %d\n", n);
ar[1] = 0;
for (int i = 1; i <= n; i++) printf("%lld ", (-1) * ((long long)ar[i] * n));
printf("\n");
}
int main() {
IO();
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9, INF = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) {
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
if (n == 1) {
cout << 1 << " " << 1 << "\n";
cout << a[0] << "\n";
cout << 1 << " " << 1 << "\n";
cout << a[0] << "\n";
cout << 1 << " " << 1 << "\n";
cout << -3 * a[0] << "\n";
continue;
}
cout << 1 << " " << n << "\n";
for (int i = 0; i < n; i++) {
cout << -n * a[i] << " ";
a[i] -= n * a[i];
}
cout << "\n";
cout << 1 << " " << n - 1 << "\n";
for (int i = 0; i < n - 1; i++) cout << -a[i] << " ";
cout << "\n";
cout << n << " " << n << "\n";
cout << -a[n - 1] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7, N = 1e5 + 5;
long long solve() {
long long n, ans = 0;
cin >> n;
long long a[n];
for (long long i = (long long)0; i < n; i++) cin >> a[i];
if (n == 1) {
cout << "1 1" << '\n' << -1 * a[0] << '\n';
cout << "1 1" << '\n' << 0 << '\n';
cout << "1 1" << '\n' << 0 << '\n';
return 1;
}
cout << n << " " << n << '\n' << -1 * a[n - 1] << '\n';
cout << "1 " << n << '\n';
for (long long i = (long long)0; i < n - 1; i++) {
cout << -1 * a[i] * n << " ";
}
cout << 0 << '\n';
cout << "1 " << n - 1 << '\n';
for (long long i = (long long)0; i < n - 1; i++) {
cout << a[i] * (n - 1) << " ";
}
cout << '\n';
}
int32_t main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
long long n, Map[N];
signed main() {
while (cin >> n) {
for (long long i = 1; i <= n; ++i) scanf("%I64d", &Map[i]);
if (n == 1) {
printf("1 1\n0\n");
printf("1 1\n0\n");
printf("1 1\n%I64d\n", Map[1] * (-1));
} else {
printf("1 %I64d\n", n);
for (long long i = 1; i <= n; ++i) printf("%I64d ", Map[i] * n * (-1));
printf("\n1 %I64d\n", n - 1);
for (long long i = 1; i < n; ++i) printf("%I64d ", Map[i] * (n - 1));
printf("\n%I64d %I64d\n%I64d\n", n, n, Map[n] * (n - 1));
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int MOD = 1e9 + 7;
template <class T>
void read(T &x) {
char ch;
bool neg = false;
for (ch = getchar(); !isdigit(ch); ch = getchar()) neg = ch == '-';
x = ch - '0';
for (ch = getchar(); isdigit(ch); ch = getchar()) (x *= 10) += ch - '0';
x *= neg ? -1 : 1;
}
template <class T, class... Args>
void read(T &x, Args &...args) {
read(x);
read(args...);
}
template <class T>
void write(T x) {
if (x < 0) {
putchar('-');
write(-x);
return;
}
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
template <class T>
void writei(T x) {
write(x);
putchar(' ');
}
template <class T>
void writeln(T x) {
write(x);
putchar('\n');
}
template <class T, class... Args>
void write(T x, Args &...args) {
writei(x);
writei(args...);
}
long long a[N];
int t = 1;
void solve() {
long long n;
read(n);
for (long long i = 1; i <= n; i++) read(a[i]);
if (n == 1) {
cout << "1 1\n" << -a[1] << "\n1 1\n0\n1 1\n0\n";
return;
}
cout << "1 1\n" << -a[1] << endl;
cout << "2 " << n << endl;
for (long long i = 2; i <= n; i++) {
cout << a[i] * (n - 1) << " ";
}
cout << "\n1 " << n << "\n0 ";
for (long long i = 2; i <= n; i++) {
cout << -a[i] * n << " ";
}
cout << endl;
}
int main() {
if (fopen("..."
".inp",
"r")) {
freopen(
"..."
".inp",
"r", stdin);
freopen(
"..."
".out",
"w", stdout);
}
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int n;
cin >> n;
long long int a[n];
for (int i = 0; i < n; ++i) cin >> a[i];
if (n <= 3) {
for (int i = 0; i < n; ++i) {
cout << i + 1 << " " << i + 1 << '\n';
cout << -a[i] << '\n';
}
for (int i = 0; i < 3 - n; ++i) {
cout << 1 << " " << 1 << '\n';
cout << 0 << '\n';
}
} else {
cout << 1 << " " << n << '\n';
for (int i = 0; i < n; ++i) {
cout << n * ((n - 1) + (n - 1) - a[i] % (n - 1)) << " ";
a[i] += n * ((n - 1) + (n - 1) - a[i] % (n - 1));
}
cout << "\n";
cout << 2 << " " << n << '\n';
for (int i = 1; i < n; ++i) {
cout << -a[i] << " ";
}
cout << "\n";
cout << 1 << " " << 1 << '\n';
cout << -a[0] << '\n';
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-7;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int d8x[8] = {+1, +1, +1, 0, 0, -1, -1, -1};
int d8y[8] = {+1, 0, -1, +1, -1, +1, 0, -1};
int d4x[4] = {1, 0, 0, -1};
int d4y[4] = {0, -1, 1, 0};
long long power(long long x, long long y) {
long long ans = 1;
x = x;
while (y > 0) {
if (y & 1) ans = (ans * x);
y = y >> 1;
x = (x * x);
}
return ans;
}
long long sqr(long long x) { return x * x; }
template <typename T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
template <class T>
inline void chmax(T &x, T y) {
x = max((x), (y));
}
template <class T>
inline void chmin(T &x, T y) {
x = min((x), (y));
}
template <class T>
bool uax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
template <typename T>
T powm(T a, T b, long long m) {
T cnt = 1;
while (b > 0) {
if (b % 2 == 1) cnt = (cnt * a) % m;
b /= 2;
a = (a * a) % m;
}
return cnt % m;
}
long long ncr(long long n, long long r) {
long long ans = 1;
if (r > n) return 0;
if (r > n - r) r = n - r;
for (long long i = 0; i < r; i++) {
ans *= (n - i);
ans /= (i + 1);
}
return ans;
}
const int MOD = 1000000007;
const int N = 100010;
void solve() {
int n;
cin >> n;
vector<long long> a(n + 5);
for (long long i = (1); i <= (n); ++i) cin >> a[i];
if (n == 1) {
cout << "1 1"
<< "\n";
cout << -a[1] << "\n";
cout << "1 1"
<< "\n";
cout << 0 << "\n";
cout << "1 1"
<< "\n";
cout << 0 << "\n";
} else {
cout << "1 1"
<< "\n";
cout << -a[1] << "\n";
cout << "1 " << n << "\n";
for (long long i = (1); i <= (n); ++i) {
if (i == 1)
cout << 0 << " ";
else
cout << -n * a[i] << " ";
}
cout << "\n";
cout << "2 " << n << "\n";
for (long long i = (2); i <= (n); ++i) cout << (n - 1) * a[i] << " ";
}
}
int32_t main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int tc;
tc = 1;
for (int i = 1; i <= tc; ++i) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
cout << 1 << " " << 1 << endl;
cout << -a[0] << endl;
int k = 2;
while (k--) {
cout << 1 << " " << 1 << endl;
cout << 0 << endl;
}
} else {
cout << 1 << " " << 1 << endl;
cout << (n - 1) * a[0] << endl;
a[0] = n * a[0];
cout << 2 << " " << n << endl;
for (int i = 1; i < n; i++) {
cout << a[i] * (n - 1) << " ";
a[i] += a[i] * (n - 1);
}
cout << endl;
cout << 1 << " " << n << endl;
for (int i = 0; i < n; i++) {
cout << -a[i] << " ";
}
cout << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
const double PI = acos(-1);
long long A[100001];
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
}
if (n == 1) {
cout << 1 << ' ' << 1 << '\n';
cout << 100000000000 << '\n';
cout << 1 << ' ' << 1 << '\n';
cout << 0 << '\n';
cout << 1 << ' ' << 1 << '\n';
cout << -(A[1] + 100000000000) << '\n';
} else {
cout << 1 << ' ' << n << '\n';
for (int i = 1; i <= n; i++) {
cout << -A[i] * n << ' ';
}
cout << '\n' << 1 << ' ' << n - 1 << '\n';
for (int i = 1; i <= n - 1; i++) cout << A[i] * (n - 1) << ' ';
cout << '\n' << n << ' ' << n << '\n';
cout << A[n] * (n - 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
long long int rvsr(long long int n) {
string s = to_string(n);
reverse(s.begin(), s.end());
stringstream obj(s);
obj >> n;
return n;
}
long long int power(long long int x, long long int y) {
long long int res = 1;
x = x;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
long long int logtwo(long long int n) {
if (n == 1) return 0;
return logtwo(n / 2) + 1;
}
long long int isprime(long long int n) {
for (long long int c1 = 2; c1 * c1 <= n; c1++) {
if (n % c1 == 0) {
return 0;
}
}
return 1;
}
long long int twop(long long int n) {
long long int x = 0;
while (n % 2 == 0) {
n /= 2;
x++;
}
return x;
}
long long int n;
int main() {
cin >> n;
long long int a[n];
{
for (long long int ii = 0; ii < n; ii++) cin >> a[ii];
};
if (n != 1) {
cout << 1 << " " << 1 << "\n";
cout << -a[0] << "\n";
cout << 1 << " " << n << "\n";
cout << 0 << " ";
a[0] = 0;
for (long long int i = 1; i < n; i++) cout << -n * a[i] << " ";
cout << "\n";
cout << 2 << " " << n << "\n";
for (long long int i = 1; i < n; i++) cout << a[i] * (n - 1) << " ";
}
if (n == 1) {
cout << 1 << " " << 1 << "\n";
cout << 0 << "\n";
cout << 1 << " " << 1 << "\n";
cout << 0 << "\n";
cout << 1 << " " << 1 << "\n";
cout << -1 * a[0];
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int i, a[n];
for (i = 0; i < n; i++) cin >> a[i];
if (n != 1) {
cout << "1"
<< " "
<< "1" << endl;
cout << -1 * a[0] << endl;
cout << "1"
<< " " << n << endl;
cout << "0"
<< " ";
for (i = 1; i < n; i++) {
cout << -1 * a[i] * n << " ";
}
cout << endl;
cout << "2"
<< " " << n << endl;
for (i = 1; i < n; i++) {
cout << a[i] * (n - 1) << " ";
}
cout << endl;
} else {
cout << "1"
<< " "
<< "1" << endl;
cout << -a[0] << endl;
cout << "1"
<< " "
<< "1" << endl;
cout << "0" << endl;
cout << "1"
<< " "
<< "1" << endl;
cout << "0" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long ch_sqrt(long long n) { return (sqrt(n) * sqrt(n) == n) ? 1 : 0; }
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long pow_(long long a, long long b, long long m) {
long long ans = 1;
while (b) {
if (b & 1) ans = ans * a % m;
a = a * a % m;
b >>= 1;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
for (auto &e : a) cin >> e;
if (n == 1) {
cout << 1 << " " << 1 << "\n";
cout << 0 << "\n";
cout << 1 << " " << 1 << "\n";
cout << 0 << "\n";
cout << 1 << " " << 1 << "\n";
cout << -a[0] << "\n";
} else {
cout << 1 << " " << 1 << "\n";
cout << -a[0] << "\n";
cout << 1 << " " << n << "\n";
a[0] = 0;
for (auto e : a) cout << -n * (e) << " ";
cout << "\n";
cout << 2 << " " << n << "\n";
for (long long i = 1; i < n; i++) {
cout << (n - 1) * a[i] << " ";
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long lmt = 3e5 + 5;
long long n, k, fac[lmt], inv[lmt];
pair<long long, long long> a[lmt];
map<long long, long long> m;
set<long long> s;
long long bigmod(long long n, long long p) {
if (p == 0) return 1;
long long x = bigmod(n, p / 2) % mod;
x = (x * x) % mod;
if (p % 2) x = (x * n) % mod;
return x;
}
long long ncr(long long n, long long r) {
if (r > n) return 0;
long long res = fac[n] % mod;
res = (res * inv[n - r]) % mod;
res = (res * inv[r]) % mod;
return res;
}
int main() {
ios_base::sync_with_stdio(false);
fac[0] = inv[0] = 1;
for (long long i = 1; i < lmt; i++) {
fac[i] = (fac[i - 1] * i) % mod;
inv[i] = bigmod(fac[i], mod - 2) % mod;
}
cin >> n >> k;
for (long long i = 1; i <= n; i++) {
cin >> a[i].first >> a[i].second;
s.insert(a[i].first);
s.insert(a[i].second);
}
long long indx = 0;
for (auto &x : s) {
indx++;
m[x] = indx;
}
for (long long i = 1; i <= n; i++) {
a[i].first = m[a[i].first], a[i].second = m[a[i].second];
}
vector<long long> start[indx + 1], end[indx + 1];
for (long long i = 1; i <= n; i++) {
start[a[i].first].push_back(i);
end[a[i].second].push_back(i);
}
set<long long> s;
s.clear();
long long ans = 0;
for (long long i = 1; i <= indx; i++) {
for (long long x : start[i]) {
ans = (ans + ncr(s.size(), k - 1)) % mod;
s.insert(x);
}
for (long long x : end[i]) {
s.erase(x);
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long binpow(long long a, long long p) {
if (p == 0) return 1;
if (p % 2)
return (a * binpow(a, p - 1)) % mod;
else {
long long quadra = binpow(a, p / 2);
return (quadra * quadra) % mod;
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, k;
cin >> n >> k;
vector<long long> fact(300001, 1);
fact[0] = 1;
for (long long i = 1; i < fact.size(); i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
vector<pair<long long, long long>> scanline;
for (long long i = 0; i < n; i++) {
long long l, r;
cin >> l >> r;
scanline.push_back({l, 1});
scanline.push_back({r + 1, -1});
}
sort(scanline.begin(), scanline.end());
long long bal = 0, res = 0;
for (long long i = 0; i < 2 * n;) {
long long elem = scanline[i].first;
while (i < 2 * n && scanline[i].first == elem && scanline[i].second == -1) {
bal--;
i++;
}
while (i < 2 * n && scanline[i].first == elem) {
if (bal >= k - 1)
res = (res + ((fact[bal] * binpow(fact[k - 1], mod - 2)) % mod *
binpow(fact[bal - (k - 1)], mod - 2)) %
mod) %
mod;
bal++;
i++;
}
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long M = 998244353;
const long long inf = 4e18;
const long long N = 3e5;
long long fac[N + 1];
long long power(long long x, long long y) {
if (y < 0) return power(x, M - 2) * power(x, y + 1) % M;
y %= (M - 1);
long long res = 1;
while (y > 0) {
if (y & 1) res = res * x % M;
y = y >> 1;
x = x * x % M;
}
return res;
}
void factorial() {
fac[0] = 1;
for (long long i = 1; i <= N; i++) fac[i] = fac[i - 1] * i % M;
}
long long nCr(long long n, long long r) {
if (r > n || r < 0) return 0;
if (r == 0) return 1;
return (fac[n] * power(fac[r], M - 2) % M * power(fac[n - r], M - 2) % M) % M;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
factorial();
long long n, k;
cin >> n >> k;
vector<long long> right, left;
for (long long i = 0; i < n; i++) {
long long l, r;
cin >> l >> r;
left.emplace_back(l);
right.emplace_back(r);
}
sort(left.begin(), left.end());
sort(right.begin(), right.end());
long long o = 0;
for (long long i = 0; i < n; i++) {
long long j =
upper_bound(left.begin(), left.end(), right[i]) - left.begin();
o = (o + nCr(j - i - 1, k - 1)) % M;
}
cout << o << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long readInt();
inline long long readUInt();
inline void readWord(char *s);
inline long long fast_readchar();
inline void writeInt(long long first);
inline void fast_writechar(long long first);
inline void writeWord(const char *s);
inline void fast_flush();
struct hash_pair {
template <class T1, class T2>
size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T>
vector<T> readvector(size_t sz) {
vector<T> res(sz);
for (size_t i = 0; i < sz; ++i) {
cin >> res[i];
}
return res;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &out, const std::pair<T, U> &p) {
out << p.first << " " << p.second;
return out;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, " "));
return out;
}
inline long long binPow(long long first, long long deg, long long mod) {
long long ans = 1;
for (long long i = sizeof(deg) * CHAR_BIT - 1; i >= 0; i--) {
ans *= ans;
ans %= mod;
if ((((deg) >> (i)) & 1)) ans *= first;
ans %= mod;
}
return ans;
}
long long gcd(long long a, long long b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
const long long MAXN = 3e5 + 10;
const long long MOD = 998244353;
const long long INF = 1e18;
long long operator*(pair<long long, long long> A,
pair<long long, long long> B) {
return A.first * B.first + A.second * B.second;
}
long long operator%(pair<long long, long long> A,
pair<long long, long long> B) {
return A.first * B.second - A.second * B.first;
}
pair<long long, long long> operator*(pair<long long, long long> A,
long long c) {
return {A.first * c, A.second * c};
}
pair<long long, long long> operator-(pair<long long, long long> A,
pair<long long, long long> B) {
return {A.first - B.first, A.second - B.second};
}
pair<long long, long long> operator+(pair<long long, long long> A,
pair<long long, long long> B) {
return {A.first + B.first, A.second + B.second};
}
vector<pair<long long, long long> > D = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
long long fact[MAXN], inv_fact[MAXN];
void precalc() {
fact[0] = 1;
for (long long i = 1; i < MAXN; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
inv_fact[MAXN - 1] = binPow(fact[MAXN - 1], MOD - 2, MOD);
for (long long i = MAXN - 1; i > 0; i--) {
inv_fact[i - 1] = (inv_fact[i] * i) % MOD;
}
}
long long c(long long n, long long k) {
if (k < 0 || k > n || n < 0) return 0;
return ((fact[n] * inv_fact[k]) % MOD * inv_fact[n - k]) % MOD;
}
inline void solve() {
precalc();
long long n, k;
cin >> n >> k;
vector<pair<long long, long long> > segs(n);
for (long long i = 0; i < n; i++) {
cin >> segs[i].first >> segs[i].second;
segs[i].second++;
}
set<long long> elems;
for (auto e : segs) {
elems.insert(e.first);
elems.insert(e.second);
}
unordered_map<long long, long long> code = {};
for (auto e : elems) {
long long id = code.size();
code[e] = id;
}
for (long long i = 0; i < n; i++) {
segs[i].first = code[segs[i].first];
segs[i].second = code[segs[i].second];
}
long long bal = 0;
unordered_map<long long, long long> opening, closing;
for (auto e : segs) {
opening[e.first]++;
closing[e.second]++;
}
long long ans = 0;
for (long long i = 0; i < elems.size(); i++) {
bal -= closing[i];
ans += (c(bal + opening[i], k) - c(bal, k));
bal += opening[i];
ans %= MOD;
}
ans = ((ans % MOD) + MOD) % MOD;
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
for (long long i = 1; i <= t; ++i) {
solve();
}
fast_flush();
return 0;
}
static const long long buf_size = 4096;
inline long long fast_readchar() {
static char buf[buf_size];
static long long len = 0, pos = 0;
if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len) return -1;
return buf[pos++];
}
inline long long readUInt() {
long long c = fast_readchar(), first = 0;
while (c <= 32) c = fast_readchar();
while ('0' <= c && c <= '9')
first = first * 10 + c - '0', c = fast_readchar();
return first;
}
inline long long readInt() {
long long s = 1, c = fast_readchar();
long long first = 0;
while (c <= 32) c = fast_readchar();
if (c == '-') s = -1, c = fast_readchar();
while ('0' <= c && c <= '9')
first = first * 10 + c - '0', c = fast_readchar();
return first * s;
}
inline void readWord(char *s) {
long long c = fast_readchar();
while (c <= 32) c = fast_readchar();
while (c > 32) *s++ = c, c = fast_readchar();
*s = 0;
}
static long long write_pos = 0;
static char write_buf[buf_size];
inline void fast_writechar(long long first) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = first;
}
inline void fast_flush() {
if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
inline void writeInt(long long first) {
if (first < 0) fast_writechar('-'), first = -first;
char s[24];
long long n = 0;
while (first || !n) s[n++] = '0' + first % 10, first /= 10;
while (n--) fast_writechar(s[n]);
}
inline void writeWord(const char *s) {
while (*s) fast_writechar(*s++);
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
template <class T>
inline void read(T &first) {
first = 0;
int f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
first = first * 10 + c - '0';
c = getchar();
}
first = first * f;
}
template <class T>
inline void out(string a, T first) {
cout << a << " = " << first << endl;
}
const int N = 3e5 + 10, mod = 998244353;
long long f[N];
long long fastPow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
long long C(int n, int k) {
return f[n] * fastPow(f[n - k] * f[k] % mod, mod - 2) % mod;
}
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first != b.first ? a.first < b.first : a.second > b.second;
}
int main() {
f[0] = 1;
for (int i = 1; i < N; i++) f[i] = f[i - 1] * i % mod;
int n, k;
cin >> n >> k;
vector<pair<int, int> > vec(2 * n + 10);
for (int i = 1; i <= n; i++) {
int l, r;
scanf("%d %d", &l, &r);
vec[i] = {l, 1};
vec[n + i] = {r, 0};
}
sort(vec.begin() + 1, vec.begin() + 2 * n + 1, cmp);
long long ans = 0;
int cnt = 0;
for (int i = 1; i <= 2 * n; i++) {
if (vec[i].second == 0)
cnt--;
else {
cnt++;
if (cnt >= k) ans = (ans + C(cnt - 1, k - 1)) % mod;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
vector<int> f;
vector<int> inverse_f;
int power(int a, int b) {
if (b == 0) return 1;
int result = power(a, b / 2);
return (long long)result * result % MOD * (b % 2 == 1 ? a : 1) % MOD;
}
int C(int n, int k) {
if (n < k) return 0;
return (long long)f[n] * inverse_f[n - k] % MOD * inverse_f[k] % MOD;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> l(n), r(n);
for (int i = 0; i < n; i++) cin >> l[i] >> r[i];
vector<array<int, 2>> actions;
for (int i = 0; i < n; i++) {
actions.push_back({l[i], i + 1});
actions.push_back({r[i] + 1, -(i + 1)});
}
sort(actions.begin(), actions.end());
f.resize(n + 1);
f[0] = 1;
for (int i = 1; i <= n; i++) f[i] = (long long)f[i - 1] * i % MOD;
inverse_f.resize(n + 1);
inverse_f[n] = power(f[n], MOD - 2);
for (int i = n - 1; i >= 0; i--)
inverse_f[i] = (long long)inverse_f[i + 1] * (i + 1) % MOD;
int ways = 0;
int i = 0;
int on_count = 0;
while (i < 2 * n) {
int j = i + 1;
while (j < 2 * n && actions[j][0] == actions[i][0]) j++;
int t;
for (t = i; t < j && actions[t][1] < 0; t++) on_count--;
int new_on_count = j - t;
ways =
(ways +
(C(on_count + new_on_count, k) + (MOD - C(on_count, k)) % MOD) % MOD) %
MOD;
on_count += new_on_count;
i = j;
}
cout << ways << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int MAXN = 300005;
long long factorial[MAXN], inverse[MAXN];
long long power(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b % 2 == 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
b >>= 1LL;
}
return res;
}
long long nCk(int n, int k) {
if (n == 0) return 0;
if (k < 0 || k > n) {
return 0;
}
long long ans = factorial[n];
ans = (ans * inverse[n - k]) % mod;
ans = (ans * inverse[k]) % mod;
return ans;
}
void numberOfWays(vector<pair<int, int> > lines, int K, int N) {
sort(lines.begin(), lines.end());
long long total_case = 0;
multiset<int> m;
for (int i = 0; i < N; i++) {
while (!m.empty() && (*m.begin() < lines[i].first)) {
m.erase(m.begin());
}
total_case += nCk(m.size(), K - 1);
total_case += mod;
total_case %= mod;
m.insert(lines[i].second);
}
cout << total_case << endl;
}
void preCompute() {
long long fact = 1;
factorial[0] = 1;
inverse[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact = (fact * i) % mod;
factorial[i] = fact;
inverse[i] = power(factorial[i], mod - 2);
}
}
int main() {
int n, k;
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
vector<pair<int, int> > lines;
preCompute();
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
lines.push_back({x, y});
}
if (k == 1) {
cout << n;
exit(0);
}
numberOfWays(lines, k, n);
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
constexpr long long int M = 998244353;
long long int f[300010], fi[300010];
long long int choose(long long int n, long long int k) {
if (n - k < 0) return 0;
return f[n] * fi[n - k] % M * fi[k] % M;
}
long long int inv(long long int a, long long int b = M) {
return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, k;
cin >> n >> k;
f[0] = fi[0] = 1;
for (long long int i = 1; i < n + 5; ++i) {
f[i] = f[i - 1] * i % M;
fi[i] = fi[i - 1] * inv(i) % M;
}
long long int ans = 0;
long long int cur = 0;
vector<pair<long long int, long long int>> evs;
for (long long int i = 0; i < n; ++i) {
long long int l, r;
cin >> l >> r;
evs.push_back({r, 1});
evs.push_back({l, 0});
}
sort(evs.begin(), evs.end());
for (auto ev : evs) {
if (ev.second == 1)
cur--;
else {
ans = (ans + choose(cur, k - 1)) % M;
cur++;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
int n, k;
pair<int, int> a[300010];
long long gt[300010], igt[300010];
int f[300010 * 2];
long long Pow(long long a, long long b) {
if (b == 0) return 1;
long long t = Pow(a, b / 2);
t = (t * t) % mod;
if (b & 1) return t * a % mod;
return t;
}
void init() {
int maxm = 3e5;
gt[0] = 1;
for (int i = 1; i <= maxm; ++i) gt[i] = gt[i - 1] * i % mod;
igt[maxm] = Pow(gt[maxm], mod - 2);
for (int i = maxm - 1; i >= 0; --i) igt[i] = igt[i + 1] * (i + 1) % mod;
}
long long C(int k, int n) {
if (k > n) return 0;
return gt[n] * igt[n - k] % mod * igt[k] % mod;
}
void Compress() {
vector<int> com;
for (int i = 1; i <= n; ++i) {
com.push_back(a[i].first);
com.push_back(a[i].second);
}
sort((com).begin(), (com).end());
com.resize(unique((com).begin(), (com).end()) - com.begin());
for (int i = 1; i <= n; ++i) {
a[i].first =
lower_bound((com).begin(), (com).end(), a[i].first) - com.begin();
a[i].first++;
a[i].second =
lower_bound((com).begin(), (com).end(), a[i].second) - com.begin();
a[i].second++;
}
}
void update(int i) {
for (; i > 0; i -= i & -i) f[i]++;
}
int get(int i) {
int ret = 0;
for (; i < 300010 * 2; i += i & -i) ret = ret + f[i];
return ret;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
if (k == 1) {
cout << n;
return 0;
}
for (int i = 1; i <= n; ++i) {
cin >> a[i].first >> a[i].second;
}
init();
Compress();
sort(a + 1, a + n + 1);
long long ans = 0;
for (int i = 1; i <= n; ++i) {
int sl = get(a[i].first);
ans = (ans + C(k - 1, sl)) % mod;
update(a[i].second);
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline long long binpow(long long a, long long b, long long m) {
long long res = 1;
for (b %= m - 1, a %= m; b > 0; b >>= 1, a = a * a % m)
if (b & 1) res = res * a % m;
return res;
}
int main() {
int n, k, l, r;
cin >> n >> k;
map<int, pair<int, int> > sl;
int mod = 998244353;
long long fact[n + 1];
fact[0] = 1;
for (int i = (1); i <= (n); ++i) fact[i] = (fact[i - 1] * i) % mod;
auto c = [&](int n, int r) {
if (n < r) return 0LL;
long long num = fact[n];
long long den = (fact[n - r] * fact[r]) % mod;
long long deninv = binpow(den, mod - 2, mod);
return (num * deninv) % mod;
};
for (int i = (1); i <= (n); ++i) {
cin >> l >> r;
sl[l].first++, sl[r].second++;
}
int curr = 0;
long long ans = 0;
for (auto x : sl) {
int inc = x.second.first;
ans += (c(inc + curr, k) - c(curr, k)) % mod;
ans += mod;
ans %= mod;
curr += inc;
curr -= x.second.second;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 3 * 1e5 + 5, mod = 998244353;
map<pair<long long, long long>, long long> mp;
long long fact[400005];
long long power(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) {
res = ((res % mod) * (a % mod)) % mod;
}
a = ((a % mod) * (a % mod)) % mod;
b = (b >> 1) % mod;
}
return res % mod;
}
void precompute() {
fact[0] = 1;
for (long long i = 1; i <= 400003; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
long long ncr(long long n, long long k) {
long long num = fact[n] % mod;
long long den1 = power(fact[k], mod - 2);
long long den2 = power(fact[n - k], mod - 2);
long long den = (den1 * den2) % mod;
return (num * den) % mod;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, k, l, r;
precompute();
cin >> n >> k;
for (long long i = 0; i < n; i++) {
cin >> l >> r;
mp[make_pair(l, -1)] += 1;
mp[make_pair(r, 1)] += 1;
}
long long an = 0, pr = 0;
for (auto i : mp) {
auto pt = i.first;
r = i.second;
if (pt.second == -1) {
for (long long x = 1; x <= r; x++)
if (pr + x >= k) an = (an + ncr(pr + x - 1, k - 1)) % mod;
}
pr += -pt.second * r;
}
an = (an + mod) % mod;
cout << an;
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long getint() {
char c = getchar();
long long ret = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') ret = ret * 10 + c - '0', c = getchar();
return ret * f;
}
const int maxn = 3e5 + 10;
const int crz = 998244353;
priority_queue<int, vector<int>, greater<int> > Q;
pair<int, int> p[maxn];
int n, m, N, T;
int fac[maxn], ifac[maxn];
inline int C(int n, int m) {
if (n < 0 || m > n) return 0;
return 1ll * fac[n] * ifac[m] % crz * ifac[n - m] % crz;
}
inline int mod(int x) { return x >= crz ? x - crz : x; }
inline void solve() {
T = N = 0;
n = getint();
m = getint();
for (int i = 1; i <= n; i++) {
int l = getint(), r = getint();
p[i] = make_pair(l, r);
}
sort(p + 1, p + n + 1);
int ans = 0;
for (int i = 1; i <= n; i++) {
while (!Q.empty() && Q.top() < p[i].first) Q.pop();
ans = mod(ans + C(Q.size(), m - 1));
Q.push(p[i].second);
}
printf("%d\n", ans);
}
inline int qpow(int a, int b) {
int ret = 1;
while (b) {
if (b & 1) ret = 1ll * ret * a % crz;
a = 1ll * a * a % crz;
b >>= 1;
}
return ret;
}
inline void init() {
n = 300000;
fac[0] = 1;
for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % crz;
ifac[n] = qpow(fac[n], crz - 2);
for (int i = n - 1; i >= 0; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % crz;
}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
int n, k;
pair<int, int> a[300005];
long long gt[300005], i_gt[300005];
long long pw(long long a, long long b) {
if (b == 0) return 1;
long long t = pw(a, b / 2);
t = t * t % mod;
if (b & 1) t = t * a % mod;
return t;
}
void pre() {
gt[0] = 1;
for (int i = 1; i <= n; ++i) gt[i] = gt[i - 1] * i % mod;
i_gt[n] = pw(gt[n], mod - 2);
for (int i = n - 1; i >= 0; --i) i_gt[i] = ((i + 1) * i_gt[i + 1]) % mod;
}
int main() {
cin >> n >> k;
pre();
for (int i = 1; i <= n; ++i) cin >> a[i].first >> a[i].second;
sort(a + 1, a + 1 + n);
priority_queue<int, vector<int>, greater<int> > pq;
long long rs = 0;
int cnt = 0;
for (int i = 1; i <= n; ++i) {
while (pq.size() && pq.top() < a[i].first) {
--cnt;
pq.pop();
}
if (cnt >= k - 1) {
long long tmp = gt[cnt] * i_gt[cnt - k + 1] % mod * i_gt[k - 1] % mod;
rs = (rs + tmp) % mod;
}
pq.push(a[i].second);
++cnt;
}
cout << rs << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846264338327950288;
using namespace std;
long long int __gcd(long long int a, long long int b) {
if (b == 0) return a;
return __gcd(b, a % b);
}
long long int fact[1000009];
long long int pow1(long long int x, long long int n) {
if (n == 0) return 1ll;
long long int sa = pow1(x, n / 2);
long long int ans = (sa * sa) % 998244353;
if (n % 2) ans = (ans * x) % 998244353;
return ans;
}
long long int nck(long long int n, long long int k) {
long long int ans = fact[n];
ans = (ans * pow1(fact[k], 998244353 - 2)) % 998244353;
ans = (ans * pow1(fact[n - k], 998244353 - 2)) % 998244353;
return ans;
}
void solve() {
long long int n, k;
cin >> n >> k;
vector<pair<long long int, long long int>> vec;
long long int l, r;
for (long long int i = 0; i < n; i++) {
cin >> l >> r;
vec.push_back({l, 0});
vec.push_back({r, 1});
}
sort(vec.begin(), vec.end());
long long int i = 0, cnt = 0, ans = 0;
while (1) {
while (vec[i].second == 0) {
cnt++;
i++;
}
if (cnt >= k) {
ans = (ans + nck(cnt, k)) % 998244353;
}
while (vec[i].second == 1) {
cnt--;
i++;
}
if (cnt >= k) {
ans = ((ans - nck(cnt, k)) % 998244353 + 998244353) % 998244353;
}
if (i >= 2 * n) break;
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int t;
fact[0] = 1;
for (long long int i = 1; i <= 1000000; i++)
fact[i] = (fact[i - 1] * i) % 998244353;
t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
map<int64_t, int64_t> compression(vector<int64_t> V) {
map<int64_t, int64_t> ret;
int64_t cnt = 0;
sort(V.begin(), V.end());
for (int i = 0; i < V.size(); i++) {
if (!ret.count(V[i])) {
ret[V[i]] = cnt;
cnt++;
}
}
return ret;
}
const int64_t MAX = 510000;
const int64_t MOD = 998244353;
int64_t fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int64_t COM(int64_t n, int64_t k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int N, K;
cin >> N >> K;
COMinit();
vector<int64_t> comp(2 * N);
vector<P> vec(N);
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
comp[i * 2] = x;
comp[i * 2 + 1] = y;
vec[i] = P(x, y);
}
map<int64_t, int64_t> M = compression(comp);
for (int i = 0; i < N; i++) {
vec[i].first = M[vec[i].first];
vec[i].second = M[vec[i].second];
}
vector<int64_t> sum(M.size() + 1);
vector<int64_t> E(M.size() + 1);
for (int i = 0; i < N; i++) {
auto [x, y] = vec[i];
sum[x]++;
sum[y + 1]--;
E[y]++;
}
for (int i = 0; i <= M.size(); i++) {
sum[i + 1] += sum[i];
}
int64_t ans = 0;
for (int i = 0; i < M.size() + 1; i++) {
for (int j = 1; j <= E[i]; j++) {
ans += COM(E[i], j) * COM(sum[i] - E[i], K - j);
ans %= MOD;
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
T = 1;
for (int i = 0; i < T; i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long modPower(long long num, long long r) {
if (r == 0) return 1;
if (r == 1) return num % 998244353;
long long ans = modPower(num, r / 2) % 998244353;
if (r % 2 == 0) {
return (ans * ans) % 998244353;
}
return (((ans * ans) % 998244353) * num) % 998244353;
}
template <typename T1, typename T2>
inline std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
bool first = true;
os << "[";
for (unsigned int i = 0; i < v.size(); i++) {
if (!first) os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
template <typename T>
inline std::ostream& operator<<(std::ostream& os, const std::set<T>& v) {
bool first = true;
os << "[";
for (typename std::set<T>::const_iterator iii = v.begin(); iii != v.end();
++iii) {
if (!first) os << ", ";
os << *iii;
first = false;
}
return os << "]";
}
template <typename T1, typename T2>
inline std::ostream& operator<<(std::ostream& os, const std::map<T1, T2>& v) {
bool first = true;
os << "[";
for (typename std::map<T1, T2>::const_iterator iii = v.begin();
iii != v.end(); ++iii) {
if (!first) os << ", ";
os << *iii;
first = false;
}
return os << "]";
}
int dr4[] = {0, 1, 0, -1}, dc4[] = {1, 0, -1, 0};
int dr8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dc8[] = {1, 1, 0, -1, -1, -1, 0, 1};
long long inv(long long a) { return modPower(a, 998244353 - 2); }
void factorial(long long* fact, long long* factorialNumInverse, long long n) {
fact[0] = 1;
factorialNumInverse[0] = inv(fact[0]);
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % 998244353;
factorialNumInverse[i] = inv(fact[i]);
}
}
long long nCr(long long n, long long r, long long* fact,
long long* factorialNumInverse) {
long long ans = (((fact[n] * factorialNumInverse[r]) % 998244353) *
factorialNumInverse[n - r]) %
998244353;
return ans;
}
bool comp(pair<long long, long long>& a, pair<long long, long long>& b) {
if (a.first == b.first) return a.second > b.second;
return a.first < b.first;
}
void solve() {
long long n, k;
cin >> n >> k;
long long factorialNumInverse[n + 1];
long long fact[n + 1];
factorial(fact, factorialNumInverse, n);
vector<pair<long long, long long> > a;
for (long long i = 0; i < n; i++) {
long long l, r;
cin >> l >> r;
a.push_back({l, 1});
a.push_back({r, -1});
}
sort(a.begin(), a.end(), comp);
vector<long long> peaks;
long long sum = 0;
for (auto it : a) {
sum += it.second;
peaks.push_back(sum);
}
long long sz = peaks.size(), ans = 0, prev = -1;
bool init = false;
for (long long i = 0; i < sz - 1; i++) {
if (peaks[i] == k && !init) {
init = true;
ans = 1;
} else if (init) {
if (peaks[i] >= k && peaks[i] > peaks[i - 1]) {
long long mul;
if (prev == -1) {
mul = nCr(peaks[i] - 1, k - 1, fact, factorialNumInverse);
} else {
mul = (mul * (peaks[i] - 1)) % 998244353;
}
ans = (ans + mul) % 998244353;
} else {
prev = -1;
}
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = 1000000000000000000;
const long long KOK = 100000;
const long long LOG = 30;
const long long li = 500005;
const long long mod = 998244353;
long long n, m, b[li], a[li], k, flag, t, fac[li];
long long cev;
string s;
pair<long long, long long> p[li];
multiset<long long> st;
vector<long long> v;
inline long long add(long long x, long long y) {
if (x + y >= mod) return x + y - mod;
return x + y;
}
inline long long mul(long long x, long long y) {
return (x % mod) * (y % mod) % mod;
}
inline long long fp(long long x, long long y) {
if (y == 0) return 1;
if (y == 1) return x;
long long q = fp(x, y / 2);
q = mul(q, q);
if (y % 2) q = mul(q, x);
return q;
}
int32_t main(void) {
scanf("%lld %lld", &n, &k);
for (long long i = 1; i <= n; i++) {
scanf("%lld %lld", &p[i].first, &p[i].second);
}
fac[0] = 1;
for (long long i = 1; i <= n + 100; i++) {
fac[i] = mul(fac[i - 1], i);
}
sort(p + 1, p + n + 1);
long long say = 0;
for (long long i = 1; i <= n; i++) {
while (say) {
if (*st.begin() >= p[i].first) break;
if (say >= k)
cev =
add(cev, mul(fac[say - 1],
fp(mul(fac[k - 1], fac[say - 1 - (k - 1)]), mod - 2)));
st.erase(st.begin());
say--;
}
st.insert(p[i].second);
say++;
}
long long i = n + 1;
p[i].first = inf;
while (say) {
if (*st.begin() >= p[i].first) break;
if (say >= k)
cev = add(cev, mul(fac[say - 1],
fp(mul(fac[k - 1], fac[say - 1 - (k - 1)]), mod - 2)));
st.erase(st.begin());
say--;
}
printf("%lld\n", cev);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int oo = 1e9;
template <typename num>
inline num ceil(num a, num b) {
return (a + b - 1) / b;
}
template <typename num>
inline num lcm(num a, num b) {
return a * (b / __gcd(a, b));
}
template <typename num>
inline num sum(num x) {
return x * (x + 1) / 2;
}
long long binpow(long long b, long long e) {
long long res = 1;
while (e)
if (e & 1)
res = (res * b % MOD), --e;
else
b = (b * b % MOD), e >>= 1;
return res;
}
const int MAXN = 3e5 + 5;
long long fac[MAXN];
inline long long inv(long long n) { return binpow(n, MOD - 2); }
inline long long C(long long n, long long k) {
if (n < k) return 0;
return fac[n] * inv(fac[k]) % MOD * inv(fac[n - k]) % MOD;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fac[0] = 1;
for (int i = 1; i < MAXN; ++i) {
fac[i] = (fac[i - 1] * i) % MOD;
}
int t = 1;
while (t--) {
int n, k;
cin >> n >> k;
vector<pair<int, int> > a;
for (int i = 0, l, r; i < n; ++i) {
cin >> l >> r;
a.push_back({l, 1});
a.push_back({r + 1, 0});
}
sort(begin(a), end(a));
long long cnt = 0, ans = 0;
for (int i = 0; i < (int)(a).size(); ++i) {
int s = a[i].second;
if (s) {
ans = (ans + C(cnt, k - 1)) % MOD;
cnt++;
} else {
cnt--;
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int in(char &c) { return scanf("%c", &c); }
int in(char s[]) { return scanf("%s", s); }
int in(int &x) { return scanf("%d", &x); }
int in(long long &x) { return scanf("%lld", &x); }
int in(double &x) { return scanf("%lf", &x); }
int in(pair<int, int> &p) { return scanf("%d%d", &p.first, &p.second); }
int in(pair<long long, long long> &p) {
return scanf("%lld%lld", &p.first, &p.second);
}
int in(pair<double, double> &p) { return scanf("%lf%lf", &p.first, &p.second); }
int in(long double &a) { return scanf("%Lf", &a); }
int in(int &x, long long &y) { return scanf("%d%lld", &x, &y); }
int in(long long &x, int &y) { return scanf("%lld%d", &x, &y); }
int in(int &x, int &y) { return scanf("%d%d", &x, &y); }
int in(long long &x, long long &y) { return scanf("%lld%lld", &x, &y); }
int in(char s[], int &n) { return scanf("%s%d", s, &n); }
int in(int &n, char s[]) { return scanf("%d%s", &n, s); }
int in(char a[], char b[]) { return scanf("%s%s", a, b); }
int in(double &x, double &y) { return scanf("%lf%lf", &x, &y); }
int in(int &n, char s[], char t[]) { return scanf("%d%s%s", &n, s, t); }
int in(int &x, int &y, int &z) { return scanf("%d%d%d", &x, &y, &z); }
int in(long long &x, long long &y, long long &z) {
return scanf("%lld%lld%lld", &x, &y, &z);
}
int in(double &x, double &y, double &z) {
return scanf("%lf%lf%lf", &x, &y, &z);
}
int in(int &x, int &y, int &z, int &k) {
return scanf("%d%d%d%d", &x, &y, &z, &k);
}
int in(long long &x, long long &y, long long &z, long long &k) {
return scanf("%lld%lld%lld%lld", &x, &y, &z, &k);
}
int in(double &x, double &y, double &z, double &k) {
return scanf("%lf%lf%lf%lf", &x, &y, &z, &k);
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
const int N = 3e5 + 10, M = 1e3 + 10, mod = 998244353;
const double eps = 1e-6, Pi = acos(-1.0);
long long l[N], r[N], a[N], b[N], num[N];
long long quick_pow(long long a, long long x) {
long long ans = 1;
a %= mod;
while (x) {
if (x & 1) ans = (ans * a) % mod;
x >>= 1;
a = (a * a) % mod;
}
return ans;
}
long long inv(long long x) { return quick_pow(x, mod - 2); }
long long fac[N];
long long C(int n, int m) {
if (n < m) return 0ll;
return (fac[n] % mod * inv(fac[m]) % mod * inv(fac[n - m]) % mod + mod) % mod;
}
int main() {
fac[0] = 1;
for (int i = 1; i < N; i++) fac[i] = fac[i - 1] * i % mod;
long long i, j, k;
long long n, m, t;
in(n, k);
for (i = 0; i < n; i++) {
for (int iii = 1; iii < 10; iii++)
;
in(l[i], r[i]);
a[i] = l[i], b[i] = r[i];
}
sort(a, a + n);
sort(b, b + n);
for (i = 0, j = 0; i < n; i++) {
if (a[i] <= b[j])
num[j]++;
else {
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
while (a[i] > b[j]) j++, num[j] = num[j - 1];
num[j]++;
}
}
while (j < n) {
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
j++;
num[j] = num[j - 1];
}
long long ans = 0;
for (i = 0; i < n; i++) {
if (num[i] - i >= k) {
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
ans = ans + C(num[i] - i - 1, k - 1);
ans = ans % mod;
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
for (int iii = 1; iii < 10; iii++)
;
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 3e5 + 15;
using namespace std;
long long modexp(long long a, long long p, long long mod) {
if (p == 0) return 1;
long long ans = modexp(a, p / 2, mod);
ans = (ans * ans) % mod;
if (p % 2)
return (a * ans) % mod;
else
return ans;
}
pair<long long, long long> A[MAXN];
long long frac[MAXN];
void solve() {
int n, k;
cin >> n >> k;
frac[0] = 1;
for (int i = 1; i < MAXN; i++) frac[i] = (i * frac[i - 1]) % 998244353;
std::map<long long, int> mp;
int t = 1;
std::vector<long long> v;
for (int i = 0; i < n; i++) {
cin >> A[i].first >> A[i].second;
v.push_back(A[i].first);
v.push_back(A[i].second);
}
sort(v.begin(), v.end());
for (auto x : v) {
if (mp[x] == 0) {
mp[x] = t;
t++;
}
}
std::vector<int> start(t, 0), eend(t + 1, 0);
for (int i = 0; i < n; i++) {
A[i].first = mp[A[i].first];
A[i].second = mp[A[i].second];
start[A[i].first]++;
eend[A[i].second + 1]++;
}
long long curr = 0, ans = 0;
for (int i = 1; i < t; i++) {
curr -= eend[i];
long long x = start[i];
if (curr + x >= k)
ans +=
(frac[curr + x] * modexp((frac[curr + x - k] * frac[k]) % 998244353,
998244353 - 2, 998244353)) %
998244353;
if (curr >= k)
ans = (ans + 998244353 -
(frac[curr] * modexp((frac[curr - k] * frac[k]) % 998244353,
998244353 - 2, 998244353)) %
998244353) %
998244353;
ans %= 998244353;
curr += start[i];
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cout << fixed << setprecision(12);
int t = 1;
for (int i = 1; i <= t; i++) {
solve();
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 998244353;
long long int modexp(long long int a, long long int b) {
long long int ret = 1;
while (b > 0) {
if (b & 1) {
ret = (ret * a) % MOD;
}
a = (a * a) % MOD;
b >>= 1;
}
return ret;
}
int main() {
long long int n, k;
cin >> n >> k;
vector<pair<long long int, long long int> > lamps;
for (int i = 0; i < n; i++) {
long long int l, r;
cin >> l >> r;
lamps.push_back({l, r});
}
vector<long long int> comb(n + 5, 0);
long long int _k = k - 1;
comb[_k] = 1;
for (long long int i = _k + 1; i <= n; i++) {
comb[i] = ((comb[i - 1] * i) % MOD * modexp(i - _k, MOD - 2)) % MOD;
}
sort(lamps.begin(), lamps.end());
auto cmp = [](pair<long long int, long long int> a,
pair<long long int, long long int> b) {
return a.second > b.second;
};
long long int ans = 0;
priority_queue<pair<long long int, long long int>,
vector<pair<long long int, long long int> >, decltype(cmp)>
pq(cmp);
for (int i = 0; i < n; i++) {
while (!pq.empty() && pq.top().second < lamps[i].first) {
pq.pop();
}
ans = (ans + comb[pq.size()]) % MOD;
pq.push(lamps[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int hell = (long long int)(1e18 + 100LL);
const double pi = acos(-1.0);
vector<long long int> fac(1000005, 0);
long long int me(long long int x, long long int n, long long int md) {
long long int res = 1LL;
x = x % md;
while (n > 0) {
if (n % 2LL == 1) {
res = (res * x) % md;
}
x = (x * x) % md;
n /= 2LL;
}
return res;
}
long long int ncr(long long int n, long long int r) {
if (n < r) {
return 0;
}
long long int x, y, z;
x = fac[n];
y = fac[r];
z = fac[n - r];
y = (y * z) % 998244353;
y = me(y, 998244353 - 2, 998244353);
x = (x * y) % 998244353;
return x;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t, i, j, k, m, n, x, y, z;
t = 1;
while (t--) {
long long int flag = 0, K;
fac[0] = fac[1] = 1;
for (i = 1; i <= 1000000; i++) {
fac[i] = (fac[i - 1] * i) % 998244353;
}
cin >> m >> K;
map<long long int, pair<long long int, long long int> > mp;
for (i = 0; i < m; i++) {
cin >> x >> y;
mp[x].first++;
mp[y + 1].second++;
}
vector<pair<long long int, long long int> > V;
long long int X = 0;
long long int ans = 0LL;
for (auto it : mp) {
x = it.second.first;
y = it.second.second;
long long int temp = y;
while (y--) {
z = ncr(X - 1, K - 1);
ans = (ans + z) % 998244353;
X--;
}
X += x;
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
const int N = 1e6 + 5;
const int mod = 998244353;
const double PI = acos(-1.0);
const double eps = 1e-8;
using namespace std;
long long qpow(long long a, long long b) {
long long ans = 1;
a %= mod;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1) ans = (ans * a) % mod;
return ans;
}
int n, k;
vector<pair<int, int> > vec;
long long pre[N];
long long inline C(int x, int y) {
if (x < y) return 0;
return pre[x] * qpow(pre[y] * pre[x - y] % mod, mod - 2) % mod;
}
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first == b.first ? a.second > b.second : a.first < b.first;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
int temp;
cin >> temp;
vec.push_back({temp, 1});
cin >> temp;
vec.push_back({temp, -1});
}
sort(vec.begin(), vec.end(), cmp);
long long ans = 0, cnt = 0;
for (auto p : vec) {
if (p.second == 1) ans = (ans + C(cnt, k - 1)) % mod;
cnt += p.second;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
pre[0] = pre[1] = 1;
for (int i = 2; i < N; ++i) pre[i] = pre[i - 1] * i % mod;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int fac[300005];
bool comp(pair<long long int, long long int> p1,
pair<long long int, long long int> p2) {
if (p1.first < p2.first) return 1;
if (p1.first == p2.first && p1.second < p2.second) return 1;
return 0;
}
void calc() {
fac[0] = 1;
for (long long int i = 1; i <= 300005; i++)
fac[i] = (fac[i - 1] % 998244353 * i % 998244353) % 998244353;
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2, p);
}
long long int nCrModPFermat(long long int n, long long int r, long long int p) {
if (r == 0) return 1;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(15);
long long int t;
t = 1;
calc();
while (t--) {
long long int n, k;
cin >> n >> k;
vector<pair<long long int, long long int>> v(n);
long long int res = 0;
for (long long int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;
if (k == 1) {
cout << n << "\n";
continue;
}
sort(v.begin(), v.end(), comp);
multiset<long long int> m;
for (long long int i = 0; i < n; i++) {
while (m.size() && *m.begin() < v[i].first) m.erase(m.begin());
long long int p = m.size();
if (p >= k - 1)
res = (res + nCrModPFermat(p, k - 1, 998244353)) % 998244353;
m.insert(v[i].second);
}
cout << res << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
const int N = 300005;
long long int add(long long int a, long long int b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
long long int sub(long long int a, long long int b) {
a -= b;
if (a < 0) a += mod;
return a;
}
long long int mul(long long int a, long long int b) { return a * b % mod; }
long long int expo(long long int a, long long int b) {
long long int r = 1;
for (; b; b >>= 1, a = mul(a, a))
if (b & 1) r = mul(r, a);
return r;
}
long long int fact[N], ifact[N];
void init() {
fact[0] = 1;
for (int i = 1; i < N; i++) fact[i] = mul(i, fact[i - 1]);
ifact[N - 1] = expo(fact[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--) ifact[i] = mul(i + 1, ifact[i + 1]);
}
long long int ncr(long long int n, long long int k) {
if (n < k) return 0;
return mul(fact[n], mul(ifact[k], ifact[n - k]));
}
int main() {
init();
long long int n, k;
scanf("%lld %lld", &n, &k);
vector<long long int> v1(n), v2(n);
map<long long int, long long int> a;
for (int i = 0; i < n; i++) scanf("%lld %lld", &v1[i], &v2[i]);
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
for (int i = 0; i < n; i++) a[v1[i]]++;
long long int ans = 0, sum = 0;
for (auto i : a) {
int temp = lower_bound(v2.begin(), v2.end(), i.first) - v2.begin();
long long int qt = sum + i.second - temp;
ans = add(ans, sub(ncr(qt, k), ncr(sum - temp, k)));
sum += i.second;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = (119 << 23) + 1;
int addeq(int &x, int y) { return x = (x + y) % MOD; }
int add(int x, int y) { return addeq(x, y); }
int multeq(int &x, int y) { return x = (1ll * x * y) % MOD; }
int mult(int x, int y) { return multeq(x, y); }
int pwr(int x, int p) {
int res = 1;
for (; p; p >>= 1) {
if (p & 1) multeq(res, x);
multeq(x, x);
}
return res;
}
int inv(int x) { return pwr(x, MOD - 2); }
int diveq(int x, int y) { return multeq(x, inv(y)); }
int divv(int x, int y) { return diveq(x, y); }
const int MAXN = 300010;
int fact[MAXN];
int cho(int n, int k) {
if (k < 0 || k > n) return 0;
return divv(fact[n], mult(fact[k], fact[n - k]));
}
int precomp() {
fact[0] = 1;
for (int i = 1; i < MAXN; i++) fact[i] = mult(fact[i - 1], i);
return 0;
}
const int PRECOMP = precomp();
int main() {
ios::sync_with_stdio(0);
int n, k;
cin >> n >> k;
vector<pair<int, int> > events;
for (int i = 0; i < n; i++) {
int lt, rt;
cin >> lt >> rt;
events.push_back({lt, -1});
events.push_back({rt, 1});
}
sort(events.begin(), events.end());
int ans = 0;
int nactive = 0;
for (pair<int, int> ev : events) {
if (ev.second == -1) {
addeq(ans, cho(nactive, k - 1));
nactive++;
} else {
nactive--;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353, N = 3e5 + 10;
long long fac[N], inv[N], facinv[N];
void init() {
fac[0] = 1;
inv[1] = 1;
facinv[1] = 1;
for (int i = 1; i < N; ++i) {
fac[i] = fac[i - 1] * i % MOD;
}
for (int i = 2; i < N; ++i) {
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
facinv[i] = facinv[i - 1] * inv[i] % MOD;
}
}
long long C(int n, int m) {
if (n == m) return 1ll;
if (n < 0 || n < m) return 0;
return fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
int n, k;
int a[2 * N], d[2 * N], x[2 * N];
int l[N], r[N], val[2 * N], cnt;
int main() {
init();
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &l[i], &r[i]);
val[++cnt] = l[i];
val[++cnt] = r[i];
}
sort(val + 1, val + 1 + cnt);
int all = unique(val + 1, val + 1 + cnt) - val - 1;
for (int i = 1; i <= n; ++i) {
l[i] = lower_bound(val + 1, val + 1 + all, l[i]) - val;
r[i] = lower_bound(val + 1, val + 1 + all, r[i]) - val;
}
for (int i = 1; i <= n; ++i) {
x[l[i]]++;
d[l[i]]++;
d[r[i] + 1]--;
}
for (int i = 1; i <= all; ++i) {
a[i] = a[i - 1] + d[i];
}
long long ans = 0;
for (int i = 1; i <= all; ++i) {
if (a[i] < k) continue;
ans = (ans + C(a[i], k) - C(a[i] - x[i], k) + MOD) % MOD;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 5;
long long fac[N], faci[N];
long long fastex(long long b, long long p) {
if (p == 0) return 1;
long long temp = fastex(b, p / 2);
temp *= temp;
temp %= 998244353;
if (p % 2) temp *= b;
temp %= 998244353;
return temp;
}
long long nCr(long long n, long long r) {
long long tr = fac[n] * faci[r];
tr %= 998244353;
tr *= faci[n - r];
tr %= 998244353;
return tr;
}
long long seg[4 * N];
long long query(long long l, long long u, long long i, long long ll,
long long uu) {
if (l >= ll && u <= uu) return seg[i];
if (l > uu || u < ll) return 0;
return query(l, ((l + u) / 2), (i * 2 + 1), ll, uu) +
query(((l + u) / 2) + 1, u, (i * 2 + 2), ll, uu);
}
long long update(long long l, long long u, long long i, long long x,
long long y) {
if (l >= x && u <= x) return seg[i] = y;
if (l > x || u < x) return seg[i];
return seg[i] = update(l, ((l + u) / 2), (i * 2 + 1), x, y) +
update(((l + u) / 2) + 1, u, (i * 2 + 2), x, y);
}
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
return a > b;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fac[0] = 1;
for (long long i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= 998244353;
}
for (long long i = 0; i < N; i++) faci[i] = fastex(fac[i], 998244353 - 2);
long long n, k;
cin >> n >> k;
pair<long long, long long> a[n];
for (long long i = 0; i < n; i++) cin >> a[i].first >> a[i].second;
sort(a, a + n);
vector<pair<long long, long long>> l, r;
for (long long i = 0; i < n; i++) {
l.push_back({a[i].first, i});
r.push_back({a[i].second, i});
}
sort(l.begin(), l.end());
sort(r.begin(), r.end());
long long i = n - 1;
long long j = n - 1;
long long ans = 0;
while (i >= 0) {
long long curr = l[i].first;
while (j >= 0 && r[j].first >= curr) {
update(0, n - 1, 0, r[j].second, 1);
j--;
}
long long sum = 0;
if (l[i].second > 0) sum = query(0, n - 1, 0, 0, l[i].second - 1);
if (sum >= (k - 1)) ans += nCr(sum, k - 1);
ans %= 998244353;
i--;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int inv[300005 + 3];
long long int fact_inv[300005 + 3];
long long int fact[300005 + 3];
void inverse() {
inv[1] = 1;
int i;
for (i = 2; i <= 300005; i++) {
inv[i] = 998244353 - (998244353 / i) * inv[998244353 % i] % 998244353;
}
}
void factinv() {
int i;
fact_inv[0] = 1;
for (i = 1; i <= 300005; i++) {
fact_inv[i] = fact_inv[i - 1] * inv[i] % 998244353;
}
}
void facto() {
int i;
fact[0] = 1;
for (i = 1; i <= 300005; i++) {
fact[i] = (fact[i - 1] * i) % 998244353;
}
}
long long int count(long long int n, long long int k) {
if (k > n)
return 0LL;
else
return (((fact[n] * fact_inv[max(n - k, 0LL)]) % 998244353) * fact_inv[k]) %
998244353;
}
int main(void) {
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
inverse();
factinv();
facto();
long long int n, i, k, bal = 0, ans = 0, x, y;
cin >> n >> k;
vector<pair<long long int, long long int>> v;
for (i = 0; i < n; i++) {
cin >> x >> y;
++y;
v.push_back({x, 1});
v.push_back({y, -1});
}
sort(v.begin(), v.end());
for (auto x : v) {
if (x.second == 1) {
ans += count(bal, k - 1);
ans %= 998244353;
++bal;
} else
--bal;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
const int maxn = 1e5 + 10;
void pvec(vector<int> v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
long long int gcd(long long int x, long long int y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
long long int binpow(long long int a, long long int b) {
if (b == 0) {
return 1;
}
long long int res = 1;
long long int tmp = binpow(a, b / 2);
res = (tmp * tmp) % mod;
if (b % 2 == 1) {
res = (res * a) % mod;
}
return res;
}
struct node {
int pos;
int l;
int r;
int val;
};
bool comp(node a, node b) {
if (a.val == b.val) return a.l > b.l;
return a.val > b.val;
}
void update(int* BIT, int n, int idx) {
while (idx <= n) {
BIT[idx]++;
idx += idx & (-idx);
}
}
int query(int* BIT, int idx) {
int ans = 0;
while (idx) {
ans += BIT[idx];
idx -= idx & (-idx);
}
return ans;
}
vector<int> solveQuery(int arr[], int n, int QueryL[], int QueryR[],
int QueryK[], int q) {
node a[n + q + 1];
for (int i = 1; i <= n; ++i) {
a[i].val = arr[i - 1];
a[i].pos = 0;
a[i].l = 0;
a[i].r = i;
}
for (int i = n + 1; i <= n + q; ++i) {
a[i].pos = i - n;
a[i].val = QueryK[i - n - 1];
a[i].l = QueryL[i - n - 1];
a[i].r = QueryR[i - n - 1];
}
sort(a + 1, a + n + q + 1, comp);
int BIT[n + 1];
memset(BIT, 0, sizeof(BIT));
int ans[q + 1];
for (int i = 1; i <= n + q; ++i) {
if (a[i].pos != 0) {
int cnt = query(BIT, a[i].r) - query(BIT, a[i].l - 1);
ans[a[i].pos] = cnt;
} else {
update(BIT, n, a[i].r);
}
}
vector<int> ai;
for (int i = 1; i <= q; ++i) {
ai.push_back(ans[i]);
}
return ai;
}
void solve() {
int n, k;
cin >> n >> k;
vector<long long int> nck(n + 1, 0);
long long int kf = 1, kfi;
for (long long int i = 1; i <= k - 1; i++) {
kf = (kf * i) % mod;
}
kfi = binpow(kf, mod - 2);
nck[k - 1] = 1;
for (int i = k; i <= n; i++) {
nck[i] = (nck[i - 1] * i) % mod;
nck[i] = (nck[i] * binpow(i - k + 1, mod - 2)) % mod;
}
vector<pair<int, int> > v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
int r[n];
for (int i = 0; i < n; i++) {
r[i] = v[i].second;
}
int q = n - k + 1;
int ql[q], qr[q], qk[q];
for (int i = k - 1; i < n; i++) {
ql[i - k + 1] = 1;
qr[i - k + 1] = i;
qk[i - k + 1] = v[i].first - 1;
}
vector<int> ai = solveQuery(r, n, ql, qr, qk, q);
long long int ans = 0;
for (int u : ai) {
ans = (ans + nck[u]) % mod;
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
int cnt = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int qq, n, m, k;
long long INF = 998244353;
struct st {
int l;
int r;
};
long long bin_pow(long long base, long long p) {
if (p == 1) {
return base;
}
if (p % 2 == 0) {
long long t = bin_pow(base, p / 2);
return t * t % INF;
} else {
return bin_pow(base, p - 1) * base % INF;
}
}
int main() {
long long ans = 0, anp = 0, x1 = 0, x2 = 0, kp = 0;
cin >> n >> k;
vector<int> v1(n), v2(n);
vector<long long> f(n + 1), pp(n + 1);
for (int i = 0; i < n; i++) {
cin >> v1[i] >> v2[i];
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
f[0] = 1;
for (int i = 1; i <= n; i++) f[i] = (i * f[i - 1]) % INF;
for (int i = k; i <= n; i++) {
pp[i] = f[i] * bin_pow(f[i - k] * f[k] % INF, INF - 2) % INF;
}
int j = 0, i = 0;
while (i < n) {
if (v1[i] <= v2[j]) {
kp++;
i++;
if (kp >= k) {
ans = (ans + pp[kp] - pp[kp - 1] + INF) % INF;
}
}
while (i != n && v1[i] > v2[j]) {
;
kp--;
j++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 998244353;
struct M {
unsigned v;
M(long long a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
M& operator+=(M r) {
if ((v += r.v) >= mod) v -= mod;
return *this;
}
M& operator-=(M r) {
if ((v += mod - r.v) >= mod) v -= mod;
return *this;
}
M& operator*=(M r) {
v = (uint64_t)v * r.v % mod;
return *this;
}
};
uint32_t add(M a, M b) { return (a += b).v; }
uint32_t mul(M a, M b) { return (a *= b).v; }
uint32_t sub(M a, M b) { return (a -= b).v; }
constexpr long long mm = 3e5 + 3;
long long fact[mm], invFact[mm];
void pre() {
fact[0] = invFact[0] = invFact[1] = 1;
for (long long i = 1; i < mm; i++) {
fact[i] = mul(fact[i - 1], i);
}
for (long long i = 2; i < mm; i++) {
invFact[i] = mul((mod - mod / i), invFact[mod % i]);
}
for (long long i = 1; i < mm; i++) {
invFact[i] = mul(invFact[i - 1], invFact[i]);
}
}
long long ncr(long long n, long long r) {
assert(n >= 0 and r >= 0);
if (n < r) return 0;
return mul(mul(fact[n], invFact[r]), invFact[n - r]);
}
void solve() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> v(n + n);
long long i = 0;
for (long long i = 0; i < n; ++i) {
long long x, y;
cin >> x >> y;
v[i << 1] = {x, 0};
v[i << 1 | 1] = {y, 1};
}
sort(v.begin(), v.end());
long long ans = 0;
long long count = 0;
for (auto events : v) {
if (events.second == 1) {
--count;
ans = add(ans, ncr(count, k - 1));
} else {
++count;
}
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
pre();
for (long long i = 1; i <= t; ++i) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
const int c = 300002;
long long fakt[c], inv[c], sum;
int n, k, db;
vector<pair<int, int>> sz;
long long oszt(long long a) {
long long p = mod - 2, ans = 1;
while (p) {
if (p % 2) ans *= a, ans %= mod;
a *= a, a %= mod, p /= 2;
}
return ans;
}
int main() {
cin >> n >> k, k--;
fakt[0] = 1, inv[0] = 1;
for (int i = 1; i <= n; i++) {
fakt[i] = fakt[i - 1] * i % mod;
inv[i] = oszt(fakt[i]);
int x, y;
cin >> x >> y;
sz.push_back({x, 0}), sz.push_back({y, 1});
}
sort(sz.begin(), sz.end());
for (int i = 0; i < 2 * n; i++) {
if (sz[i].second == 0) {
if (db >= k) {
sum += fakt[db] * inv[k] % mod * inv[db - k] % mod, sum %= mod;
}
db++;
} else {
db--;
}
}
cout << sum << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long N = 3e5 + 10, alp = 26;
const long double pi = 3.14159265358979;
long long mod = 998244353;
long long fact[N];
long long binpow(long long a, long long n) {
if (!n) return 1;
long long k = binpow(a, n / 2);
k = (k * k) % mod;
if (n & 1) k = (k * a) % mod;
return k;
}
long long cnk(long long n, long long k) {
if (k > n) return 0;
return (fact[n] * binpow((fact[n - k] * fact[k]) % mod, mod - 2)) % mod;
}
void solve() {
fact[0] = fact[1] = 1;
for (long long i = 2; i < N; ++i) fact[i] = (fact[i - 1] * i) % mod;
long long n, k, res = 0;
cin >> n >> k;
vector<pair<pair<long long, long long>, long long>> s;
for (long long i = 0; i < n; ++i) {
long long l, r;
cin >> l >> r;
s.push_back({{l, 0}, i});
s.push_back({{r, 1}, i});
}
sort(s.begin(), s.end());
set<long long> curr;
for (auto to : s) {
if (to.first.second == 1) {
curr.erase(to.second);
} else {
res += cnk(curr.size(), k - 1);
res %= mod;
curr.insert(to.second);
}
}
cout << res;
}
int32_t main() {
ios_base::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 998244353;
struct M {
unsigned v;
M(long long a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
M& operator+=(M r) {
if ((v += r.v) >= mod) v -= mod;
return *this;
}
M& operator-=(M r) {
if ((v += mod - r.v) >= mod) v -= mod;
return *this;
}
M& operator*=(M r) {
v = (uint64_t)v * r.v % mod;
return *this;
}
};
uint32_t add(M a, M b) { return (a += b).v; }
uint32_t mul(M a, M b) { return (a *= b).v; }
uint32_t sub(M a, M b) { return (a -= b).v; }
constexpr long long mm = 3e5 + 3;
long long fact[mm], invFact[mm];
void pre() {
fact[0] = invFact[0] = invFact[1] = 1;
for (long long i = 1; i < mm; i++) {
fact[i] = mul(fact[i - 1], i);
}
for (long long i = 2; i < mm; i++) {
invFact[i] = mul((mod - mod / i), invFact[mod % i]);
}
for (long long i = 1; i < mm; i++) {
invFact[i] = mul(invFact[i - 1], invFact[i]);
}
}
long long ncr(long long n, long long r) {
assert(n >= 0 and r >= 0);
if (n < r) return 0;
return mul(mul(fact[n], invFact[r]), invFact[n - r]);
}
vector<pair<long long, long long>> v;
const long long N = 3e5 + 5;
vector<int32_t> tree[N << 2];
struct merge_sort_tree {
public:
void build(long long l, long long r, long long node) {
if (l == r) {
tree[node].push_back(v[l].first);
return;
}
long long mid = l + r >> 1, lc = node + node, rc = 1 + lc;
build(l, mid, lc);
build(mid + 1, r, rc);
merge(tree[lc].begin(), tree[lc].end(), tree[rc].begin(), tree[rc].end(),
back_inserter(tree[node]));
}
long long query(long long l, long long r, long long ql, long long qr,
long long val, long long node) {
if (ql > qr) return 0;
if (qr < l || r < ql) return 0;
if (ql <= l and r <= qr) {
long long L = lower_bound(tree[node].begin(), tree[node].end(), val) -
tree[node].begin();
return L;
}
long long mid = l + r >> 1, lc = node + node, rc = 1 + lc;
return (query(l, mid, ql, qr, val, lc) +
query(mid + 1, r, ql, qr, val, rc));
}
};
void solve() {
long long n, k;
cin >> n >> k;
v.resize(n);
for (auto& [x, y] : v) {
cin >> x >> y;
}
sort(v.begin(), v.end(),
[&](pair<long long, long long> a, pair<long long, long long> b) {
if (a.second != b.second) return a.second < b.second;
return a.first < b.first;
});
long long ans = 0;
merge_sort_tree ins;
v.insert(v.begin(), make_pair(0, 0));
ins.build(1, n, 1);
for (long long i = 1; i <= n; ++i) {
long long cnt = ins.query(1, n, i + 1, n, v[i].second + 1, 1);
if (cnt >= k - 1) ans = add(ans, ncr(cnt, k - 1));
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
pre();
for (long long i = 1; i <= t; ++i) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int md = 998244353;
long long int __gcd(long long int a, long long int b) {
if (b == 0) return a;
return __gcd(b, a % b);
}
long long int poww(long long int a, long long int b, long long int md) {
if (b < 0) return 0;
if (a == 0) return 0;
long long int res = 1;
while (b) {
if (b & 1) {
res = (1ll * res * a) % md;
}
a = (1ll * a * a) % md;
b >>= 1;
}
return res;
}
long long int poww(long long int a, long long int b) {
if (b < 0) return 0;
if (a == 0) return 0;
long long int res = 1;
while (b) {
if (b & 1) {
res = (1ll * res * a);
}
a = (1ll * a * a);
b >>= 1;
}
return res;
}
void ainp(long long int arr[], long long int n) {
for (long long int i = 1; i <= n; i++) cin >> arr[i];
}
void disp(long long int arr[], long long int n) {
for (long long int i = 1; i <= n; i++) cout << arr[i] << " ";
cout << "\n";
}
void dispv(vector<long long int> &v) {
for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << "\n";
}
long long int divide(long long int a, long long int b, long long int md) {
long long int rr = a * (poww(b, md - 2, md));
rr %= md;
return rr;
}
const long long int size = 3e5 + 5;
long long int fact[size], invfact[size];
long long int n, k, l, r, ans;
vector<pair<long long int, pair<long long int, long long int> > > moment;
void calc() {
fact[0] = 1;
for (long long int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i % md;
invfact[n] = divide(1, fact[n], md);
for (long long int i = n - 1; i >= 0; i--)
invfact[i] = invfact[i + 1] * (i + 1) % md;
}
long long int ncr(long long int n, long long int r) {
if (n < r) return 0;
return fact[n] * invfact[r] % md * invfact[n - r] % md;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
fun();
cin >> n >> k;
calc();
for (long long int i = 1; i <= n; i++) {
cin >> l >> r;
moment.push_back(make_pair(l, make_pair(0, i)));
moment.push_back(make_pair(r, make_pair(1, i)));
}
sort(moment.begin(), moment.end());
set<long long int> onn;
for (long long int i = 0; i < moment.size(); i++) {
if (moment[i].second.first == 0) {
ans = (ans + ncr(onn.size(), k - 1)) % md;
onn.insert(moment[i].second.second);
} else {
onn.erase(moment[i].second.second);
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e5 + 4;
const int mod = 998244353;
int l[maxn], r[maxn];
pair<int, int> p[maxn];
long long fac[maxn];
long long inv[maxn];
long long qk(long long a, long long n) {
long long res = 1;
while (n) {
if (n & 1) res = res * a % mod;
n >>= 1;
a = a * a % mod;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < maxn; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
inv[maxn - 1] = qk(fac[maxn - 1], mod - 2);
for (int i = maxn - 2; i > 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
long long c(int a, int b) {
if (a < b) return 0;
if (a == b) return 1;
return fac[a] * inv[b] % mod * inv[a - b] % mod;
}
int er[maxn];
int main() {
init();
int n, k;
scanf("%d%d", &n, &k);
vector<int> v;
for (int i = 1; i <= n; ++i) {
er[i] = 0;
scanf("%d%d", &l[i], &r[i]);
v.push_back(l[i]);
v.push_back(r[i]);
p[i] = make_pair(l[i], r[i]);
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
sort(p + 1, p + 1 + n);
int pos = 1;
int num = 0;
long long ans = 0;
int maxi = 0;
for (int i = 1; i <= n; ++i) {
p[i].first = lower_bound(v.begin(), v.end(), p[i].first) - v.begin() + 1;
p[i].second = lower_bound(v.begin(), v.end(), p[i].second) - v.begin() + 1;
maxi = max(p[i].first, maxi);
maxi = max(maxi, p[i].second);
}
for (int i = 1; i <= maxi; ++i) {
int add = 0;
while (pos <= n && p[pos].first <= i) {
add++;
er[p[pos].second + 1]++;
pos++;
}
num -= er[i];
ans += c(num + add, k) - c(num, k) + mod;
num += add;
ans %= mod;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 10;
vector<long long> fact(N);
template <typename T1, typename T2>
void add_self(T1& a, T2 b) {
a += b;
a %= 998244353;
}
long long pow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) {
res = (res * a) % 998244353;
}
b >>= 1;
a = (a * a) % 998244353;
}
return res;
}
long long modInverse(long long a) { return pow(a, (long long)998244353 - 2); }
long long nCr(long long n, long long r) {
if (r > n) {
return 0;
}
if (n < r) {
swap(n, r);
}
long long ways = 0;
ways = (modInverse(fact[r]) * modInverse(fact[n - r])) % 998244353;
ways = (ways * fact[n]) % 998244353;
return ways;
}
void preprocess() {
fact[0] = 1;
for (long long i = 1; i < N; i++) {
fact[i] = (fact[i - 1] * i) % 998244353;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed;
cout.precision(10);
preprocess();
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> a(n);
vector<long long> val(2 * n);
vector<long long> open(2 * n + 10), close(2 * n + 10);
for (long long i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
a[i].second++;
val[2 * i] = a[i].first;
val[2 * i + 1] = a[i].second;
}
sort(val.begin(), val.end());
val.resize(unique(val.begin(), val.end()) - val.begin());
long long end = 0;
for (long long i = 0; i < n; i++) {
a[i].first = lower_bound(val.begin(), val.end(), a[i].first) - val.begin();
a[i].second =
lower_bound(val.begin(), val.end(), a[i].second) - val.begin();
end = max(end, a[i].first);
open[a[i].first]++;
close[a[i].second]++;
}
vector<long long> cnt(2 * n + 10);
sort(a.begin(), a.end());
long long sol = 0;
long long j = 0;
for (long long i = 0; i <= 2 * n; i++) {
while (j < n and a[i].first == i) {
cnt[a[j].first]++;
cnt[a[j].second]--;
j++;
}
if (i > 0) cnt[i] += cnt[i - 1];
if (cnt[i] >= k and open[i] > 0) {
long long mx = open[i];
long long prv = cnt[i] - mx;
add_self(sol, (nCr(cnt[i], k) - nCr(prv, k) + 998244353) % 998244353);
}
}
cout << sol << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
long long mod = 998244353;
long long gt[300004];
pair<int, int> p[300004];
bool cmp1(pair<int, int> x, pair<int, int> y) {
if (x.first != y.first)
return x.first < y.first;
else
return x.second < y.second;
}
struct cmp {
bool operator()(pair<int, int> x, pair<int, int> y) {
return x.second > y.second;
}
};
long long mu(long long x, long long y) {
if (y == 0) return 1;
if (y == 1) return x % mod;
long long t = mu(x, y / 2);
if (y % 2 == 0)
return (t * t) % mod;
else
return ((t * t) % mod * x) % mod;
}
long long chia(long long x, long long y) { return x * mu(y, mod - 2) % mod; }
long long get(long long K, long long N) {
if (K > N) return 0;
return chia(gt[N], (gt[K] * gt[N - K]) % mod);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i, j;
cin >> n >> k;
for (i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
p[i] = make_pair(x, y);
}
pair<int, int> p1;
sort(p + 1, p + 1 + n, cmp1);
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp> h;
gt[0] = 1;
for (i = 1; i <= n; i++) gt[i] = (gt[i - 1] * i) % mod;
long long res = 0;
for (i = 1; i <= n; i++) {
while (true) {
if (h.empty() == 1) break;
p1 = h.top();
if (p1.second < p[i].first)
h.pop();
else
break;
}
j = h.size();
res += get(k - 1, j);
res = res % mod;
h.push(p[i]);
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> fact(4e5);
long long fpow(long long a, long long b, long long mod) {
if (b == 0) return 1;
if (b == 1) return a;
long long prod = fpow(a, b / 2, mod) % mod;
long long ans = (prod * prod) % mod;
if (b % 2) return (ans * a) % mod;
return ans;
}
long long nck(long long n, long long k) {
long long mod = 998244353;
long long res = fact[n];
res %= mod;
res *= fpow(fact[n - k], mod - 2, mod);
res %= mod;
res *= fpow(fact[k], mod - 2, mod);
res %= mod;
return res;
}
int main() {
long long t, n, k;
cin >> n >> k;
long long mod = 998244353;
long long a, b;
vector<pair<long long, char>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({a, 'A'});
v.push_back({b, 'B'});
}
sort(v.begin(), v.end());
fact[0] = 1;
for (int i = 1; i < 4e5; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
long long curr = 0, ans = 0;
for (auto p : v) {
if (p.second == 'B') {
curr--;
} else {
curr++;
if (curr >= k) ans = (ans + nck(curr - 1, k - 1)) % mod;
}
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e5 + 10;
const int mod = 998244353;
const long long INF = 1e9;
map<int, int> in, out;
int n, k;
vector<int> ev;
long long fac[maxn], inv[maxn];
long long ksm(long long a, long long x = mod - 2) {
long long ans = 1;
while (x) {
if (x & 1) ans = ans * a % mod;
x >>= 1, a = a * a % mod;
}
return ans;
}
inline long long C(long long n, long long m) {
if (n < m) return 0;
long long ans = fac[n] * inv[m] % mod;
return ans * inv[n - m] % mod;
}
int main() {
fac[0] = 1;
for (int i = 1; i < maxn; ++i) fac[i] = fac[i - 1] * i % mod;
inv[maxn - 1] = ksm(fac[maxn - 1]);
for (int i = maxn - 2; i >= 0; --i) inv[i] = inv[i + 1] * (i + 1) % mod;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
int l, r;
scanf("%d%d", &l, &r);
++in[l], ++out[r];
}
for (auto& w : in) ev.push_back(w.first);
for (auto& w : out) ev.push_back(w.first);
sort(ev.begin(), ev.end());
ev.erase(unique(ev.begin(), ev.end()), ev.end());
long long ans = 0;
long long cn = 0;
for (auto& w : ev) {
long long bf = cn;
if (in.count(w)) cn += in[w];
ans = (ans + C(cn, k) - C(bf, k)) % mod;
if (out.count(w)) cn -= out[w];
}
if (ans < 0) ans += mod;
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int N = 3e5 + 5;
long long fact[N], invfact[N];
long long pw(long long a, long long b) {
if (b == 0) return 1ll;
if (b & 1) return a * pw(a, b - 1) % mod;
long long x = pw(a, b / 2);
return x * x % mod;
}
long long inv(long long a) { return pw(a, mod - 2); }
long long c(long long p, long long n) {
if (p > n) return 0;
return fact[n] * invfact[n - p] % mod * invfact[p] % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
fact[0] = 1;
invfact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = i * fact[i - 1] % mod;
invfact[i] = inv(fact[i]);
}
int n, k;
cin >> n >> k;
vector<pair<long long, long long> > v(n);
for (int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort((v).begin(), (v).end());
set<pair<long long, int> > rs;
long long ans = 0;
for (int i = 0; i < n; i++) {
while (!rs.empty() && rs.begin()->first < v[i].first) {
rs.erase(rs.begin());
}
rs.insert(make_pair(v[i].second, i));
long long cnt = (long long)rs.size();
ans += c(k - 1, cnt - 1);
ans %= mod;
while (i + 1 < n && v[i].first == v[i + 1].first) {
cnt++;
ans += c(k - 1, cnt - 1);
ans %= mod;
i++;
rs.insert(make_pair(v[i].second, i));
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int pwr(int x, int n) {
if (!n) return 1;
if (n % 2) return 1LL * x * pwr(1LL * x * x % MOD, n / 2) % MOD;
return pwr(1LL * x * x % MOD, n / 2);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<pair<int, int>> ev;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
ev.emplace_back(x, -i);
ev.emplace_back(y, +i);
}
sort(ev.begin(), ev.end());
vector<int> fact(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++) fact[i] = 1LL * fact[i - 1] * i % MOD;
vector<int> mInv(n + 1);
mInv[n] = pwr(fact[n], MOD - 2);
for (int i = n - 1; i >= 0; i--) mInv[i] = 1LL * mInv[i + 1] * (i + 1) % MOD;
auto comb = [&](int n, int k) {
if (k > n) return 0LL;
return 1LL * fact[n] * mInv[k] % MOD * mInv[n - k] % MOD;
};
int ans = 0, cnt = 0;
for (auto e : ev) {
if (e.second < 0) {
cnt++;
ans = (ans + comb(cnt - 1, k - 1)) % MOD;
} else
cnt--;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
long long int fac[300005 + 1];
long long int power(long long int x, long long int y) {
long long int res = 1;
x = x % 998244353;
while (y > 0) {
if (y & 1) res = (res * x) % 998244353;
y = y >> 1;
x = (x * x) % 998244353;
}
return res;
}
long long int modInverse(long long int n) { return power(n, 998244353 - 2); }
long long int nCrModPFermat(long long int n, long long int r) {
if (r == 0) return 1;
return (fac[n] * modInverse(fac[r]) % 998244353 * modInverse(fac[n - r]) %
998244353) %
998244353;
}
bool cmp(const pair<long long int, long long int>& a,
const pair<long long int, long long int>& b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second > b.second;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long int t = 1;
fac[0] = 1;
for (int i = 1; i <= 300005; i++) fac[i] = (fac[i - 1] * i) % 998244353;
while (t--) {
long long int n, k;
cin >> n >> k;
vector<pair<long long int, long long int>> v;
for (long long int i = 0; i < n; i++) {
long long int x, y;
cin >> x >> y;
v.push_back({x, 1});
v.push_back({y, 0});
}
sort(v.begin(), v.end(), cmp);
long long int on = 0, ans = 0;
for (long long int i = 0; i < v.size(); i++) {
if (v[i].second == 1) {
if (on >= k - 1) {
ans = (ans + nCrModPFermat(on, k - 1)) % 998244353;
}
on++;
} else {
on--;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 7;
const long long inf = INF * INF;
const long long MOD = 998244353;
const long long mod = MOD;
const int MAX = 300010;
long long extGCD(long long a, long long mod, long long &x, long long &y) {
if (mod == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(mod, a % mod, y, x);
y -= (a / mod) * x;
return d;
}
long long invmod(long long a, long long mod) {
long long x, y;
extGCD(a, mod, x, y);
x %= mod;
if (x < 0) x += mod;
return x;
}
long long fac[MAX], finv[MAX], inv[MAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = (2); i < (MAX); i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = invmod(i, mod);
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long comb(long long n, long long k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
combinit();
long long n, k;
cin >> n >> k;
set<pair<pair<long long, long long>, long long> > event;
set<long long> st;
long long t = 0;
for (int i = (0); i < (n); i++) {
long long l, r;
cin >> l >> r;
event.insert(make_pair(make_pair(l, 1), i));
event.insert(make_pair(make_pair(r + 1, 0), i));
}
long long ans = 0;
for (auto e : event) {
if (e.first.second == 1) {
if (st.size() + 1 >= k) {
ans = (ans + comb(st.size(), k - 1)) % mod;
}
st.insert(e.second);
} else {
st.erase(e.second);
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
long long bin_pow(long long a, long long b) {
if (b == 0) return 1;
if (b % 2 == 0) {
long long t = bin_pow(a, b / 2);
return t * t % 998244353;
} else
return a * bin_pow(a, b - 1) % 998244353;
}
long long f[300001], f1[300001];
long long co(long long n, long long k) {
long long z = 1;
z *= f[n];
z = z * f1[n - k] % 998244353;
z = z * f1[k] % 998244353;
return z;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long t = 1, n, m, k = 0, x = 0, y = 0, z = 0, l = 0, r = 0, sum = 0,
ans = 0, mn = LLONG_MAX, mx = LLONG_MIN;
cin >> n >> k;
f[0] = 1;
f1[0] = bin_pow(1, 998244353 - 2);
long long zl = 0;
for (long long i = 1; i <= n; i++) {
f[i] = f[i - 1] * i % 998244353;
f1[i] = bin_pow(f[i], 998244353 - 2);
}
vector<pair<long long, long long> > a;
for (int i = 0; i < n; i++) {
cin >> l >> r;
a.push_back({l, 0});
a.push_back({r, 1});
}
sort(a.begin(), a.end());
for (int i = 0; i < 2 * n; i++) {
if (a[i].second == 0)
z++;
else {
if (z >= k) {
if (zl != 0) ans = (ans - (x - co(zl - 1, k - 1))) % 998244353;
x = co(z, k);
ans = (ans + x) % 998244353;
zl = z;
}
z--;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> fac(1e6);
long long power(long long a, long long x, long long p) {
long long ans = 1;
while (x) {
if (x & 1) {
ans = (ans * a) % p;
}
x = x >> 1;
a = (a * a) % p;
}
return ans;
}
long long modInv(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
if (n < r) {
return 0;
}
long long ans = 1;
if (r != 0 && r != n) {
ans = (((fac[n] * modInv(fac[r], p)) % p) * modInv(fac[n - r], p)) % p;
}
return ans;
}
void solve() {
int n, k, p = 998244353, active = 0;
long long ans = 0;
fac[0] = 1;
for (long long i = 1; i < 1e6; i++) {
fac[i] = (fac[i - 1] * i) % p;
}
cin >> n >> k;
map<int, pair<int, int>> time;
while (n--) {
int start, end;
cin >> start >> end;
time[start].first++;
time[end].second++;
}
for (auto t : time) {
active += t.second.first;
if (active >= k) {
ans = (ans + ncr(active, k, p) - ncr(active - t.second.first, k, p)) % p;
ans = (ans + p) % p;
}
active -= t.second.second;
}
cout << ans << endl;
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> F(300000);
long long power(long long a, long long b) {
if (b == 0) {
return 1;
} else if (b == 1) {
return a % 998244353;
}
long long p = power(a, b / 2);
return (((p * p) % 998244353) * power(a, b % 2)) % 998244353;
}
long long inv(long long i) { return power(i, 998244353 - 2); }
long long choose(long long n, long long k) {
return (((F[n] * inv(F[k])) % 998244353) * inv(F[n - k])) % 998244353;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t = 1;
F[0] = 1;
for (int i = 1; i < 300000; i++) {
F[i] = F[i - 1] * i % 998244353;
}
while (t--) {
long long n, k;
cin >> n >> k;
;
long long ans = 0;
vector<pair<long long, int>> a(2 * n);
for (int i = 0; i < n; i++) {
cin >> a[2 * i].first;
cin >> a[2 * i + 1].first;
a[2 * i].second = 0;
a[2 * i + 1].second = 1;
}
sort(a.begin(), a.end());
int cur = 0;
for (int i = 0; i < 2 * n; i++) {
if (a[i].second == 1) {
cur--;
} else {
cur++;
if (cur >= k) {
ans += choose(cur - 1, k - 1);
}
ans %= 998244353;
}
}
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
long long res = 1;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a;
a = a * a;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int mod = 998244353;
vector<long long> fac, facinv;
long long nCk(int n, int k) {
if (k > n) return 0ll;
long long ans = fac[n] * facinv[k] % mod;
ans = ans * facinv[n - k] % mod;
return ans % mod;
}
void factorial(int n) {
fac.resize(n + 1);
facinv.resize(n + 1);
vector<long long> inv(n + 1);
fac[0] = 1;
inv[0] = 1;
facinv[0] = 1;
fac[1] = 1;
inv[1] = 1;
facinv[1] = 1;
for (int i = 2; i <= n; ++i) {
inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
fac[i] = fac[i - 1] * i % mod;
facinv[i] = (facinv[i - 1] * inv[i]) % mod;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k, l, r;
cin >> n >> k;
factorial(400000);
vector<pair<int, int> > v;
for (int i = 0; i < n; ++i) {
cin >> l >> r;
v.push_back({l, 1});
v.push_back({r + 1, -1});
}
sort(v.begin(), v.end());
long long ans = 0, s = 0;
for (int i = 0; i < v.size(); ++i) {
pair<int, int> x = v[i];
s += x.second;
ans = (ans + max(x.second, 0) * 1ll * nCk(s - 1, k - 1)) % mod;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
const long long mod = 1000 * 1000 * 1000 + 7;
const long long mod1 = 998244353;
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
using namespace std;
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y / 2;
x = (x * x) % p;
}
return res;
}
long long modInverse(long long n, long long p) { return power(n, p - 2, p); }
long long fact[300005] = {};
long long nCr(long long n, long long r, long long p) {
return (fact[n] * modInverse(fact[r], p) % p * modInverse(fact[n - r], p) %
p) %
p;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
vector<pair<long long, long long> > swp;
long long n, k;
cin >> n >> k;
for (int(i) = (0); (i) < (n); ++(i)) {
long long x, y;
cin >> x >> y;
swp.push_back({x, 0});
swp.push_back({y, 1});
}
sort(swp.begin(), swp.end());
long long sum = 0;
long long cnt = 0;
fact[0] = 1;
for (long long i = 1; i <= 300005; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= mod1;
}
for (int i = 0; i < int((swp).size()); i++) {
if (swp[i].second == 0) {
if (cnt >= k - 1) sum += nCr(cnt, k - 1, mod1);
sum %= mod1;
cnt += 1;
} else {
cnt -= 1;
}
}
cout << sum % mod1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
ll sum_mod(ll a, ll b) { return (a + b + MOD) % MOD; }
ll mul_mod(ll a, ll b) { return (a * b) % MOD; }
ll pow_mod(ll exp, ll p) {
ll res = 1LL;
ll cur_e = exp;
while (p != 0LL) {
if (p % 2 == 1) {
res = mul_mod(res, cur_e);
}
cur_e = mul_mod(cur_e, cur_e);
p >>= 1LL;
}
return res;
}
ll inv_mod(ll a) { return pow_mod(a % MOD, MOD - 2); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<pair<int, int>> q;
for (int i = 0; i < n; i++) {
int l, r;
cin >> l >> r;
q.push_back({l, 0});
q.push_back({r, 1});
}
sort(q.begin(), q.end());
vector<ll> cur_C(2 * n, 0LL);
cur_C[k] = 1LL;
for (int i = k + 1; i < 2 * n; i++) {
cur_C[i] = mul_mod(cur_C[i - 1], mul_mod(i - 1, inv_mod(i - k)));
}
int cnt = 0;
ll ans = 0;
for (int i = 0; i < 2 * n; i++) {
pair<int, int> tmp = q[i];
int pos = tmp.first;
if (tmp.second == 0) {
cnt++;
ans = sum_mod(ans, cur_C[cnt]);
} else {
cnt--;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, cnt = 0, a[300010 * 2], l[300010], r[300010], cl[300010 * 2],
cr[300010 * 2];
long long f[300010], inv[300010];
int md = 998244353;
long long qpow(long long aa, long long bb) {
long long ret = 1;
aa %= md;
while (bb) {
if (bb & 1) ret = ret * aa % md;
aa = aa * aa % md;
bb /= 2;
}
return ret % md;
}
long long C(int x, int y) {
if (x < y) return 0;
if (x == y) return 1;
return f[x] * inv[y] % md * inv[x - y] % md;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &l[i], &r[i]);
a[++cnt] = l[i];
a[++cnt] = r[i];
}
f[0] = 1;
for (long long i = 1; i <= n; i++) f[i] = f[i - 1] * i % md;
for (int i = 1; i <= n; i++) inv[i] = qpow(f[i], md - 2 % md);
sort(a + 1, a + cnt + 1);
cnt = unique(a + 1, a + cnt + 1) - a - 1;
for (int i = 1; i <= n; i++) {
l[i] = lower_bound(a + 1, a + cnt + 1, l[i]) - a;
r[i] = lower_bound(a + 1, a + cnt + 1, r[i]) - a;
cl[l[i]]++;
cr[r[i]]++;
}
long long ans = 0;
int t = 0, nt = 0;
for (int i = 1; i <= cnt; i++) {
t -= cr[i - 1];
nt = cl[i];
ans = (ans + C(nt + t, k) - C(t, k) + md) % md;
t += nt;
}
printf("%lld", ans % md);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long fact[300005], mmi[300005];
vector<pair<int, int> > X;
long long power(long long n, long long expo) {
long long ans = 1;
while (expo) {
if (expo % 2) ans = ans * n % MOD;
n = n * n % MOD;
expo /= 2;
}
return ans;
}
long long nCr(int n, int r) {
if (n < r) return 0;
return fact[n] * mmi[r] % MOD * mmi[n - r] % MOD;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n, k;
cin >> n >> k;
fact[0] = mmi[0] = 1;
for (int i = 1; i <= 300000; i++) {
fact[i] = fact[i - 1] * i % MOD;
mmi[i] = power(fact[i], MOD - 2);
}
while (n--) {
int x, y;
cin >> x >> y;
X.push_back({x, -1});
X.push_back({y, 1});
}
int open = 0;
long long ans = 0;
sort(X.begin(), X.end());
for (auto x : X) {
int f = x.second;
if (f == -1) {
open++;
continue;
}
open--;
ans += nCr(open, k - 1);
}
cout << ans % MOD << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 6e5 + 2;
long long fac[N];
const long long mod = 998244353;
unsigned long long power(unsigned long long x, long long y) {
unsigned long long res = 1;
x = x % mod;
while (y > 0) {
if (y & 1) res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
unsigned long long modInverse(unsigned long long n) {
return power(n, mod - 2);
}
void precalFact(long long n) {
fac[0] = 1;
for (long long i = 1; i < n; i++) {
fac[i] = i * fac[i - 1];
fac[i] %= mod;
}
}
unsigned long long nCrModFormat(unsigned long long n, long long r) {
if (n < r) return 0;
if (r == 0) return 1;
return (fac[n] * modInverse(fac[r]) % mod * modInverse(fac[n - r]) % mod) %
mod;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
precalFact(2 * n + 1);
vector<pair<long, long>> a(n);
set<long long> s;
map<long long, long long> mp;
for (long long i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
s.insert(a[i].first);
s.insert(a[i].second);
}
long long p = 0;
for (auto &x : s) mp[x] = p++;
vector<long long> tot(2 * n + 1, 0), st(2 * n, 0);
for (long long i = 0; i < n; i++) {
a[i].first = mp[a[i].first];
a[i].second = mp[a[i].second];
tot[a[i].first]++;
tot[a[i].second + 1]--;
st[a[i].first]++;
}
for (long long i = 1; i < 2 * n; i++) tot[i] += tot[i - 1];
long long ans = 0;
for (long long i = 0; i < 2 * n; i++) {
long long v = nCrModFormat(tot[i], k) - nCrModFormat(tot[i] - st[i], k);
while (v < 0) v += mod;
ans += v;
ans = ans % mod;
if (ans < 0) {
cout << i << "\n";
break;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 998244353;
struct M {
unsigned v;
M(long long a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
M& operator+=(M r) {
if ((v += r.v) >= mod) v -= mod;
return *this;
}
M& operator-=(M r) {
if ((v += mod - r.v) >= mod) v -= mod;
return *this;
}
M& operator*=(M r) {
v = (uint64_t)v * r.v % mod;
return *this;
}
};
uint32_t add(M a, M b) { return (a += b).v; }
uint32_t mul(M a, M b) { return (a *= b).v; }
uint32_t sub(M a, M b) { return (a -= b).v; }
constexpr long long mm = 3e5 + 3;
long long fact[mm], invFact[mm];
void pre() {
fact[0] = invFact[0] = invFact[1] = 1;
for (long long i = 1; i < mm; i++) {
fact[i] = mul(fact[i - 1], i);
}
for (long long i = 2; i < mm; i++) {
invFact[i] = mul((mod - mod / i), invFact[mod % i]);
}
for (long long i = 1; i < mm; i++) {
invFact[i] = mul(invFact[i - 1], invFact[i]);
}
}
long long ncr(long long n, long long r) {
assert(n >= 0 and r >= 0);
if (n < r) return 0;
return mul(mul(fact[n], invFact[r]), invFact[n - r]);
}
void solve() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> v(n);
for (auto& [x, y] : v) {
cin >> x >> y;
}
sort(v.begin(), v.end());
long long ans = 0;
priority_queue<long long, vector<long long>, greater<long long>> q;
for (long long i = 0; i < n; ++i) {
while (!q.empty() && q.top() < v[i].first) {
q.pop();
}
long long cnt = q.size();
q.push(v[i].second);
if (cnt >= k - 1) {
ans = add(ans, ncr(cnt, k - 1));
}
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
pre();
for (long long i = 1; i <= t; ++i) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long fact[300005];
long long mod = 998244353;
bool omp(pair<int, int> a, pair<int, int> b) {
if (a.first < b.first) return 1;
if (a.first > b.first) return 0;
if (a.second > b.second) return 1;
return 0;
}
long long power(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b = b >> 1;
}
return res;
}
long long mod_inverse(long long a) { return power(a, mod - 2); }
long long ncr(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a % mod;
return ((fact[a] * mod_inverse(fact[a - b])) % mod * mod_inverse(fact[b])) %
mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
fact[0] = fact[1] = 1;
for (long long i = 1; i <= 300002; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
int n, k;
cin >> n >> k;
vector<pair<int, int>> arr(2 * n);
for (int i = 0; i < arr.size(); i += 2) {
cin >> arr[i].first >> arr[i + 1].first;
arr[i].second = 1;
arr[i + 1].second = 0;
}
sort(arr.begin(), arr.end(), omp);
long long count = 0;
long long on = 0;
for (int i = 0; i < arr.size(); i++) {
if (arr[i].second == 1) {
if (on >= k - 1) {
count = (count + ncr(on, k - 1)) % mod;
}
on++;
} else {
on--;
}
}
cout << count << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300000;
const long long oo = 998244353;
int n, k;
long long frac[maxn + 1];
int l[maxn], r[maxn];
vector<int> v;
set<int> cur;
vector<int> cur_ad[maxn * 2], cur_rm[maxn * 2];
set<int> both;
vector<int> both_ad[maxn * 2], both_rm[maxn * 2];
long long Ck[maxn + 1];
int index(int x) {
return distance(v.begin(), lower_bound(begin(v), end(v), x));
}
void init() {
frac[0] = 1;
for (int i = 1; i < (maxn + 1); ++i) frac[i] = (frac[i - 1] * i) % oo;
}
long long pow(long long x, long long y) {
if (y == 0) return 1;
long long p = pow(x, y / 2);
p = p * p % oo;
if (y % 2 == 1) p = p * x % oo;
return p;
}
long long C(long long n, long long k) {
if (n < k) return 0;
if (k == 0 or k == n) return 1;
long long tuso = frac[n];
long long mauso = frac[k] * frac[n - k] % oo;
return tuso * pow(mauso, oo - 2) % oo;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
init();
cin >> n >> k;
for (int i = 0; i < (n); ++i) {
cin >> l[i] >> r[i];
v.push_back(l[i]), v.push_back(r[i]);
}
for (int i = 0; i < (maxn + 1); ++i) Ck[i] = C(i, k);
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), v.end());
for (int i = 0; i < (n); ++i) {
l[i] = index(l[i]);
r[i] = index(r[i]);
cur_ad[l[i]].push_back(i);
cur_rm[r[i]].push_back(i);
if (l[i] != r[i]) {
both_ad[l[i] + 1].push_back(i);
both_rm[r[i]].push_back(i);
}
}
cur.clear();
both.clear();
long long res = 0;
for (int i = 0; i < ((int)(v).size()); ++i) {
for (int v : cur_ad[i]) cur.insert(v);
for (int v : both_ad[i]) both.insert(v);
res = (res + (long long)Ck[(int)(cur).size()] -
(long long)Ck[(int)(both).size()] + oo * oo) %
oo;
for (int v : cur_rm[i]) cur.erase(v);
for (int v : both_rm[i]) both.erase(v);
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
long long strToInt(string& a) {
stringstream x(a);
long long b;
x >> b;
return b;
}
void readI(long long& a) { cin >> a; }
void readI(long long& a, long long& b) { cin >> a >> b; }
void readI(long long& a, long long& b, long long& c) { cin >> a >> b >> c; }
vector<long long> readVI(long long n) {
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
return a;
}
vector<vector<long long> > readVVI(long long n, long long m) {
vector<vector<long long> > a(n, vector<long long>(m));
for (long long i = 0; i < n; i++) a[i] = readVI(m);
return a;
}
vector<long long> readVLL(long long n) {
vector<long long> a(n);
for (long long i = 0; i < n; i++) cin >> a[i];
return a;
}
vector<vector<long long> > readVVLL(long long n, long long m) {
vector<vector<long long> > a(n, vector<long long>(m));
for (long long i = 0; i < n; i++) a[i] = readVLL(m);
return a;
}
void print(vector<long long>& a) {
for (auto el : a) {
cout << el << ' ';
}
cout << '\n';
}
void print(vector<long long>& a, long long n) {
long long cnt = 0;
for (auto el : a) {
if (cnt++ == n) break;
cout << el << ' ';
}
cout << '\n';
}
const long long MOD = 998244353;
const long long INF = INT_MAX;
const long long INFF = INT64_MAX;
const double EPS = 1e-9;
const double PI = acos(-1.0);
vector<long long> fact;
long long modInverse(long long a) {
long long ans = 1, pow = MOD - 2;
a = a % MOD;
while (pow > 0) {
if (pow & 1) ans = (ans * a) % MOD;
pow >>= 1;
a = (a * a) % MOD;
}
return ans % MOD;
}
long long add(long long n, long long r) {
if (r > n) return 0;
return ((fact[n] * modInverse(fact[r])) % MOD *
(modInverse(fact[n - r]) % MOD)) %
MOD;
}
void go() {
long long n, m;
cin >> n >> m;
vector<vector<long long> > lamps = readVVLL(n, 2);
set<long long> nums;
unordered_map<long long, long long> index;
for (auto el1 : lamps)
for (auto el : el1) nums.insert(el);
long long idx = 0;
for (auto el : nums) {
index[el] = idx++;
}
n = idx;
vector<long long> dp(n + 10, 0), reduce(n + 10, 0);
long long ans = 0;
fact.resize(1e6);
fact[1] = fact[0] = 1;
for (long long i = 1; i < 1e6; i++) fact[i] = fact[i - 1] * i % MOD;
for (auto el : lamps) {
dp[index[el[0]]]++, dp[index[el[1]] + 1]--, reduce[index[el[1]] + 1]++;
}
for (long long i = 0; i < n - 1; i++) {
if (i > 0) dp[i] += dp[i - 1];
if (dp[i] >= m) {
ans = (MOD + add(dp[i], m) - add(dp[i] - reduce[i + 1], m) + ans) % MOD;
}
}
ans = (MOD + ans + add(reduce[n], m)) % MOD;
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long T = 1;
while (T--) go();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int MAXN = 3e5 + 5;
long long factorial[MAXN], inverse[MAXN];
long long power(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b % 2 == 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return res;
}
long long nCk(int n, int k) {
if (k < 0 || k > n) {
return 0;
}
long long ans = factorial[n];
ans = (ans * inverse[n - k]) % mod;
ans = (ans * inverse[k]) % mod;
return ans;
}
void numberOfWays(vector<pair<int, int> > lines, int K, int N) {
sort(lines.begin(), lines.end());
long long total_case = 0;
multiset<int> m;
for (int i = 0; i < N; i++) {
while (!m.empty() && (*m.begin() < lines[i].first)) {
m.erase(m.begin());
}
total_case += nCk(m.size(), K - 1);
total_case += mod;
total_case %= mod;
m.insert(lines[i].second);
}
cout << total_case << endl;
}
void preCompute() {
long long fact = 1;
factorial[0] = 1;
inverse[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact = (fact * i) % mod;
factorial[i] = fact;
inverse[i] = power(factorial[i], mod - 2);
}
}
int main() {
int N = 3, K = 2;
cin >> N >> K;
vector<pair<int, int> > lines;
preCompute();
for (int i = 0; i < N; i++) {
long long l, r;
cin >> l >> r;
lines.push_back({l, r});
}
numberOfWays(lines, K, N);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long N = 3e5 + 3;
long long f[N], inv[N];
long long modpow(long long a, long long b) {
long long res = 1;
while (b) {
if (b % 2) res = res * a % mod;
a = a * a % mod;
b = b / 2;
}
return res;
}
void fact() {
f[0] = 1, f[1] = 1;
for (long long i = 2; i < N; i++) f[i] = i * f[i - 1] % mod;
}
void inverse() {
inv[0] = 1, inv[1] = 1;
for (long long i = 2; i < N; i++) inv[i] = modpow(f[i], mod - 2);
}
long long ncr(long long a, long long b) {
if (a < b) return 0;
return (f[a] * inv[b] % mod) * inv[a - b] % mod;
}
void solve() {
long long n, k;
cin >> n >> k;
pair<long long, long long> a[n];
for (long long i = 0; i < (n); i++) cin >> a[i].first >> a[i].second;
sort(a, a + n);
multiset<long long> ends;
long long ans = 0;
for (long long i = 0; i < (n); i++) {
while (ends.begin() != ends.end() && a[i].first > *ends.begin())
ends.erase(ends.begin());
ends.insert(a[i].second);
long long cnt = ends.size();
if (cnt >= k) ans = (ans + ncr(cnt - 1, k - 1)) % mod;
}
cout << ans << "\n";
return;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fact();
inverse();
long long t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long N = 100311;
long long fact[300005], inv[300005];
long long inverse(long long a) {
long long ret = 1;
for (long long b = mod - 2; b > 0; b /= 2) {
if (b % 2) ret = ret * a % mod;
a = a * a % mod;
}
return ret;
}
long long C(long long n, long long k) {
if (n < k) return 0;
return fact[n] * inv[k] % mod * inv[n - k] % mod;
}
long long binpow(long long x, long long y) {
if (y == 0) return 1;
if (y == 1)
return x % mod;
else if (y % 2 == 0) {
long long w = binpow(x, y / 2) % mod;
return (w * w) % mod;
} else
return ((x % mod) * (binpow(x, y - 1) % mod)) % mod;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> v;
for (long long i = 1; i <= n; i++) {
long long l, r;
cin >> l >> r;
v.push_back({l, 1});
v.push_back({r + 1, -1});
}
fact[0] = inv[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = inverse(fact[i]);
}
sort(v.begin(), v.end());
long long ans = 0;
long long total = 0, nw = 0;
for (long long i = 0; i < 2 * n; i++) {
if (v[i].second == -1)
total--;
else {
total++;
nw++;
}
nw = min(nw, total);
if (total >= k) {
ans += (C(total, k) - C(total - nw, k) + mod);
ans %= mod;
nw = 0;
}
}
cout << ans % mod;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long fast_pow(long long x, long long y, long long p);
long long factorial[300010];
long long modInverse(long long n, long long p) { return fast_pow(n, p - 2, p); }
long long fermatNCR(long long n, long long r, long long p) {
if (r == 0) return 1;
if (n < r) return 0;
return (factorial[n] * modInverse(factorial[r], p) % p *
modInverse(factorial[n - r], p) % p) %
p;
}
void solve() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> a(n);
priority_queue<long long, vector<long long>, greater<long long>> pq;
for (long long i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
long long ans = 0;
factorial[0] = 1;
for (long long i = 1; i < 300010; i++)
factorial[i] = (factorial[i - 1] * i) % 998244353;
sort((a).begin(), (a).end());
for (long long i = 0; i < n; i++) {
pq.emplace(a[i].second);
while (pq.top() < a[i].first) {
pq.pop();
}
ans += fermatNCR(pq.size() - 1, k - 1, 998244353);
ans %= 998244353;
}
cout << ans << "\n";
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long test = 1;
for (long long i = 1; i <= test; i++) {
solve();
}
return 0;
}
long long fast_pow(long long x, long long y, long long p) {
long long ret = 1;
x = x % p;
while (y > 0) {
if (y & 1) ret = (ret * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return ret;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = (int)3e5 + 10;
vector<pair<int, bool> > v;
long long sil[maxn];
long long odwsil[maxn];
int k;
long long fastpow(long long a, long long p) {
long long ret = 1, pot = a;
while (p) {
if (p & 1) ret = (ret * pot) % mod;
pot = (pot * pot) % mod;
p >>= 1;
}
return ret;
}
void prep(int n) {
sil[0] = 1;
for (long long i = 1; i <= n; i++) sil[i] = (i * sil[i - 1]) % mod;
odwsil[n] = fastpow(sil[n], mod - 2);
for (long long i = n - 1; i > 0; i--)
odwsil[i] = (odwsil[i + 1] * (i + 1)) % mod;
odwsil[0] = 1;
}
long long dwumian(long long en, long long ka) {
if (en - ka < 0) printf("KUPA");
long long mianownik = (odwsil[ka] * odwsil[en - ka]) % mod;
return (sil[en] * mianownik) % mod;
}
int main() {
int n;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
int a, b;
scanf("%d %d", &a, &b);
v.push_back({a, 0});
v.push_back({b, 1});
}
sort(v.begin(), v.end());
long long stare = 0;
long long wyn = 0;
prep(n);
for (auto it : v) {
if (it.second == 0) {
if (stare >= (k - 1)) wyn = (wyn + dwumian(stare, k - 1)) % mod;
++stare;
}
if (it.second == 1) --stare;
}
printf("%lld", wyn);
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using lld = long double;
const ll oo = 0x3f3f3f3f;
const ll MOD = 998244353;
struct ncr {
vector<ll> fact;
ll p;
ncr(ll mod, ll range) {
range += 2;
p = mod;
fact.resize(range);
fact[0] = fact[1] = 1;
for (ll i = 2; i < range; i++) fact[i] = (fact[i - 1] * i) % p;
}
ll pw(ll a, ll b) {
if (b == 0) return 1;
if (b == 1) return a;
ll x = pw(a, b / 2) % p;
if (b & 1)
return (a * ((x * x) % p)) % p;
else
return (x * x) % p;
}
ll C(ll n, ll r) {
if (r > n) return 0;
ll res = fact[n];
if (r == 0 || r == n) return 1;
if (r == 1 || r == n - 1) return n;
res = (res * ((pw(fact[n - r], p - 2) * pw(fact[r], p - 2)) % p)) % p;
return res;
}
};
vector<array<ll, 3>> e;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ncr* cal = new ncr(MOD, 3e5 + 10);
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> intervals(n);
for (auto& [l, r] : intervals) {
cin >> l >> r;
}
sort(intervals.begin(), intervals.end());
for (ll i = 0; i < n; i++) {
e.push_back({intervals[i].first, 0, i});
e.push_back({intervals[i].second, 1, i});
}
sort(e.begin(), e.end());
set<pair<ll, ll>> hs;
ll ans = 0;
ll so_far = 0;
for (const auto& [val, _, id] : e) {
if (hs.count({id, val}))
hs.erase({id, val});
else {
ll x = hs.size();
ans = (ans + cal->C(x, k - 1)) % MOD;
hs.insert({id, intervals[id].second});
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;
const ll MX = 3e5 + 5;
ll fct[MX] = {1}, inv[MX] = {1};
ll power(ll a, ll b, ll p = 1) {
if (b == 0) return 1;
ll res = power(a, b / 2) % MOD;
if (b & 1) {
return (((res * res) % MOD) * a) % MOD;
} else {
return (((res * res) % MOD) * 1) % MOD;
}
}
void func() {
ll i;
fct[1] = 1;
for (i = 2; i < MX; i++) {
fct[i] = fct[i - 1] * i;
fct[i] %= MOD;
}
for (i = 1; i < MX; i++) {
inv[i] = power(fct[i], MOD - 2);
}
}
int main() {
func();
ll n, i, k;
cin >> n >> k;
vector<pair<ll, ll>> vt;
for (i = 0; i < n; i++) {
ll l, r;
cin >> l >> r;
vt.push_back({l, -1});
vt.push_back({r, 1});
}
sort(vt.begin(), vt.end());
ll cur = 0, ans = 0;
for (i = 0; i < vt.size(); i++) {
if (vt[i].second < 0) {
cur++;
} else {
cur--;
if (cur >= k - 1)
ans += (((fct[cur] * inv[k - 1]) % MOD) * inv[cur - k + 1]) % MOD;
ans %= MOD;
}
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 998244353;
struct M {
unsigned v;
M(long long a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
M& operator+=(M r) {
if ((v += r.v) >= mod) v -= mod;
return *this;
}
M& operator-=(M r) {
if ((v += mod - r.v) >= mod) v -= mod;
return *this;
}
M& operator*=(M r) {
v = (uint64_t)v * r.v % mod;
return *this;
}
};
uint32_t add(M a, M b) { return (a += b).v; }
uint32_t mul(M a, M b) { return (a *= b).v; }
uint32_t sub(M a, M b) { return (a -= b).v; }
constexpr long long mm = 3e5 + 3;
long long fact[mm], invFact[mm];
void pre() {
fact[0] = invFact[0] = invFact[1] = 1;
for (long long i = 1; i < mm; i++) {
fact[i] = mul(fact[i - 1], i);
}
for (long long i = 2; i < mm; i++) {
invFact[i] = mul((mod - mod / i), invFact[mod % i]);
}
for (long long i = 1; i < mm; i++) {
invFact[i] = mul(invFact[i - 1], invFact[i]);
}
}
long long ncr(long long n, long long r) {
assert(n >= 0 and r >= 0);
if (n < r) return 0;
return mul(mul(fact[n], invFact[r]), invFact[n - r]);
}
void solve() {
long long n, k;
cin >> n >> k;
vector<pair<long long, long long>> v(n);
for (auto& [x, y] : v) {
cin >> x >> y;
}
sort(v.begin(), v.end(),
[&](pair<long long, long long> a, pair<long long, long long> b) {
if (a.second != b.second) return a.second < b.second;
return a.first < b.first;
});
long long ans = 0;
multiset<long long> st;
for (long long i = n - 1; i >= 0; --i) {
long long x = v[i].second;
while (!st.empty() && *st.rbegin() > x) {
st.erase(*st.rbegin());
}
long long cnt = st.size();
if (cnt >= k - 1) ans = add(ans, ncr(cnt, k - 1));
st.insert(v[i].first);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
pre();
for (long long i = 1; i <= t; ++i) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 3e5 + 10;
const long long mod = 998244353;
struct node {
long long left;
long long right;
};
node a[maxn];
long long vis[maxn * 2];
long long x[maxn * 2];
long long y[maxn * 2];
long long A[maxn];
long long B[maxn];
int F[maxn], Finv[maxn], inv[maxn];
void init() {
inv[1] = 1;
for (int i = 2; i < maxn; i++) {
inv[i] = (mod - mod / i) * 1ll * inv[mod % i] % mod;
}
F[0] = Finv[0] = 1;
for (int i = 1; i < maxn; i++) {
F[i] = F[i - 1] * 1ll * i % mod;
Finv[i] = Finv[i - 1] * 1ll * inv[i] % mod;
}
}
int comb(int n, int m) {
if (m < 0 || m > n) return 0;
return F[n] * 1ll * Finv[n - m] % mod * Finv[m] % mod;
}
int main() {
init();
memset(vis, 0, sizeof(vis));
long long n, k;
scanf("%lld%lld", &n, &k);
long long count_ = 0;
for (long long i = 0; i < n; i++) {
scanf("%lld %lld", &a[i].left, &a[i].right);
x[count_] = a[i].left;
y[count_] = x[count_];
count_++;
x[count_] = a[i].right;
y[count_] = x[count_];
count_++;
}
sort(y, y + count_);
long long len = unique(y, y + count_) - y;
for (long long i = 0; i < count_; i++) {
x[i] = lower_bound(y, y + len, x[i]) - y;
if (i % 2 == 0) {
A[i / 2] = x[i];
} else if (i % 2 == 1) {
B[i / 2] = x[i];
}
}
sort(A, A + count_ / 2);
sort(B, B + count_ / 2);
count_ = count_ / 2;
long long lx = 0;
long long ly = 0;
long long num = 0;
long long ans = 0;
while (lx < count_ && ly < count_) {
if (A[lx] > B[ly]) {
num--;
ly++;
} else if (A[lx] <= B[ly]) {
num++;
if (num >= k) {
ans = (ans + comb(num - 1, k - 1) % mod) % mod;
}
lx++;
}
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const int MAX = 1000000;
class MergeSortTree {
public:
vector<vector<int>> t;
MergeSortTree(int n) { t = vector<vector<int>>(4 * n); }
void build(vector<int>& a, int v, int tl, int tr) {
if (tl == tr) {
t[v] = vector<int>(1, a[tl]);
} else {
int tm = (tl + tr) / 2;
build(a, v * 2, tl, tm);
build(a, v * 2 + 1, tm + 1, tr);
merge(t[v * 2].begin(), t[v * 2].end(), t[v * 2 + 1].begin(),
t[v * 2 + 1].end(), back_inserter(t[v]));
}
}
int query(int v, int tl, int tr, int l, int r, int x) {
if (l > r) return 0;
if (l == tl && r == tr) {
int cnt = t[v].end() - lower_bound(t[v].begin(), t[v].end(), x);
return cnt;
}
int tm = (tl + tr) / 2;
return query(v * 2, tl, tm, l, min(r, tm), x) +
query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r, x);
}
};
long long pwr(int a, int n) {
if (n == 0) return 1 % MOD;
long long q = pwr(a, n / 2);
q = q * q % MOD;
if (n & 1) q = q * a % MOD;
return q;
}
long long inv(long long a) { return pwr(a, MOD - 2); }
vector<long long> fact(MAX);
vector<long long> ifac(MAX);
void init() {
fact[0] = 1;
for (int i = 1; i < MAX; i++) {
fact[i] = fact[i - 1] * i % MOD;
}
for (int i = 0; i < MAX; i++) ifac[i] = inv(fact[i]);
}
long long C(int n, int k) {
if (k > n) return 0;
return ((fact[n] * ifac[k] % MOD) * ifac[n - k] % MOD);
}
void solve() {
init();
int n, k;
cin >> n >> k;
vector<pair<int, int>> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
a[i] = v[i].second;
}
MergeSortTree tree(n + 2);
tree.build(a, 1, 1, n);
long long ans = 0;
for (int i = 1; i <= n; i++) {
int el = v[i].first;
int rt = tree.query(1, 1, n, 1, i, el) - 1;
ans = (ans + C(rt, k - 1)) % MOD;
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long const mod = 998244353;
inline long long add(long long a, long long b) {
return ((a % mod) + (b % mod) + mod) % mod;
}
inline long long mul(long long a, long long b) {
return (((a % mod) * (b % mod)) % mod + mod) % mod;
}
inline long long sub(long long a, long long b) {
return ((a % mod) - (b % mod) + mod) % mod;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long power(long long x, long long y, long long m) {
if (y == 0) return 1;
long long p = power(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
long long modInv(long long x) { return power(x, mod - 2, mod) % mod; }
long long func(long long a[], long long n, long long i, long long c,
long long dp[][3]) {
if (i == n) return 0;
if (dp[i][c] != -1) return dp[i][c];
long long ans = func(a, n, i + 1, c, dp);
if (c == 1) {
ans = max(ans, a[i] + func(a, n, i + 1, 2, dp));
} else
ans = max(ans, func(a, n, i + 1, 1, dp) - a[i]);
dp[i][c] = ans;
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n, k;
cin >> n >> k;
vector<pair<long long, long long> > v, v1;
long long fact[n + 1];
fact[0] = 1;
for (long long i = 1; i <= n; i++) fact[i] = mul(fact[i - 1], i);
for (long long i = 0; i < n; i++) {
long long l, r;
cin >> l >> r;
v.push_back(make_pair(l, r));
v1.push_back(make_pair(l, 1));
v1.push_back(make_pair(r, 2));
}
sort(v1.begin(), v1.end());
long long count = 0;
long long ans = 0;
for (long long i = 0; i < v1.size(); i++) {
if (v1[i].second == 2)
count--;
else {
count++;
if (count >= k) {
long long num = fact[count - 1];
long long den = mul(fact[k - 1], fact[count - k]);
long long z = mul(num, modInv(den));
ans = add(ans, z);
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long int MOD = 998244353;
const int N = 1e6 + 6;
long long int fact[N], invfact[N];
long long int bigMod(long long int a, long long int b) {
long long int p;
if (b == 0) return 1;
p = (bigMod(a, b / 2) % MOD);
p = (p * p) % MOD;
if (b & 1) p = (p * a) % MOD;
return p;
}
long long int modInverse(long long int x) { return bigMod(x, MOD - 2); }
long long int ncr(int n, int r) {
if (n < r || n < 0 || r < 0) return 0;
long long int up = fact[n];
long long int down = (invfact[r] * invfact[n - r]) % MOD;
return (up * down) % MOD;
}
void pre() {
fact[0] = 1;
for (int i = 1; i < N; i++) fact[i] = (fact[i - 1] * i) % MOD;
invfact[N - 1] = modInverse(fact[N - 1]);
for (int i = N - 2; i >= 0; i--)
invfact[i] = (invfact[i + 1] * (i + 1)) % MOD;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
pre();
int n, k;
cin >> n >> k;
vector<pair<int, int> > vec;
for (int i = 0; i < n; i++) {
int l, r;
cin >> l >> r;
vec.push_back({l, 0});
vec.push_back({r, 1});
}
sort(vec.begin(), vec.end());
long long int ans = 0;
int now = 0;
for (auto x : vec) {
int typ = x.second;
if (typ == 0) {
ans += ncr(now, k - 1);
ans %= MOD;
now++;
} else
now--;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
inline long long add(long long a, long long b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
inline long long sub(long long a, long long b) {
a -= b;
if (a < 0) a += mod;
return a;
}
inline long long mul(long long a, long long b) {
return (long long)((long long)a * b % mod);
}
class node {
public:
long long x, y, z;
};
long long power(long long x, long long n, long long mod1) {
long long res = 1;
x %= mod1;
while (n) {
if (n & 1) res = (res * x) % mod1;
x = (x * x) % mod1;
n >>= 1;
}
return res;
}
long long modInverse(long long n, long long p) { return power(n, p - 2, p); }
long long fac[1000100];
void fun() {
fac[0] = 1;
for (long long i = 1; i <= 1000090; i++) fac[i] = (fac[i - 1] * i) % mod;
}
long long ncr(long long n, long long r, long long p) {
if (r == 0) return 1;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long n, k;
fun();
cin >> n >> k;
vector<pair<long long, long long> > v(n + 1, {0, 0});
for (long long i = (1); i <= (n); i++) {
cin >> v[i].first >> v[i].second;
}
if (k == 1) {
cout << n << "\n";
return 0;
}
sort(v.begin() + 1, v.end());
multiset<long long> m;
long long ans = 0;
for (long long i = (1); i <= (n); i++) {
m.erase(m.begin(), m.lower_bound(v[i].first));
if (m.size() > k - 2) {
ans += ncr(m.size(), k - 1, mod);
if (ans >= mod) ans %= mod;
}
m.insert(v[i].second);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
const int N = 5e3 + 10;
const long long inf = 0x3f3f3f3f;
const long long oo = 8e18;
const int dir[][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0},
{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
long long l[maxn], r[maxn], a[maxn], pos[maxn];
long long fac[maxn], inv1[maxn];
set<int> st[maxn];
long long Pow(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) {
ans = ans * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return ans;
}
long long inv(long long b) { return Pow(b, mod - 2) % mod; }
long long C(long long n, long long m) {
if (m > n || n < 0 || m < 0) return 0;
if (m == 0 || m == n) return 1;
long long res = (fac[n] * inv1[m] % mod * inv1[n - m]) % mod;
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < maxn; i++) {
fac[i] = fac[i - 1] * i % mod;
}
inv1[maxn - 1] = Pow(fac[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
inv1[i] = inv1[i + 1] * (i + 1) % mod;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k, cnt = 0;
init();
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> l[i] >> r[i];
a[++cnt] = l[i];
a[++cnt] = r[i];
}
sort(a + 1, a + 1 + cnt);
cnt = unique(a + 1, a + 1 + cnt) - a - 1;
for (int i = 1; i <= n; i++) {
int p = lower_bound(a + 1, a + 1 + cnt, l[i]) - a;
int q = lower_bound(a + 1, a + 1 + cnt, r[i]) - a;
st[p].insert(i);
pos[p]++, pos[q + 1]--;
}
long long ans = 0;
for (int i = 1; i <= cnt; i++) {
pos[i] += pos[i - 1];
long long tmp = pos[i] - (int)st[i].size();
for (int j = 0; j < (int)st[i].size(); j++)
ans = (ans + C(pos[i] - (int)st[i].size() + j, k - 1)) % mod;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 9, mod = 998244353;
vector<long long> fac(N), invfac(N);
long long power(long long x, long long p) {
long long res = 1;
x %= mod;
if (!x) return x;
while (p) {
if (p % 2) res = (res * x) % mod;
p >>= 1;
x = (x * x) % mod;
}
return res;
}
void preprocess() {
fac[0] = fac[1] = 1;
for (long long i = 2; i < N; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
invfac[N - 1] = power(fac[N - 1], mod - 2);
for (long long i = N - 2; i >= 0; i--) {
invfac[i] = (invfac[i + 1] * (i + 1)) % mod;
}
}
long long nCr(long long n, long long r) {
if (r > n) return 0;
long long ans = (fac[n] * ((invfac[r] * invfac[n - r]) % mod)) % mod;
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
preprocess();
long long n, k;
cin >> n >> k;
vector<pair<long long, long long> > seg;
for (long long i = 1; i <= n; i++) {
long long l, r;
cin >> l >> r;
seg.push_back({l, i});
seg.push_back({r + 1, -i});
}
sort(seg.begin(), seg.end());
multiset<long long> cur;
long long ans = 0;
for (long long i = 0; i < 2 * n; i++) {
long long j = seg[i].second;
if (j < 0)
cur.erase(-j);
else {
cur.insert(j);
if (cur.size() >= k) {
ans += nCr(cur.size() - 1, k - 1);
ans %= mod;
}
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
const int mod = 998244353;
long long a1[maxn], b1[maxn];
struct node {
long long l, r;
} num[maxn];
long long n, k, val[maxn], cnt;
long long ans, d[maxn], x[maxn], c[maxn];
long long quickpow(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
long long ni(long long x) { return quickpow(x, mod - 2); }
void init() {
a1[0] = 1;
for (int i = 1; i < maxn; i++) {
a1[i] = (a1[i - 1] * i) % mod;
}
b1[maxn - 1] = ni(a1[maxn - 1]);
for (int i = maxn - 2; i >= 0; i--) {
b1[i] = b1[i + 1] * (i + 1) % mod;
}
}
long long C(long long n, long long m) {
if (n < m) return 0;
return (a1[n] * b1[m] % mod) * b1[n - m] % mod;
}
int main() {
scanf("%lld%lld", &n, &k);
init();
for (int i = 1; i <= n; i++) {
scanf("%lld%lld", &num[i].l, &num[i].r);
val[cnt++] = num[i].l;
val[cnt++] = num[i].r;
}
sort(val, val + cnt);
cnt = unique(val, val + cnt) - val;
for (int i = 1; i <= n; i++) {
num[i].l = lower_bound(val, val + cnt, num[i].l) - val + 1;
num[i].r = lower_bound(val, val + cnt, num[i].r) - val + 1;
}
for (int i = 1; i <= n; i++) {
x[num[i].l]++;
d[num[i].l]++;
d[num[i].r + 1]--;
}
for (int i = 1; i <= cnt; i++) {
c[i] = c[i - 1] + d[i];
}
for (int i = 1; i <= cnt; i++) {
if (c[i] < k) continue;
ans = (ans + C(c[i], k) - C(c[i] - x[i], k) + mod) % mod;
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class COMBCALC {
private:
static constexpr int maxN = 3e5;
static constexpr int mod = 998244353;
vector<int> inv;
vector<int> fact;
vector<int> fact_inv;
public:
COMBCALC() : inv(1 + maxN, 0), fact(1 + maxN, 0), fact_inv(1 + maxN, 0) {
inv[1] = 1;
for (int k = 2; k <= maxN; ++k)
inv[k] = (int)((long long)(mod - mod / k) * inv[mod % k] % mod);
fact[0] = 1;
fact_inv[0] = 1;
for (int k = 1; k <= maxN; ++k) {
fact[k] = (int)((long long)fact[k - 1] * k % mod);
fact_inv[k] = (int)((long long)fact_inv[k - 1] * inv[k] % mod);
}
}
int operator()(int N, int K) {
if (K < 0 || K > N) return 0;
return (int)(((long long)fact[N] * fact_inv[K] % mod) * fact_inv[N - K] %
mod);
}
} C;
long long lampopen(const vector<pair<int, int> >& L, int K) {
constexpr int mod = 998244353;
map<int, pair<int, int> > LM;
for (const pair<int, int>& p : L) {
map<int, pair<int, int> >::iterator it;
it = LM.find(p.first);
if (it != LM.end())
it->second.first++;
else
LM[p.first] = {1, 0};
it = LM.find(p.second);
if (it != LM.end())
it->second.second++;
else
LM[p.second] = {0, 1};
}
int on = 0;
long long ans = 0;
for (auto it = LM.begin(); it != LM.end(); ++it) {
const auto& p = it->second;
ans = (ans + C(on + p.first, K) - C(on, K) + mod) % mod;
on += p.first - p.second;
}
return ans;
}
int main() {
int N, K;
scanf("%d%d", &N, &K);
vector<pair<int, int> > L(N);
for (int k = 0; k < N; ++k) scanf("%d%d", &L[k].first, &L[k].second);
printf("%lld\n", lampopen(L, K));
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long mpow(long long a, long long b) {
a %= MOD;
if (!b) return 1;
long long temp = mpow(a, b / 2);
temp = (temp * temp) % MOD;
if (b % 2) return (a * temp) % MOD;
return temp;
}
long long _pow(long long a, long long b) {
if (!b) return 1;
long long temp = _pow(a, b / 2);
temp = (temp * temp);
if (b % 2) return (a * temp);
return temp;
}
long long mod_in(long long n) { return mpow(n, MOD - 2); }
long long cl(long long a, long long b) {
if (a % b) return 1 + a / b;
return a / b;
}
const long long N = 1e6;
long long fact[N];
bool cmp(pair<long long, long long>& A, pair<long long, long long>& B) {
if (A.first < B.first) return 1;
if (A.first > B.first) return 0;
return A.second < B.second;
}
long long select(long long n, long long r) {
if (n < r) return 0;
long long k = fact[n];
k *= mod_in(fact[r]);
k %= MOD;
k *= mod_in(fact[n - r]);
k %= MOD;
return k;
}
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
long long t = 1;
while (t--) {
long long n, k;
cin >> n >> k;
fact[0] = 1;
for (long long i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
pair<long long, long long> pr[n + 5];
for (long long i = 0; i < n; i++) {
long long u, v;
cin >> u >> v;
pr[i] = {u, v};
}
sort(pr, pr + n, cmp);
long long ans = 0;
multiset<long long> second;
for (long long i = 0; i < n; i++) {
while (second.size() && *second.begin() < pr[i].first)
second.erase(second.begin());
ans += select((long long)second.size(), k - 1);
ans %= MOD;
second.insert(pr[i].second);
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 3e5 + 10;
const int mod = 998244353;
int bit[N * 2];
int lowbit(int x) { return x & -x; }
void add(int i, int up) {
while (i <= up) {
bit[i]++;
i += lowbit(i);
}
}
int query(int i) {
int res = 0;
while (i) {
res += bit[i];
i -= lowbit(i);
}
return res;
}
long long fac[N], ifac[N];
long long qpow(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
long long comb(long long n, long long m) {
if (m < 0 || n < m) return 0;
return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}
void init(int n) {
fac[0] = 1;
for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
ifac[n] = qpow(fac[n], mod - 2);
for (int i = n - 1; i >= 0; i--) ifac[i] = 1LL * (i + 1) * ifac[i + 1] % mod;
}
int main() {
int n, k;
scanf("%d%d", &n, &k);
init(n);
vector<pair<int, int>> a(n + 1);
vector<int> xs;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i].first, &a[i].second);
xs.push_back(a[i].first);
xs.push_back(a[i].second);
}
sort(xs.begin(), xs.end());
int cnt = unique(xs.begin(), xs.end()) - xs.begin();
vector<pair<int, int>> b(n + 1);
for (int i = 1; i <= n; i++) {
b[i].first =
lower_bound(xs.begin(), xs.begin() + cnt, a[i].first) - xs.begin() + 1;
b[i].second =
lower_bound(xs.begin(), xs.begin() + cnt, a[i].second) - xs.begin() + 1;
}
sort(b.begin(), b.end());
long long ans = 0;
for (int i = 1; i <= n; i++) {
int x = query(b[i].first - 1);
x = i - 1 - x;
if (x >= k - 1) {
long long add = comb(x, k - 1);
ans += add;
ans %= mod;
}
add(b[i].second, cnt);
}
printf("%lld\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename... T>
inline void inp(T &...args) {
((cin >> args), ...);
}
template <typename T>
inline istream &operator>>(istream &in, vector<T> &a) {
for (auto &x : a) in >> x;
return in;
}
template <typename T, typename U>
inline istream &operator>>(istream &in, pair<T, U> &a) {
in >> a.first >> a.second;
return in;
}
const long long int MX = 3e5 + 10;
const long long int Mod = 998244353;
inline long long int md(long long int x, long long int M = Mod) {
x %= M;
return ((x < 0) ? (x + M) : x);
}
vector<long long int> fact(MX), invfact(MX), inv(MX);
void init_fact(long long int m = Mod) {
inv[0] = 0;
inv[1] = fact[0] = fact[1] = invfact[0] = invfact[1] = 1;
for (long long int i = 2; i < MX; i++) {
fact[i] = md(fact[i - 1] * i, m);
inv[i] = m - (m / i) * inv[m % i] % m;
invfact[i] = md(inv[i] * invfact[i - 1], m);
}
}
long long int NPR(long long int n, long long int r) {
if (0 <= r and r <= n) {
return md(fact[n] * invfact[n - r]);
}
return 0;
}
long long int NCR(long long int n, long long int r) {
if (0 <= r and r <= n) {
return md(fact[n] * md(invfact[r] * invfact[n - r]));
}
return 0;
}
void solve(int &T) {
long long int n, k;
cin >> n >> k;
vector<pair<long long int, long long int>> a;
for (long long int i = (0); ((1) > 0 ? i < (n) : i > (n)); i += (1)) {
long long int x, y;
cin >> x >> y;
a.push_back({x, 0});
a.push_back({y, 1});
}
sort((a).begin(), (a).end());
long long int cnt = 0, ans = 0;
for (long long int i = (0); ((1) > 0 ? i < (2 * n) : i > (2 * n)); i += (1)) {
if (a[i].second == 0) {
if (cnt >= k - 1) {
ans = md(ans + NCR(cnt, k - 1));
}
cnt++;
} else {
cnt--;
}
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init_fact();
int t = 1;
for (int i = 1; i <= t; i++) {
if (0) cerr << "Case #" << i << "\n";
solve(i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long fact[300006];
long long fast_mod_exp(long long a, long long b, long long m) {
long long res = 1;
while (b > 0) {
if (b & 1) res = (res * a) % m;
a = (a * a) % m;
b = b >> 1;
}
return res;
}
long long mod_inverse(long long a, long long m) {
return fast_mod_exp(a, m - 2, m);
}
long long ncr(long long n, long long r, long long p) {
if (r == 0) return 1;
return ((fact[n] * mod_inverse(fact[n - r], p)) % p *
mod_inverse(fact[r], p)) %
p;
}
bool cmp(pair<long long, long long> p1, pair<long long, long long> p2) {
if (p1.first < p2.first)
return true;
else if (p1.first > p2.first)
return false;
else {
return p1.second > p2.second;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, k;
cin >> n >> k;
fact[0] = fact[1] = 1;
for (long long i = 1; i <= 300002; i++) {
fact[i] = (fact[i - 1] * i) % 998244353;
}
vector<pair<long long, long long>> v;
for (long long i = 1; i <= n; i++) {
long long st, en;
cin >> st >> en;
v.push_back({st, 0});
v.push_back({en, 1});
}
sort(v.begin(), v.end());
long long on_so_far = 0;
long long ans = 0;
for (long long i = 0; i < v.size(); i++) {
if (v[i].second == 0) {
if (on_so_far >= k - 1)
ans = (ans + ncr(on_so_far, k - 1, 998244353)) % 998244353;
on_so_far++;
} else
on_so_far--;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653;
const long long infi = 1000000001;
const long long mod = 998244353;
const string no = "NO\n", yes = "YES\n";
long long bexpo(long long a, long long p) {
long long x = 1;
while (p) {
if (p & 1) {
x = (x * a) % mod;
}
a = (a * a) % mod;
p >>= 1;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
long long n, m, i, length, d, bank, k, j, x, y, ans, q;
while (t--) {
ans = 0;
cin >> n >> k;
vector<pair<long long, long long> > vp;
for (i = 0; i < n; i++) {
cin >> x >> y;
vp.emplace_back(make_pair(x, y));
}
long long fact[n + 1], inv[n + 1];
fact[0] = 1;
for (i = 1; i < n + 1; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
inv[n] = bexpo(fact[n], mod - 2);
for (i = n - 1; i >= 0; i--) {
inv[i] = ((i + 1) * inv[i + 1]) % mod;
}
priority_queue<long long, vector<long long>, greater<long long> > pq;
sort(vp.begin(), vp.end());
x = 0;
for (i = 0; i < n; i++) {
pq.push(vp[i].second);
y = vp[i].first;
while (pq.top() < y && !pq.empty()) {
pq.pop();
}
x = pq.size();
y = 0;
if (x >= k) {
y = (((fact[x - 1] * inv[k - 1]) % mod) * inv[x - k]) % mod;
ans += (((fact[x - 1] * inv[k - 1]) % mod) * inv[x - k]) % mod;
ans %= mod;
}
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long m = 998244353;
long long n, k;
vector<vector<long long>> seg(n, vector<long long>(2, 0));
vector<long long> val;
vector<long long> cnt(val.size(), 0);
long long bin(long long a, long long b) {
if (b == 0) return 1;
long long u = bin(a, b / 2);
u = (u * u) % m;
if (b % 2 == 1) return (u * a) % m;
return u;
}
vector<long long> fact;
long long divMod(long long a, long long b) { return a * bin(b, m - 2) % m; }
long long cnk(long long a, long long p) {
long long b = fact[p] * fact[a - p] % m;
long long x = divMod(fact[a], b);
return x;
}
void init() {
fact.assign(1e6 + 1, 1);
for (long long i = 1; i < 1e6; i++) fact[i] = (fact[i - 1] * i) % m;
}
int main() {
cin >> n >> k;
seg.assign(n, vector<long long>(2, 0));
for (long long i = 0; i < n; i++) cin >> seg[i][0] >> seg[i][1];
sort(seg.begin(), seg.end());
init();
vector<int> val;
for (int i = 0; i < n; i++) val.push_back(seg[i][0]);
auto last = unique(val.begin(), val.end());
val.erase(last, val.end());
long long ans = 0;
vector<int> cnt(val.size(), 0);
for (int i = 0; i < n; i++) {
int a = lower_bound(val.begin(), val.end(), seg[i][0]) - val.begin();
int b = upper_bound(val.begin(), val.end(), seg[i][1]) - val.begin() - 1;
cnt[a]++;
if (b < val.size() - 1) cnt[b + 1]--;
}
for (int i = 1; i < val.size(); i++) cnt[i] += cnt[i - 1];
vector<int> amount(val.size(), 0);
for (int i = 0; i < n; i++)
amount[lower_bound(val.begin(), val.end(), seg[i][0]) - val.begin()]++;
for (int i = 0; i < val.size(); i++) {
if (cnt[i] < k) continue;
long long res = cnk(cnt[i], k);
if (cnt[i] - amount[i] >= k) res -= cnk(cnt[i] - amount[i], k);
if (res < 0) res += m;
ans += res;
ans %= m;
}
cout << ans << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.