oj.uz

답안 #200725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200725 2020-02-08T04:36:42 Z dimash241 Boat (APIO16_boat) C++17
9 / 100
 1327 ms 18476 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
 
# include <x86intrin.h>
# include <bits/stdc++.h>
 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}
 
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;
 
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n;
ll dp[505][1010];
ll p[1001][1010];
int C1[1001][1001];
int C2[1001][1001];
int l[505], r[505];
int vv[N], ptr;
ll inv[N];
ll pw[N];
 
ll bpow (ll a, ll b) {
	ll res = 1;
	while (b > 0) {
		if (b & 1) (res *= a) %= mod;
		(a *= a) %= mod;
		b /= 2;
	}
	return res;
}
 
 
ll C(ll n, int k) {
	ll res = inv[k];
	for (int i = 0; i < k; ++i) {
		res *= (n - i);
		res %= mod;
	}
 
	res *= pw[k-2];
	res %= mod;
 
	return res;
}      
 
int main () {
   	SpeedForce;
 
	inv[0] = 1;
	pw[0] = 1;
	for (int i = 1; i < 1001;i ++) {
		inv[i] = inv[i-1] * bpow(i, mod - 2) % mod;
		pw[i] = (pw[i-1] + pw[i-1]) % mod;
	}
 
	cin >> n;
 
	for (int i = 1; i <= n; ++i) {
		cin >> l[i] >> r[i];
		r[i]++;
		vv[ptr++] = l[i];
		vv[ptr++] = r[i];
	}
	sort(vv, vv + ptr);
	ptr = unique(vv, vv + ptr) - vv;
	for (int i = 0; i < ptr; ++i) dp[0][i] = 1;
    for (int i = 1; i < ptr; ++i) {
		for (int j = 1; j <= n; ++j)
			C2[i][j] = C(vv[i] - vv[i-1], j);
	}
 
	for (int i = 0; i <= n; ++i)
		C1[i][i] = C1[i][0] = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j < i; ++j)
			C1[i][j] = (C1[i-1][j] + C1[i-1][j-1]) % mod;
	}
 
	for (int i = 1; i < ptr; ++i) {
		for (int k = 1; k <= n; ++k) {
			for (int j = 1; j <= k; ++j)
				p[i][k] = (p[i][k] + C2[i][j] * (ll)C1[k-1][j-1]) % mod;
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j < ptr; ++j) if (l[i] <= vv[j-1] && vv[j] <= r[i]) {
			dp[i][j] = (dp[i-1][j-1] * (ll)(vv[j] - vv[j - 1])) % mod;
			for (int k = i - 1, cnt = 1; k > 0; --k) if (l[k] <= vv[j-1] && r[k] >= vv[j]) {
				++cnt;
				dp[i][j] = (dp[i][j] + (ll)dp[k-1][j-1] * p[j][cnt]) % mod;
				if (!C(vv[j] - vv[j-1], cnt)) break;
			}
		}
 
		dp[i][0] = 1;
		for (int j = 1; j < ptr; ++j)
			dp[i][j] = ((ll)dp[i][j] + dp[i - 1][j] + dp[i][j-1] - dp[i-1][j-1] + mod) % mod;
	}
 
	int ans = (dp[n][ptr-1] - 1 + mod) % mod;
	assert(ans >= 0);
 
	cout << ans << '\n';
	return Accepted;
}
 
// B...a

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1310 ms 18296 KB Output is correct
2 Correct 1288 ms 18276 KB Output is correct
3 Correct 1298 ms 18184 KB Output is correct
4 Correct 1290 ms 18252 KB Output is correct
5 Correct 1282 ms 18416 KB Output is correct
6 Correct 1327 ms 18196 KB Output is correct
7 Correct 1287 ms 18296 KB Output is correct
8 Correct 1290 ms 18460 KB Output is correct
9 Correct 1297 ms 18476 KB Output is correct
10 Correct 1281 ms 18296 KB Output is correct
11 Correct 1278 ms 18180 KB Output is correct
12 Correct 1292 ms 18376 KB Output is correct
13 Correct 1284 ms 18296 KB Output is correct
14 Correct 1286 ms 18260 KB Output is correct
15 Correct 1293 ms 18296 KB Output is correct
16 Correct 233 ms 7032 KB Output is correct
17 Correct 248 ms 7288 KB Output is correct
18 Correct 237 ms 7288 KB Output is correct
19 Correct 248 ms 7288 KB Output is correct
20 Correct 246 ms 7288 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1310 ms 18296 KB Output is correct
2 Correct 1288 ms 18276 KB Output is correct
3 Correct 1298 ms 18184 KB Output is correct
4 Correct 1290 ms 18252 KB Output is correct
5 Correct 1282 ms 18416 KB Output is correct
6 Correct 1327 ms 18196 KB Output is correct
7 Correct 1287 ms 18296 KB Output is correct
8 Correct 1290 ms 18460 KB Output is correct
9 Correct 1297 ms 18476 KB Output is correct
10 Correct 1281 ms 18296 KB Output is correct
11 Correct 1278 ms 18180 KB Output is correct
12 Correct 1292 ms 18376 KB Output is correct
13 Correct 1284 ms 18296 KB Output is correct
14 Correct 1286 ms 18260 KB Output is correct
15 Correct 1293 ms 18296 KB Output is correct
16 Correct 233 ms 7032 KB Output is correct
17 Correct 248 ms 7288 KB Output is correct
18 Correct 237 ms 7288 KB Output is correct
19 Correct 248 ms 7288 KB Output is correct
20 Correct 246 ms 7288 KB Output is correct
21 Incorrect 1206 ms 17400 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 3068 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1310 ms 18296 KB Output is correct
2 Correct 1288 ms 18276 KB Output is correct
3 Correct 1298 ms 18184 KB Output is correct
4 Correct 1290 ms 18252 KB Output is correct
5 Correct 1282 ms 18416 KB Output is correct
6 Correct 1327 ms 18196 KB Output is correct
7 Correct 1287 ms 18296 KB Output is correct
8 Correct 1290 ms 18460 KB Output is correct
9 Correct 1297 ms 18476 KB Output is correct
10 Correct 1281 ms 18296 KB Output is correct
11 Correct 1278 ms 18180 KB Output is correct
12 Correct 1292 ms 18376 KB Output is correct
13 Correct 1284 ms 18296 KB Output is correct
14 Correct 1286 ms 18260 KB Output is correct
15 Correct 1293 ms 18296 KB Output is correct
16 Correct 233 ms 7032 KB Output is correct
17 Correct 248 ms 7288 KB Output is correct
18 Correct 237 ms 7288 KB Output is correct
19 Correct 248 ms 7288 KB Output is correct
20 Correct 246 ms 7288 KB Output is correct
21 Incorrect 1206 ms 17400 KB Output isn't correct
22 Halted 0 ms 0 KB -