Submission #652816

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
652816	2022-10-24 15:53:57	XCAC197	Hamburg Steak (JOI20_hamburg)	C++14	21 / 100	3098 ms	15908 KiB

hamburg

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
//This code is meant to test lunchbox's code against the stronger test data. All credit is due to lunchbox (Dong Liu)
/*
 author: lunchbox
 problem link: https://c...content-available-to-author-only...s.com/group/uodset6U2h/contest/405473/problem/C
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5, MX = 1e9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct rect {
 long long l, d, u, r, i;
 rect operator+(const rect& o) {
  return {max(l, o.l), max(d, o.d), min(u, o.u), min(r, o.r), -1};
 }
 bool empty() const {
  return l > r || d > u;
 }
 long long area() const {
  assert(!empty());
  return 1LL * (r - l + 1) * (u - d + 1);
 }
} a[N];
int main() {
 ios::sync_with_stdio(0), cin.tie(0);
 int n, k; cin >> n >> k;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 1 / 1
• Subtask 3: 3 / 3
• Subtask 4: 6 / 6
• Subtask 5: 1 / 1
• Subtask 6: 3 / 3
• Subtask 7: 6 / 6
• Subtask 8: 0 / 79