oj.uz

답안 #588725

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
588725 2022-07-04T00:48:05 Z chonka Boat (APIO16_boat) C++17
0 / 100
 6 ms 4560 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int MAXN = 502 ;
const int MOD = 1e9 + 7 ;
// mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

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

ll dp[ MAXN ][ 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 ) ;
    }
    for ( auto x : s ) {
        v.push_back ( x ) ;
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        inv[ i ] = fastpow ( i , MOD - 2 ) ;
    }
    int k = v.size ( ) ;
    dp[ 0 ][ 0 ] = 1 ;
    for ( int i = 0 ; i <= n ; ++ i ) {
        ll up_to = 0 ;
        for ( int j = 0 ; j <= k ; ++ j ) {
            up_to = ( up_to + dp[ i ][ j ] ) % MOD ;
            ll coef = 1 ;
            int cnt = 0 ;
            for ( int t = i + 1 ; t <= n ; ++ t ) {
                if ( !( a[ t ].first <= v[ j ] && v[ j + 1 ] <= a[ t ].second + 1 ) ) { break ; }
                coef = ( coef * ( v[ j + 1 ] - v[ j ] - cnt ) ) % MOD ;
                if ( v[ j + 1 ] - v[ j ] - cnt <= 0 ) { break ; }
                ++ cnt ;
                coef = ( coef * inv[ cnt ] ) % MOD ;
                dp[ t ][ j + 1 ] = ( dp[ t ][ j + 1 ] + up_to * coef ) % MOD ;
            }
            dp[ i + 1 ][ j ] = ( dp[ i + 1 ][ j ] + dp[ i ][ j ] ) % MOD ;
            // dp[ i ][ j + 1 ] = ( dp[ i ][ j + 1 ] + dp[ i ][ j ] ) % MOD ;
        }
        if ( i == n ) {
            cout << ( up_to - 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

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 4560 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 4560 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 6 ms 4560 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -