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>
#define PB push_back
using namespace std;
typedef long long ll;
const int N = 10100;
const int PW = 22;
bool mrk[N];
int X1[N], Y1[N], x2[N], y2[N], n;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++){
int X, Y; cin >> X1[i] >> Y1[i] >> X >> Y;
x2[i] = X1[i] + X;
y2[i] = Y1[i] + Y;
}
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++){
int mn = max(X1[i], X1[j]);
int mx = min(x2[i], x2[j]);
if (mn >= mx) continue;
mn = max(Y1[i], Y1[j]);
mx = min(y2[i], y2[j]);
if (mn >= mx) continue;
mrk[i] = 1;
}
for (int i = 0; i < n; i++)
cout << (mrk[i] ? "NE\n" : "DA\n");
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |