답안 #168247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168247 2019-12-12T06:40:42 Z thecodingwizard Dragon 2 (JOI17_dragon2) C++11
15 / 100
4000 ms 11368 KB
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; i<=(a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000LL
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define PI acos(-1.0)
// #define MOD (int)(2e+9+11)
#define MOD (int)(1e+9+7)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;

#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
#define SORT(vec) sort(all(vec))
#define RSORT(vec) sort(vec.rbegin(),vec.rend())

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

// @formatter:off
// Source: Benq (https://github.com/bqi343/USACO) [Modified]
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    template<class T> void reA(T A[], int sz);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.pA,p.pB); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
    template<class T> void reA(T A[], int sz) { F0R(i, sz) re(A[i]); }

    void setupIO(const string &PROB = "") {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        if (PROB.length() != 0) {
            ifstream infile(PROB + ".in");
            if (infile.good()) {
                freopen((PROB + ".in").c_str(), "r", stdin);
                freopen((PROB + ".out").c_str(), "w", stdout);
            }
        }
    }
}
using namespace input;

namespace output {
    template<class T1, class T2> void prD(const pair<T1,T2>& x);
    template<class T, size_t SZ> void prD(const array<T,SZ>& x);
    template<class T> void prD(const vector<T>& x);
    template<class T> void prD(const set<T>& x);
    template<class T1, class T2> void prD(const map<T1,T2>& x);

    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void prD(const T& x) { cout << x; cout.flush(); }
    template<class Arg, class... Args> void prD(const Arg& first, const Args&... rest) {
        prD(first); prD(rest...);
    }

    template<class T1, class T2> void prD(const pair<T1,T2>& x) {
        prD("{",x.pA,", ",x.pB,"}");
    }
    template<class T> void prDContain(const T& x) {
        prD("{");
        bool fst = 1; for (const auto& a: x) prD(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        prD("}");
    }
    template<class T, size_t SZ> void prD(const array<T,SZ>& x) { prDContain(x); }
    template<class T> void prD(const vector<T>& x) { prDContain(x); }
    template<class T> void prD(const set<T>& x) { prDContain(x); }
    template<class T1, class T2> void prD(const map<T1,T2>& x) { prDContain(x); }

    void psD() { prD("\n"); }
    template<class Arg> void psD(const Arg& first) {
        prD(first); psD(); // no space at end of line
    }
    template<class Arg, class... Args> void psD(const Arg& first, const Args&... rest) {
        prD(first," "); psD(rest...); // print w/ spaces
    }


    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr(x.pA, " ", x.pB);
    }
    template<class T> void prContain(const T& x) {
        bool fst = 1; for (const auto& a: x) pr(!fst?" ":"",a), fst = 0; // const needed for vector<bool>
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}
using namespace output;
// @formatter:on

/* ============================ */

struct point { ld x, y;   // only used if more precision is needed
    point() { x = y = 0.0; }                      // default constructor
    point(ld _x, ld _y) : x(_x), y(_y) {}        // user-defined
    bool operator == (point other) const {
        return (fabs(x-other.x) < EPS && (fabs(y-other.y) < EPS)); }
    bool operator <(const point &p) const {
        return x < p.x || (abs(x-p.x) < EPS && y < p.y); } };

struct vec { ld x, y;  // name: `vec' is different from STL vector
    vec(ld _x, ld _y) : x(_x), y(_y) {} };

vec toVec(point a, point b) {       // convert 2 points to vector a->b
    return vec(b.x-a.x, b.y-a.y); }

ld cross(vec a, vec b) { return a.x*b.y - a.y*b.x; }

// note: to accept collinear points, we have to change the `> 0'
// returns true if point r is on the left side of line pq
bool ccw(point p, point q, point r) {
    return cross(toVec(p, q), toVec(p, r)) > 0; }

class FenwickTree {
private:
    vi ft;

public:
    FenwickTree() {}
    FenwickTree(int n) { ft.assign(n + 1, 0); }

    int rsq(int b) {
        int sum = 0; for (; b; b -= LSOne(b)) sum += ft[b];
        return sum; }

    int rsq(int a, int b) {
        return rsq(b) - (a == 1 ? 0 : rsq(a - 1)); }

    void adjust(int k, int v) {
        for (; k < (int)ft.size(); k += LSOne(k)) ft[k] += v; }
};

int n, m;
pair<point, int> A[30000];
pair<point, pair<int, int>> A2[30000];
pair<point, int> B[30000];
pair<point, ii> B2[30000];
int bSweepIdx[30000];
int ct[30000];
int qryAns[100000];
point a, b;
vector<int> toProcess;
vi dragonsByTribe[30000];
FenwickTree above(30000), below(30000);

// returns true if x < y in angle sweep about point a
bool cmp(point x, point y, point a, point b) {
    bool isBelowX = ccw(b, a, x), isBelowY = ccw(b, a, y);
    if (isBelowX == isBelowY) {
        return ccw(a, x, y);
    } else if (isBelowX && !isBelowY) {
        return !ccw(x, y, a);
    } else {
        return ccw(y, x, a);
    }
}

int solve(int t1, int t2) {
    trav(x, toProcess) {
        if (A[x].pB == t2 && ccw(b, a, A[x].pA)) {
            below.adjust(bSweepIdx[x]+1, 1);
        }
    }

    int ct = 0;
    trav(x, toProcess) {
        if (A[x].pB == t1) {
            if (ccw(b, a, A[x].pA)) {
                // below
                ct += below.rsq(bSweepIdx[x]+1);
                ct += above.rsq(bSweepIdx[x]+1, n);
            } else {
                ct += below.rsq(bSweepIdx[x]+1);
                ct += above.rsq(bSweepIdx[x]+1, n);
            }
        } else {
            if (ccw(b, a, A[x].pA)) {
                below.adjust(bSweepIdx[x]+1, -1);
            } else {
                above.adjust(bSweepIdx[x]+1, 1);
            }
        }
    }

    trav(x, toProcess) {
        if (A[x].pB == t2 && !ccw(b, a, A[x].pA)) {
            above.adjust(bSweepIdx[x]+1, -1);
        }
    }

    return ct;
}

set<int> activeSet[30000];
void solve2(int t1, vii &queries) {
    vi targets; trav(x, queries) targets.pb(x.pA);
    vi toProcess;

    trav(t2, targets) {
        trav(x, dragonsByTribe[t2]) {
            toProcess.pb(x);
            if (ccw(b, a, A[x].pA)) {
                activeSet[t2].insert(x);
            }
        }
    }
    trav(x, dragonsByTribe[t1]) {
        toProcess.pb(x);
    }

    sort(toProcess.begin(), toProcess.end());

    int ct2[sz(targets)]; SET(ct2, 0, sz(targets));
    trav(x, toProcess) {
        if (A[x].pB == t1) {
            if (ccw(b, a, A[x].pA)) {
                // below
                F0R(i, sz(targets)) {
                    int t2 = targets[i];
                    for (int y : activeSet[t2]) {
                        if (ccw(A[x].pA, b, A[y].pA)) ct2[i]++;
                    }
                }
            } else {
                F0R(i, sz(targets)) {
                    int t2 = targets[i];
                    for (int y : activeSet[t2]) {
                        if (ccw(b, A[x].pA, A[y].pA)) ct2[i]++;
                    }
                }
            }
        } else {
            if (ccw(b, a, A[x].pA)) {
                activeSet[A[x].pB].erase(x);
            } else {
                activeSet[A[x].pB].insert(x);
            }
        }
    }


    F0R(i, sz(queries)) {
        ii t2 = queries[i];
        activeSet[t2.pA].clear();
        qryAns[t2.pB] = ct2[i];
    }
}

int main() {
    setupIO();

    re(n, m); SET(ct, 0, m);
    F0R(i, n) {
        int a, b, c; re(a, b, c);
        A2[i] = B2[i] = {point(a, b), {c-1, i}};
        ct[c-1]++;
    }
    re(a.x, a.y, b.x, b.y);

    sort(A2, A2+n, [](const pair<point, ii> &x, const pair<point, ii> &y) {
        return cmp(x.pA, y.pA, a, b);
    });
    F0R(i, n) {
        A[i] = {A2[i].pA, A2[i].pB.pA};
    }

    F0R(i, n) {
        dragonsByTribe[A[i].pB].pb(i);
    }

    sort(B2, B2+n, [](const pair<point, ii> &x, const pair<point, ii> &y) {
        return cmp(x.pA, y.pA, b, a);
    });
    F0R(i, n) {
        B[i] = {B2[i].pA, B2[i].pB.pA};
    }

    int mappedAIdx[n];
    F0R(i, n) mappedAIdx[A2[i].pB.pB] = i;
    F0R(i, n) bSweepIdx[mappedAIdx[B2[i].pB.pB]] = i;

    int q; re(q); int SQRT = sqrt(q);
    vii queries[n];
    int queryCt[n]; SET(queryCt, n, 0);
    vii rawQueries;
    F0R(i, q) {
        int a, b; re(a, b); --a; --b;
        rawQueries.pb({a, b});
        queryCt[a]++;
    }
    F0R(i, sz(rawQueries)) {
        int a = rawQueries[i].pA, b = rawQueries[i].pB;
        if (queryCt[a] <= SQRT) {
            queries[a].pb({b,i});
        } else {
            toProcess.clear();
            trav(x, dragonsByTribe[a]) toProcess.pb(x);
            trav(x, dragonsByTribe[b]) toProcess.pb(x);
            sort(all(toProcess));
            qryAns[i] = solve(a, b);
        }
    }

    F0R(i, n) {
        solve2(i, queries[i]);
    }

    F0R(i, q) ps(qryAns[i]);

    return 0;
}

Compilation message

dragon2.cpp: In function 'void input::setupIO(const string&)':
dragon2.cpp:88:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".in").c_str(), "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dragon2.cpp:89:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".out").c_str(), "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 8440 KB Output is correct
2 Correct 61 ms 8568 KB Output is correct
3 Correct 109 ms 8728 KB Output is correct
4 Correct 123 ms 10992 KB Output is correct
5 Correct 70 ms 11368 KB Output is correct
6 Correct 14 ms 8568 KB Output is correct
7 Correct 14 ms 8568 KB Output is correct
8 Correct 39 ms 8568 KB Output is correct
9 Correct 39 ms 8568 KB Output is correct
10 Correct 39 ms 8568 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2796 ms 10308 KB Output is correct
2 Execution timed out 4016 ms 10544 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 8440 KB Output is correct
2 Correct 61 ms 8568 KB Output is correct
3 Correct 109 ms 8728 KB Output is correct
4 Correct 123 ms 10992 KB Output is correct
5 Correct 70 ms 11368 KB Output is correct
6 Correct 14 ms 8568 KB Output is correct
7 Correct 14 ms 8568 KB Output is correct
8 Correct 39 ms 8568 KB Output is correct
9 Correct 39 ms 8568 KB Output is correct
10 Correct 39 ms 8568 KB Output is correct
11 Correct 2796 ms 10308 KB Output is correct
12 Execution timed out 4016 ms 10544 KB Time limit exceeded
13 Halted 0 ms 0 KB -