oj.uz

답안 #832866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832866 2023-08-21T16:05:15 Z caganyanmaz Boat (APIO16_boat) C++17
58 / 100
 2000 ms 30268 KB 
#include <bits/stdc++.h>


#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define int int64_t
#define pb push_back
using namespace std;


//#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif

constexpr static int MXN = 6000;
constexpr static int MXR = 11000;
int n;
vector<int> a, b;
vector<int> ranges;
int dp[MXR][MXN]; // Schools passed, last range, count in  last range
int old_dp[MXR][MXN];
int sums[MXN][MXN]; // last range
constexpr static int MOD = 1e9 + 7;

static inline int add(int a, int b) { return (a+b) % MOD; }
static inline int mul(int64_t a, int64_t b) { return (a*b) % MOD; }

static inline int pow(int a, int b)
{
	int res = 1;
	while (b)
	{
		if (b&1)
		{
			res = mul(a, res);
			b--;
		}
		else
		{
			a = mul(a, a);
			b >>= 1;
		}
	}
	return res;
}

static inline int _div(int a, int b) { return mul(a, pow(b, MOD-2)); }
int C[MXR][MXN];
int p[MXN];

int32_t main()
{
	cin >> n;
	p[0] = 1;
	for (int i = 1; i < n; i++)
		p[i] = mul(i, p[i-1]);
	a.resize(n, 0), b.resize(n, 0);
	debug("A");
	for (int i = 0; i < n; i++)
	{
		cin >> a[i] >> b[i];
		b[i]++;
	}
	debug("b");
	vector<int> c;
 	for (int i = 0; i < n; i++)
		c.pb(a[i]);
	for (int i = 0; i < n; i++)
		c.pb(b[i]);
	debug("A");
	sort(c.begin(), c.end());
	auto last = unique(c.begin(), c.end());
	c.erase(last, c.end());
	int rn = c.size();
	for (int i = 0; i < c.size()-1; i++)
		ranges.pb(c[i+1] - c[i]);
	debug("B");
	for (int i = 0; i < rn; i++)
	{
		int pf = 1;
		for (int j = 0; j <= n; j++)
		{
			C[i][j] = pf;
			pf = mul(pf, ranges[i]-j);
			pf = _div(pf, j+1);
			if (ranges[i] < j)
				C[i][j] = 0;
			debug(i, j, C[i][j]);
		}
	}
	debug("D");
	debug(a, b);
	for (int& i : a)
		i = lower_bound(c.begin(), c.end(), i) - c.begin();
	for (int& i : b)
		i = lower_bound(c.begin(), c.end(), i) - c.begin();
	debug(a, b);
	for (int j = 0; j < rn; j++)
		old_dp[j][0] = 1;
	for (int i = 1; i <= n; i++) // Current node
	{
		for (int j = 0; j < rn; j++) // Current range
		{
			dp[j][0] = 1;
			for (int k = 1; k <= n; k++) // Current count 
			{
				dp[j][k] = 0;
				if (a[i-1] <= j && b[i-1] > j)
				{
					if (j > 0 && k == 1)
						dp[j][k] = add(dp[j][k], sums[i-1][j-1]); // Starting with it
					dp[j][k] = add(dp[j][k], old_dp[j][k-1]); // Including it		
					debug(i, j, k);
				}
				dp[j][k] = add(dp[j][k], old_dp[j][k]); // Not including it
				debug(i, j, k, dp[j][k]);
			}
		}
		for (int j = 0; j < rn; j++)
		{
			if (j > 0)
				sums[i][j] = add(sums[i][j], sums[i][j-1]);
			debug(sums[i][j]);
			for (int k = 1; k <= n; k++)
			{
				sums[i][j] = add(sums[i][j], mul(dp[j][k], C[j][k]));
			}
			debug(i, j, sums[i][j]);
		}
		for (int j = 0; j < rn; j++)
			for (int k = 1; k <= n; k++)
				old_dp[j][k] = dp[j][k];
	}
	int res = 0;
	for (int i = 0; i < rn; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			debug(i, j, old_dp[i][j]);
			res = add(res, mul(old_dp[i][j], C[i][j]));
		}
	
	}
	cout << res << "\n";
}

Compilation message

boat.cpp: In function 'int32_t main()':
boat.cpp:78:20: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |  for (int i = 0; i < c.size()-1; i++)
      |                  ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1804 ms 30132 KB Output is correct
2 Correct 1767 ms 30148 KB Output is correct
3 Correct 1768 ms 30196 KB Output is correct
4 Correct 1783 ms 30060 KB Output is correct
5 Correct 1799 ms 30120 KB Output is correct
6 Correct 1749 ms 30144 KB Output is correct
7 Correct 1888 ms 30144 KB Output is correct
8 Correct 1890 ms 30104 KB Output is correct
9 Correct 1992 ms 30068 KB Output is correct
10 Correct 1906 ms 30092 KB Output is correct
11 Correct 1821 ms 30204 KB Output is correct
12 Correct 1789 ms 30116 KB Output is correct
13 Correct 1833 ms 30188 KB Output is correct
14 Correct 1819 ms 30112 KB Output is correct
15 Correct 1794 ms 30184 KB Output is correct
16 Correct 270 ms 7192 KB Output is correct
17 Correct 293 ms 7684 KB Output is correct
18 Correct 277 ms 7372 KB Output is correct
19 Correct 286 ms 7656 KB Output is correct
20 Correct 280 ms 7444 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1804 ms 30132 KB Output is correct
2 Correct 1767 ms 30148 KB Output is correct
3 Correct 1768 ms 30196 KB Output is correct
4 Correct 1783 ms 30060 KB Output is correct
5 Correct 1799 ms 30120 KB Output is correct
6 Correct 1749 ms 30144 KB Output is correct
7 Correct 1888 ms 30144 KB Output is correct
8 Correct 1890 ms 30104 KB Output is correct
9 Correct 1992 ms 30068 KB Output is correct
10 Correct 1906 ms 30092 KB Output is correct
11 Correct 1821 ms 30204 KB Output is correct
12 Correct 1789 ms 30116 KB Output is correct
13 Correct 1833 ms 30188 KB Output is correct
14 Correct 1819 ms 30112 KB Output is correct
15 Correct 1794 ms 30184 KB Output is correct
16 Correct 270 ms 7192 KB Output is correct
17 Correct 293 ms 7684 KB Output is correct
18 Correct 277 ms 7372 KB Output is correct
19 Correct 286 ms 7656 KB Output is correct
20 Correct 280 ms 7444 KB Output is correct
21 Correct 1674 ms 27868 KB Output is correct
22 Correct 1723 ms 28128 KB Output is correct
23 Correct 1717 ms 27628 KB Output is correct
24 Correct 1684 ms 27372 KB Output is correct
25 Correct 1713 ms 27420 KB Output is correct
26 Correct 1699 ms 26784 KB Output is correct
27 Correct 1728 ms 27204 KB Output is correct
28 Correct 1740 ms 26860 KB Output is correct
29 Correct 1682 ms 26688 KB Output is correct
30 Correct 1799 ms 30084 KB Output is correct
31 Correct 1850 ms 30112 KB Output is correct
32 Correct 1827 ms 30104 KB Output is correct
33 Correct 1792 ms 30124 KB Output is correct
34 Correct 1787 ms 30088 KB Output is correct
35 Correct 1804 ms 30096 KB Output is correct
36 Correct 1740 ms 30228 KB Output is correct
37 Correct 1803 ms 30048 KB Output is correct
38 Correct 1784 ms 30060 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 3796 KB Output is correct
2 Correct 17 ms 3764 KB Output is correct
3 Correct 17 ms 3796 KB Output is correct
4 Correct 20 ms 3688 KB Output is correct
5 Correct 17 ms 3668 KB Output is correct
6 Correct 18 ms 3748 KB Output is correct
7 Correct 18 ms 3776 KB Output is correct
8 Correct 18 ms 3668 KB Output is correct
9 Correct 18 ms 3752 KB Output is correct
10 Correct 21 ms 3692 KB Output is correct
11 Correct 17 ms 3752 KB Output is correct
12 Correct 17 ms 3796 KB Output is correct
13 Correct 17 ms 3744 KB Output is correct
14 Correct 17 ms 3744 KB Output is correct
15 Correct 17 ms 3728 KB Output is correct
16 Correct 10 ms 2420 KB Output is correct
17 Correct 10 ms 2388 KB Output is correct
18 Correct 10 ms 2444 KB Output is correct
19 Correct 10 ms 2456 KB Output is correct
20 Correct 9 ms 2344 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1804 ms 30132 KB Output is correct
2 Correct 1767 ms 30148 KB Output is correct
3 Correct 1768 ms 30196 KB Output is correct
4 Correct 1783 ms 30060 KB Output is correct
5 Correct 1799 ms 30120 KB Output is correct
6 Correct 1749 ms 30144 KB Output is correct
7 Correct 1888 ms 30144 KB Output is correct
8 Correct 1890 ms 30104 KB Output is correct
9 Correct 1992 ms 30068 KB Output is correct
10 Correct 1906 ms 30092 KB Output is correct
11 Correct 1821 ms 30204 KB Output is correct
12 Correct 1789 ms 30116 KB Output is correct
13 Correct 1833 ms 30188 KB Output is correct
14 Correct 1819 ms 30112 KB Output is correct
15 Correct 1794 ms 30184 KB Output is correct
16 Correct 270 ms 7192 KB Output is correct
17 Correct 293 ms 7684 KB Output is correct
18 Correct 277 ms 7372 KB Output is correct
19 Correct 286 ms 7656 KB Output is correct
20 Correct 280 ms 7444 KB Output is correct
21 Correct 1674 ms 27868 KB Output is correct
22 Correct 1723 ms 28128 KB Output is correct
23 Correct 1717 ms 27628 KB Output is correct
24 Correct 1684 ms 27372 KB Output is correct
25 Correct 1713 ms 27420 KB Output is correct
26 Correct 1699 ms 26784 KB Output is correct
27 Correct 1728 ms 27204 KB Output is correct
28 Correct 1740 ms 26860 KB Output is correct
29 Correct 1682 ms 26688 KB Output is correct
30 Correct 1799 ms 30084 KB Output is correct
31 Correct 1850 ms 30112 KB Output is correct
32 Correct 1827 ms 30104 KB Output is correct
33 Correct 1792 ms 30124 KB Output is correct
34 Correct 1787 ms 30088 KB Output is correct
35 Correct 1804 ms 30096 KB Output is correct
36 Correct 1740 ms 30228 KB Output is correct
37 Correct 1803 ms 30048 KB Output is correct
38 Correct 1784 ms 30060 KB Output is correct
39 Correct 17 ms 3796 KB Output is correct
40 Correct 17 ms 3764 KB Output is correct
41 Correct 17 ms 3796 KB Output is correct
42 Correct 20 ms 3688 KB Output is correct
43 Correct 17 ms 3668 KB Output is correct
44 Correct 18 ms 3748 KB Output is correct
45 Correct 18 ms 3776 KB Output is correct
46 Correct 18 ms 3668 KB Output is correct
47 Correct 18 ms 3752 KB Output is correct
48 Correct 21 ms 3692 KB Output is correct
49 Correct 17 ms 3752 KB Output is correct
50 Correct 17 ms 3796 KB Output is correct
51 Correct 17 ms 3744 KB Output is correct
52 Correct 17 ms 3744 KB Output is correct
53 Correct 17 ms 3728 KB Output is correct
54 Correct 10 ms 2420 KB Output is correct
55 Correct 10 ms 2388 KB Output is correct
56 Correct 10 ms 2444 KB Output is correct
57 Correct 10 ms 2456 KB Output is correct
58 Correct 9 ms 2344 KB Output is correct
59 Correct 1906 ms 30096 KB Output is correct
60 Correct 1891 ms 30144 KB Output is correct
61 Correct 1877 ms 30172 KB Output is correct
62 Correct 1935 ms 30076 KB Output is correct
63 Correct 1881 ms 30108 KB Output is correct
64 Correct 1954 ms 30064 KB Output is correct
65 Correct 1948 ms 30120 KB Output is correct
66 Correct 1959 ms 30120 KB Output is correct
67 Execution timed out 2041 ms 30268 KB Time limit exceeded
68 Halted 0 ms 0 KB -