제출 #1025210

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1025210	2024-07-16 17:42:34	giorgi_pkhaladze	구경하기 (JOI13_watching)	C++14	100 / 100	72 ms	44012 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>
#define int long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define ff first
#define ss second
using namespace std;
int n,m,k,i,j,a[30001],b[30001],x,y,l,r,d[3001][3001],t[30001];
bool check(int o){
  for(int k=0; k<=n; ++k){
    a[k]=lower_bound(t+k+1,t+n+1,t[k+1]+o)-t-1;
    b[k]=lower_bound(t+k+1,t+n+1,t[k+1]+(o<<1))-t-1;
  }
  for(int i=0; i<=x; i++){
    for(int j=0; j<=y; j++){
      if(i*j!=0){
        d[i][j]=max(a[d[i-1][j]],b[d[i][j-1]]);
      }
      else{
        if(i!=0){
          d[i][j]=a[d[i-1][j]];
        }
        else if(j!=0) d[i][j]=b[d[i][j-1]];
      }
    }
  }
  if(n==d[x][y])return true;
  else return false;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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