Submission #376291

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
376291	2021-03-11T07:39:33 Z	shivensinha4	Boat (APIO16_boat)	C++17	58 / 100	2000 ms	16364 KB

boat

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
// #define endl '\n'

namespace speedy_io {
	int read_nonneg() {
		int c;
		while ((c = getchar_unlocked()) < '0' || c > '9');
		int v = c - '0';
		while ((c = getchar_unlocked()) >= '0' && c <= '9') {
			v = (v << 3) + (v << 1) + (c - '0');
		}
		return v;
	}
	
	const int max_ll_size = 20;
	void put_nonneg(ll n) {
		int i = max_ll_size;
		char output_buffer[max_ll_size];
		do {
			output_buffer[--i] = (n % 10) + '0';
			n /= 10;
		} while (n);
		do {
			putchar_unlocked(output_buffer[i]);
		} while (++i < max_ll_size);
	}
}

using namespace speedy_io;

 
const ll mod = 1e9+7;
 
ll power(ll x, ll y) {
	if (y == 0) return 1;
	ll p = power(x, y/2) % mod;
	p = (p * p) % mod;
  
	return (y%2 == 0)? p : (x * p) % mod;
}
 
ll modInverse(ll a) {
	return power(a, mod-2);
}
 
const int MXN = 500;
ll choose[4*MXN+2][MXN+1], dp[2][MXN+1][MXN+1][2];
 
int main() {
#ifdef mlocal
	freopen("test.in", "r", stdin);
#endif
	
	// ios_base::sync_with_stdio(false);
	// cin.tie(0);
	
	int n = read_nonneg();
	vector<ii> lt(n);
	vi raw(2*n);
	
	for_(i, 0, n) {
		lt[i][0] = read_nonneg(), lt[i][1] = read_nonneg();
		lt[i][1]++;
		raw[2*i] = lt[i][0], raw[2*i+1] = lt[i][1];
	}
	
	sort(raw.begin(), raw.end());
	raw.resize(unique(raw.begin(), raw.end()) - raw.begin());
	
	vector<ii> seg;
	// int pre = -1;
	for_(i, 1, raw.size()) {
		// if (pre < raw[i] and pre != -1) seg.push_back({pre, raw[i]-1});
		seg.push_back({raw[i-1], raw[i]-1});
		// pre = raw[i]+1;
	}
	
	int ns = seg.size();
	// cout << ns << endl;
	// for (auto i: seg) cout << i[0] << " " << i[1] << endl;
	memset(choose, 0, sizeof(choose)); memset(dp, 0, sizeof(dp));
	
	vector<ll> modInv(n+1);
	for_(i, 1, n+1) modInv[i] = modInverse(i);
	
	for_(i, 0, ns) {
		choose[i][0] = 1;
		for_(r, 1, min(n, seg[i][1]-seg[i][0]+1) + 1) choose[i][r] = (((choose[i][r-1] * (seg[i][1]-seg[i][0]-r+2)) % mod) * modInv[r]) % mod;
	}
	
	bool valid[n];
	
	int c = 0;
	for (int s = ns-1; s >= 0; s--) {
		memset(dp[c], 0, sizeof(dp[c]));
		
		for_(idx, 0, n) valid[idx] = seg[s][0] >= lt[idx][0] and seg[s][1] < lt[idx][1];
		
		for (int ct = min(n-1, seg[s][1]-seg[s][0]+1); ct >= 0; ct--) {
			dp[c][ct][n][0] = choose[s][ct];
			
			for (int idx = n-1; idx >= 0; idx--) {
				if (valid[idx]) dp[c][ct][idx][1] += dp[c][ct+1][idx+1][0];
				if (dp[c][ct][idx][1] >= mod) dp[c][ct][idx][1] -= mod;
				
				dp[c][ct][idx][1] += (choose[s][ct] * (s < ns-1 ? dp[1-c][0][idx][1] : 0)) % mod;
				if (dp[c][ct][idx][1] >= mod) dp[c][ct][idx][1] -= mod;
				
				dp[c][ct][idx][0] = dp[c][ct][idx][1] + dp[c][ct][idx+1][0];
				if (dp[c][ct][idx][0] >= mod) dp[c][ct][idx][0] -= mod;
			}
		}
		c = 1-c;
	}
	
	put_nonneg((dp[1-c][0][0][0]-1+mod) % mod);
	printf("\n");
	
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1008 ms	16236 KB	Output is correct
2	Correct	1028 ms	16312 KB	Output is correct
3	Correct	1031 ms	16116 KB	Output is correct
4	Correct	1012 ms	16140 KB	Output is correct
5	Correct	985 ms	16116 KB	Output is correct
6	Correct	997 ms	16244 KB	Output is correct
7	Correct	1016 ms	16116 KB	Output is correct
8	Correct	989 ms	16116 KB	Output is correct
9	Correct	1061 ms	16116 KB	Output is correct
10	Correct	1004 ms	16236 KB	Output is correct
11	Correct	981 ms	16236 KB	Output is correct
12	Correct	999 ms	16116 KB	Output is correct
13	Correct	1012 ms	16236 KB	Output is correct
14	Correct	961 ms	16236 KB	Output is correct
15	Correct	1040 ms	16116 KB	Output is correct
16	Correct	191 ms	16108 KB	Output is correct
17	Correct	215 ms	16108 KB	Output is correct
18	Correct	187 ms	16108 KB	Output is correct
19	Correct	197 ms	16108 KB	Output is correct
20	Correct	202 ms	16108 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1008 ms	16236 KB	Output is correct
2	Correct	1028 ms	16312 KB	Output is correct
3	Correct	1031 ms	16116 KB	Output is correct
4	Correct	1012 ms	16140 KB	Output is correct
5	Correct	985 ms	16116 KB	Output is correct
6	Correct	997 ms	16244 KB	Output is correct
7	Correct	1016 ms	16116 KB	Output is correct
8	Correct	989 ms	16116 KB	Output is correct
9	Correct	1061 ms	16116 KB	Output is correct
10	Correct	1004 ms	16236 KB	Output is correct
11	Correct	981 ms	16236 KB	Output is correct
12	Correct	999 ms	16116 KB	Output is correct
13	Correct	1012 ms	16236 KB	Output is correct
14	Correct	961 ms	16236 KB	Output is correct
15	Correct	1040 ms	16116 KB	Output is correct
16	Correct	191 ms	16108 KB	Output is correct
17	Correct	215 ms	16108 KB	Output is correct
18	Correct	187 ms	16108 KB	Output is correct
19	Correct	197 ms	16108 KB	Output is correct
20	Correct	202 ms	16108 KB	Output is correct
21	Correct	381 ms	16236 KB	Output is correct
22	Correct	399 ms	16236 KB	Output is correct
23	Correct	400 ms	16236 KB	Output is correct
24	Correct	430 ms	16112 KB	Output is correct
25	Correct	419 ms	16364 KB	Output is correct
26	Correct	386 ms	16108 KB	Output is correct
27	Correct	379 ms	16112 KB	Output is correct
28	Correct	435 ms	16112 KB	Output is correct
29	Correct	345 ms	16108 KB	Output is correct
30	Correct	912 ms	16108 KB	Output is correct
31	Correct	979 ms	16116 KB	Output is correct
32	Correct	919 ms	16236 KB	Output is correct
33	Correct	937 ms	16236 KB	Output is correct
34	Correct	963 ms	16236 KB	Output is correct
35	Correct	940 ms	16236 KB	Output is correct
36	Correct	912 ms	16236 KB	Output is correct
37	Correct	921 ms	16108 KB	Output is correct
38	Correct	903 ms	16116 KB	Output is correct

Subtask #3
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	114 ms	15980 KB	Output is correct
2	Correct	111 ms	16092 KB	Output is correct
3	Correct	94 ms	15980 KB	Output is correct
4	Correct	95 ms	15980 KB	Output is correct
5	Correct	108 ms	15980 KB	Output is correct
6	Correct	106 ms	16108 KB	Output is correct
7	Correct	95 ms	16000 KB	Output is correct
8	Correct	98 ms	16120 KB	Output is correct
9	Correct	98 ms	16108 KB	Output is correct
10	Correct	97 ms	15980 KB	Output is correct
11	Correct	93 ms	15980 KB	Output is correct
12	Correct	91 ms	15980 KB	Output is correct
13	Correct	93 ms	15980 KB	Output is correct
14	Correct	106 ms	16236 KB	Output is correct
15	Correct	96 ms	15980 KB	Output is correct
16	Correct	62 ms	16108 KB	Output is correct
17	Correct	64 ms	15980 KB	Output is correct
18	Correct	60 ms	15980 KB	Output is correct
19	Correct	58 ms	15980 KB	Output is correct
20	Correct	61 ms	16108 KB	Output is correct

Subtask #4
0 / 42.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1008 ms	16236 KB	Output is correct
2	Correct	1028 ms	16312 KB	Output is correct
3	Correct	1031 ms	16116 KB	Output is correct
4	Correct	1012 ms	16140 KB	Output is correct
5	Correct	985 ms	16116 KB	Output is correct
6	Correct	997 ms	16244 KB	Output is correct
7	Correct	1016 ms	16116 KB	Output is correct
8	Correct	989 ms	16116 KB	Output is correct
9	Correct	1061 ms	16116 KB	Output is correct
10	Correct	1004 ms	16236 KB	Output is correct
11	Correct	981 ms	16236 KB	Output is correct
12	Correct	999 ms	16116 KB	Output is correct
13	Correct	1012 ms	16236 KB	Output is correct
14	Correct	961 ms	16236 KB	Output is correct
15	Correct	1040 ms	16116 KB	Output is correct
16	Correct	191 ms	16108 KB	Output is correct
17	Correct	215 ms	16108 KB	Output is correct
18	Correct	187 ms	16108 KB	Output is correct
19	Correct	197 ms	16108 KB	Output is correct
20	Correct	202 ms	16108 KB	Output is correct
21	Correct	381 ms	16236 KB	Output is correct
22	Correct	399 ms	16236 KB	Output is correct
23	Correct	400 ms	16236 KB	Output is correct
24	Correct	430 ms	16112 KB	Output is correct
25	Correct	419 ms	16364 KB	Output is correct
26	Correct	386 ms	16108 KB	Output is correct
27	Correct	379 ms	16112 KB	Output is correct
28	Correct	435 ms	16112 KB	Output is correct
29	Correct	345 ms	16108 KB	Output is correct
30	Correct	912 ms	16108 KB	Output is correct
31	Correct	979 ms	16116 KB	Output is correct
32	Correct	919 ms	16236 KB	Output is correct
33	Correct	937 ms	16236 KB	Output is correct
34	Correct	963 ms	16236 KB	Output is correct
35	Correct	940 ms	16236 KB	Output is correct
36	Correct	912 ms	16236 KB	Output is correct
37	Correct	921 ms	16108 KB	Output is correct
38	Correct	903 ms	16116 KB	Output is correct
39	Correct	114 ms	15980 KB	Output is correct
40	Correct	111 ms	16092 KB	Output is correct
41	Correct	94 ms	15980 KB	Output is correct
42	Correct	95 ms	15980 KB	Output is correct
43	Correct	108 ms	15980 KB	Output is correct
44	Correct	106 ms	16108 KB	Output is correct
45	Correct	95 ms	16000 KB	Output is correct
46	Correct	98 ms	16120 KB	Output is correct
47	Correct	98 ms	16108 KB	Output is correct
48	Correct	97 ms	15980 KB	Output is correct
49	Correct	93 ms	15980 KB	Output is correct
50	Correct	91 ms	15980 KB	Output is correct
51	Correct	93 ms	15980 KB	Output is correct
52	Correct	106 ms	16236 KB	Output is correct
53	Correct	96 ms	15980 KB	Output is correct
54	Correct	62 ms	16108 KB	Output is correct
55	Correct	64 ms	15980 KB	Output is correct
56	Correct	60 ms	15980 KB	Output is correct
57	Correct	58 ms	15980 KB	Output is correct
58	Correct	61 ms	16108 KB	Output is correct
59	Execution timed out	2082 ms	16256 KB	Time limit exceeded
60	Halted	0 ms	0 KB	-

Submission #376291

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 22.0 / 22.0

Subtask #3 27.0 / 27.0

Subtask #4 0 / 42.0

Subtask #1
9.0 / 9.0

Subtask #2
22.0 / 22.0

Subtask #3
27.0 / 27.0

Subtask #4
0 / 42.0