oj.uz

Submission #491405

# Submission time Handle Problem Language Result Execution time Memory
491405 2021-12-02T00:59:23 Z rrrr10000 Boat (APIO16_boat) C++14
100 / 100
 1145 ms 8268 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define popcnt __builtin_popcountll
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

int main(){
    ll n;cin>>n;
    vp v(n);
    vi srt;
    rep(i,n){
        cin>>v[i].fi>>v[i].se;v[i].se++;
        srt.pb(v[i].fi);
        srt.pb(v[i].se);
    }
    dupli(srt);
    rep(i,n){
        v[i].fi=lb(srt,v[i].fi);
        v[i].se=lb(srt,v[i].se);
    }
    ll m=srt.size();
    vvi dp(m,vi(n+1)),table(m-1,vi(n+1));
    vi inv(n+5);REP(i,1,n+5)inv[i]=modpow(i,mod-2);
    rep(i,m-1){
        ll x=(srt[i+1]-srt[i])%mod;
        table[i][0]=x;
        REP(j,1,n+1){
            ll tmp=x*(x-1)/2%mod;
            rep(k,j){
                table[i][j]+=tmp;
                tmp*=(j-1-k)*inv[k+1]%mod*(x-k-2)%mod*inv[k+3]%mod;
                tmp%=mod;
            }
            table[i][j]%=mod;
        }
    }
    rep(i,m)dp[i][0]=1;
    rep(j,n+1)dp[0][j]=1;
    REP(i,1,m)REP(j,1,n+1){
        dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
        dp[i][j]%=mod;
        if(i-1<v[j-1].fi||v[j-1].se<=i-1)continue;
        ll cnt=0;
        for(int k=j;k;k--){
            if(i-1<v[k-1].fi||v[k-1].se<=i-1)continue;
            dp[i][j]+=table[i-1][cnt++]*dp[i-1][k-1]%mod;
        }
        dp[i][j]%=mod;
    }
    // outvv(dp);
    if(dp[m-1][n]<=0)dp[m-1][n]+=mod;
    out(dp[m-1][n]-1);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1029 ms 8196 KB Output is correct
2 Correct 1028 ms 8192 KB Output is correct
3 Correct 1042 ms 8192 KB Output is correct
4 Correct 1038 ms 8196 KB Output is correct
5 Correct 1018 ms 8192 KB Output is correct
6 Correct 1069 ms 8196 KB Output is correct
7 Correct 1110 ms 8196 KB Output is correct
8 Correct 1018 ms 8196 KB Output is correct
9 Correct 1057 ms 8192 KB Output is correct
10 Correct 1046 ms 8200 KB Output is correct
11 Correct 1055 ms 8196 KB Output is correct
12 Correct 1022 ms 8204 KB Output is correct
13 Correct 1045 ms 8200 KB Output is correct
14 Correct 1031 ms 8192 KB Output is correct
15 Correct 1062 ms 8196 KB Output is correct
16 Correct 183 ms 1612 KB Output is correct
17 Correct 201 ms 1792 KB Output is correct
18 Correct 198 ms 1740 KB Output is correct
19 Correct 198 ms 1788 KB Output is correct
20 Correct 193 ms 1740 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1029 ms 8196 KB Output is correct
2 Correct 1028 ms 8192 KB Output is correct
3 Correct 1042 ms 8192 KB Output is correct
4 Correct 1038 ms 8196 KB Output is correct
5 Correct 1018 ms 8192 KB Output is correct
6 Correct 1069 ms 8196 KB Output is correct
7 Correct 1110 ms 8196 KB Output is correct
8 Correct 1018 ms 8196 KB Output is correct
9 Correct 1057 ms 8192 KB Output is correct
10 Correct 1046 ms 8200 KB Output is correct
11 Correct 1055 ms 8196 KB Output is correct
12 Correct 1022 ms 8204 KB Output is correct
13 Correct 1045 ms 8200 KB Output is correct
14 Correct 1031 ms 8192 KB Output is correct
15 Correct 1062 ms 8196 KB Output is correct
16 Correct 183 ms 1612 KB Output is correct
17 Correct 201 ms 1792 KB Output is correct
18 Correct 198 ms 1740 KB Output is correct
19 Correct 198 ms 1788 KB Output is correct
20 Correct 193 ms 1740 KB Output is correct
21 Correct 1027 ms 7500 KB Output is correct
22 Correct 1022 ms 7604 KB Output is correct
23 Correct 1000 ms 7464 KB Output is correct
24 Correct 990 ms 7404 KB Output is correct
25 Correct 993 ms 7444 KB Output is correct
26 Correct 1010 ms 7248 KB Output is correct
27 Correct 1042 ms 7372 KB Output is correct
28 Correct 1042 ms 7244 KB Output is correct
29 Correct 1010 ms 7220 KB Output is correct
30 Correct 1058 ms 8196 KB Output is correct
31 Correct 1062 ms 8204 KB Output is correct
32 Correct 1016 ms 8184 KB Output is correct
33 Correct 1029 ms 8204 KB Output is correct
34 Correct 1031 ms 8176 KB Output is correct
35 Correct 1075 ms 8184 KB Output is correct
36 Correct 1027 ms 8184 KB Output is correct
37 Correct 1016 ms 8180 KB Output is correct
38 Correct 1032 ms 8164 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 588 KB Output is correct
2 Correct 10 ms 620 KB Output is correct
3 Correct 9 ms 632 KB Output is correct
4 Correct 9 ms 624 KB Output is correct
5 Correct 11 ms 588 KB Output is correct
6 Correct 10 ms 628 KB Output is correct
7 Correct 11 ms 632 KB Output is correct
8 Correct 10 ms 628 KB Output is correct
9 Correct 10 ms 624 KB Output is correct
10 Correct 10 ms 588 KB Output is correct
11 Correct 10 ms 588 KB Output is correct
12 Correct 9 ms 588 KB Output is correct
13 Correct 10 ms 628 KB Output is correct
14 Correct 9 ms 628 KB Output is correct
15 Correct 10 ms 628 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 6 ms 460 KB Output is correct
18 Correct 6 ms 424 KB Output is correct
19 Correct 6 ms 460 KB Output is correct
20 Correct 5 ms 460 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1029 ms 8196 KB Output is correct
2 Correct 1028 ms 8192 KB Output is correct
3 Correct 1042 ms 8192 KB Output is correct
4 Correct 1038 ms 8196 KB Output is correct
5 Correct 1018 ms 8192 KB Output is correct
6 Correct 1069 ms 8196 KB Output is correct
7 Correct 1110 ms 8196 KB Output is correct
8 Correct 1018 ms 8196 KB Output is correct
9 Correct 1057 ms 8192 KB Output is correct
10 Correct 1046 ms 8200 KB Output is correct
11 Correct 1055 ms 8196 KB Output is correct
12 Correct 1022 ms 8204 KB Output is correct
13 Correct 1045 ms 8200 KB Output is correct
14 Correct 1031 ms 8192 KB Output is correct
15 Correct 1062 ms 8196 KB Output is correct
16 Correct 183 ms 1612 KB Output is correct
17 Correct 201 ms 1792 KB Output is correct
18 Correct 198 ms 1740 KB Output is correct
19 Correct 198 ms 1788 KB Output is correct
20 Correct 193 ms 1740 KB Output is correct
21 Correct 1027 ms 7500 KB Output is correct
22 Correct 1022 ms 7604 KB Output is correct
23 Correct 1000 ms 7464 KB Output is correct
24 Correct 990 ms 7404 KB Output is correct
25 Correct 993 ms 7444 KB Output is correct
26 Correct 1010 ms 7248 KB Output is correct
27 Correct 1042 ms 7372 KB Output is correct
28 Correct 1042 ms 7244 KB Output is correct
29 Correct 1010 ms 7220 KB Output is correct
30 Correct 1058 ms 8196 KB Output is correct
31 Correct 1062 ms 8204 KB Output is correct
32 Correct 1016 ms 8184 KB Output is correct
33 Correct 1029 ms 8204 KB Output is correct
34 Correct 1031 ms 8176 KB Output is correct
35 Correct 1075 ms 8184 KB Output is correct
36 Correct 1027 ms 8184 KB Output is correct
37 Correct 1016 ms 8180 KB Output is correct
38 Correct 1032 ms 8164 KB Output is correct
39 Correct 9 ms 588 KB Output is correct
40 Correct 10 ms 620 KB Output is correct
41 Correct 9 ms 632 KB Output is correct
42 Correct 9 ms 624 KB Output is correct
43 Correct 11 ms 588 KB Output is correct
44 Correct 10 ms 628 KB Output is correct
45 Correct 11 ms 632 KB Output is correct
46 Correct 10 ms 628 KB Output is correct
47 Correct 10 ms 624 KB Output is correct
48 Correct 10 ms 588 KB Output is correct
49 Correct 10 ms 588 KB Output is correct
50 Correct 9 ms 588 KB Output is correct
51 Correct 10 ms 628 KB Output is correct
52 Correct 9 ms 628 KB Output is correct
53 Correct 10 ms 628 KB Output is correct
54 Correct 6 ms 460 KB Output is correct
55 Correct 6 ms 460 KB Output is correct
56 Correct 6 ms 424 KB Output is correct
57 Correct 6 ms 460 KB Output is correct
58 Correct 5 ms 460 KB Output is correct
59 Correct 1086 ms 8260 KB Output is correct
60 Correct 1093 ms 8204 KB Output is correct
61 Correct 1100 ms 8200 KB Output is correct
62 Correct 1103 ms 8204 KB Output is correct
63 Correct 1080 ms 8260 KB Output is correct
64 Correct 1132 ms 8216 KB Output is correct
65 Correct 1145 ms 8208 KB Output is correct
66 Correct 1141 ms 8204 KB Output is correct
67 Correct 1143 ms 8260 KB Output is correct
68 Correct 1134 ms 8208 KB Output is correct
69 Correct 1091 ms 8208 KB Output is correct
70 Correct 1066 ms 8268 KB Output is correct
71 Correct 1060 ms 8204 KB Output is correct
72 Correct 1077 ms 8208 KB Output is correct
73 Correct 1073 ms 8212 KB Output is correct
74 Correct 201 ms 1740 KB Output is correct
75 Correct 202 ms 1768 KB Output is correct
76 Correct 201 ms 1740 KB Output is correct
77 Correct 203 ms 1744 KB Output is correct
78 Correct 195 ms 1720 KB Output is correct