oj.uz

Submission #589536

# Submission time Handle Problem Language Result Execution time Memory
589536 2022-07-04T20:39:39 Z chonka Boat (APIO16_boat) C++17
27 / 100
 168 ms 2272 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int MAXN = 503 ;
const int MOD = 1e9 + 7 ;
// mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int n ;
pair < int , int > a[ MAXN ] ;
int v[ MAXN ] ;

ll dp[ MAXN ][ MAXN ] ;
ll en[ MAXN ] , nw[ MAXN ] ;
ll inv[ MAXN ] ;

ll fastpow ( ll x , ll pw ) {
    ll ret = 1 ;
    while ( pw > 0 ) {
        if ( ( pw % 2 ) == 0 ) {
            x = ( x * x ) % MOD ;
            pw /= 2 ;
        }
        else {
            ret = ( ret * x ) % MOD ;
            -- pw ;
        }
    }
    return ret ;
}
set < int > s ;

void solve ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ].first >> a[ i ].second ;
        s.insert ( a[ i ].first ) ;
        s.insert ( a[ i ].second + 1 ) ;
    }
    int k = 0 ;
    for ( auto x : s ) {
        v[ ++ k ] = x ;
    }
    -- k ;
    for ( int i = 1 ; i < MAXN ; ++ i ) {
        inv[ i ] = fastpow ( i , MOD - 2 ) ;
    }
    for ( int i = 0 ; i <= k ; ++ i ) {
        dp[ 0 ][ i ] = 1 ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        dp[ i ][ 0 ] = 1 ;
        for ( int j = 1 ; j <= k ; ++ j ) {
            dp[ i ][ j ] = dp[ i ][ j - 1 ] ;
            ll coef = 1 ;
            int cnt = 0 ;
            for ( int t = i ; t >= 1 ; -- t ) {
                if ( a[ t ].first <= v[ j ] && v[ j + 1 ] <= a[ t ].second + 1 ) {
                    coef = ( coef * ( v[ j + 1 ] - v[ j ] + cnt ) ) % MOD ;
                    coef = ( coef * inv[ cnt + 1 ] ) % MOD ;
                    ++ cnt ;
                    dp[ i ][ j ] = ( dp[ i ][ j ] + coef * dp[ t - 1 ][ j - 1 ] ) % MOD ;
                }
            }
        }
    }
    cout << ( dp[ n ][ k ] - 1 + MOD ) % MOD << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 4 ms 744 KB Output is correct
3 Correct 5 ms 696 KB Output is correct
4 Correct 5 ms 696 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 7 ms 724 KB Output is correct
7 Correct 7 ms 712 KB Output is correct
8 Correct 7 ms 680 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 7 ms 704 KB Output is correct
11 Correct 7 ms 736 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 5 ms 724 KB Output is correct
14 Correct 5 ms 724 KB Output is correct
15 Correct 5 ms 724 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct

Subtask #4
0 / 42.0

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