Submission #27693073

---

Source Code Expand

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };


vector<int> vle[305];
modint dp[305][305][305];
modint rdp[305][305][305];

bool exi[305][305];

int cl[305];
void solve() {
	int n, m; cin >> n >> m;
	vector<int> l(m), r(m);
	rep(i, m) {
		cin >> l[i] >> r[i]; l[i]--; r[i]--;
		r[i]++;
		vle[r[i]].push_back(l[i]);
	}
	rep(i, n + 1)sort(all(vle[i]));
	rep(i, n + 1)exi[i][i] = false;
	for (int len = 1; len <= n; len++) {
		for (int l = 0; l + len <= n; l++) {
			int r = l + len;
			//[l,r)
			int nw = r;
			for (int j = r-1; j >= l; j--) {
				int t = lower_bound(all(vle[j + 1]), l) - vle[j + 1].begin();
				if (t < vle[j + 1].size()) {
					nw = min(nw, vle[j + 1][t]);
				}
				cl[j] = nw;
			}
			if (nw == r) {
				exi[l][r] = false;
				continue;
			}
			exi[l][r] = true;
			for (int x = l; x < r; x++) {
				if (x < cl[x]) {
					continue;
				}
				modint sl = 0, sr = 0;
				if (!exi[l][x])sl = 1;
				else {
					sl = rdp[l][x][x] - rdp[l][x][cl[x]];
				}
				if (!exi[x + 1][r])sr = 1;
				else {
					sr = rdp[x + 1][r][r] - rdp[x + 1][r][x + 1];
				}
				dp[l][r][x] = sl * sr;
			}
			for (int j = l; j < r; j++) {
				rdp[l][r][j + 1] = rdp[l][r][j] + dp[l][r][j];
			}
		}
	}
	modint ans = rdp[0][n][n];
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void coutarray(std::vector<_Tp>&)’:
./Main.cpp:65:3: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   65 |   if (i > 0)cout << " "; cout << v[i];
      |   ^~
./Main.cpp:65:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   65 |   if (i > 0)cout << " "; cout << v[i];
      |                          ^~~~
./Main.cpp: In function ‘void solve()’:
./Main.cpp:171:11: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
  171 |     if (t < vle[j + 1].size()) {
      |         ~~^~~~~~~~~~~~~~~~~~~

Judge Result