제출 #386385

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
386385	2021-04-06 13:34:41	ritul_kr_singh	The Kingdom of JOIOI (JOI17_joioi)	C++17	100 / 100	1913 ms	31816 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
// #pragma GCC optimize("Ofast,unroll-loops")
 
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define nl << '\n'
#define sp << ' ' <<
 
int h, w;
int g[2000][2000], a[2000], b[2000], maxElement, minElement;
 
bool possible(int diff){
  int res0 = 0, res1 = 0;
  for(int i=0; i<h; ++i){
    a[i] = 0;
    for(int j=0; j<w; ++j){
      if(g[i][j]-minElement<=diff) ++a[i];
      else break;
    }
    b[i] = a[i];
    a[i] = min(a[i], a[i-1]);
  }
  for(int i=h-2; i>=0; --i) b[i] = min(b[i], b[i+1]);
  for(int i=0; i<h; ++i){
    for(int j=a[i]; j<w; ++j)
      res0 = max(res0, maxElement - g[i][j]);
    for(int j=b[i]; j<w; ++j)
      res1 = max(res1, maxElement - g[i][j]);
  }
  return (res0<=diff or res1<=diff);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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