Submission #109348

#	Time	Username	Problem	Language	Result	Execution time	Memory
109348		b2563125	Boat (APIO16_boat)	C++14	0 / 100	13 ms	896 KiB

boat

#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<vel> dp0(2,vel(sz-1, 0));
	V<V<vel>> dp1(2, V<vel>(sz-1));
	rep(i, n) {
		rep(j, sz-1) {
			vel	q(count[j],0);
			dp1[i][j] = q;
		}
	}
	rep(i, n) {
		int now = i % 2;
		int nex = (i + 1) % 2;
		dp0[nex] = dp0[now];
		dp1[nex] = dp1[now];
		int sum = 1;
		rep(j, a[i]) {
			sum += dp0[now][j]; ref(sum);
		}
		for (int j = a[i]; j < b[i]; j++) {
			pl(dp1[nex][j][0],sum);
			pl(dp0[nex][j], sum*gap[j]);
			rep(k, count[j] - 1) {
				pl(dp1[nex][j][k + 1], dp1[nex][j][k]);
				pl(dp0[nex][j], dp1[nex][j][k] * com[j][k + 1]);
			}
			sum += dp0[now][j];
		}
	}
	int ans = 0;
	rep(i, sz-1) {
		pl(ans,dp0[n % 2][i]);
	}
	cout << ans << endl;
	return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42