# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313285 | Nightlight | Hamburg Steak (JOI20_hamburg) | C++14 | 3061 ms | 10744 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int N, K;
int L[200005], R[200005], D[200005], U[200005];
int A[200005], ok[200005], wa[200005];
int ans[5][5];
int main() {
scanf("%d %d", &N, &K);
mt19937 rnd(1069696909);
for(int i = 1; i <= N; i++) {
scanf("%d %d %d %d", &L[i], &D[i], &R[i], &U[i]);
A[i] = i;
}
int l, r, u, d, now, p1, p2, tp;
while(1) {
p1 = 0, p2 = 0;
for(int i = 1; i <= K; i++) {
ans[i][1] = 1, ans[i][2] = 1;
ans[i][3] = 1000000000, ans[i][4] = 1000000000;
}
for(int i = 1; i <= N; i++) {
now = A[i];
for(tp = 1; tp <= K; tp++) {
l = max(L[now], ans[tp][1]);
d = max(D[now], ans[tp][2]);
r = min(R[now], ans[tp][3]);
u = min(U[now], ans[tp][4]);
if(l <= r && d <= u) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |