oj.uz

Submission #225063

# Submission time Handle Problem Language Result Execution time Memory
225063 2020-04-19T08:52:29 Z alishahali1382 Boat (APIO16_boat) C++14
58 / 100
 2000 ms 10796 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 510, LOG=20;

ll n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN], B[MAXN];
ll dp[2][MAXN*2][MAXN];
ll F[MAXN], I[MAXN];
int ent[MAXN*2][MAXN];
vector<int> comp;

ll powmod(ll a, ll b){
	ll res=1;
	for (; b; b>>=1, a=a*a%mod) if (b&1) res=res*a%mod;
	return res;
}

int C(int n, int r){
	if (r<0 || r>n) return 0;
	ll res=1;
	for (int i=n; i>n-r; i--) res=res*i%mod;
	return res*I[r]%mod;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	F[0]=1;
	for (int i=1; i<MAXN; i++) F[i]=F[i-1]*i%mod;
	I[MAXN-1]=powmod(F[MAXN-1], mod-2);
	for (int i=MAXN-1; i; i--) I[i-1]=I[i]*i%mod;
	cin>>n;
	for (int i=1; i<=n; i++){
		cin>>A[i]>>B[i];
		comp.pb(A[i]);
		comp.pb(++B[i]);
	}
	
	comp.pb(0);
	sort(all(comp));
	comp.resize(unique(all(comp))-comp.begin());
	m=comp.size()-1;
	
	for (int i=0; i<m; i++) for (int j=0; j<=n; j++) ent[i][j]=C(comp[i+1]-comp[i], j);
	
	for (int i=1; i<=n; i++){
		A[i]=lower_bound(all(comp), A[i])-comp.begin();
		B[i]=lower_bound(all(comp), B[i])-comp.begin();
	}
	dp[0][0][0]=1;
	int prev=0, curr=1;
	for (int i=1; i<=n; i++){
		memset(dp[curr], 0, sizeof(dp[curr]));
		dp[curr][0][0]=1;
		for (int j=1; j<=m; j++){
			for (int k=1; k<=i; k++){
				dp[curr][j][k]=dp[prev][j][k];
				if (A[i]<=j && j<B[i]){
					if (k>1) dp[curr][j][k]=(dp[curr][j][k]+dp[prev][j][k-1])%mod;
					else for (int jj=0; jj<j; jj++) dp[curr][j][k]=(dp[curr][j][k]+dp[prev][jj][0])%mod;
				}
			}
			for (int kk=1; kk<=i; kk++) dp[curr][j][0]=(dp[curr][j][0]+dp[curr][j][kk]*ent[j][kk])%mod;
		}
		swap(prev, curr);
	}
	for (int j=1; j<=m; j++) ans=(ans+dp[prev][j][0])%mod;
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1319 ms 10616 KB Output is correct
2 Correct 1346 ms 10796 KB Output is correct
3 Correct 1314 ms 10616 KB Output is correct
4 Correct 1293 ms 10616 KB Output is correct
5 Correct 1263 ms 10616 KB Output is correct
6 Correct 1286 ms 10616 KB Output is correct
7 Correct 1287 ms 10532 KB Output is correct
8 Correct 1269 ms 10556 KB Output is correct
9 Correct 1289 ms 10616 KB Output is correct
10 Correct 1265 ms 10552 KB Output is correct
11 Correct 1264 ms 10616 KB Output is correct
12 Correct 1284 ms 10656 KB Output is correct
13 Correct 1278 ms 10676 KB Output is correct
14 Correct 1302 ms 10616 KB Output is correct
15 Correct 1281 ms 10488 KB Output is correct
16 Correct 338 ms 8824 KB Output is correct
17 Correct 355 ms 8952 KB Output is correct
18 Correct 347 ms 8824 KB Output is correct
19 Correct 363 ms 8824 KB Output is correct
20 Correct 349 ms 8952 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1319 ms 10616 KB Output is correct
2 Correct 1346 ms 10796 KB Output is correct
3 Correct 1314 ms 10616 KB Output is correct
4 Correct 1293 ms 10616 KB Output is correct
5 Correct 1263 ms 10616 KB Output is correct
6 Correct 1286 ms 10616 KB Output is correct
7 Correct 1287 ms 10532 KB Output is correct
8 Correct 1269 ms 10556 KB Output is correct
9 Correct 1289 ms 10616 KB Output is correct
10 Correct 1265 ms 10552 KB Output is correct
11 Correct 1264 ms 10616 KB Output is correct
12 Correct 1284 ms 10656 KB Output is correct
13 Correct 1278 ms 10676 KB Output is correct
14 Correct 1302 ms 10616 KB Output is correct
15 Correct 1281 ms 10488 KB Output is correct
16 Correct 338 ms 8824 KB Output is correct
17 Correct 355 ms 8952 KB Output is correct
18 Correct 347 ms 8824 KB Output is correct
19 Correct 363 ms 8824 KB Output is correct
20 Correct 349 ms 8952 KB Output is correct
21 Correct 1239 ms 10384 KB Output is correct
22 Correct 1256 ms 10408 KB Output is correct
23 Correct 1226 ms 10488 KB Output is correct
24 Correct 1245 ms 10360 KB Output is correct
25 Correct 1267 ms 10368 KB Output is correct
26 Correct 1349 ms 10320 KB Output is correct
27 Correct 1396 ms 10360 KB Output is correct
28 Correct 1332 ms 10360 KB Output is correct
29 Correct 1357 ms 10360 KB Output is correct
30 Correct 1262 ms 10556 KB Output is correct
31 Correct 1247 ms 10616 KB Output is correct
32 Correct 1242 ms 10616 KB Output is correct
33 Correct 1300 ms 10616 KB Output is correct
34 Correct 1366 ms 10616 KB Output is correct
35 Correct 1293 ms 10556 KB Output is correct
36 Correct 1295 ms 10588 KB Output is correct
37 Correct 1347 ms 10556 KB Output is correct
38 Correct 1250 ms 10616 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 8952 KB Output is correct
2 Correct 53 ms 8952 KB Output is correct
3 Correct 51 ms 8960 KB Output is correct
4 Correct 52 ms 8952 KB Output is correct
5 Correct 54 ms 8960 KB Output is correct
6 Correct 55 ms 8952 KB Output is correct
7 Correct 54 ms 8832 KB Output is correct
8 Correct 63 ms 9080 KB Output is correct
9 Correct 56 ms 8960 KB Output is correct
10 Correct 57 ms 8952 KB Output is correct
11 Correct 61 ms 8952 KB Output is correct
12 Correct 55 ms 8832 KB Output is correct
13 Correct 59 ms 8832 KB Output is correct
14 Correct 56 ms 8960 KB Output is correct
15 Correct 54 ms 8952 KB Output is correct
16 Correct 44 ms 8704 KB Output is correct
17 Correct 48 ms 8704 KB Output is correct
18 Correct 48 ms 8704 KB Output is correct
19 Correct 54 ms 8704 KB Output is correct
20 Correct 45 ms 8736 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1319 ms 10616 KB Output is correct
2 Correct 1346 ms 10796 KB Output is correct
3 Correct 1314 ms 10616 KB Output is correct
4 Correct 1293 ms 10616 KB Output is correct
5 Correct 1263 ms 10616 KB Output is correct
6 Correct 1286 ms 10616 KB Output is correct
7 Correct 1287 ms 10532 KB Output is correct
8 Correct 1269 ms 10556 KB Output is correct
9 Correct 1289 ms 10616 KB Output is correct
10 Correct 1265 ms 10552 KB Output is correct
11 Correct 1264 ms 10616 KB Output is correct
12 Correct 1284 ms 10656 KB Output is correct
13 Correct 1278 ms 10676 KB Output is correct
14 Correct 1302 ms 10616 KB Output is correct
15 Correct 1281 ms 10488 KB Output is correct
16 Correct 338 ms 8824 KB Output is correct
17 Correct 355 ms 8952 KB Output is correct
18 Correct 347 ms 8824 KB Output is correct
19 Correct 363 ms 8824 KB Output is correct
20 Correct 349 ms 8952 KB Output is correct
21 Correct 1239 ms 10384 KB Output is correct
22 Correct 1256 ms 10408 KB Output is correct
23 Correct 1226 ms 10488 KB Output is correct
24 Correct 1245 ms 10360 KB Output is correct
25 Correct 1267 ms 10368 KB Output is correct
26 Correct 1349 ms 10320 KB Output is correct
27 Correct 1396 ms 10360 KB Output is correct
28 Correct 1332 ms 10360 KB Output is correct
29 Correct 1357 ms 10360 KB Output is correct
30 Correct 1262 ms 10556 KB Output is correct
31 Correct 1247 ms 10616 KB Output is correct
32 Correct 1242 ms 10616 KB Output is correct
33 Correct 1300 ms 10616 KB Output is correct
34 Correct 1366 ms 10616 KB Output is correct
35 Correct 1293 ms 10556 KB Output is correct
36 Correct 1295 ms 10588 KB Output is correct
37 Correct 1347 ms 10556 KB Output is correct
38 Correct 1250 ms 10616 KB Output is correct
39 Correct 53 ms 8952 KB Output is correct
40 Correct 53 ms 8952 KB Output is correct
41 Correct 51 ms 8960 KB Output is correct
42 Correct 52 ms 8952 KB Output is correct
43 Correct 54 ms 8960 KB Output is correct
44 Correct 55 ms 8952 KB Output is correct
45 Correct 54 ms 8832 KB Output is correct
46 Correct 63 ms 9080 KB Output is correct
47 Correct 56 ms 8960 KB Output is correct
48 Correct 57 ms 8952 KB Output is correct
49 Correct 61 ms 8952 KB Output is correct
50 Correct 55 ms 8832 KB Output is correct
51 Correct 59 ms 8832 KB Output is correct
52 Correct 56 ms 8960 KB Output is correct
53 Correct 54 ms 8952 KB Output is correct
54 Correct 44 ms 8704 KB Output is correct
55 Correct 48 ms 8704 KB Output is correct
56 Correct 48 ms 8704 KB Output is correct
57 Correct 54 ms 8704 KB Output is correct
58 Correct 45 ms 8736 KB Output is correct
59 Execution timed out 2089 ms 10488 KB Time limit exceeded
60 Halted 0 ms 0 KB -