oj.uz

답안 #240602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240602 2020-06-20T09:07:29 Z osaaateiasavtnl Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 9720 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);


            if ((A - a) * (B - a) > 0) {
                //cout << "first" << endl;
                auto sim = A + (A - a);

                //cout << sim.x << ' ' << sim.y << endl;

                for (auto b : cA[c2][t^1]) {
                    if (compA(b, sim)) {
                        //cout << "ext " << b.x << ' ' << b.y << endl;
                        --ans;    
                    }
                }   
                sim = B + (B - a);
                for (auto b : cB[c2][t^1]) {
                    if (compB(b, sim)) {
                        //cout << "add " << b.x << ' ' << b.y << endl;
                        ++ans;
                    }
                }   
            }
            else {
                //cout << "first" << endl;
                auto sim = A + (A - a);

                //cout << sim.x << ' ' << sim.y << endl;

                for (auto b : cA[c2][t^1]) {
                    if (compA(b, sim)) {
                        //cout << "ext " << b.x << ' ' << b.y << endl;
                        ++ans;    
                    }
                }   
                sim = B + (B - a);
                for (auto b : cB[c2][t^1]) {
                    if (compB(b, sim)) {
                        //cout << "add " << b.x << ' ' << b.y << endl;
                        --ans;
                    }
                }   
            }

            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 << a.x << ' ' << a.y << " : " << ans << endl;
        }
        cout << ans << endl;
    }   
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 4224 KB Output is correct
2 Correct 23 ms 4480 KB Output is correct
3 Correct 31 ms 4352 KB Output is correct
4 Correct 47 ms 5240 KB Output is correct
5 Correct 38 ms 5368 KB Output is correct
6 Correct 9 ms 4352 KB Output is correct
7 Correct 9 ms 4352 KB Output is correct
8 Correct 16 ms 4352 KB Output is correct
9 Correct 14 ms 4352 KB Output is correct
10 Correct 16 ms 4352 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 698 ms 7972 KB Output is correct
2 Correct 1257 ms 8448 KB Output is correct
3 Correct 50 ms 8576 KB Output is correct
4 Correct 26 ms 8576 KB Output is correct
5 Correct 32 ms 8184 KB Output is correct
6 Correct 339 ms 7628 KB Output is correct
7 Correct 335 ms 7628 KB Output is correct
8 Correct 738 ms 7636 KB Output is correct
9 Correct 547 ms 7484 KB Output is correct
10 Correct 723 ms 7528 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 4224 KB Output is correct
2 Correct 23 ms 4480 KB Output is correct
3 Correct 31 ms 4352 KB Output is correct
4 Correct 47 ms 5240 KB Output is correct
5 Correct 38 ms 5368 KB Output is correct
6 Correct 9 ms 4352 KB Output is correct
7 Correct 9 ms 4352 KB Output is correct
8 Correct 16 ms 4352 KB Output is correct
9 Correct 14 ms 4352 KB Output is correct
10 Correct 16 ms 4352 KB Output is correct
11 Correct 698 ms 7972 KB Output is correct
12 Correct 1257 ms 8448 KB Output is correct
13 Correct 50 ms 8576 KB Output is correct
14 Correct 26 ms 8576 KB Output is correct
15 Correct 32 ms 8184 KB Output is correct
16 Correct 339 ms 7628 KB Output is correct
17 Correct 335 ms 7628 KB Output is correct
18 Correct 738 ms 7636 KB Output is correct
19 Correct 547 ms 7484 KB Output is correct
20 Correct 723 ms 7528 KB Output is correct
21 Correct 701 ms 8056 KB Output is correct
22 Correct 1263 ms 8440 KB Output is correct
23 Correct 1279 ms 8728 KB Output is correct
24 Correct 457 ms 9720 KB Output is correct
25 Correct 76 ms 9464 KB Output is correct
26 Correct 87 ms 9720 KB Output is correct
27 Correct 29 ms 8408 KB Output is correct
28 Correct 30 ms 8320 KB Output is correct
29 Execution timed out 4080 ms 8768 KB Time limit exceeded
30 Halted 0 ms 0 KB -