oj.uz

Submission #207722

# Submission time Handle Problem Language Result Execution time Memory
207722 2020-03-08T16:57:59 Z DodgeBallMan Watching (JOI13_watching) C++14
100 / 100
 943 ms 8680 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e3 + 10;
int n, p, q, now, prev, dp[N][N], vec[N];

bool chk( int m ) {
    for( int i = 0 ; i <= p ; i++ ) for( int j = 0 ; j <= q ; j++ ) {
        if( !i && !j ) continue ;
        dp[i][j] = 0;
        if( i ) dp[i][j] = upper_bound( vec + 1, vec + 1 + n, vec[dp[i-1][j]+1] + m - 1 ) - vec - 1;
        if( j ) dp[i][j] = max( ( long int )dp[i][j], upper_bound( vec + 1, vec + 1 + n, vec[dp[i][j-1]+1] + m + m - 1 ) - vec - 1 );
        if( dp[i][j] == n ) return true;
    }
    return false;
}

int main()
{
    scanf("%d %d %d",&n,&p,&q);
    if( p + q >= n ) return !printf("1");
    for( int i = 1 ; i <= n ; i++ ) {
        scanf("%d",&vec[i]);
    } 
    sort( vec + 1, vec + 1 + n );
    int l = 1, r = 1e9;
    while( l < r ) {
        int m = l + r >> 1;
        if( chk( m ) ) r = m;
        else l = m + 1;
    }
    printf("%d",l);
    return 0;
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:29:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int m = l + r >> 1;
                 ~~^~~
watching.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&n,&p,&q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
watching.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&vec[i]);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 6 ms 608 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 380 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 368 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 132 ms 1144 KB Output is correct
9 Correct 119 ms 3704 KB Output is correct
10 Correct 162 ms 8680 KB Output is correct
11 Correct 97 ms 1016 KB Output is correct
12 Correct 943 ms 8184 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 376 KB Output is correct