oj.uz

답안 #557720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557720 2022-05-06T00:57:55 Z hhhhaura Boat (APIO16_boat) C++14
58 / 100
 2000 ms 22168 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
using namespace std;
#ifdef wiwihorz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("["+string(#a)+"] = ", a)
void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
void kout() { cerr << endl; }
template<class T1,class ... T2>void kout(T1 a,T2 ... e){cerr<<a<<" ",kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif
#define x first
#define y second
namespace solver {
	int n, tot;
	vector<pii> seg;
	vector<int> v, fac, inv;
	vector<vector<int>> dp, pre, P, cal, C;
	int pow_(int a, int times) {
		int ans = 1;
		for(; times > 0; times >>= 1, a = a * a % MOD) {
			if(times & 1) ans = ans * a % MOD;
		}
		return ans;
	}
	void init_(int _n) {
		n = _n;
		v.clear();
		seg.assign(n + 1, {0, 0});
		dp.assign(n + 1, vector<int>(n * 2 + 1, 0));
		pre.assign(n * 2 + 1, vector<int>(n * 2 + 1, 0));
		P.assign(n * 2 + 1, vector<int>(n + 1, 0));
		C.assign(n + 1, vector<int>(n + 1, 0));
		cal.assign(n * 2 + 1, vector<int>(n + 1, 0));
		fac.assign(n + 1, 1);
		inv.assign(n + 1, 1);
		rep(i, 1, n) fac[i] = fac[i - 1] * i % MOD;
		inv[n] = pow_(fac[n], MOD - 2);
		rrep(i, 1, n - 1) inv[i] = inv[i + 1] * (i + 1) % MOD;
		rep(i, 0, n) rep(j, 0, i) {
			C[i][j] = fac[i] * inv[j] % MOD * inv[i - j] % MOD;
		}
	}

	void solve() {
		sort(all(v));
		v.resize(unique(all(v)) - v.begin());
		tot = v.size() - 1;
		rep(i, 1, n) {
			int L = seg[i].x, R = seg[i].y;
			L = lower_bound(all(v), L) - v.begin() + 1;
			R = lower_bound(all(v), R + 1) - v.begin();
			seg[i] = {L, R};
		}
		int l = 0, cur = 1;
		rep(i, 1, tot) {
			int len = v[i] - v[i - 1];
			rep(j, 1, n) {
				int L = 1, R = 1;
				rep(k, 0, j - 1) L = L * (len - k) % MOD;
				rep(k, 1, j) R = R * k % MOD;
				if(len < j) P[i][j] = 0;
				else P[i][j] = L * pow_(R, MOD - 2) % MOD;
			}
		}
		rep(i, 1, tot) rep(j, 1, n) {
			rep(k, 1, j) {
				cal[i][j] += P[i][k] * C[j - 1][k - 1] % MOD;
				cal[i][j] %= MOD;
			}
		}
		dp[0][0] = 1;
		rep(i, 0, tot) pre[0][i] = 1;
		rep(i, 1, n) {
			int L = seg[i].x, R = seg[i].y;
			rep(j, 1, tot) if(L <= j && j <= R) {
				int cnt = 0;
				rrep(k, 0, i - 1) {
					cnt += (seg[k + 1].x <= j && seg[k + 1].y >= j);
					dp[i][j] += pre[k][j - 1] * cal[j][cnt] % MOD;
					dp[i][j] %= MOD;
				}
			}
			rep(j, 1, tot) pre[i][j] = (pre[i][j - 1] + dp[i][j]) % MOD;
		}
		int ans = 0;
		rep(i, 1, n) ans = (ans + pre[i][tot]) % MOD;
		cout << ans << "\n";
	}
	
};
using namespace solver;
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n; cin >> n;
	init_(n);
	rep(i, 1, n) {
		cin >> seg[i].x >> seg[i].y;
		v.push_back(seg[i].x);
		v.push_back(seg[i].y + 1);
	}
	solve();
	return 0;
}

Compilation message

boat.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
boat.cpp:20:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |             ^~~~
boat.cpp:20:20: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   20 | void vprint(auto L,auto R){while(L<R)cerr<<*L<<" \n"[next(L) == R], ++L; }
      |                    ^~~~
boat.cpp: In function 'void solver::solve()':
boat.cpp:70:7: warning: unused variable 'l' [-Wunused-variable]
   70 |   int l = 0, cur = 1;
      |       ^
boat.cpp:70:14: warning: unused variable 'cur' [-Wunused-variable]
   70 |   int l = 0, cur = 1;
      |              ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 22044 KB Output is correct
2 Correct 1837 ms 22044 KB Output is correct
3 Correct 1816 ms 22052 KB Output is correct
4 Correct 1779 ms 22040 KB Output is correct
5 Correct 1701 ms 22040 KB Output is correct
6 Correct 1760 ms 22040 KB Output is correct
7 Correct 1828 ms 22044 KB Output is correct
8 Correct 1790 ms 21972 KB Output is correct
9 Correct 1731 ms 22036 KB Output is correct
10 Correct 1720 ms 22056 KB Output is correct
11 Correct 1705 ms 22036 KB Output is correct
12 Correct 1747 ms 22040 KB Output is correct
13 Correct 1713 ms 22056 KB Output is correct
14 Correct 1813 ms 22060 KB Output is correct
15 Correct 1865 ms 22040 KB Output is correct
16 Correct 360 ms 22044 KB Output is correct
17 Correct 356 ms 22040 KB Output is correct
18 Correct 344 ms 22092 KB Output is correct
19 Correct 363 ms 22040 KB Output is correct
20 Correct 360 ms 22040 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 22044 KB Output is correct
2 Correct 1837 ms 22044 KB Output is correct
3 Correct 1816 ms 22052 KB Output is correct
4 Correct 1779 ms 22040 KB Output is correct
5 Correct 1701 ms 22040 KB Output is correct
6 Correct 1760 ms 22040 KB Output is correct
7 Correct 1828 ms 22044 KB Output is correct
8 Correct 1790 ms 21972 KB Output is correct
9 Correct 1731 ms 22036 KB Output is correct
10 Correct 1720 ms 22056 KB Output is correct
11 Correct 1705 ms 22036 KB Output is correct
12 Correct 1747 ms 22040 KB Output is correct
13 Correct 1713 ms 22056 KB Output is correct
14 Correct 1813 ms 22060 KB Output is correct
15 Correct 1865 ms 22040 KB Output is correct
16 Correct 360 ms 22044 KB Output is correct
17 Correct 356 ms 22040 KB Output is correct
18 Correct 344 ms 22092 KB Output is correct
19 Correct 363 ms 22040 KB Output is correct
20 Correct 360 ms 22040 KB Output is correct
21 Correct 1778 ms 22044 KB Output is correct
22 Correct 1786 ms 22168 KB Output is correct
23 Correct 1856 ms 22044 KB Output is correct
24 Correct 1849 ms 22044 KB Output is correct
25 Correct 1812 ms 22044 KB Output is correct
26 Correct 1718 ms 22044 KB Output is correct
27 Correct 1725 ms 22044 KB Output is correct
28 Correct 1718 ms 22092 KB Output is correct
29 Correct 1708 ms 22044 KB Output is correct
30 Correct 1696 ms 22048 KB Output is correct
31 Correct 1702 ms 22092 KB Output is correct
32 Correct 1703 ms 22048 KB Output is correct
33 Correct 1720 ms 22040 KB Output is correct
34 Correct 1686 ms 22044 KB Output is correct
35 Correct 1713 ms 22044 KB Output is correct
36 Correct 1752 ms 22044 KB Output is correct
37 Correct 1812 ms 22044 KB Output is correct
38 Correct 1935 ms 22044 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 1200 KB Output is correct
2 Correct 21 ms 1220 KB Output is correct
3 Correct 21 ms 1220 KB Output is correct
4 Correct 21 ms 1224 KB Output is correct
5 Correct 22 ms 1108 KB Output is correct
6 Correct 22 ms 1220 KB Output is correct
7 Correct 23 ms 1108 KB Output is correct
8 Correct 22 ms 1220 KB Output is correct
9 Correct 22 ms 1220 KB Output is correct
10 Correct 22 ms 1224 KB Output is correct
11 Correct 21 ms 1224 KB Output is correct
12 Correct 21 ms 1236 KB Output is correct
13 Correct 21 ms 1220 KB Output is correct
14 Correct 20 ms 1108 KB Output is correct
15 Correct 21 ms 1108 KB Output is correct
16 Correct 13 ms 1108 KB Output is correct
17 Correct 13 ms 1212 KB Output is correct
18 Correct 11 ms 1108 KB Output is correct
19 Correct 11 ms 1108 KB Output is correct
20 Correct 12 ms 1220 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1798 ms 22044 KB Output is correct
2 Correct 1837 ms 22044 KB Output is correct
3 Correct 1816 ms 22052 KB Output is correct
4 Correct 1779 ms 22040 KB Output is correct
5 Correct 1701 ms 22040 KB Output is correct
6 Correct 1760 ms 22040 KB Output is correct
7 Correct 1828 ms 22044 KB Output is correct
8 Correct 1790 ms 21972 KB Output is correct
9 Correct 1731 ms 22036 KB Output is correct
10 Correct 1720 ms 22056 KB Output is correct
11 Correct 1705 ms 22036 KB Output is correct
12 Correct 1747 ms 22040 KB Output is correct
13 Correct 1713 ms 22056 KB Output is correct
14 Correct 1813 ms 22060 KB Output is correct
15 Correct 1865 ms 22040 KB Output is correct
16 Correct 360 ms 22044 KB Output is correct
17 Correct 356 ms 22040 KB Output is correct
18 Correct 344 ms 22092 KB Output is correct
19 Correct 363 ms 22040 KB Output is correct
20 Correct 360 ms 22040 KB Output is correct
21 Correct 1778 ms 22044 KB Output is correct
22 Correct 1786 ms 22168 KB Output is correct
23 Correct 1856 ms 22044 KB Output is correct
24 Correct 1849 ms 22044 KB Output is correct
25 Correct 1812 ms 22044 KB Output is correct
26 Correct 1718 ms 22044 KB Output is correct
27 Correct 1725 ms 22044 KB Output is correct
28 Correct 1718 ms 22092 KB Output is correct
29 Correct 1708 ms 22044 KB Output is correct
30 Correct 1696 ms 22048 KB Output is correct
31 Correct 1702 ms 22092 KB Output is correct
32 Correct 1703 ms 22048 KB Output is correct
33 Correct 1720 ms 22040 KB Output is correct
34 Correct 1686 ms 22044 KB Output is correct
35 Correct 1713 ms 22044 KB Output is correct
36 Correct 1752 ms 22044 KB Output is correct
37 Correct 1812 ms 22044 KB Output is correct
38 Correct 1935 ms 22044 KB Output is correct
39 Correct 21 ms 1200 KB Output is correct
40 Correct 21 ms 1220 KB Output is correct
41 Correct 21 ms 1220 KB Output is correct
42 Correct 21 ms 1224 KB Output is correct
43 Correct 22 ms 1108 KB Output is correct
44 Correct 22 ms 1220 KB Output is correct
45 Correct 23 ms 1108 KB Output is correct
46 Correct 22 ms 1220 KB Output is correct
47 Correct 22 ms 1220 KB Output is correct
48 Correct 22 ms 1224 KB Output is correct
49 Correct 21 ms 1224 KB Output is correct
50 Correct 21 ms 1236 KB Output is correct
51 Correct 21 ms 1220 KB Output is correct
52 Correct 20 ms 1108 KB Output is correct
53 Correct 21 ms 1108 KB Output is correct
54 Correct 13 ms 1108 KB Output is correct
55 Correct 13 ms 1212 KB Output is correct
56 Correct 11 ms 1108 KB Output is correct
57 Correct 11 ms 1108 KB Output is correct
58 Correct 12 ms 1220 KB Output is correct
59 Execution timed out 2066 ms 21972 KB Time limit exceeded
60 Halted 0 ms 0 KB -