Submission #722385

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
722385	2023-04-11 21:27:32	hyakup	Watching (JOI13_watching)	C++17	100 / 100	124 ms	16056 KiB

watching

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
 
const int maxn = 2010;
 
int pos[maxn];
 
int dp[maxn][maxn];
int n, p, q; 
 
bool check( int x ){
    
    for( int j = 0; j < maxn; j++ ) dp[0][j] = 0;
    
    int k1 = 0, k2 = 0;
    
    for( int i = 1; i <= n; i++ ){
        
        while( pos[k1 + 1] < pos[i] - x + 1 ) k1++;
        while( pos[k2 + 1] < pos[i] - 2*x + 1 ) k2++;
        
        dp[i][0] = dp[k2][0] + 1;
        
        for( int j = 1; j <= p; j++ ){
            
            dp[i][j] = min( dp[k1][j - 1], dp[k2][j] + 1 );
        }
    }
    
    if( dp[n][p] <= q ) return true;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 50 / 50
• Subtask 2: 50 / 50