oj.uz

Submission #754851

# Submission time Handle Problem Language Result Execution time Memory
754851 2023-06-08T17:43:15 Z denniskim Boat (APIO16_boat) C++17
100 / 100
 1381 ms 8360 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
 
using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())
 
inline int readChar();
template<class T = int> inline T readInt();
template<class T> inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
static const int buf_size = 1 << 18;
inline int getChar(){
    #ifndef LOCAL
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if(pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
    if(pos == len) return -1;
    return buf[pos++];
    #endif
}
inline int readChar(){
    #ifndef LOCAL
    int c = getChar();
    while(c <= 32) c = getChar();
    return c;
    #else
    char c; cin >> c; return c;
    #endif
}
template <class T>
inline T readInt(){
    #ifndef LOCAL
    int s = 1, c = readChar();
    T x = 0;
    if(c == '-') s = -1, c = getChar();
    while('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
    #else
    T x; cin >> x; return x;
    #endif
}
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x){
    if(write_pos == buf_size) fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
template <class T>
inline void writeInt(T x, char end){
    if(x < 0) writeChar('-'), x = -x;
    char s[24]; int n = 0;
    while(x || !n) s[n++] = '0' + x % 10, x /= 10;
    while(n--) writeChar(s[n]);
    if(end) writeChar(end);
}
inline void writeWord(const char *s){
    while(*s) writeChar(*s++);
}
struct Flusher{
    ~Flusher(){ if(write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0; }
}flusher;
 
int n;
pair<int, int> a[1010];
int ss = 1000000007;
int inv[1010];
vector<int> zip;
ll dp[1010][1010];
ll LC[1010];
ll xjc[1010];
int num[1010];
 
ll fast_mod(ll X)
{
	return X >= ss ? X - X / ss * ss : X;
}
 
ll sqrmtp(ll X, ll Y)
{
	ll ret = 1;
	
	while(Y)
	{
		if(Y & 1)
			ret = fast_mod(ret * X);
		
		X = fast_mod(X * X);
		Y >>= 1;
	}
	
	return ret;
}
 
int main(void)
{
	fastio
	
	n = readInt();
	//cin >> n;
	
	for(int i = 1 ; i <= n ; ++i)
	{
		a[i].fi = readInt();
		a[i].se = readInt();
		
		//cin >> a[i].fi >> a[i].se;
		
		zip.push_back(a[i].fi);
		zip.push_back(a[i].se + 1);
	}
	
	for(int i = 1 ; i <= n ; ++i)
		inv[i] = sqrmtp(i, ss - 2);
	
	compress(zip);
	
	dp[0][0] = 1;
	
	for(int i = 1 ; i <= n ; ++i)
		dp[0][i] = 1;
	
	int siz = (ll)zip.size();
	
	for(int i = 1 ; i < siz ; ++i)
	{
		int siz2 = 0;
		
		for(int j = 1 ; j <= n ; ++j)
		{
			if(a[j].fi <= zip[i - 1] && zip[i] - 1 <= a[j].se)
				num[siz2++] = j;
		}
		
		int L = zip[i] - zip[i - 1];
		LC[0] = 1;
		
		for(int j = 1 ; j <= siz2 ; ++j)
		{
			if(L <= 0)
				break;
			
			LC[j] = fast_mod(fast_mod(LC[j - 1] * L) * inv[j]);
			L--;
		}
		
		L = zip[i] - zip[i - 1];
		
		for(int j = 0 ; j <= siz2 - 2 ; ++j)
		{
			ll gap = j;
			ll gap2 = 1;
			
			xjc[j] = 0;
			
			if(L <= 1)
				break;
			
			xjc[j] = LC[2];
			
			for(int k = 1 ; ; ++k)
			{
				if(k + 2 > L || k > j)
					break;
				
				gap2 = fast_mod(fast_mod(gap2 * gap) * inv[k]);
				--gap;
				xjc[j] = fast_mod(xjc[j] + gap2 * LC[k + 2]);
			}
		}
		
		for(int j = 0 ; j < siz2 ; ++j)
		{
			dp[i][num[j]] = fast_mod(dp[i][num[j]] + dp[i - 1][num[j] - 1] * LC[1]);
			
			if(L >= 2)
			{
				for(int k = 0 ; k < j ; ++k)
					dp[i][num[j]] = fast_mod(dp[i][num[j]] + dp[i - 1][num[k] - 1] * xjc[j - k - 1]);
			}
		}
		
		for(int j = 0 ; j <= n ; ++j)
		{
			dp[i][j] = fast_mod(dp[i][j] + dp[i - 1][j] + dp[i][j - 1]);
			
			if(j)
				dp[i][j] = fast_mod(dp[i][j] - dp[i - 1][j - 1] + ss);
		}
	}
	
	dp[siz - 1][n]--;
	dp[siz - 1][n] = (dp[siz - 1][n] % ss + ss) % ss;
	
	cout << dp[siz - 1][n];
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8276 KB Output is correct
2 Correct 10 ms 8276 KB Output is correct
3 Correct 11 ms 8276 KB Output is correct
4 Correct 9 ms 8276 KB Output is correct
5 Correct 9 ms 8276 KB Output is correct
6 Correct 10 ms 8276 KB Output is correct
7 Correct 9 ms 8276 KB Output is correct
8 Correct 10 ms 8208 KB Output is correct
9 Correct 11 ms 8308 KB Output is correct
10 Correct 10 ms 8276 KB Output is correct
11 Correct 9 ms 8216 KB Output is correct
12 Correct 10 ms 8276 KB Output is correct
13 Correct 10 ms 8276 KB Output is correct
14 Correct 9 ms 8276 KB Output is correct
15 Correct 10 ms 8276 KB Output is correct
16 Correct 3 ms 1748 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 2 ms 1748 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1748 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8276 KB Output is correct
2 Correct 10 ms 8276 KB Output is correct
3 Correct 11 ms 8276 KB Output is correct
4 Correct 9 ms 8276 KB Output is correct
5 Correct 9 ms 8276 KB Output is correct
6 Correct 10 ms 8276 KB Output is correct
7 Correct 9 ms 8276 KB Output is correct
8 Correct 10 ms 8208 KB Output is correct
9 Correct 11 ms 8308 KB Output is correct
10 Correct 10 ms 8276 KB Output is correct
11 Correct 9 ms 8216 KB Output is correct
12 Correct 10 ms 8276 KB Output is correct
13 Correct 10 ms 8276 KB Output is correct
14 Correct 9 ms 8276 KB Output is correct
15 Correct 10 ms 8276 KB Output is correct
16 Correct 3 ms 1748 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 2 ms 1748 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1748 KB Output is correct
21 Correct 111 ms 7568 KB Output is correct
22 Correct 106 ms 7588 KB Output is correct
23 Correct 98 ms 7428 KB Output is correct
24 Correct 113 ms 7528 KB Output is correct
25 Correct 111 ms 7432 KB Output is correct
26 Correct 212 ms 7224 KB Output is correct
27 Correct 207 ms 7332 KB Output is correct
28 Correct 217 ms 7176 KB Output is correct
29 Correct 235 ms 7216 KB Output is correct
30 Correct 9 ms 8148 KB Output is correct
31 Correct 9 ms 8276 KB Output is correct
32 Correct 9 ms 8236 KB Output is correct
33 Correct 10 ms 8276 KB Output is correct
34 Correct 9 ms 8248 KB Output is correct
35 Correct 10 ms 8180 KB Output is correct
36 Correct 10 ms 8148 KB Output is correct
37 Correct 10 ms 8136 KB Output is correct
38 Correct 10 ms 8148 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1236 KB Output is correct
2 Correct 3 ms 1236 KB Output is correct
3 Correct 4 ms 1236 KB Output is correct
4 Correct 6 ms 1236 KB Output is correct
5 Correct 5 ms 1236 KB Output is correct
6 Correct 11 ms 1276 KB Output is correct
7 Correct 11 ms 1264 KB Output is correct
8 Correct 11 ms 1236 KB Output is correct
9 Correct 11 ms 1236 KB Output is correct
10 Correct 11 ms 1248 KB Output is correct
11 Correct 6 ms 1236 KB Output is correct
12 Correct 4 ms 1236 KB Output is correct
13 Correct 5 ms 1236 KB Output is correct
14 Correct 5 ms 1312 KB Output is correct
15 Correct 5 ms 1236 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 3 ms 852 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 3 ms 852 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 8276 KB Output is correct
2 Correct 10 ms 8276 KB Output is correct
3 Correct 11 ms 8276 KB Output is correct
4 Correct 9 ms 8276 KB Output is correct
5 Correct 9 ms 8276 KB Output is correct
6 Correct 10 ms 8276 KB Output is correct
7 Correct 9 ms 8276 KB Output is correct
8 Correct 10 ms 8208 KB Output is correct
9 Correct 11 ms 8308 KB Output is correct
10 Correct 10 ms 8276 KB Output is correct
11 Correct 9 ms 8216 KB Output is correct
12 Correct 10 ms 8276 KB Output is correct
13 Correct 10 ms 8276 KB Output is correct
14 Correct 9 ms 8276 KB Output is correct
15 Correct 10 ms 8276 KB Output is correct
16 Correct 3 ms 1748 KB Output is correct
17 Correct 3 ms 1876 KB Output is correct
18 Correct 2 ms 1748 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1748 KB Output is correct
21 Correct 111 ms 7568 KB Output is correct
22 Correct 106 ms 7588 KB Output is correct
23 Correct 98 ms 7428 KB Output is correct
24 Correct 113 ms 7528 KB Output is correct
25 Correct 111 ms 7432 KB Output is correct
26 Correct 212 ms 7224 KB Output is correct
27 Correct 207 ms 7332 KB Output is correct
28 Correct 217 ms 7176 KB Output is correct
29 Correct 235 ms 7216 KB Output is correct
30 Correct 9 ms 8148 KB Output is correct
31 Correct 9 ms 8276 KB Output is correct
32 Correct 9 ms 8236 KB Output is correct
33 Correct 10 ms 8276 KB Output is correct
34 Correct 9 ms 8248 KB Output is correct
35 Correct 10 ms 8180 KB Output is correct
36 Correct 10 ms 8148 KB Output is correct
37 Correct 10 ms 8136 KB Output is correct
38 Correct 10 ms 8148 KB Output is correct
39 Correct 5 ms 1236 KB Output is correct
40 Correct 3 ms 1236 KB Output is correct
41 Correct 4 ms 1236 KB Output is correct
42 Correct 6 ms 1236 KB Output is correct
43 Correct 5 ms 1236 KB Output is correct
44 Correct 11 ms 1276 KB Output is correct
45 Correct 11 ms 1264 KB Output is correct
46 Correct 11 ms 1236 KB Output is correct
47 Correct 11 ms 1236 KB Output is correct
48 Correct 11 ms 1248 KB Output is correct
49 Correct 6 ms 1236 KB Output is correct
50 Correct 4 ms 1236 KB Output is correct
51 Correct 5 ms 1236 KB Output is correct
52 Correct 5 ms 1312 KB Output is correct
53 Correct 5 ms 1236 KB Output is correct
54 Correct 3 ms 852 KB Output is correct
55 Correct 2 ms 852 KB Output is correct
56 Correct 3 ms 852 KB Output is correct
57 Correct 2 ms 852 KB Output is correct
58 Correct 3 ms 852 KB Output is correct
59 Correct 574 ms 8184 KB Output is correct
60 Correct 514 ms 8184 KB Output is correct
61 Correct 489 ms 8220 KB Output is correct
62 Correct 604 ms 8200 KB Output is correct
63 Correct 547 ms 8168 KB Output is correct
64 Correct 1381 ms 8244 KB Output is correct
65 Correct 1336 ms 8200 KB Output is correct
66 Correct 1341 ms 8220 KB Output is correct
67 Correct 1345 ms 8360 KB Output is correct
68 Correct 1375 ms 8280 KB Output is correct
69 Correct 492 ms 8236 KB Output is correct
70 Correct 493 ms 8320 KB Output is correct
71 Correct 496 ms 8144 KB Output is correct
72 Correct 530 ms 8268 KB Output is correct
73 Correct 520 ms 8316 KB Output is correct
74 Correct 59 ms 1684 KB Output is correct
75 Correct 59 ms 1744 KB Output is correct
76 Correct 60 ms 1772 KB Output is correct
77 Correct 59 ms 1748 KB Output is correct
78 Correct 61 ms 1740 KB Output is correct