답안 #285231

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285231 2020-08-28T12:28:04 Z CaroLinda Sailing Race (CEOI12_race) C++14
70 / 100
3000 ms 4984 KB
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define mkt make_tuple
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define ff first
#define ss second
#define eb push_back
#define ll long long
#define mk make_pair
#define pii pair<int,int>
#define debug printf
#define all(x) x.begin(),x.end()

const int MAXN = 510 ;

using namespace std ;

int N , K , ans, curId ;
int t[2] = {-1,1} ;
int dp[MAXN][MAXN][2] , dpLinha[MAXN][MAXN][2] ;
vector<int> adj[MAXN] ;
vector<pii> edge ;

bool isInside(int x, int L , int R , int type )
{

    if(type == -1) swap(L,R) ;

    if( L > R ) return (L <= x || x <= R ) ;
    return L <= x && x <= R ;

}

void solve()
{
    for(int diff = 1 ; diff < N ; diff++ )
        for(int i = 0 ; i < N ; i++ )
            for(int j = 0 ; j < 2 ; j++ )
            {
                int R = ( i + diff * t[j] + N ) % N ;
                int &ptr = dp[i][R][j] ;
                ptr = 0 ;

                for(int viz : adj[i] )
                {
                    if(!isInside(viz, i , R, t[j] ) ) continue ;

                    ptr = max(ptr, 1 + dp[viz][R][j] ) ;
                    ptr = max(ptr, 1 + dp[viz][ (i+t[j]+N)%N ][ !j ] ) ;

                    if( dpLinha[viz][R][j] > 0 || viz == R )
                        dpLinha[i][R][j] = max( dpLinha[i][R][j] , 1 + dpLinha[viz][R][j] ) ;

                }

                if(ptr  > ans )
                {
                    ans = ptr ;
                    curId = i ;
                }
            }

}

int main()
{
    scanf("%d%d", &N , &K ) ;
    for(int i = 0 , x ; i < N ; i++ )
        while( scanf("%d", &x) && x != 0 )
        {
            if(x == i+1) continue ;
            adj[i].push_back(x-1) ;
            edge.push_back( mk( i , x-1 ) ) ;
        }

    solve() ;

    if(K == 0)
    {
        printf("%d %d\n" , ans, curId + 1 );
        return 0 ;
    }

       /* for(int i = 0 ; i < N ; i++ )
    {
        for(int j = 0 ; j < N ; j++ )
            for(int g = 0 ; g < 2 ; g++ )
            {
                printf("dp[%d][%d][%d] = %d\n", i , j , g , dp[i][j][g] ) ;
            }
    } */

    for(int i = 0 ; i < sz(edge) ; i++ )
        for(int j = 0 ; j < sz(edge) ; j++ )
        {
            int A = edge[i].ff, B = edge[i].ss ;
            int X = edge[j].ff, Y = edge[j].ss ;

            if( A == X || A == Y || B == X || B == Y ) continue ;
            if( isInside(X, A, B, 1) == isInside(Y, A, B, 1) ) continue ;

            int typeB = isInside(A, Y, B, 1) ? 0 : 1 ;
            int typeA = !typeB ;

            int valY = max( dp[Y][ (B+t[typeA]+N)%N ][typeB] , dp[Y][ (A+t[typeB]+N)%N ][typeA] ) ;
            int valX = dpLinha[B][X][typeB] ;


            if( ans < valY+valX+2 )
            {
                ans = valY+valX+2 ;
                curId = A ;
            }

        }

    printf("%d %d\n" , ans, curId + 1 ) ;

}

Compilation message

race.cpp: In function 'int main()':
race.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     scanf("%d%d", &N , &K ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Incorrect 1 ms 512 KB Output isn't correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 7 ms 768 KB Output is correct
7 Correct 4 ms 896 KB Output is correct
8 Correct 9 ms 1024 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 16 ms 1320 KB Output is correct
11 Correct 9 ms 1280 KB Output is correct
12 Correct 309 ms 2172 KB Output is correct
13 Correct 473 ms 2816 KB Output is correct
14 Correct 76 ms 3756 KB Output is correct
15 Execution timed out 3089 ms 4732 KB Time limit exceeded
16 Execution timed out 3085 ms 4856 KB Time limit exceeded
17 Execution timed out 3070 ms 4732 KB Time limit exceeded
18 Correct 106 ms 4520 KB Output is correct
19 Execution timed out 3099 ms 4984 KB Time limit exceeded
20 Execution timed out 3066 ms 4984 KB Time limit exceeded