oj.uz

Submission #546286

# Submission time Handle Problem Language Result Execution time Memory
546286 2022-04-07T03:52:06 Z zaneyu Boat (APIO16_boat) C++14
100 / 100
 599 ms 2464 KB 
/*input
2
1 1000000000
1 1000000000
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=1e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int l[maxn],r[maxn];
int dp[maxn][maxn];
int inv[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    vector<int> v;
    REP(i,n+2) inv[i]=mypow(i,MOD-2);
    REP1(i,n) cin>>l[i]>>r[i],++r[i],v.pb(l[i]),v.pb(r[i]);
    SORT_UNIQUE(v);
    REP1(i,n) l[i]=lower_bound(ALL(v),l[i])-v.begin()+1,r[i]=lower_bound(ALL(v),r[i])-v.begin();
    REP(i,sz(v)) dp[0][i]=1;
    int ans=0;
    REP1(i,n){
        for(int j=l[i];j<=r[i];j++){
            int cnt=0;
            int len=v[j]-v[j-1];
            int c=len;
            for(int k=i-1;k>=0;k--){
                dp[i][j]+=1LL*dp[k][j-1]*c%MOD;
                dp[i][j]%=MOD;
                if(l[k]<=j and j<=r[k]){
                    ++cnt;
                    c=1LL*c*(len+cnt)%MOD*inv[cnt+1]%MOD;
                }
            }
        }
        REP1(j,sz(v)) dp[i][j]+=dp[i][j-1],dp[i][j]%=MOD;
        ans+=dp[i][sz(v)];
        ans%=MOD;
    }
    cout<<ans<<'\n';
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2260 KB Output is correct
2 Correct 6 ms 2260 KB Output is correct
3 Correct 6 ms 2264 KB Output is correct
4 Correct 6 ms 2260 KB Output is correct
5 Correct 6 ms 2260 KB Output is correct
6 Correct 5 ms 2260 KB Output is correct
7 Correct 6 ms 2260 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 7 ms 2232 KB Output is correct
10 Correct 6 ms 2232 KB Output is correct
11 Correct 6 ms 2260 KB Output is correct
12 Correct 7 ms 2212 KB Output is correct
13 Correct 6 ms 2260 KB Output is correct
14 Correct 6 ms 2276 KB Output is correct
15 Correct 7 ms 2260 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 4 ms 2260 KB Output is correct
18 Correct 3 ms 2260 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2260 KB Output is correct
2 Correct 6 ms 2260 KB Output is correct
3 Correct 6 ms 2264 KB Output is correct
4 Correct 6 ms 2260 KB Output is correct
5 Correct 6 ms 2260 KB Output is correct
6 Correct 5 ms 2260 KB Output is correct
7 Correct 6 ms 2260 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 7 ms 2232 KB Output is correct
10 Correct 6 ms 2232 KB Output is correct
11 Correct 6 ms 2260 KB Output is correct
12 Correct 7 ms 2212 KB Output is correct
13 Correct 6 ms 2260 KB Output is correct
14 Correct 6 ms 2276 KB Output is correct
15 Correct 7 ms 2260 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 4 ms 2260 KB Output is correct
18 Correct 3 ms 2260 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct
21 Correct 285 ms 2288 KB Output is correct
22 Correct 278 ms 2232 KB Output is correct
23 Correct 253 ms 2392 KB Output is correct
24 Correct 273 ms 2260 KB Output is correct
25 Correct 279 ms 2232 KB Output is correct
26 Correct 496 ms 2380 KB Output is correct
27 Correct 523 ms 2224 KB Output is correct
28 Correct 507 ms 2448 KB Output is correct
29 Correct 487 ms 2252 KB Output is correct
30 Correct 6 ms 2260 KB Output is correct
31 Correct 7 ms 2296 KB Output is correct
32 Correct 7 ms 2312 KB Output is correct
33 Correct 7 ms 2240 KB Output is correct
34 Correct 7 ms 2304 KB Output is correct
35 Correct 7 ms 2208 KB Output is correct
36 Correct 8 ms 2288 KB Output is correct
37 Correct 7 ms 2316 KB Output is correct
38 Correct 8 ms 2292 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 3 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 6 ms 724 KB Output is correct
9 Correct 6 ms 724 KB Output is correct
10 Correct 6 ms 696 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 3 ms 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 2 ms 724 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2260 KB Output is correct
2 Correct 6 ms 2260 KB Output is correct
3 Correct 6 ms 2264 KB Output is correct
4 Correct 6 ms 2260 KB Output is correct
5 Correct 6 ms 2260 KB Output is correct
6 Correct 5 ms 2260 KB Output is correct
7 Correct 6 ms 2260 KB Output is correct
8 Correct 6 ms 2260 KB Output is correct
9 Correct 7 ms 2232 KB Output is correct
10 Correct 6 ms 2232 KB Output is correct
11 Correct 6 ms 2260 KB Output is correct
12 Correct 7 ms 2212 KB Output is correct
13 Correct 6 ms 2260 KB Output is correct
14 Correct 6 ms 2276 KB Output is correct
15 Correct 7 ms 2260 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 4 ms 2260 KB Output is correct
18 Correct 3 ms 2260 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct
21 Correct 285 ms 2288 KB Output is correct
22 Correct 278 ms 2232 KB Output is correct
23 Correct 253 ms 2392 KB Output is correct
24 Correct 273 ms 2260 KB Output is correct
25 Correct 279 ms 2232 KB Output is correct
26 Correct 496 ms 2380 KB Output is correct
27 Correct 523 ms 2224 KB Output is correct
28 Correct 507 ms 2448 KB Output is correct
29 Correct 487 ms 2252 KB Output is correct
30 Correct 6 ms 2260 KB Output is correct
31 Correct 7 ms 2296 KB Output is correct
32 Correct 7 ms 2312 KB Output is correct
33 Correct 7 ms 2240 KB Output is correct
34 Correct 7 ms 2304 KB Output is correct
35 Correct 7 ms 2208 KB Output is correct
36 Correct 8 ms 2288 KB Output is correct
37 Correct 7 ms 2316 KB Output is correct
38 Correct 8 ms 2292 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 3 ms 724 KB Output is correct
44 Correct 6 ms 724 KB Output is correct
45 Correct 5 ms 724 KB Output is correct
46 Correct 6 ms 724 KB Output is correct
47 Correct 6 ms 724 KB Output is correct
48 Correct 6 ms 696 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 3 ms 724 KB Output is correct
52 Correct 3 ms 724 KB Output is correct
53 Correct 3 ms 724 KB Output is correct
54 Correct 2 ms 724 KB Output is correct
55 Correct 2 ms 724 KB Output is correct
56 Correct 2 ms 724 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 2 ms 724 KB Output is correct
59 Correct 305 ms 2284 KB Output is correct
60 Correct 296 ms 2464 KB Output is correct
61 Correct 261 ms 2264 KB Output is correct
62 Correct 309 ms 2296 KB Output is correct
63 Correct 312 ms 2276 KB Output is correct
64 Correct 599 ms 2236 KB Output is correct
65 Correct 575 ms 2364 KB Output is correct
66 Correct 570 ms 2296 KB Output is correct
67 Correct 575 ms 2284 KB Output is correct
68 Correct 565 ms 2300 KB Output is correct
69 Correct 244 ms 2416 KB Output is correct
70 Correct 242 ms 2196 KB Output is correct
71 Correct 239 ms 2236 KB Output is correct
72 Correct 259 ms 2288 KB Output is correct
73 Correct 264 ms 2220 KB Output is correct
74 Correct 65 ms 2200 KB Output is correct
75 Correct 61 ms 2244 KB Output is correct
76 Correct 65 ms 2288 KB Output is correct
77 Correct 66 ms 2292 KB Output is correct
78 Correct 66 ms 2252 KB Output is correct