#607448 (C++17) No.1354 Sambo's Treasure

提出ソース

結果

問題	No.1354 Sambo's Treasure
ユーザー	kyoprouno
提出日時	2021-01-19 22:53:31
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,945 bytes
コンパイル時間	6,200 ms
コンパイル使用メモリ	233,288 KB
実行使用メモリ	13,424 KB
最終ジャッジ日時	2023-08-22 18:34:52
合計ジャッジ時間	11,495 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	10 ms 10,624 KB
testcase_01	AC	10 ms 10,664 KB
testcase_02	AC	11 ms 10,628 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	11 ms 10,728 KB
testcase_06	WA	-
testcase_07	AC	10 ms 10,664 KB
testcase_08	AC	10 ms 10,868 KB
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	11 ms 10,732 KB
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	11 ms 10,828 KB
testcase_16	AC	10 ms 10,708 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	10 ms 10,764 KB
testcase_20	AC	11 ms 10,860 KB
testcase_21	WA	-
testcase_22	AC	11 ms 10,772 KB
testcase_23	AC	81 ms 13,100 KB
testcase_24	AC	83 ms 13,356 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	AC	81 ms 13,112 KB
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	81 ms 13,240 KB
testcase_34	WA	-
testcase_35	AC	82 ms 13,152 KB
testcase_36	WA	-
testcase_37	AC	82 ms 13,204 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	AC	81 ms 13,116 KB
testcase_42	WA	-
testcase_43	AC	13 ms 11,080 KB
testcase_44	AC	13 ms 10,764 KB
testcase_45	AC	13 ms 10,760 KB
testcase_46	AC	13 ms 10,996 KB
testcase_47	AC	13 ms 11,136 KB
testcase_48	AC	14 ms 11,008 KB
testcase_49	AC	13 ms 10,660 KB
testcase_50	AC	13 ms 10,692 KB
testcase_51	AC	14 ms 11,104 KB
testcase_52	AC	13 ms 10,624 KB
testcase_53	AC	13 ms 11,124 KB
testcase_54	AC	14 ms 10,736 KB
testcase_55	AC	13 ms 10,624 KB
testcase_56	AC	13 ms 10,628 KB
testcase_57	AC	13 ms 11,140 KB
testcase_58	AC	14 ms 10,708 KB
testcase_59	AC	13 ms 10,664 KB
testcase_60	AC	14 ms 11,132 KB
testcase_61	AC	13 ms 11,136 KB
testcase_62	AC	14 ms 10,984 KB
testcase_63	AC	81 ms 13,188 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

#pragma region Macros

#define FOR(i, l, r) for(int i = (l) ;i < (r) ;i++)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n+1)
#define RFOR(i, l, r) for(int i = (l) ; i >= (r) ; i--)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n , 1)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
template <class T = int>
using VVV = V<V<V<T>>>;
#define ll long long
using ld = long double;
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

#define VEC(type, name, size) \
	V<type> name(size);       \
	INPUT(name)
#define VVEC(type, name, h, w)    \
	VV<type> name(h, V<type>(w)); \
	INPUT(name)
#define INT(...)     \
	int __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define LL(...)     \
	ll __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define STR(...)        \
	string __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define CHAR(...)     \
	char __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
	double __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define LD(...)     \
	ld __VA_ARGS__; \
	INPUT(__VA_ARGS__)

void scan(int &a) { cin >> a;}
void scan(long long &a) { cin >> a;}
void scan(char &a) { cin >> a;}
void scan(double &a) { cin >> a;}
void scan(long double &a) { cin >> a;}
void scan(char a[]) { scanf("%s", a);}
void scan(string &a) { cin >> a;}
template <class T>
void scan(V<T> &);
template <class T, class L>
void scan(pair<T, L> &);
template <class T>
void scan(V<T> &a){
	for(auto &i : a) scan(i);
}
template <class T, class L>
void scan(pair<T, L> &p){
	scan(p.first);
	scan(p.second);
}
template <class T>
void scan(T &a) { cin >> a;}
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail){
	scan(head);
	INPUT(tail...);
}
template <class T>
inline void print(T x) { cout << x << '\n'; }
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
	is >> p.first >> p.second;
	return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
	for(T &in : v) is >> in;
	return is;
}
template <class T>
ostream &operator<<(ostream &os, const V<T> &v) {
	REP(i, SZ(v)) {
		if(i) os << " ";
		os << v[i];
	}
	return os;
}
//debug
template <typename T>
void view(const V<T> &v) {
	cerr << "{ ";
	for(const auto &e : v) {
		cerr << e << ", ";
	}
	cerr << "\b\b }";
}
template <typename T>
void view(const VV<T> &vv) {
	cerr << "{\n";
	for(const auto &v : vv) {
		cerr << "\t";
		view(v);
		cerr << "\n";
	}
	cerr << "}";
}
template <typename T, typename U>
void view(const V<pair<T, U>> &v) {
	cerr << "{\n";
	for(const auto &c : v) cerr << "\t(" << c.first << ", " << c.second << ")\n";
	cerr << "}";
}
template <typename T, typename U>
void view(const map<T, U> &m) {
	cerr << "{\n";
	for(auto &t : m) cerr << "\t[" << t.first << "] : " << t.second << "\n";
	cerr << "}";
}
template <typename T, typename U>
void view(const pair<T, U> &p) { cerr << "(" << p.first << ", " << p.second << ")"; }
template <typename T>
void view(const set<T> &s) {
	cerr << "{ ";
	for(auto &t : s) {
		view(t);
		cerr << ", ";
	}
	cerr << "\b\b }";
}
template <typename T>
void view(T e) { cerr << e; }
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	view(H);
	cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                           \
	do {                                                     \
		cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                              \
		cerr << "\b\b]\n";                                   \
	} while(0)
#else
#define debug(...) (void(0))
#endif
template <class T>
V<T> press(V<T> &x) {
	V<T> res = x;
	sort(all(res));
	res.erase(unique(all(res)), res.end());
	REP(i, SZ(x)) {
		x[i] = lower_bound(all(res), x[i]) - res.begin();
	}
	return res;
}
template <class T>
inline bool chmin(T &a, T b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
inline void err(bool b = true) {
	if(b) {
		cout << -1 << '\n';
		exit(0);
	}
}
template <class T>
inline void fin(bool b = true, T e = 0) {
	if(b) {
		cout << e << '\n';
		exit(0);
	}
}
template <class T>
T divup(T x, T y) { return (x + (y - 1)) / y; }
template <typename T>
T pow(T a, long long n, T e = 1) {
	T ret = e;
	while(n) {
		if(n & 1) ret *= a;
		a *= a;
		n >>= 1;
	}
	return ret;
}
struct iofast {
	iofast() {
		ios_base::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} iofast_;
const int inf = 1e9;
const ll INF = 1e18;
#pragma endregion


inline int topbit(unsigned long long x){
	return x?63-__builtin_clzll(x):-1;
}

inline int popcount(unsigned long long x){
	return __builtin_popcountll(x);
}

inline int parity(unsigned long long x){//popcount%2
	return __builtin_parity(x);
}

const ll mod = 998244353;

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(ll n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (ll i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (ll i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(ll n, ll k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(ll n, ll k) {
    return fact[n]*ifact[n-k];
  }
} c(500005);

int main(){
	LL(N,M,L,K);
	V<pair<pll,ll>> p(M+L+2);
	map<pll,ll> m;
	REP(i,M){
	    cin >> p[i].fi.fi >> p[i].fi.se;
	    p[i].se=0;
	}
	REP(i,L){
	    cin >> p[i+M].fi.fi >> p[i+M].fi.se;
	    p[i+M].se=-1;
	    m[p[i+M].fi]=1;
	}
	p[M+L].fi.fi=N;
	p[M+L].fi.se=N;
	p[M+L].se=0;
	p[M+L+1].fi.fi=0;
	p[M+L+1].fi.se=0;
	p[M+L+1].se=0;
	sort(all(p));
	ll ind=0;
	ll cnt=0;
	V<mint> dp(L+1),nxt(L+1);
	REP(i,M+L+2){
	    if(i==0){
	        continue;
	    }
	    if(p[i].se==-1) cnt++;
	    else{
	        cnt++;
	        if(m.count(p[i].fi)) K--;
	        VV<mint> d(cnt+1,V<mint>(cnt+1));
	        d[0][0]=1;
	        REP(j,cnt){
	            mint sum=0;
	            for(ll q=j;q>=0;q--){
	                REP(k,j+1){
	                    ll dr=p[ind+j+1].fi.fi-p[ind+k].fi.fi;
	                    ll dc=p[ind+j+1].fi.se-p[ind+k].fi.se;
	                    
	                    if(dr>=0 && dc>=0) d[j+1][q+1]+=d[k][q]*c(dr+dc,dc);
	                    //cout << j+1 << " " << q+1 << " " << d[j+1][q+1] << endl;
	                }
	                d[j+1][q+1]-=sum;
	                sum+=d[j+1][q+1];
	            }
	        }
	        
	        if(ind==0){
	            for(ll j=1;j<=cnt;j++){
	                dp[j-1]=d[cnt][j];
	            }
	        }
	        else{
	            for(ll j=1;j<=cnt;j++){
	                REP(k,L+1){
	                    if(k-j+1>=0) nxt[k]+=dp[k-(j-1)]*d[cnt][j];
	                }
	            }
	            dp=nxt;
	            nxt=V<mint>(L+1);
	        }
	        cnt=0;
	        ind=i;
	    }
	}
	mint ans=0;
	REP(i,L+1){
	    if(i<=K) ans+=dp[i];
	}
	cout << ans << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード