oj.uz

Submission #240604

# Submission time Handle Problem Language Result Execution time Memory
240604 2020-06-20T09:10:43 Z osaaateiasavtnl Dragon 2 (JOI17_dragon2) C++14
60 / 100
 4000 ms 8440 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) {

                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;
                }   
                ans -= r;
                
                sim = B + (B - a);
                for (auto b : cB[c2][t^1]) {
                    if (compB(b, sim)) {
                        ++ans;
                    }
                }   
            }
            else {
                auto sim = A + (A - a);
                for (auto b : cA[c2][t^1]) {
                    if (compA(b, sim)) {
                        ++ans;    
                    }
                }   
                sim = B + (B - a);
                for (auto b : cB[c2][t^1]) {
                    if (compB(b, sim)) {
                        --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 << ans << endl;
    }   
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4352 KB Output is correct
2 Correct 20 ms 4352 KB Output is correct
3 Correct 29 ms 4352 KB Output is correct
4 Correct 47 ms 4728 KB Output is correct
5 Correct 37 ms 4728 KB Output is correct
6 Correct 10 ms 4352 KB Output is correct
7 Correct 9 ms 4352 KB Output is correct
8 Correct 12 ms 4352 KB Output is correct
9 Correct 12 ms 4352 KB Output is correct
10 Correct 12 ms 4352 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 7536 KB Output is correct
2 Correct 1120 ms 8064 KB Output is correct
3 Correct 49 ms 8184 KB Output is correct
4 Correct 29 ms 8064 KB Output is correct
5 Correct 35 ms 7680 KB Output is correct
6 Correct 350 ms 7244 KB Output is correct
7 Correct 338 ms 7124 KB Output is correct
8 Correct 378 ms 7132 KB Output is correct
9 Correct 466 ms 7344 KB Output is correct
10 Correct 373 ms 7144 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4352 KB Output is correct
2 Correct 20 ms 4352 KB Output is correct
3 Correct 29 ms 4352 KB Output is correct
4 Correct 47 ms 4728 KB Output is correct
5 Correct 37 ms 4728 KB Output is correct
6 Correct 10 ms 4352 KB Output is correct
7 Correct 9 ms 4352 KB Output is correct
8 Correct 12 ms 4352 KB Output is correct
9 Correct 12 ms 4352 KB Output is correct
10 Correct 12 ms 4352 KB Output is correct
11 Correct 623 ms 7536 KB Output is correct
12 Correct 1120 ms 8064 KB Output is correct
13 Correct 49 ms 8184 KB Output is correct
14 Correct 29 ms 8064 KB Output is correct
15 Correct 35 ms 7680 KB Output is correct
16 Correct 350 ms 7244 KB Output is correct
17 Correct 338 ms 7124 KB Output is correct
18 Correct 378 ms 7132 KB Output is correct
19 Correct 466 ms 7344 KB Output is correct
20 Correct 373 ms 7144 KB Output is correct
21 Correct 629 ms 7652 KB Output is correct
22 Correct 1116 ms 8060 KB Output is correct
23 Correct 1167 ms 8184 KB Output is correct
24 Correct 461 ms 8440 KB Output is correct
25 Correct 74 ms 8056 KB Output is correct
26 Correct 73 ms 7928 KB Output is correct
27 Correct 29 ms 7680 KB Output is correct
28 Correct 28 ms 7680 KB Output is correct
29 Execution timed out 4067 ms 7820 KB Time limit exceeded
30 Halted 0 ms 0 KB -