Submission #5115

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
5115	2014-02-08 22:55:37	cki86201	Watching (JOI13_watching)	C++98	100 / 100	280 ms	17048 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<stdio.h>
#include<algorithm>
using namespace std;
int P, Q, N, ans;
int w[2020];
int dp[2020][2020];
int prev[2020][2];
void pre(int x,int t)
{
  int i;
  for(i=1;i<=N&&w[i]-w[1]<x;i++)prev[i][t] = 1;
  for(int j=1;i<=N;i++){
    while(w[i]-w[j]>=x)j++;
    prev[i][t] = j;
  }
}
bool chk(int x)
{
  pre(x,0), pre(x<<1,1);
  int i, j;
  dp[0][0] = N+1;
  for(i=1;i<=P;i++)dp[i][0] = prev[dp[i-1][0]-1][0];
  for(i=1;i<=Q;i++)dp[0][i] = prev[dp[0][i-1]-1][1];
  for(i=1;i<=P;i++)
    for(j=1;j<=Q;j++)
      dp[i][j] = min(prev[dp[i-1][j]-1][0], prev[dp[i][j-1]-1][1]);
  return dp[P][Q] <= 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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