oj.uz

Submission #285186

# Submission time Handle Problem Language Result Execution time Memory
285186 2020-08-28T11:32:02 Z CaroLinda Sailing Race (CEOI12_race) C++14
40 / 100
 71 ms 2432 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 ;
int t[2] = {-1,1} ;
int dp[MAXN][MAXN][2] ;
vector<int> adj[MAXN] ;

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 caso0()
{
    int ans = 0  ;
    int curId = 0 ;

    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(ptr > ans )
                {
                    ans = ptr ;
                    curId = i ;
                }
            }

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


    exit(0) ;
}

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

    if(K == 0) caso0() ;
}

Compilation message

race.cpp: In function 'int main()':
race.cpp:71:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |     scanf("%d%d", &N , &K ) ;
      |     ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
3 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
4 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
5 Correct 1 ms 512 KB Output is correct
6 Incorrect 1 ms 384 KB Unexpected end of file - int32 expected
7 Correct 3 ms 640 KB Output is correct
8 Incorrect 0 ms 384 KB Unexpected end of file - int32 expected
9 Correct 4 ms 640 KB Output is correct
10 Correct 10 ms 768 KB Output is correct
11 Correct 6 ms 768 KB Output is correct
12 Incorrect 2 ms 384 KB Unexpected end of file - int32 expected
13 Incorrect 2 ms 384 KB Unexpected end of file - int32 expected
14 Correct 54 ms 1920 KB Output is correct
15 Incorrect 5 ms 512 KB Unexpected end of file - int32 expected
16 Incorrect 6 ms 512 KB Unexpected end of file - int32 expected
17 Incorrect 5 ms 512 KB Unexpected end of file - int32 expected
18 Correct 71 ms 2432 KB Output is correct
19 Incorrect 7 ms 640 KB Unexpected end of file - int32 expected
20 Incorrect 7 ms 640 KB Unexpected end of file - int32 expected