제출 #305239

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
305239	2020-09-22 18:59:50	pit4h	The Kingdom of JOIOI (JOI17_joioi)	C++14	60 / 100	4103 ms	71488 KiB

joioi

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;
using ll = int;
const ll INF = 1e9+1;
bool possible(vector<vector<ll>>& grid, ll M, ll L, ll R) {
  int h = grid.size(), w = grid[0].size();
  vector<vector<bool>> dp(h, vector<bool>(w+1));
  dp[0][0] = 1;
  for(int i=0; i<h; ++i) {
    ll mx = L;
    if(i!=0) {
      dp[i][0] = dp[i-1][0];
    }
    for(int j=0; j<w; ++j) {
      mx = max(mx, grid[i][j]);
      if(i!=0) {
        dp[i][j+1] = dp[i][j+1] | dp[i-1][j+1];
      }
      dp[i][j+1] = dp[i][j+1] | dp[i][j];
      if(mx-L > M) dp[i][j+1] = 0;
    }
    ll mini = R;
    for(int j=w; j>=0; --j) {
      if(R-mini > M) dp[i][j] = 0;
      if(j-1>=0) mini = min(mini, grid[i][j-1]);
    }
  }
  bool res = 0;
  for(int i=0; i<w; ++i) {
    if(dp[h-1][i+1]) res = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 45 / 45
• Subtask 3: 0 / 40