oj.uz

답안 #637089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
637089 2022-08-31T13:08:38 Z IWTIM Boat (APIO16_boat) C++17
100 / 100
 1163 ms 27144 KB 
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define int long long
const int N = 1005, mod = 1e9 + 7;
int t,n,a[N],b[N],pr[N][N],dp[N][N],inv[N],fq[N],ch[N][N],chh[N][N],sum[N][N];
map <int, int> shes;
vector <int> v;
int f_p(int base, int power) {
	int result = 1;
	while (power > 0) {
		if (power % 2) result = (result * base) % mod;
		base = (base * base) % mod;
		power /= 2;
	}
	return result;
}
int C(int n, int k) {
	if (n < k) return 0;
	if (n == 0 && k == 0) return 1;
	int pas = 1;
	for (int i = n; i >= n - k + 1; i--){
		pas *= i;
		pas %= mod;
	} 
	pas *= inv[k];pas %= mod;
	return pas;
}
int check(int le, int ri, int a, int b) {
	return (max(a,le) <= min(b,ri));
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for (int i = 1; i <= n; i++) {
    	cin>>a[i]>>b[i];
    	v.pb(a[i]);
    	v.pb(b[i] + 1);
	}
	fq[0] = 1; inv[0] = 1;
	for (int i = 1; i < N; i++) {
		fq[i] = fq[i - 1] * i % mod;
	}
	inv[N - 1] = f_p(fq[N - 1], mod - 2);
	for (int i = N - 2; i >= 1; i--) {
		inv[i] = (inv[i + 1] * (i + 1)) % mod;
	}
	sort(v.begin(), v.end());
	v.resize(unique(v.begin(), v.end())-v.begin());
	
	vector <pii> seg;
	vector <int> szz;
	seg.pb({-1,-1});
	for (int i = 1; i < v.size(); i++) {
	    //if (v[i - 1] != 3) // !!!!!!!!!!!!!!!!!!
		seg.pb({v[i - 1], v[i] - 1}); 
		szz.pb(v[i] - v[i - 1]);
	}
	sort(szz.begin(), szz.end());
	szz.resize(unique(szz.begin(), szz.end())-szz.begin());
	dp[0][0] = 1;
	pr[0][0] = 1; 
	ch[0][0] = 1;
	ch[1][1] = ch[1][0] = 1;
	for (int i = 2; i <= n; i++) {
	    ch[i][0] = 1;
	    for (int j = 1; j <= i; j++) {
	        ch[i][j] = (ch[i - 1][j] + ch[i - 1][j - 1]) % mod;
	    }
	}
	int raod = 0;
	for (int sz : szz) { raod++; shes[sz] = raod;
	    for (int cnt = 1; cnt <= n; cnt++) {
	        chh[raod][cnt] = C(sz, cnt);
	        for (int cn = 1; cn <= cnt; cn++) {
	            sum[raod][cnt] += chh[raod][cn] * ch[cnt - 1][cn - 1] % mod;
	            if (sum[raod][cnt] >= mod) sum[raod][cnt] -= mod;
	        }
	    }
	}

	int ans = 0;
	for (int i = 1; i < seg.size(); i++) pr[0][i] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < seg.size(); j++) {
			int le = seg[j].f; int ri = seg[j].s;
			if (check(le,ri,a[i],b[i])) { 
				int cnt = 1;
				int sh = shes[ri - le + 1];
				for (int prless = i - 1; prless >= 0; prless--) {
				    dp[i][j] += sum[sh][cnt] * pr[prless][j - 1] % mod;
				    //cout<<i<<" "<<j<<" "<<ri - le + 1<<" "<<cnt<<" "<<sum[ri - le + 1][cnt]<<"  "<<pr[prless][j - 1]<<endl;
				    //cout<<sum[ri - le + 1][cnt]<<endl;
				    if (dp[i][j] >= mod) dp[i][j] -= mod;
					if ((check(le,ri,a[prless],b[prless]))) cnt++;
				}
			}
			//if (dp[i][j]) cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
			ans += dp[i][j]; if (ans >= mod) ans -= mod;
			pr[i][j] = (dp[i][j] + pr[i][j - 1]);  if (pr[i][j] >= mod) pr[i][j] -= mod;
		}
	}
	cout<<ans<<"\n";
}

Compilation message

boat.cpp:209:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  209 | main() {
      | ^~~~
boat.cpp: In function 'int main()':
boat.cpp:231:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int, std::allocator<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  231 |  for (int i = 1; i < v.size(); i++) {
      |                  ~~^~~~~~~~~~
boat.cpp:260:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  260 |  for (int i = 1; i < seg.size(); i++) pr[0][i] = 1;
      |                  ~~^~~~~~~~~~~~
boat.cpp:262:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  262 |   for (int j = 1; j < seg.size(); j++) {
      |                   ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 17092 KB Output is correct
2 Correct 420 ms 17136 KB Output is correct
3 Correct 418 ms 17180 KB Output is correct
4 Correct 410 ms 17100 KB Output is correct
5 Correct 434 ms 17152 KB Output is correct
6 Correct 409 ms 17160 KB Output is correct
7 Correct 426 ms 17480 KB Output is correct
8 Correct 410 ms 17144 KB Output is correct
9 Correct 431 ms 17168 KB Output is correct
10 Correct 413 ms 17124 KB Output is correct
11 Correct 420 ms 17244 KB Output is correct
12 Correct 425 ms 17184 KB Output is correct
13 Correct 408 ms 17228 KB Output is correct
14 Correct 419 ms 17300 KB Output is correct
15 Correct 406 ms 17224 KB Output is correct
16 Correct 78 ms 9396 KB Output is correct
17 Correct 86 ms 9548 KB Output is correct
18 Correct 80 ms 9472 KB Output is correct
19 Correct 86 ms 9688 KB Output is correct
20 Correct 85 ms 9484 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 17092 KB Output is correct
2 Correct 420 ms 17136 KB Output is correct
3 Correct 418 ms 17180 KB Output is correct
4 Correct 410 ms 17100 KB Output is correct
5 Correct 434 ms 17152 KB Output is correct
6 Correct 409 ms 17160 KB Output is correct
7 Correct 426 ms 17480 KB Output is correct
8 Correct 410 ms 17144 KB Output is correct
9 Correct 431 ms 17168 KB Output is correct
10 Correct 413 ms 17124 KB Output is correct
11 Correct 420 ms 17244 KB Output is correct
12 Correct 425 ms 17184 KB Output is correct
13 Correct 408 ms 17228 KB Output is correct
14 Correct 419 ms 17300 KB Output is correct
15 Correct 406 ms 17224 KB Output is correct
16 Correct 78 ms 9396 KB Output is correct
17 Correct 86 ms 9548 KB Output is correct
18 Correct 80 ms 9472 KB Output is correct
19 Correct 86 ms 9688 KB Output is correct
20 Correct 85 ms 9484 KB Output is correct
21 Correct 213 ms 10800 KB Output is correct
22 Correct 195 ms 10932 KB Output is correct
23 Correct 183 ms 10788 KB Output is correct
24 Correct 222 ms 10828 KB Output is correct
25 Correct 201 ms 10992 KB Output is correct
26 Correct 277 ms 11352 KB Output is correct
27 Correct 274 ms 11552 KB Output is correct
28 Correct 276 ms 11380 KB Output is correct
29 Correct 267 ms 11440 KB Output is correct
30 Correct 367 ms 16808 KB Output is correct
31 Correct 358 ms 16716 KB Output is correct
32 Correct 401 ms 16816 KB Output is correct
33 Correct 388 ms 16828 KB Output is correct
34 Correct 377 ms 16744 KB Output is correct
35 Correct 363 ms 16464 KB Output is correct
36 Correct 387 ms 16628 KB Output is correct
37 Correct 362 ms 16588 KB Output is correct
38 Correct 362 ms 16616 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3668 KB Output is correct
2 Correct 11 ms 3640 KB Output is correct
3 Correct 10 ms 3668 KB Output is correct
4 Correct 12 ms 3668 KB Output is correct
5 Correct 11 ms 3668 KB Output is correct
6 Correct 12 ms 3760 KB Output is correct
7 Correct 11 ms 3660 KB Output is correct
8 Correct 13 ms 3668 KB Output is correct
9 Correct 11 ms 3668 KB Output is correct
10 Correct 13 ms 3668 KB Output is correct
11 Correct 10 ms 3760 KB Output is correct
12 Correct 10 ms 3660 KB Output is correct
13 Correct 10 ms 3668 KB Output is correct
14 Correct 10 ms 3668 KB Output is correct
15 Correct 10 ms 3736 KB Output is correct
16 Correct 5 ms 2568 KB Output is correct
17 Correct 6 ms 2516 KB Output is correct
18 Correct 6 ms 2516 KB Output is correct
19 Correct 5 ms 2516 KB Output is correct
20 Correct 6 ms 2644 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 410 ms 17092 KB Output is correct
2 Correct 420 ms 17136 KB Output is correct
3 Correct 418 ms 17180 KB Output is correct
4 Correct 410 ms 17100 KB Output is correct
5 Correct 434 ms 17152 KB Output is correct
6 Correct 409 ms 17160 KB Output is correct
7 Correct 426 ms 17480 KB Output is correct
8 Correct 410 ms 17144 KB Output is correct
9 Correct 431 ms 17168 KB Output is correct
10 Correct 413 ms 17124 KB Output is correct
11 Correct 420 ms 17244 KB Output is correct
12 Correct 425 ms 17184 KB Output is correct
13 Correct 408 ms 17228 KB Output is correct
14 Correct 419 ms 17300 KB Output is correct
15 Correct 406 ms 17224 KB Output is correct
16 Correct 78 ms 9396 KB Output is correct
17 Correct 86 ms 9548 KB Output is correct
18 Correct 80 ms 9472 KB Output is correct
19 Correct 86 ms 9688 KB Output is correct
20 Correct 85 ms 9484 KB Output is correct
21 Correct 213 ms 10800 KB Output is correct
22 Correct 195 ms 10932 KB Output is correct
23 Correct 183 ms 10788 KB Output is correct
24 Correct 222 ms 10828 KB Output is correct
25 Correct 201 ms 10992 KB Output is correct
26 Correct 277 ms 11352 KB Output is correct
27 Correct 274 ms 11552 KB Output is correct
28 Correct 276 ms 11380 KB Output is correct
29 Correct 267 ms 11440 KB Output is correct
30 Correct 367 ms 16808 KB Output is correct
31 Correct 358 ms 16716 KB Output is correct
32 Correct 401 ms 16816 KB Output is correct
33 Correct 388 ms 16828 KB Output is correct
34 Correct 377 ms 16744 KB Output is correct
35 Correct 363 ms 16464 KB Output is correct
36 Correct 387 ms 16628 KB Output is correct
37 Correct 362 ms 16588 KB Output is correct
38 Correct 362 ms 16616 KB Output is correct
39 Correct 12 ms 3668 KB Output is correct
40 Correct 11 ms 3640 KB Output is correct
41 Correct 10 ms 3668 KB Output is correct
42 Correct 12 ms 3668 KB Output is correct
43 Correct 11 ms 3668 KB Output is correct
44 Correct 12 ms 3760 KB Output is correct
45 Correct 11 ms 3660 KB Output is correct
46 Correct 13 ms 3668 KB Output is correct
47 Correct 11 ms 3668 KB Output is correct
48 Correct 13 ms 3668 KB Output is correct
49 Correct 10 ms 3760 KB Output is correct
50 Correct 10 ms 3660 KB Output is correct
51 Correct 10 ms 3668 KB Output is correct
52 Correct 10 ms 3668 KB Output is correct
53 Correct 10 ms 3736 KB Output is correct
54 Correct 5 ms 2568 KB Output is correct
55 Correct 6 ms 2516 KB Output is correct
56 Correct 6 ms 2516 KB Output is correct
57 Correct 5 ms 2516 KB Output is correct
58 Correct 6 ms 2644 KB Output is correct
59 Correct 1088 ms 26188 KB Output is correct
60 Correct 1072 ms 26176 KB Output is correct
61 Correct 1044 ms 25964 KB Output is correct
62 Correct 1048 ms 26116 KB Output is correct
63 Correct 1031 ms 26136 KB Output is correct
64 Correct 1142 ms 26936 KB Output is correct
65 Correct 1106 ms 27040 KB Output is correct
66 Correct 1119 ms 26972 KB Output is correct
67 Correct 1163 ms 27096 KB Output is correct
68 Correct 1137 ms 27144 KB Output is correct
69 Correct 987 ms 26108 KB Output is correct
70 Correct 991 ms 26128 KB Output is correct
71 Correct 987 ms 26224 KB Output is correct
72 Correct 999 ms 26120 KB Output is correct
73 Correct 1004 ms 26164 KB Output is correct
74 Correct 127 ms 9880 KB Output is correct
75 Correct 124 ms 9996 KB Output is correct
76 Correct 121 ms 10100 KB Output is correct
77 Correct 124 ms 9892 KB Output is correct
78 Correct 125 ms 9912 KB Output is correct