제출 #1263259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263259		CodeLakVN	Plahte (COCI17_plahte)	C++20	64 / 160	142 ms	24344 KiB

plahte

#include <bits/stdc++.h>
using namespace std;

#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

const int MAX_N = (int)8e4 + 5;

int nRec, nPoint;

struct RECTANGLE {
    int a, b, c, d;
} recs[MAX_N];

ii points[MAX_N];
int col[MAX_N];

struct EVENT {
    int x, y1, y2, id, type; // 1 - open, 2 - close, 0 - point

    bool operator < (const EVENT &other) const {
        return x < other.x || (x == other.x && type > other.type);
    }
};
vector<EVENT> events;

vector<int> comX, comY;
int nX, nY;

struct IT {
    vector<int> tree[4 * MAX_N];

    void add(int id, int l, int r, int u, int v, int val) {
        if (l > v || r < u) return;
        if (l >= u && r <= v) {
            tree[id].push_back(val);
            return;
        }
        int mid = (l + r) >> 1;
        add(id << 1, l, mid, u, v, val);
        add(id << 1 | 1, mid + 1, r, u, v, val);
    }

    void del(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return;
        if (l >= u && r <= v) {
            tree[id].pop_back();
            return;
        }
        int mid = (l + r) >> 1;
        del(id << 1, l, mid, u, v);
        del(id << 1 | 1, mid + 1, r, u, v);
    }

    int get(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return -1;
        if (l >= u && r <= v) {
            if (tree[id].empty()) return -1;
            return tree[id].back();
        }
        int mid = (l + r) >> 1;
        int res = get(id << 1, l, mid, u, v);
        if (res == -1)
            res = get(id << 1 | 1, mid + 1, r, u, v);
        if (res == -1 && !tree[id].empty())
            res = tree[id].back();
        return res;
    }

    void add(int l, int r, int val) {
        add(1, 1, nY, l, r, val);
    }

    void del(int l, int r) {
        del(1, 1, nY, l, r);
    }

    int get(int l, int r) {
        return get(1, 1, nY, l, r);
    }
} magic;

inline int idX(int x) {
    return lower_bound(comX.begin(), comX.end(), x) - comX.begin() + 1;
}

inline int idY(int y) {
    return lower_bound(comY.begin(), comY.end(), y) - comY.begin() + 1;
}

void compress() {
    FOR(i, 1, nRec) {
        comX.push_back(recs[i].a);
        comX.push_back(recs[i].c);
        comX.push_back(recs[i].c + 1);
        comY.push_back(recs[i].b);
        comY.push_back(recs[i].d);
    }
    FOR(i, 1, nPoint) {
        comX.push_back(points[i].F);
        comY.push_back(points[i].S);
    }

    sort(comX.begin(), comX.end());
    sort(comY.begin(), comY.end());
    comX.erase(unique(comX.begin(), comX.end()), comX.end());
    comY.erase(unique(comY.begin(), comY.end()), comY.end());

    FOR(i, 1, nRec) {
        recs[i].a = idX(recs[i].a);
        recs[i].c = idX(recs[i].c);
        recs[i].b = idY(recs[i].b);
        recs[i].d = idY(recs[i].d);
    }
    FOR(i, 1, nPoint) {
        points[i].F = idX(points[i].F);
        points[i].S = idY(points[i].S);
    }
    nX = (int)comX.size();
    nY = (int)comY.size();
}

vector<int> roots;
vector<int> adj[MAX_N];
set<int> colors[MAX_N];

void prepare() {
    compress();

    FOR(i, 1, nRec) {
        events.push_back({recs[i].a, recs[i].b, recs[i].d, i, 1});
        events.push_back({recs[i].c + 1, recs[i].b, recs[i].d, i, 2});
    }
    FOR(i, 1, nPoint)
        events.push_back({points[i].F, points[i].S, points[i].S, i, 0});

    sort(events.begin(), events.end());
}

void buildTree() {
    for (EVENT e : events) {
        if (e.type == 2) {
            magic.del(e.y1, e.y2);
        }
        else if (e.type == 1) {
            int x = magic.get(e.y1, e.y2);
            if (x == -1) roots.push_back(e.id);
            else adj[x].push_back(e.id);
            magic.add(e.y1, e.y2, e.id);
        }
        else {
            int x = magic.get(e.y1, e.y2);
            if (x != -1) colors[x].insert(col[e.id]);
        }
    }
}

int ans[MAX_N];

void combine(set<int> &a, set<int> &b) {
    if (a.size() < b.size()) swap(a, b);
    if (b.empty()) return;
    for (int c : b) a.insert(c);
    b.clear();
}

void dfs(int u) {
    for (int v : adj[u]) {
        dfs(v);
        combine(colors[u], colors[v]);
    }
    ans[u] = colors[u].size();
}

void solve() {
    cin >> nRec >> nPoint;
    FOR(i, 1, nRec) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        recs[i] = {a, b, c, d};
    }
    FOR(i, 1, nPoint) cin >> points[i].F >> points[i].S >> col[i];

    prepare();
    buildTree();
    for (int u : roots) dfs(u);

    FOR(i, 1, nRec) cout << ans[i] << "\n";
}

int32_t main() {
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = 0;
    int numTest = 1;
    if (multitest) cin >> numTest;

    while (numTest--) {
        solve();
    }

    return 0;
}

/* Lak lu theo dieu nhac!!!! */

컴파일 시 표준 에러 (stderr) 메시지

plahte.cpp: In function 'int32_t main()':
plahte.cpp:217:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  217 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
plahte.cpp:218:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  218 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 32 / 32
• Subtask 2: 32 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32
• Subtask 5: 0 / 32