oj.uz

답안 #960121

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960121 2024-04-09T17:00:29 Z kim Boat (APIO16_boat) C++17
9 / 100
 7 ms 7516 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],qs[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();
    dp[0][0]=1;
    for(int i=0;i<m;++i) qs[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();
        qs[i][0]=1;
        for(int j=1;j<m;++j){
            if(a[i]<j&&j<=b[i]) dp[i][j]=((qs[i-1][j-1]*(comp[j]-comp[j-1]))%md+md)%md;
            qs[i][j]=((dp[i][j]+qs[i-1][j]+qs[i][j-1]-qs[i-1][j-1])%md+md)%md;
        }
    }
    cout<<(qs[n][m-1]+md-1)%md;

    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 5 ms 6488 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 7 ms 6492 KB Output is correct
5 Correct 7 ms 6492 KB Output is correct
6 Correct 7 ms 6504 KB Output is correct
7 Correct 6 ms 6488 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 6 ms 6436 KB Output is correct
10 Correct 5 ms 6488 KB Output is correct
11 Correct 5 ms 6492 KB Output is correct
12 Correct 6 ms 6424 KB Output is correct
13 Correct 6 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 6 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6488 KB Output is correct
18 Correct 5 ms 6492 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 5 ms 6488 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 7 ms 6492 KB Output is correct
5 Correct 7 ms 6492 KB Output is correct
6 Correct 7 ms 6504 KB Output is correct
7 Correct 6 ms 6488 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 6 ms 6436 KB Output is correct
10 Correct 5 ms 6488 KB Output is correct
11 Correct 5 ms 6492 KB Output is correct
12 Correct 6 ms 6424 KB Output is correct
13 Correct 6 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 6 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6488 KB Output is correct
18 Correct 5 ms 6492 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Incorrect 6 ms 7516 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6488 KB Output is correct
2 Correct 5 ms 6488 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 7 ms 6492 KB Output is correct
5 Correct 7 ms 6492 KB Output is correct
6 Correct 7 ms 6504 KB Output is correct
7 Correct 6 ms 6488 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 6 ms 6436 KB Output is correct
10 Correct 5 ms 6488 KB Output is correct
11 Correct 5 ms 6492 KB Output is correct
12 Correct 6 ms 6424 KB Output is correct
13 Correct 6 ms 6492 KB Output is correct
14 Correct 5 ms 6492 KB Output is correct
15 Correct 6 ms 6492 KB Output is correct
16 Correct 3 ms 6492 KB Output is correct
17 Correct 3 ms 6488 KB Output is correct
18 Correct 5 ms 6492 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Incorrect 6 ms 7516 KB Output isn't correct
22 Halted 0 ms 0 KB -