Submission #107338

# Submission time Handle Problem Language Result Execution time Memory
107338 2019-04-23T11:20:35 Z username Boat (APIO16_boat) C++14
9 / 100
2000 ms 432 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,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.resize(unique(ALL(p))-p.begin());
	REP(i,0,n)a[i]=find(ALL(p),a[i])-p.begin(),b[i]=find(ALL(p),b[i])-p.begin();
	dp[0]=1;
	REP(i,0,p.size()-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(){
      ^
boat.cpp: In function 'int main()':
boat.cpp:6:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,j,k) for(int i=(j);i<(k);++i)
                                   ^
boat.cpp:37:2: note: in expansion of macro 'REP'
  REP(i,0,p.size()-1){
  ^~~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 5 ms 432 KB Output is correct
5 Correct 5 ms 356 KB Output is correct
6 Correct 4 ms 356 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 4 ms 356 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 5 ms 432 KB Output is correct
5 Correct 5 ms 356 KB Output is correct
6 Correct 4 ms 356 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 4 ms 356 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Execution timed out 2028 ms 384 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 5 ms 432 KB Output is correct
5 Correct 5 ms 356 KB Output is correct
6 Correct 4 ms 356 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 4 ms 356 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 4 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Execution timed out 2028 ms 384 KB Time limit exceeded
22 Halted 0 ms 0 KB -