제출 #229058

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229058		NONAME	Sunčanje (COCI18_suncanje)	C++17	91 / 130	4094 ms	5368 KiB

suncanje

#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#define N 100500
#define oo ll(1e16)
#define ft first
#define sd second
#define pb push_back
#define ppb pop_back
#define el '\n'
#define elf endl
#define base ll(1e9 + 7)
using namespace std;
typedef long long ll;
typedef long double ld;

ll n, m, xlt[N], ylt[N], xrt[N], yrt[N], rs[N];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    in("input.txt");

    cin >> n;
    for (int i = 0; i < n; i++) {
        ll a, b;
        cin >> xlt[i] >> ylt[i] >> a >> b;
        xrt[i] = xlt[i] + a;
        yrt[i] = ylt[i] + b;
        rs[i] = 1;
    }

    for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
        ll mn1, mx1, mn2, mx2;

        mn1 = min(xrt[i], xrt[j]);
        mx1 = max(xlt[i], xlt[j]);

        mn2 = min(yrt[i], yrt[j]);
        mx2 = max(ylt[i], ylt[j]);

        if (mn1 > mx1 && mn2 > mx2) {
            rs[i] = 0;
            break;
        }
    }

    for (int i = 0; i < n; i++)
        if (rs[i]) cout << "DA" << el;
            else cout << "NE" << el;
}

• Subtask 1: 13 / 13
• Subtask 2: 13 / 13
• Subtask 3: 13 / 13
• Subtask 4: 13 / 13
• Subtask 5: 13 / 13
• Subtask 6: 13 / 13
• Subtask 7: 13 / 13
• Subtask 8: 0 / 13
• Subtask 9: 0 / 13
• Subtask 10: 0 / 13