oj.uz

답안 #240606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240606 2020-06-20T09:13:11 Z osaaateiasavtnl Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 8312 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 30007;
struct Point {
    int x, y, c;
    Point operator - (Point p) {
        return {x - p.x, y - p.y};
    }   
    Point operator + (Point p) {
        return {x + p.x, y + p.y};
    }   
    int operator *(Point p) {
        return x * p.y - y * p.x;
    }   
} a[N];  
int sign(int x) {
    if (x < 0)
        return -1;
    else if (x == 0)
        return 0;
    else
        return 1;
}   

vector <Point> cA[N][2], cB[N][2];
vector <Point> al[N];

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].x >> a[i].y >> a[i].c;
    }   
    Point A, B;
    cin >> A.x >> A.y;
    cin >> B.x >> B.y;

    auto half = [&](Point p) {
        int ans = (p - A) * (B - A) > 0;
        return ans;
    };     

    for (int i = 1; i <= n; ++i) {
        cA[a[i].c][half(a[i])].app(a[i]);
        cB[a[i].c][half(a[i])].app(a[i]);
        al[a[i].c].app(a[i]);
    }   

    auto compA = [&](Point a, Point b) {
        return (a - A) * (b - A) > 0;
    };
    auto compB = [&](Point a, Point b) {
        return (a - B) * (b - B) > 0;
    };

    for (int i = 1; i <= m; ++i) {
        for (int j = 0; j < 2; ++j) {
            sort(all(cA[i][j]), compA);
            sort(all(cB[i][j]), compB);
        }   
    }   

    int q;
    cin >> q;
    while (q--) {
        int c1, c2;
        cin >> c1 >> c2;
        int ans = 0;
        for (auto a : al[c1]) {
            int t = half(a);

            {
            int l = -1, r = cA[c2][t^1].size();
            auto sim = A + (A - a);
            while (l < r - 1) {
                int m = (l + r) >> 1;
                if (compA(cA[c2][t^1][m], sim))
                    l = m;
                else
                    r = m;
            }
            if ((A - a) * (B - a) > 0) {   
                ans -= r;
            }
            else {
                ans += r;
            }   
            }

            {
            int l = -1, r = cB[c2][t^1].size();
            auto sim = B + (B - a);
            while (l < r - 1) {
                int m = (l + r) >> 1;
                if (compB(cB[c2][t^1][m], sim)) 
                    l = m;
                else
                    r = m;
            }   
            if ((A - a) * (B - a) > 0) {   
                ans += r;
            }
            else {
                ans -= r;
            }   
            }

            for (auto b : cA[c2][t]) {
                auto l = A - a;
                auto r = B - a;
                auto v = b - a;
                if (sign(l * r) * sign(l * v) > 0 && sign(l * r) * sign(v * r) > 0) {
                    ++ans;
                }
            }   
        }
        cout << ans << endl;
    }   
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4224 KB Output is correct
2 Correct 18 ms 4224 KB Output is correct
3 Correct 29 ms 4224 KB Output is correct
4 Correct 50 ms 4480 KB Output is correct
5 Correct 39 ms 4472 KB Output is correct
6 Correct 9 ms 4224 KB Output is correct
7 Correct 8 ms 4224 KB Output is correct
8 Correct 9 ms 4224 KB Output is correct
9 Correct 10 ms 4224 KB Output is correct
10 Correct 8 ms 4224 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 454 ms 7280 KB Output is correct
2 Correct 763 ms 7808 KB Output is correct
3 Correct 42 ms 7936 KB Output is correct
4 Correct 25 ms 7800 KB Output is correct
5 Correct 30 ms 7416 KB Output is correct
6 Correct 391 ms 6984 KB Output is correct
7 Correct 334 ms 6868 KB Output is correct
8 Correct 28 ms 6876 KB Output is correct
9 Correct 200 ms 6972 KB Output is correct
10 Correct 25 ms 6760 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 4224 KB Output is correct
2 Correct 18 ms 4224 KB Output is correct
3 Correct 29 ms 4224 KB Output is correct
4 Correct 50 ms 4480 KB Output is correct
5 Correct 39 ms 4472 KB Output is correct
6 Correct 9 ms 4224 KB Output is correct
7 Correct 8 ms 4224 KB Output is correct
8 Correct 9 ms 4224 KB Output is correct
9 Correct 10 ms 4224 KB Output is correct
10 Correct 8 ms 4224 KB Output is correct
11 Correct 454 ms 7280 KB Output is correct
12 Correct 763 ms 7808 KB Output is correct
13 Correct 42 ms 7936 KB Output is correct
14 Correct 25 ms 7800 KB Output is correct
15 Correct 30 ms 7416 KB Output is correct
16 Correct 391 ms 6984 KB Output is correct
17 Correct 334 ms 6868 KB Output is correct
18 Correct 28 ms 6876 KB Output is correct
19 Correct 200 ms 6972 KB Output is correct
20 Correct 25 ms 6760 KB Output is correct
21 Correct 457 ms 7400 KB Output is correct
22 Correct 760 ms 7800 KB Output is correct
23 Correct 828 ms 7988 KB Output is correct
24 Correct 480 ms 8312 KB Output is correct
25 Correct 78 ms 7800 KB Output is correct
26 Correct 76 ms 7672 KB Output is correct
27 Correct 29 ms 7424 KB Output is correct
28 Correct 28 ms 7424 KB Output is correct
29 Execution timed out 4085 ms 7260 KB Time limit exceeded
30 Halted 0 ms 0 KB -