結果

問題 No.2512 Mountain Sequences
ユーザー 👑 amentorimaru
提出日時 2023-08-01 14:46:45
言語 C++17(clang)
(17.0.6 + boost 1.87.0)
結果
AC  
実行時間 861 ms / 3,000 ms
コード長 4,432 bytes
コンパイル時間 4,955 ms
コンパイル使用メモリ 162,620 KB
実行使用メモリ 18,280 KB
最終ジャッジ日時 2024-06-24 18:16:02
合計ジャッジ時間 20,641 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define ATCODER
#define _USE_MATH_DEFINES
#include<stdio.h>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<string>
#include <cassert>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <math.h>
#include <climits>
#include <set>
#include <map>
#include <list>
#include <random>
#include <iterator>
#include <bitset>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
//template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, b) for(ll i=(a); i<(b);i++)
#define REP(i, n) for(ll i=0; i<(n);i++)
#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)
#define PER(i, n) for(ll i=n-1; i>=0;i--)
#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)
#define VV(type) vector< vector<type> >
#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)
#define vec(type) vector<type>
#define VEC(type,n,val) vector<type> val;val.resize(n)
#define VL vector<ll>
#define VVL vector< vector<ll> >
#define VP vector< pair<ll,ll> >
#define SZ size()
#define all(i) begin(i),end(i)
#define SORT(i) sort(all(i))
#define BITI(i) (1<<i)
#define BITSET(x,i) x | (ll(1)<<i)
#define BITCUT(x,i) x & ~(ll(1)<<i)
#define EXISTBIT(x,i) (((x>>i) & 1) != 0)
#define ALLBIT(n) (ll(1)<<n-1)
#define CHMAX(n,v) n=n<v?v:n
#define CHMIN(n,v) n=n>v?v:n
#define MP(a,b) make_pair(a,b)
#define DET2(x1,y1,x2,y2) x1*y2-x2*y1
#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2
#define INC(a) for(auto& v:a)v++;
#define DEC(a) for(auto& v:a)v--;
#define SQU(x) (x)*(x)
#define L0 ll(0)
#ifdef ATCODER
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using mint2 = modint998244353;
#endif
template<typename T = ll>
vector<T> read(size_t n) {
vector<T> ts(n);
for (size_t i = 0; i < n; i++) cin >> ts[i];
return ts;
}
template<typename TV, const ll N> void read_tuple_impl(TV&) {}
template<typename TV, const ll N, typename Head, typename... Tail>
void read_tuple_impl(TV& ts) {
get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));
read_tuple_impl<TV, N + 1, Tail...>(ts);
}
template<typename... Ts> decltype(auto) read_tuple(size_t n) {
tuple<vector<Ts>...> ts;
for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);
return ts;
}
using val = ll;
using func = ll;
val op(val a, val b) { return min(a, b); }
val e() { return 1e18; }
val mp(func f, val a) {
if (f == -1)
return a;
return f;
}
func comp(func f, func g) {
if (f == -1)
return g;
return f;
}
func id() { return -1; }
ll di[4] = { 1,0,-1,0 };
ll dj[4] = { 0,1,0,-1 };
//ll di[4] = { -1,-1,1,1 };
//ll dj[4] = { -1,1,-1,1 };
ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };
ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };
template<typename T>
T Combi(ll a, ll b, vector<T>& fact, vector<T>& rfact) {
if (a < 0 || b < 0 || a < b)
return 0;
return fact[a] * rfact[b] * rfact[a - b];
}
void solve() {
ll t;
cin >> t;
ll MAX_N = 200000;
ll MAX_M = 200000;
ll rn = sqrt(MAX_N);
vector<mint2> f(MAX_N * 2 + 101, 1), rf(MAX_N * 2 + 101, 1);
mint2 half = mint2(1) / 2;
REP(i, MAX_N * 2 + 100) {
f[i + 1] = f[i] * (i + 1);
rf[i + 1] = mint2(1) / f[i + 1];
}
vector<tuple<ll, ll, ll>> nmi(t);
REP(i, t) {
ll n, m;
cin >> n >> m;
nmi[i] = make_tuple(n, m, i);
}
SORT(nmi);
vector<mint2> ans(t);
ll mx = 0;
ll nnm = 0;
while (mx < MAX_N) {
vector<tuple<ll, ll, ll>> mni;
while (nnm < t) {
auto [n, m, i] = nmi[nnm];
if (n >= mx + rn + 1)
break;
if (m * 2 > n)
mni.emplace_back(m, n, i);
nnm++;
}
SORT(mni);
mint2 sum = 0;
ll fsm = (mx + 1) / 2;
ll mnid = 0;
FOR(mm, fsm, MAX_M + 1) {
if (mnid == mni.size())
break;
while (mnid < mni.size()) {
auto [m, n, i] = mni[mnid];
if (m != mm)
break;
mint2 now = sum;
REP(i, n - mx - 1) {
now = (Combi(m * 2, mx + i + 2, f, rf) - now) * half;
}
ans[i] = now;
mnid++;
}
sum += Combi(mm * 2, mx, f, rf);
}
mx += rn;
}
REP(i, t) {
cout << ans[i].val() << "\n";
}
return;
}
int main() {
ll t = 1;
//cin >> t;
while (t--) {
solve();
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0