oj.uz

답안 #305465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305465 2020-09-23T09:32:41 Z phathnv Sunčanje (COCI18_suncanje) C++11
130 / 130
 2453 ms 156900 KB 
#include <bits/stdc++.h>

#define mp make_pair
#define X first
#define Y second
#define taskname "SUNCANJE"

using namespace std;

typedef long long ll;
typedef pair <int, int> ii;

const int N = 1e5 + 1;
const int INF = 1e9;

struct rectangle{
    int x1, x2, y1, y2;
    rectangle(int _x1 = 0, int _x2 = 0, int _y1 = 0, int _y2 = 0){
        x1 = _x1;
        x2 = _x2;
        y1 = _y1;
        y2 = _y2;
    }
};

struct segmentTree{
    set <ii> s0[N * 8],s1[N * 8];
    bool check(set <ii> &s, int l, int r){
        if (s.empty())
            return 1;
        auto it = s.lower_bound(mp(l, 0));
        if (it != s.end()){
            if ((*it).X <= r)
                return 0;
        }
        if (it != s.begin()){
            --it;
            if ((*it).Y >= l)
                return 0;
        }
        return 1;
    }
    void add(set <ii> &s, int l, int r){
        if (s.empty()){
            s.insert(mp(l, r));
            return;
        }

        auto first = s.upper_bound(mp(l, 0));
        auto last = s.upper_bound(mp(r, INF));
        if (first != s.begin()){
            --first;
            if ((*first).Y < l)
                ++first;
        }

        vector <ii> tmp;
        while (first != last){
            tmp.push_back(*first);
            ++first;
        }
        for(ii p : tmp){
            s.erase(p);
            l = min(l, p.X);
            r = max(r, p.Y);
        }
        s.insert(mp(l, r));
    }
    bool addRect(int id, int l, int r, int x1, int x2, int y1, int y2){
        if (x2 < l || r < x1)
            return 1;
        if (x1 <= l && r <= x2){
            bool res = check(s0[id], y1, y2) && check(s1[id], y1, y2);
            add(s0[id], y1, y2);
            return res;
        }
        add(s1[id], y1, y2);
        int mid = (l + r) >> 1;
        bool res = check(s0[id], y1, y2);
        res &= addRect(id << 1, l, mid, x1, x2, y1, y2);
        res &= addRect(id << 1 | 1, mid + 1, r, x1, x2, y1, y2);
        return res;
    }
} ST;

int n;
rectangle rect[N];

int x[2 * N], nX, y[2 * N], nY;
bool ans[N];

void readInput(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        int x, y, a, b;
        cin >> x >> y >> a >> b;
        rect[i] = rectangle(x, x + a - 1, y, y + b - 1);
    }
}

void prepare(){
    for(int i = 1; i <= n; i++){
        x[++nX] = rect[i].x1;
        x[++nX] = rect[i].x2;
        y[++nY] = rect[i].y1;
        y[++nY] = rect[i].y2;
    }
    sort(x + 1, x + 1 + nX);
    sort(y + 1, y + 1 + nY);
    nX = unique(x + 1, x + 1 + nX) - (x + 1);
    nY = unique(y + 1, y + 1 + nY) - (y + 1);
    for(int i = 1; i <= n; i++){
        rect[i].x1 = lower_bound(x + 1, x + 1 + nX, rect[i].x1) - x;
        rect[i].x2 = lower_bound(x + 1, x + 1 + nX, rect[i].x2) - x;
        rect[i].y1 = lower_bound(y + 1, y + 1 + nY, rect[i].y1) - y;
        rect[i].y2 = lower_bound(y + 1, y + 1 + nY, rect[i].y2) - y;
    }
}

void solve(){
    for(int i = n; i >= 1; i--)
        ans[i] = ST.addRect(1, 1, nX, rect[i].x1, rect[i].x2, rect[i].y1, rect[i].y2);

    for(int i = 1; i <= n; i++)
        if (ans[i])
            cout << "DA\n";
        else
            cout << "NE\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    readInput();
    prepare();
    solve();
    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 79864 KB Output is correct
2 Correct 142 ms 81264 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 179 ms 83832 KB Output is correct
2 Correct 875 ms 109816 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 405 ms 88696 KB Output is correct
2 Correct 1165 ms 120300 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 562 ms 93820 KB Output is correct
2 Correct 999 ms 113656 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 983 ms 109432 KB Output is correct
2 Correct 1317 ms 120824 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 991 ms 106928 KB Output is correct
2 Correct 1241 ms 120892 KB Output is correct

Subtask #7
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1096 ms 116608 KB Output is correct
2 Correct 1163 ms 110712 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1723 ms 136820 KB Output is correct
2 Correct 993 ms 106012 KB Output is correct

Subtask #9
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1848 ms 133796 KB Output is correct
2 Correct 1853 ms 140668 KB Output is correct

Subtask #10
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2083 ms 136984 KB Output is correct
2 Correct 2453 ms 156900 KB Output is correct