oj.uz

Submission #960111

# Submission time Handle Problem Language Result Execution time Memory
960111 2024-04-09T16:38:36 Z kim Boat (APIO16_boat) C++17
0 / 100
 3 ms 4184 KB 
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define eb emplace_back

const ll md=1e9+7;

vector<int> comp;
int a[505],b[505];
ll dp[505][1005];

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    int n; cin>>n;
    for(int i=1;i<=n;++i){
        cin>>a[i]>>b[i];
        comp.eb(--a[i]), comp.eb(b[i]);
    }
    comp.eb(0);
    sort(comp.begin(),comp.end());
    comp.erase(unique(comp.begin(),comp.end()),comp.end());
    int m=comp.size();
    for(int i=0;i<m;++i) dp[0][i]=1;
    for(int i=1;i<=n;++i){
        a[i]=lower_bound(comp.begin(),comp.end(),a[i])-comp.begin();
        b[i]=lower_bound(comp.begin(),comp.end(),b[i])-comp.begin();
        dp[i][0]=dp[i-1][m-1];
        for(int j=1;j<m;++j){
            if(a[i]<j&&j<=b[i]) dp[i][j]=((dp[i][j-1]+(j==1?1:dp[i-1][j-1])*(comp[j]-comp[j-1]))%md+md)%md;
            else dp[i][j]=dp[i][j-1];
        }
    }
    cout<<(dp[n][m-1]-1+md)%md;

    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2648 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -