oj.uz

답안 #250857

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250857 2020-07-19T10:08:35 Z hackermub Boat (APIO16_boat) C++17
9 / 100
 1 ms 396 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz(v) (int)v.size()
const int MOD = 1e9+7;
const int64_t INF = 1e18;

int add(int a,int b){
    return (a+b+MOD)%MOD; 
}

int mul(int a,int b){
    return (1LL*a*b)%MOD;
}

int bigmod(int b,int p){
    if(!p) return 1;
    int x = bigmod(b,p/2);
    x = mul(x,x);
    if(p%2) x = mul(x,b);
    return x;
}

int vag(int a,int b){
    return mul(a,bigmod(b,MOD-2));
}

void getseg(vector<pii> &seg,vector<int> &L,vector<int> &R){
    vector<pii> v;
    for(auto x:L) v.push_back({x,0});
    for(auto x:R) v.push_back({x,1});
    sort(all(v));
    v.erase(unique(all(v)),v.end());
    for(int i=1;i<sz(v);i++){
        if(v[i].second == 1){
            if(v[i-1].second == 0) seg.push_back({v[i-1].fi,v[i].fi});
            else seg.push_back({v[i-1].fi+1,v[i].fi});
        }else if(v[i-1].second == 0){
            seg.push_back({v[i-1].fi,v[i].fi-1});
        }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0),cin.tie(),cout.tie();
    int n;
    cin>>n;
    vector<int> L(n+1),R(n+1);
    for(int i=1;i<=n;i++){
       cin>>L[i]>>R[i];
    }
    vector<int> dp(n+1);
    dp[0]=1;
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<i;j++){
            if(L[j]<L[i]) dp[i]=add(dp[i],dp[j]);
        }
        ans=add(ans,dp[i]);
    }
   // cout<<dp[1]<<" "<<dp[2]<<endl;
    cout<<ans;
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

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