제출 #129364

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
129364	2019-07-12 06:25:02	Latina	The Kingdom of JOIOI (JOI17_joioi)	C++14	100 / 100	1188 ms	54976 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;
const int N = 2019;
int H, W;
int A[N][N];
int gmax, gmin;
void flipRow() { for (int i = 0; i < H/2; i++) for (int j = 0; j < W; j++) swap(A[i][j], A[H-i-1][j]); }
void flipCol() { for (int i = 0; i < H; i++) for (int j = 0; j < W/2; j++) swap(A[i][j], A[i][W-j-1]); }
bool check(int t) {
  int sp = 0;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) if (A[i][j] < gmax-t) sp = max(sp,j+1); 
    for (int j = 0; j < W; j++) if (gmin+t < A[i][j]) if (j < sp) return false;
  }
  return true;
}
int solve() {
  int l = 0, r = gmax-gmin;
  while (l < r) {
    int mid = (l+r)/2;
    if (check(mid)) r = mid;
    else l = mid+1;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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