Submission #105207

#	Time	Username	Problem	Language	Result	Execution time	Memory
105207		puyu_liao	Boat (APIO16_boat)	C++14	9 / 100	477 ms	640 KiB

boat

#include<bits/stdc++.h>
#include<stdint.h>
using namespace std;
#define IOS {cin.tie(0);ios_base::sync_with_stdio(false);}
#define N 505
#define C 2000
#define int int64_t
const int MOD = 1000000007;
vector<int> ds;
int a[N],b[N];
int dp[N];
int fact[C];
int ifact[C];

int powmo(int a,int b,int m){
	int r = 1;
	for(;b;b>>=1){
		if(b&1) r = r*a % m;
		a = a*a % m;
	}
	return r;
}

inline int CC(int n,int r){
	return fact[n] * ifact[r] % MOD * ifact[n-r] % MOD;
}

int32_t main()
{
	fact[0] = 1;
	for(int i=1;i<C;i++) fact[i] = i * fact[i-1] % MOD;
	ifact[C-1] = powmo(fact[C-1],MOD-2,MOD);
	for(int i=C-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1) % MOD;
	IOS;
	int n;
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> a[i] >> b[i];
		ds.push_back(a[i]);
		ds.push_back(b[i]+1);
	}
	sort(ds.begin(),ds.end());
	ds.resize(unique(ds.begin(),ds.end()) - ds.begin());
	for(int i=1;i<=n;i++){
		a[i] = (int)(lower_bound(ds.begin(),ds.end(),a[i]) - ds.begin());
		b[i] = (int)(lower_bound(ds.begin(),ds.end(),b[i]+1) - ds.begin());		
	}
	dp[0] = 1;
	for(int i=0;i+1<ds.size();i++){
		int L = ds[i+1] - ds[i];
		for(int j=n;j>0;j--) if(a[j] <= i && i < b[j]){
			int f = 0, m = 1;
			for(int k=j-1;k>=0;k--){
				(f += CC(L+m-1,m) * dp[k]) %= MOD;
				if(a[k] <= i && i < b[k]) m++;
			}
			(dp[j] += f) %= MOD;
		}
	}
	int ans = 0;
	for(int i=1;i<=n;i++) (ans += dp[i]) %= MOD;
	cout << ans << '\n';
  return 0;
}

Compilation message (stderr)

boat.cpp: In function 'int32_t main()':
boat.cpp:49:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i+1<ds.size();i++){
              ~~~^~~~~~~~~~

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