Submission #107328

#TimeUsernameProblemLanguageResultExecution timeMemory
107328usernameBoat (APIO16_boat)C++14
9 / 100
2040 ms384 KiB
#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 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]; pii p[2*maxn]; 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[q++]=pii(a[i],0),p[q++]=pii(b[i],0); sort(p,p+q); q=unique(p,p+q)-p; REP(i,0,q)p[i].S=i; REP(i,0,n)a[i]=lower_bound(p,p+q,pii(a[i],0))->S,b[i]=lower_bound(p,p+q,pii(b[i],0))->S; dp[0]=1; REP(i,0,q-1){ RREP(j,n,0){ int l=p[i+1].F-p[i].F; 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 (stderr)

boat.cpp:27:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...