Submission #107331

# Submission time Handle Problem Language Result Execution time Memory
107331 2019-04-23T11:00:48 Z username Boat (APIO16_boat) C++14
0 / 100
3 ms 384 KB
#include<bits/stdc++.h>
#include<stdint.h>
#define int int64_t
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define RREP(i,j,k) for(int i=(j)-1;i>=(k);--i)
#define MST(a,v) memset(a,(v),sizeof a)
#define ALL(x) x.begin(),x.end()
#define pb push_back
#define F first
#define S second
#define IOS cin.tie(0),ios_base::sync_with_stdio(false)
#define add(x,y) x=(x+y)%mo

const int maxn=509,mo=1e9L+7;
int n,q=0,a[maxn],b[maxn],dp[maxn];
vector<int>p;

int qp(int x,int t){
	int re=1;
	while(t){
		if(t&1)re=re*x%mo;
		x=x*x%mo,t>>=1;
	}
	return re;
}

main(){
	IOS;
	cin>>n;
	REP(i,0,n)cin>>a[i]>>b[i],++b[i],p.pb(a[i]),p.pb(b[i]);
	sort(ALL(p));
	p.erase(unique(ALL(p)),p.end());
	REP(i,0,n)a[i]=lower_bound(ALL(p),a[i])-p.begin(),b[i]=lower_bound(ALL(p),b[i])-p.begin();
	dp[0]=1;
	REP(i,0,q-1){
		RREP(j,n,0){
			int l=p[i+1]-p[i];
			if(a[j]<=i&&i<b[j]){
				int c=l,t=1;
				RREP(k,j+1,0){
					add(dp[j+1],dp[k]*c%mo);
					if(k&&a[k-1]<=i&&i<b[k-1])c=c*(k+l)%mo*qp(k+1,mo-2)%mo,++t;
				}
			}
		}
	}
	int sum=0;
	REP(i,0,n)add(sum,dp[i+1]);
	cout<<sum<<endl;
}

Compilation message

boat.cpp:29:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -