oj.uz

답안 #500411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500411 2021-12-30T22:45:46 Z doowey Boat (APIO16_boat) C++14
9 / 100
 1058 ms 11888 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 505;
const int M = N * 4;
const int MOD = (int)1e9 + 7;
int L[N], R[N];

int C[M][N];
int I[N][N];

int fin[M][N];

int powr(int n, int k){
    if(k == 0) return 1;
    int p = powr(n, k / 2);
    p = (p * 1ll * p) % MOD;
    if(k % 2 == 1) p = (p * 1ll * n) % MOD;
    return p;
}

void add(int &a, int b){
    a += b;
    if(a >= MOD) a -= MOD;
    else if(a < 0) a += MOD;
}

int dp[N][M];
int dif[N];


int main(){
    fastIO;
    int n;
    cin >> n;
    vector<int> pp;
    for(int i = 1; i <= n; i ++ ){
        cin >> L[i] >> R[i];
        pp.push_back(L[i]);
        pp.push_back(R[i]);
    }
    sort(pp.begin(), pp.end());
    pp.resize(unique(pp.begin(), pp.end()) - pp.begin());
    vector<pii> segm;
    for(int i = 0 ; i < pp.size(); i ++ ){
        segm.push_back(mp(pp[i], pp[i]));
        if(i + 1 < pp.size() && pp[i] + 1 <= pp[i + 1] - 1){
            segm.push_back(mp(pp[i] + 1, pp[i + 1] - 1));
        }
    }
    int m = segm.size();
    for(int i = 0; i < N ;i ++ ){
        I[i][0] = 1;
    }
    for(int k = 1; k < N ; k ++ ){
        for(int i = 1; i < N ; i ++ ){
            add(I[i][k], I[i-1][k]);
            add(I[i][k], I[i-1][k-1]);
        }
    }
    int sz;
    int P, Q;
    int inv;
    int cum;
    for(int i = 0 ; i < m ; i ++ ){
        sz = segm[i].se - segm[i].fi + 1;
        P = Q = 1;
        for(int j = 1; j <= n; j ++ ){
            if(j > sz) break;
            P = (P * 1ll * (sz - j + 1)) % MOD;
            Q = (Q * 1ll * j) % MOD;
            inv = powr(Q, MOD - 2);
            C[i][j] = (P * 1ll * inv) % MOD;
        }
        for(int j = 1; j <= n; j ++ ){
            for(int v = 1; v <= j; v ++ ){
                add(fin[i][j], C[i][v] * 1ll * I[j][v]);
            }
        }
        for(int j = n; j >= 1; j -- ){
            add(fin[i][j], -fin[i][j-1]);
        }
    }
    int tl, tr;
    int mm;
    int side;
    int res = 0;
    for(int i = 1; i <= n; i ++ ){
        for(int j = 0 ; j < m ; j ++ ){
            tl = segm[j].fi;
            tr = segm[j].se;
            if(L[i] <= tl && tr <= R[i]){
                mm = 0;
                for(int v = i; v >= 1; v -- ){

                    if(L[v] <= tl && tr <= R[v]) mm ++ ;
                    side = 0;
                    if(j > 0) add(side, dp[v - 1][j - 1]);
                    if(v == 1) add(side, 1);
                    add(dp[i][j], (side * 1ll * fin[j][mm]) % MOD);
                }
            }
            add(res, dp[i][j]);
            if(j)
                add(dp[i][j], dp[i][j-1]);
        }
    }

    cout << res << "\n";
    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i = 0 ; i < pp.size(); i ++ ){
      |                     ~~^~~~~~~~~~~
boat.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         if(i + 1 < pp.size() && pp[i] + 1 <= pp[i + 1] - 1){
      |            ~~~~~~^~~~~~~~~~~
boat.cpp:73:9: warning: unused variable 'cum' [-Wunused-variable]
   73 |     int cum;
      |         ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 9228 KB Output is correct
2 Correct 384 ms 9264 KB Output is correct
3 Correct 397 ms 9152 KB Output is correct
4 Correct 378 ms 9208 KB Output is correct
5 Correct 401 ms 9240 KB Output is correct
6 Correct 409 ms 9228 KB Output is correct
7 Correct 380 ms 9112 KB Output is correct
8 Correct 410 ms 9192 KB Output is correct
9 Correct 384 ms 9120 KB Output is correct
10 Correct 385 ms 9328 KB Output is correct
11 Correct 391 ms 9188 KB Output is correct
12 Correct 389 ms 9268 KB Output is correct
13 Correct 402 ms 9152 KB Output is correct
14 Correct 394 ms 9156 KB Output is correct
15 Correct 369 ms 9216 KB Output is correct
16 Correct 74 ms 4244 KB Output is correct
17 Correct 94 ms 4440 KB Output is correct
18 Correct 73 ms 4332 KB Output is correct
19 Correct 73 ms 4412 KB Output is correct
20 Correct 72 ms 4404 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 9228 KB Output is correct
2 Correct 384 ms 9264 KB Output is correct
3 Correct 397 ms 9152 KB Output is correct
4 Correct 378 ms 9208 KB Output is correct
5 Correct 401 ms 9240 KB Output is correct
6 Correct 409 ms 9228 KB Output is correct
7 Correct 380 ms 9112 KB Output is correct
8 Correct 410 ms 9192 KB Output is correct
9 Correct 384 ms 9120 KB Output is correct
10 Correct 385 ms 9328 KB Output is correct
11 Correct 391 ms 9188 KB Output is correct
12 Correct 389 ms 9268 KB Output is correct
13 Correct 402 ms 9152 KB Output is correct
14 Correct 394 ms 9156 KB Output is correct
15 Correct 369 ms 9216 KB Output is correct
16 Correct 74 ms 4244 KB Output is correct
17 Correct 94 ms 4440 KB Output is correct
18 Correct 73 ms 4332 KB Output is correct
19 Correct 73 ms 4412 KB Output is correct
20 Correct 72 ms 4404 KB Output is correct
21 Incorrect 1058 ms 11888 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 9228 KB Output is correct
2 Correct 384 ms 9264 KB Output is correct
3 Correct 397 ms 9152 KB Output is correct
4 Correct 378 ms 9208 KB Output is correct
5 Correct 401 ms 9240 KB Output is correct
6 Correct 409 ms 9228 KB Output is correct
7 Correct 380 ms 9112 KB Output is correct
8 Correct 410 ms 9192 KB Output is correct
9 Correct 384 ms 9120 KB Output is correct
10 Correct 385 ms 9328 KB Output is correct
11 Correct 391 ms 9188 KB Output is correct
12 Correct 389 ms 9268 KB Output is correct
13 Correct 402 ms 9152 KB Output is correct
14 Correct 394 ms 9156 KB Output is correct
15 Correct 369 ms 9216 KB Output is correct
16 Correct 74 ms 4244 KB Output is correct
17 Correct 94 ms 4440 KB Output is correct
18 Correct 73 ms 4332 KB Output is correct
19 Correct 73 ms 4412 KB Output is correct
20 Correct 72 ms 4404 KB Output is correct
21 Incorrect 1058 ms 11888 KB Output isn't correct
22 Halted 0 ms 0 KB -