oj.uz

Submission #117860

# Submission time Handle Problem Language Result Execution time Memory
117860 2019-06-17T09:05:49 Z ckodser Boat (APIO16_boat) C++14
100 / 100
 1115 ms 8756 KB 
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}

#define ll int
#define pb push_back
#define ld long double
#define mp make_pair
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll maxn=590;
const ll mod=1e9+7;
const ll inf=1e9+9;


inline void zarb(ll &a,long long  b){a=((long long)a*b)%mod;}
inline ll zarbO(long long a,long long b){return (a*b)%mod;}
inline void jam(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
inline ll jamO(ll a,ll b){a+=b;if(a>=mod)a-=mod;return a;}




ll dp[maxn][maxn*2];
ll dppar[maxn][maxn*2];
ll f[maxn*2][maxn];
ll ent[maxn][maxn];


ll rev[maxn];
ll a[maxn];
ll b[maxn];

ll poww(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1){
			zarb(ans,a);
		}
		b>>=1;
		zarb(a,a);
	}
	return ans;
}	


ll tmp[maxn];
void hesab(ll x,ll tol){
	if(tol==1){
		for(ll t=0;t+1<maxn;t++){
			f[x][t]=1;
		}
		return ;
	}		
	tmp[0]=1;
	for(ll i=1;i<maxn;i++){
		tmp[i]=zarbO(tmp[i-1],zarbO(tol-i+1,rev[i]));
	}
	for(ll t=0;t+1<maxn;t++){
		for(ll i=0;i<=t;i++){
			jam(f[x][t],zarbO(ent[t][i],tmp[i+1]));
		}
	}
}
int main(){
	for(ll i=0;i<maxn;i++){
		rev[i]=poww(i,mod-2);
	}	
	ent[0][0]=1;
	for(ll i=1;i<maxn;i++){
		ent[i][0]=1;
		ent[i][i]=1;
		for(ll j=1;j<i;j++){
			ent[i][j]=jamO(ent[i-1][j],ent[i-1][j-1]);
		}
	}
	ll n;
	cin>>n;
	vector<ll> vec;
	vec.pb(0);
	vec.pb(inf);
	for(ll i=0;i<n;i++){
		cin>>a[i]>>b[i];
		vec.pb(a[i]);
		vec.pb(b[i]+1);
	}
	{
		sort(vec.begin(),vec.end());
		auto it=unique(vec.begin(),vec.end());
		vec.resize(it-vec.begin());
	}
	for(ll i=0;i+1<(ll)vec.size();i++){
		ll tol=vec[i+1]-vec[i];
		hesab(i,tol);
	}
	ll ans=0;
	for(ll i=0;i<n;i++){
		for(ll j=0;j+1<(ll)vec.size();j++){
			//dp[i][j];
			if(a[i]<=vec[j] && b[i]+1>=vec[j+1]){
				ll tol=vec[j+1]-vec[j];
				ll tedad=0;
				for(ll z=i-1;z>=0;z--){
					if(j)jam(dp[i][j],zarbO(dppar[z][j-1],f[j][tedad]));
					tedad+=(a[z]<=vec[j] && b[z]+1>=vec[j+1]);	
				}
				jam(dp[i][j],f[j][tedad]);
			}
		}
		dppar[i][0]=dp[i][0];
		for(ll j=1;j+1<(ll)vec.size();j++){
			dppar[i][j]=jamO(dppar[i][j-1],dp[i][j]);
		}
		jam(ans,dppar[i][vec.size()-2]);
	}
	cout<<ans;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:157:8: warning: unused variable 'tol' [-Wunused-variable]
     ll tol=vec[j+1]-vec[j];
        ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 8232 KB Output is correct
2 Correct 223 ms 8136 KB Output is correct
3 Correct 220 ms 8184 KB Output is correct
4 Correct 228 ms 8184 KB Output is correct
5 Correct 224 ms 8300 KB Output is correct
6 Correct 226 ms 8316 KB Output is correct
7 Correct 227 ms 8312 KB Output is correct
8 Correct 227 ms 8376 KB Output is correct
9 Correct 225 ms 8312 KB Output is correct
10 Correct 227 ms 8312 KB Output is correct
11 Correct 240 ms 8424 KB Output is correct
12 Correct 224 ms 8312 KB Output is correct
13 Correct 224 ms 8400 KB Output is correct
14 Correct 231 ms 8360 KB Output is correct
15 Correct 230 ms 8312 KB Output is correct
16 Correct 47 ms 6392 KB Output is correct
17 Correct 50 ms 6392 KB Output is correct
18 Correct 49 ms 6520 KB Output is correct
19 Correct 50 ms 6396 KB Output is correct
20 Correct 49 ms 6392 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 8232 KB Output is correct
2 Correct 223 ms 8136 KB Output is correct
3 Correct 220 ms 8184 KB Output is correct
4 Correct 228 ms 8184 KB Output is correct
5 Correct 224 ms 8300 KB Output is correct
6 Correct 226 ms 8316 KB Output is correct
7 Correct 227 ms 8312 KB Output is correct
8 Correct 227 ms 8376 KB Output is correct
9 Correct 225 ms 8312 KB Output is correct
10 Correct 227 ms 8312 KB Output is correct
11 Correct 240 ms 8424 KB Output is correct
12 Correct 224 ms 8312 KB Output is correct
13 Correct 224 ms 8400 KB Output is correct
14 Correct 231 ms 8360 KB Output is correct
15 Correct 230 ms 8312 KB Output is correct
16 Correct 47 ms 6392 KB Output is correct
17 Correct 50 ms 6392 KB Output is correct
18 Correct 49 ms 6520 KB Output is correct
19 Correct 50 ms 6396 KB Output is correct
20 Correct 49 ms 6392 KB Output is correct
21 Correct 844 ms 8488 KB Output is correct
22 Correct 788 ms 8400 KB Output is correct
23 Correct 739 ms 8440 KB Output is correct
24 Correct 787 ms 8440 KB Output is correct
25 Correct 782 ms 8520 KB Output is correct
26 Correct 888 ms 8424 KB Output is correct
27 Correct 854 ms 8560 KB Output is correct
28 Correct 866 ms 8568 KB Output is correct
29 Correct 850 ms 8432 KB Output is correct
30 Correct 412 ms 8448 KB Output is correct
31 Correct 531 ms 8468 KB Output is correct
32 Correct 410 ms 8432 KB Output is correct
33 Correct 421 ms 8316 KB Output is correct
34 Correct 458 ms 8284 KB Output is correct
35 Correct 240 ms 8140 KB Output is correct
36 Correct 241 ms 8312 KB Output is correct
37 Correct 229 ms 8160 KB Output is correct
38 Correct 228 ms 8088 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 3004 KB Output is correct
2 Correct 91 ms 3064 KB Output is correct
3 Correct 90 ms 3064 KB Output is correct
4 Correct 94 ms 3064 KB Output is correct
5 Correct 93 ms 3076 KB Output is correct
6 Correct 92 ms 3056 KB Output is correct
7 Correct 93 ms 3080 KB Output is correct
8 Correct 94 ms 3084 KB Output is correct
9 Correct 96 ms 3052 KB Output is correct
10 Correct 96 ms 3116 KB Output is correct
11 Correct 93 ms 3064 KB Output is correct
12 Correct 93 ms 3064 KB Output is correct
13 Correct 92 ms 3088 KB Output is correct
14 Correct 92 ms 3092 KB Output is correct
15 Correct 91 ms 3088 KB Output is correct
16 Correct 42 ms 2808 KB Output is correct
17 Correct 43 ms 2808 KB Output is correct
18 Correct 42 ms 2808 KB Output is correct
19 Correct 42 ms 2808 KB Output is correct
20 Correct 44 ms 2780 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 8232 KB Output is correct
2 Correct 223 ms 8136 KB Output is correct
3 Correct 220 ms 8184 KB Output is correct
4 Correct 228 ms 8184 KB Output is correct
5 Correct 224 ms 8300 KB Output is correct
6 Correct 226 ms 8316 KB Output is correct
7 Correct 227 ms 8312 KB Output is correct
8 Correct 227 ms 8376 KB Output is correct
9 Correct 225 ms 8312 KB Output is correct
10 Correct 227 ms 8312 KB Output is correct
11 Correct 240 ms 8424 KB Output is correct
12 Correct 224 ms 8312 KB Output is correct
13 Correct 224 ms 8400 KB Output is correct
14 Correct 231 ms 8360 KB Output is correct
15 Correct 230 ms 8312 KB Output is correct
16 Correct 47 ms 6392 KB Output is correct
17 Correct 50 ms 6392 KB Output is correct
18 Correct 49 ms 6520 KB Output is correct
19 Correct 50 ms 6396 KB Output is correct
20 Correct 49 ms 6392 KB Output is correct
21 Correct 844 ms 8488 KB Output is correct
22 Correct 788 ms 8400 KB Output is correct
23 Correct 739 ms 8440 KB Output is correct
24 Correct 787 ms 8440 KB Output is correct
25 Correct 782 ms 8520 KB Output is correct
26 Correct 888 ms 8424 KB Output is correct
27 Correct 854 ms 8560 KB Output is correct
28 Correct 866 ms 8568 KB Output is correct
29 Correct 850 ms 8432 KB Output is correct
30 Correct 412 ms 8448 KB Output is correct
31 Correct 531 ms 8468 KB Output is correct
32 Correct 410 ms 8432 KB Output is correct
33 Correct 421 ms 8316 KB Output is correct
34 Correct 458 ms 8284 KB Output is correct
35 Correct 240 ms 8140 KB Output is correct
36 Correct 241 ms 8312 KB Output is correct
37 Correct 229 ms 8160 KB Output is correct
38 Correct 228 ms 8088 KB Output is correct
39 Correct 94 ms 3004 KB Output is correct
40 Correct 91 ms 3064 KB Output is correct
41 Correct 90 ms 3064 KB Output is correct
42 Correct 94 ms 3064 KB Output is correct
43 Correct 93 ms 3076 KB Output is correct
44 Correct 92 ms 3056 KB Output is correct
45 Correct 93 ms 3080 KB Output is correct
46 Correct 94 ms 3084 KB Output is correct
47 Correct 96 ms 3052 KB Output is correct
48 Correct 96 ms 3116 KB Output is correct
49 Correct 93 ms 3064 KB Output is correct
50 Correct 93 ms 3064 KB Output is correct
51 Correct 92 ms 3088 KB Output is correct
52 Correct 92 ms 3092 KB Output is correct
53 Correct 91 ms 3088 KB Output is correct
54 Correct 42 ms 2808 KB Output is correct
55 Correct 43 ms 2808 KB Output is correct
56 Correct 42 ms 2808 KB Output is correct
57 Correct 42 ms 2808 KB Output is correct
58 Correct 44 ms 2780 KB Output is correct
59 Correct 947 ms 8488 KB Output is correct
60 Correct 862 ms 8548 KB Output is correct
61 Correct 854 ms 8536 KB Output is correct
62 Correct 1020 ms 8564 KB Output is correct
63 Correct 892 ms 8496 KB Output is correct
64 Correct 1048 ms 8664 KB Output is correct
65 Correct 1058 ms 8740 KB Output is correct
66 Correct 1115 ms 8652 KB Output is correct
67 Correct 1074 ms 8688 KB Output is correct
68 Correct 1083 ms 8572 KB Output is correct
69 Correct 789 ms 8580 KB Output is correct
70 Correct 785 ms 8748 KB Output is correct
71 Correct 764 ms 8596 KB Output is correct
72 Correct 754 ms 8528 KB Output is correct
73 Correct 788 ms 8756 KB Output is correct
74 Correct 135 ms 6520 KB Output is correct
75 Correct 133 ms 6648 KB Output is correct
76 Correct 133 ms 6520 KB Output is correct
77 Correct 134 ms 6588 KB Output is correct
78 Correct 137 ms 6536 KB Output is correct