oj.uz

Submission #975459

# Submission time Handle Problem Language Result Execution time Memory
975459 2024-05-05T08:26:55 Z Kenjikrab Boat (APIO16_boat) C++14
58 / 100
 2000 ms 8792 KB 
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
int const mod=1e9+7;
map<int,int> ind;
vector<int> val;
vector<int> fen(1010,0);
void upd(int idx,int val)
{
    idx+=2;
    for(int i=idx;i<1010;i+=i&-i)fen[i]+=val,fen[i]%=mod;
}
int qr(int idx)
{
    idx+=2;
    int ret=0;
    for(int i=idx;i>0;i-=i&-i)ret+=fen[i],ret%=mod;
    return ret;
}

int pow(int a,int b)
{
    if(b==0)return 1;
    if(b==1)return a;
    int ret=pow(a,b/2);
    if(b%2==0)return (ret*ret)%mod;
    else return (((ret*ret)%mod)*a)%mod;
}
vector<int> inverse(510);
void inv(int a)
{
    inverse[a]=pow(a,mod-2);
}

int choose(int a,int b)
{
    if(b>a)return 0;
    if(a==b)return 1;
    if(a-b>b)b=a-b;
    int ret=1;
    for(int i=b+1;i<=a;i++)
    {
        ret*=i;
        ret%=mod;
    }
    for(int i=2;i<=a-b;i++)
    {
        ret*=inverse[i];
        ret%=mod;
    }
    return ret;
}

signed main()
{
    for(int i=2;i<510;i++)inv(i);
    int n;
    cin>>n;
    vector<pii> info;
    set<int> temp;
    for(int i=0;i<n;i++)
    {
        int a,b;
        cin>>a>>b;
        temp.insert(a);
        temp.insert(b+1);
        info.push_back({a,b+1});
    }
    for(auto it:temp)
    {
        val.push_back(it);
        ind[it]=val.size()-1;
    }
    vector<vector<int>> pre(510,vector<int>(1010,-2));
    vector<int> latest(1010,-1);
    upd(-1,1);
    vector<vector<int>> dp(510,vector<int>(1010,0));
    for(int i=0;i<n;i++)
    {
        //cout<<endl<<i<<":";
        for(int j=ind[info[i].se]-1;j>=ind[info[i].fi];j--)
        {
            //cout<<j<<" ";
            
            int bef=latest[j];
            pre[i][j]=latest[j];
            latest[j]=i;
            int a=qr(j),b=(val[j+1]-val[j]),c=0;
            dp[i][j]=a;
            int ans=a*b;
            ans%=mod;
            int k=2;
            //cout<<i<<" "<<j<<" "<<ans<<" ";
            while(bef!=-1)
            {
                ans+=dp[bef][j]*choose(b+k-2,k);
                ans%=mod;
                bef=pre[bef][j];
                k++;
                //cout<<endl<<bef<<" "<<ans<<" ";
            }
           // cout<<endl;
            upd(j+1,ans);
        }
    }
    cout<<(qr(1007)+mod-1)%mod;
    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:91:45: warning: unused variable 'c' [-Wunused-variable]
   91 |             int a=qr(j),b=(val[j+1]-val[j]),c=0;
      |                                             ^

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 4 ms 8528 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8540 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8540 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 4 ms 8536 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 4 ms 8568 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8544 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 418 ms 8660 KB Output is correct
22 Correct 412 ms 8536 KB Output is correct
23 Correct 359 ms 8656 KB Output is correct
24 Correct 445 ms 8536 KB Output is correct
25 Correct 443 ms 8788 KB Output is correct
26 Correct 634 ms 8652 KB Output is correct
27 Correct 630 ms 8536 KB Output is correct
28 Correct 625 ms 8656 KB Output is correct
29 Correct 657 ms 8656 KB Output is correct
30 Correct 4 ms 8536 KB Output is correct
31 Correct 4 ms 8540 KB Output is correct
32 Correct 4 ms 8520 KB Output is correct
33 Correct 4 ms 8540 KB Output is correct
34 Correct 4 ms 8540 KB Output is correct
35 Correct 4 ms 8540 KB Output is correct
36 Correct 4 ms 8540 KB Output is correct
37 Correct 4 ms 8540 KB Output is correct
38 Correct 4 ms 8792 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8536 KB Output is correct
2 Correct 12 ms 8540 KB Output is correct
3 Correct 17 ms 8424 KB Output is correct
4 Correct 19 ms 8792 KB Output is correct
5 Correct 22 ms 8540 KB Output is correct
6 Correct 72 ms 8568 KB Output is correct
7 Correct 70 ms 8540 KB Output is correct
8 Correct 70 ms 8540 KB Output is correct
9 Correct 71 ms 8536 KB Output is correct
10 Correct 70 ms 8792 KB Output is correct
11 Correct 22 ms 8540 KB Output is correct
12 Correct 13 ms 8380 KB Output is correct
13 Correct 18 ms 8592 KB Output is correct
14 Correct 18 ms 8596 KB Output is correct
15 Correct 22 ms 8736 KB Output is correct
16 Correct 11 ms 8388 KB Output is correct
17 Correct 9 ms 8540 KB Output is correct
18 Correct 10 ms 8540 KB Output is correct
19 Correct 9 ms 8540 KB Output is correct
20 Correct 13 ms 8536 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8540 KB Output is correct
2 Correct 4 ms 8528 KB Output is correct
3 Correct 4 ms 8540 KB Output is correct
4 Correct 4 ms 8540 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 4 ms 8540 KB Output is correct
7 Correct 4 ms 8540 KB Output is correct
8 Correct 4 ms 8540 KB Output is correct
9 Correct 4 ms 8540 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8540 KB Output is correct
12 Correct 4 ms 8536 KB Output is correct
13 Correct 4 ms 8536 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 4 ms 8568 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8544 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 418 ms 8660 KB Output is correct
22 Correct 412 ms 8536 KB Output is correct
23 Correct 359 ms 8656 KB Output is correct
24 Correct 445 ms 8536 KB Output is correct
25 Correct 443 ms 8788 KB Output is correct
26 Correct 634 ms 8652 KB Output is correct
27 Correct 630 ms 8536 KB Output is correct
28 Correct 625 ms 8656 KB Output is correct
29 Correct 657 ms 8656 KB Output is correct
30 Correct 4 ms 8536 KB Output is correct
31 Correct 4 ms 8540 KB Output is correct
32 Correct 4 ms 8520 KB Output is correct
33 Correct 4 ms 8540 KB Output is correct
34 Correct 4 ms 8540 KB Output is correct
35 Correct 4 ms 8540 KB Output is correct
36 Correct 4 ms 8540 KB Output is correct
37 Correct 4 ms 8540 KB Output is correct
38 Correct 4 ms 8792 KB Output is correct
39 Correct 19 ms 8536 KB Output is correct
40 Correct 12 ms 8540 KB Output is correct
41 Correct 17 ms 8424 KB Output is correct
42 Correct 19 ms 8792 KB Output is correct
43 Correct 22 ms 8540 KB Output is correct
44 Correct 72 ms 8568 KB Output is correct
45 Correct 70 ms 8540 KB Output is correct
46 Correct 70 ms 8540 KB Output is correct
47 Correct 71 ms 8536 KB Output is correct
48 Correct 70 ms 8792 KB Output is correct
49 Correct 22 ms 8540 KB Output is correct
50 Correct 13 ms 8380 KB Output is correct
51 Correct 18 ms 8592 KB Output is correct
52 Correct 18 ms 8596 KB Output is correct
53 Correct 22 ms 8736 KB Output is correct
54 Correct 11 ms 8388 KB Output is correct
55 Correct 9 ms 8540 KB Output is correct
56 Correct 10 ms 8540 KB Output is correct
57 Correct 9 ms 8540 KB Output is correct
58 Correct 13 ms 8536 KB Output is correct
59 Execution timed out 2057 ms 8540 KB Time limit exceeded
60 Halted 0 ms 0 KB -