oj.uz

Submission #109353

# Submission time Handle Problem Language Result Execution time Memory
109353 2019-05-06T08:51:34 Z b2563125 Boat (APIO16_boat) C++14
9 / 100
 2000 ms 12724 KB 
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define V vector
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
int pr = 1000000007;
int ref(int &a) {
	a = a % pr;
	a += pr;
	a = a % pr;
	return a;
}
void uni(vel &a) {
	vel ans(1, a[0]);
	int n = a.size();
	rep(i,n - 1) { if (a[i + 1] != a[i]) { ans.push_back(a[i + 1]); } }
	a = ans;
}
int rui(int a, int n) {
	if (n == 0) { return 1; }
	int back = rui(a, n / 2);
	back *= back; ref(back);
	if (n % 2 == 0) { return back; }
	return (back*a) % pr;
}
int inv(int a) {
	return rui(a, pr - 2);
}
void pl(int &a, int b) {
	ref(b);
	a += b; ref(a);
}
signed main() {
	int n; cin >> n;
	vel a(n);
	vel b(n);
	vel all_time(1, 0);
	rep(i, n) {
		cin >> a[i] >> b[i]; b[i]++;
		all_time.push_back(a[i]);
		all_time.push_back(b[i]);
	}
	sort(all_time.begin(), all_time.end());
	uni(all_time);
	int sz = all_time.size();
	vel gap(sz - 1);
	rep(i, sz - 1) { gap[i] = all_time[i + 1] - all_time[i]; }
	vel count(sz-1);
	rep(i, n) {
		a[i] = lower_bound(all_time.begin(), all_time.end(), a[i])-all_time.begin();
		b[i] = lower_bound(all_time.begin(), all_time.end(), b[i])-all_time.begin();
		rep(j, b[i] - a[i]) {
			count[a[i] + j]++;
		}
	}
	V<vel> com(sz-1);
	rep(i, sz-1) {
		int ba = 1;
		rep(j, count[i]) {
			ba *= gap[i] - j; ref(ba);
			ba *= inv(j+1);
			com[i].push_back(ba);
		}
	}
	V<V<vel>> dp1(2, V<vel>(sz-1,vel(n)));
	vel now_count(sz - 1, 0);
	rep(i, n) {
		int now = i % 2;
		int nex = (i + 1) % 2;
		dp1[nex] = dp1[now];
		int sum = 1;
		rep(j, a[i]) {
			rep(k, now_count[j]) {
				sum += dp1[now][j][k] * com[j][k];
				ref(sum);
			}
		}
		for (int j = a[i]; j < b[i]; j++) {
			pl(dp1[nex][j][0],sum);
			rep(k, now_count[j]) {
				pl(dp1[nex][j][k + 1], dp1[nex][j][k]);
			}
			now_count[j]++;
			rep(k, now_count[j]) {
				sum += dp1[now][j][k] * com[j][k];
				ref(sum);
			}
		}
	}
	int ans = 0;
	rep(i, sz-1) {
		rep(k, count[i]) {
			ans += dp1[n%2][i][k] * com[i][k];
			ref(ans);
		}
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 12292 KB Output is correct
2 Correct 186 ms 12288 KB Output is correct
3 Correct 175 ms 12288 KB Output is correct
4 Correct 209 ms 12288 KB Output is correct
5 Correct 204 ms 12288 KB Output is correct
6 Correct 194 ms 12408 KB Output is correct
7 Correct 192 ms 12408 KB Output is correct
8 Correct 218 ms 12288 KB Output is correct
9 Correct 210 ms 12380 KB Output is correct
10 Correct 231 ms 12380 KB Output is correct
11 Correct 202 ms 12300 KB Output is correct
12 Correct 187 ms 12328 KB Output is correct
13 Correct 190 ms 12324 KB Output is correct
14 Correct 186 ms 12288 KB Output is correct
15 Correct 189 ms 12288 KB Output is correct
16 Correct 37 ms 2552 KB Output is correct
17 Correct 40 ms 2560 KB Output is correct
18 Correct 35 ms 2552 KB Output is correct
19 Correct 38 ms 2560 KB Output is correct
20 Correct 37 ms 2568 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 12292 KB Output is correct
2 Correct 186 ms 12288 KB Output is correct
3 Correct 175 ms 12288 KB Output is correct
4 Correct 209 ms 12288 KB Output is correct
5 Correct 204 ms 12288 KB Output is correct
6 Correct 194 ms 12408 KB Output is correct
7 Correct 192 ms 12408 KB Output is correct
8 Correct 218 ms 12288 KB Output is correct
9 Correct 210 ms 12380 KB Output is correct
10 Correct 231 ms 12380 KB Output is correct
11 Correct 202 ms 12300 KB Output is correct
12 Correct 187 ms 12328 KB Output is correct
13 Correct 190 ms 12324 KB Output is correct
14 Correct 186 ms 12288 KB Output is correct
15 Correct 189 ms 12288 KB Output is correct
16 Correct 37 ms 2552 KB Output is correct
17 Correct 40 ms 2560 KB Output is correct
18 Correct 35 ms 2552 KB Output is correct
19 Correct 38 ms 2560 KB Output is correct
20 Correct 37 ms 2568 KB Output is correct
21 Execution timed out 2055 ms 12724 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 12292 KB Output is correct
2 Correct 186 ms 12288 KB Output is correct
3 Correct 175 ms 12288 KB Output is correct
4 Correct 209 ms 12288 KB Output is correct
5 Correct 204 ms 12288 KB Output is correct
6 Correct 194 ms 12408 KB Output is correct
7 Correct 192 ms 12408 KB Output is correct
8 Correct 218 ms 12288 KB Output is correct
9 Correct 210 ms 12380 KB Output is correct
10 Correct 231 ms 12380 KB Output is correct
11 Correct 202 ms 12300 KB Output is correct
12 Correct 187 ms 12328 KB Output is correct
13 Correct 190 ms 12324 KB Output is correct
14 Correct 186 ms 12288 KB Output is correct
15 Correct 189 ms 12288 KB Output is correct
16 Correct 37 ms 2552 KB Output is correct
17 Correct 40 ms 2560 KB Output is correct
18 Correct 35 ms 2552 KB Output is correct
19 Correct 38 ms 2560 KB Output is correct
20 Correct 37 ms 2568 KB Output is correct
21 Execution timed out 2055 ms 12724 KB Time limit exceeded
22 Halted 0 ms 0 KB -