oj.uz

답안 #574422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
574422 2022-06-08T14:21:58 Z chonka Misspelling (JOI22_misspelling) C++17
100 / 100
 1885 ms 286684 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int MAXN = 500007 ;
const int MOD = 1000000007 ;
const int SIGMA = 26 , LOG = 20 ;

int n ;
int small[ MAXN ] , large[ MAXN ] ;

ll dp[ MAXN ][ SIGMA ] ;
int rmq[ 2 ][ LOG ][ MAXN ] ;
int mxpw[ MAXN ] ;

void input ( ) {
    int m ; cin >> n >> m ;
    for ( int x , y , i = 1 ; i <= m ; ++ i ) {
        cin >> x >> y ;
        if ( x < y ) {
            large[ x ] = max ( large[ x ] , y ) ;
        }
        else if ( x > y ) {
            small[ y ] = max ( small[ y ] , x ) ;
        }
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        rmq[ 0 ][ 0 ][ i ] = large[ i ] ;
        rmq[ 1 ][ 0 ][ i ] = small[ i ] ;
    }
    for ( int id : { 0 , 1 } ) {
        for ( int lvl = 1 ; lvl < LOG ; ++ lvl ) {
            for ( int i = 1 ; i + ( 1 << lvl ) - 1 <= n ; ++ i ) {
                rmq[ id ][ lvl ][ i ] = max ( rmq[ id ][ lvl - 1 ][ i ] , rmq[ id ][ lvl - 1 ][ i + ( 1 << ( lvl - 1 ) ) ] ) ;
            }
        }
    }
    mxpw[ 1 ] = 0 ;
    for ( int i = 2 ; i <= n ; ++ i ) {
        mxpw[ i ] = mxpw[ i - 1 ] ;
        if ( ( 1 << ( mxpw[ i ] + 1 ) ) < i ) { ++ mxpw[ i ] ; }
    }
}

int get_mx ( int id , int l , int r ) {
    if ( l > r ) { return 0 ; }
    int len = ( 1 << mxpw[ r - l + 1 ] ) ;
    return max ( rmq[ id ][ mxpw[ r - l + 1 ] ][ l ] , rmq[ id ][ mxpw[ r - l + 1 ] ][ r - len + 1 ] ) ;
}

int f ( int id , int targ ) {
    int l , r , mid ;
    l = 0 , r = targ - 1 ;
    while ( r - l > 3 ) {
        mid = ( l + r ) / 2 ;
        if ( get_mx ( id , mid + 1 , targ - 1 ) < targ ) { r = mid ; }
        else { l = mid + 1 ; }
    }
    while ( get_mx ( id , l + 1 , targ - 1 ) >= targ ) { ++ l ; }
    return l ;
}
ll sm[ SIGMA ] ;
ll add[ MAXN ][ SIGMA ] ;

void solve ( ) {
    for ( int i = n ; i >= 1 ; -- i ) {
        int id_large = f ( 1 , i ) ;
        int id_small = f ( 0 , i ) ;
        for ( int j = 0 ; j < SIGMA ; ++ j ) {
            sm[ j ] = ( sm[ j ] + add[ i ][ j ] + MOD ) % MOD ;
            dp[ i ][ j ] = sm[ j ] ;
            if ( id_large < n && id_small < n ) { dp[ i ][ j ] = ( dp[ i ][ j ] + 1 ) % MOD ; }
        }
        for ( int j = 0 ; j < SIGMA ; ++ j ) {
            for ( int t = 0 ; t < SIGMA ; ++ t ) {
                if ( t == j ) { continue ; }
                sm[ t ] = ( sm[ t ] + dp[ i ][ j ] ) % MOD ;
            }
            for ( int t = j + 1 ; t < SIGMA ; ++ t ) {
                add[ id_large ][ t ] = ( add[ id_large ][ t ] - dp[ i ][ j ] + MOD ) % MOD ;
            }
            for ( int t = 0 ; t < j ; ++ t ) {
                add[ id_small ][ t ] = ( add[ id_small ][ t ] - dp[ i ][ j ] + MOD ) % MOD ;
            }
        }
    }
    ll ans = 0 ;
    for ( int i = 0 ; i < SIGMA ; ++ i ) {
        ans = ( ans + dp[ 1 ][ i ] ) % MOD ;
    }
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t ;
    /// cin >> t ;
    ///scanf ( "%d" , &t ) ;
    t = 1 ;
    while ( t -- ) {
        input ( ) ;
        solve ( ) ;
    }
    return 0 ;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 3 ms 544 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 468 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1767 ms 286620 KB Output is correct
6 Correct 1715 ms 286464 KB Output is correct
7 Correct 1700 ms 286584 KB Output is correct
8 Correct 1699 ms 286680 KB Output is correct
9 Correct 1745 ms 286548 KB Output is correct
10 Correct 63 ms 11156 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1751 ms 284212 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 3 ms 544 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 84 ms 11212 KB Output is correct
27 Correct 62 ms 11028 KB Output is correct
28 Correct 61 ms 10900 KB Output is correct
29 Correct 65 ms 11212 KB Output is correct
30 Correct 62 ms 11216 KB Output is correct
31 Correct 172 ms 16200 KB Output is correct
32 Correct 67 ms 11200 KB Output is correct
33 Correct 68 ms 11140 KB Output is correct
34 Correct 62 ms 11068 KB Output is correct
35 Correct 146 ms 16216 KB Output is correct
36 Correct 56 ms 6732 KB Output is correct
37 Correct 66 ms 11036 KB Output is correct
38 Correct 62 ms 10952 KB Output is correct
39 Correct 63 ms 10620 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 3 ms 544 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1767 ms 286620 KB Output is correct
31 Correct 1715 ms 286464 KB Output is correct
32 Correct 1700 ms 286584 KB Output is correct
33 Correct 1699 ms 286680 KB Output is correct
34 Correct 1745 ms 286548 KB Output is correct
35 Correct 63 ms 11156 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1751 ms 284212 KB Output is correct
39 Correct 84 ms 11212 KB Output is correct
40 Correct 62 ms 11028 KB Output is correct
41 Correct 61 ms 10900 KB Output is correct
42 Correct 65 ms 11212 KB Output is correct
43 Correct 62 ms 11216 KB Output is correct
44 Correct 172 ms 16200 KB Output is correct
45 Correct 67 ms 11200 KB Output is correct
46 Correct 68 ms 11140 KB Output is correct
47 Correct 62 ms 11068 KB Output is correct
48 Correct 146 ms 16216 KB Output is correct
49 Correct 56 ms 6732 KB Output is correct
50 Correct 66 ms 11036 KB Output is correct
51 Correct 62 ms 10952 KB Output is correct
52 Correct 63 ms 10620 KB Output is correct
53 Correct 1700 ms 282416 KB Output is correct
54 Correct 1663 ms 280968 KB Output is correct
55 Correct 1766 ms 286552 KB Output is correct
56 Correct 1774 ms 286448 KB Output is correct
57 Correct 1872 ms 286568 KB Output is correct
58 Correct 1725 ms 286684 KB Output is correct
59 Correct 1702 ms 286492 KB Output is correct
60 Correct 1785 ms 284216 KB Output is correct
61 Correct 1532 ms 174808 KB Output is correct
62 Correct 1808 ms 281708 KB Output is correct
63 Correct 1687 ms 278384 KB Output is correct
64 Correct 1885 ms 271744 KB Output is correct