Line Intersections

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
string to_string(string s) {
    return '"' + s + '"';
}
 
string to_string(const char* s) {
    return to_string((string) s);
}
 
string to_string(bool b) {
    return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
 
void debug_out() {
    cerr << endl;
}
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
 
const int N = 1e5 + 5;
const int X = 1e6 + 5;
const int INF = 1e9;
 
int n;
vector<array<int, 4>> a;
int ans = 0;
 
int bit[2 * X];
 
void Update(int u, int v) {
    for (int i = u; i < 2 * X; i += i & -i) {
        bit[i] += v;
    }
}
 
int Get(int u) {
    int ans = 0;
    for (int i = u; i >= 1; i -= i & -i) {
        ans += bit[i];
    }
    return ans;
}
 
int Get(int l, int r) {
    return Get(r) - Get(l - 1);
}
 
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        
        x1 += X;
        x2 += X;
        y1 += X;
        y2 += X;
 
        if (x1 == x2) { // vertical line (used as query)
            a.push_back({x1, 1, y1, y2});
        }
 
        if (y1 == y2) { // horizontal line (used as update)
            a.push_back({x1, 0, y1, +1});
            a.push_back({x2 + 1, 0, y2, -1});
        }
    }
 
    sort(a.begin(), a.end());
 
    for (auto& q : a) {
        if (q[1] == 0) {
            Update(q[2], q[3]);
        } 
 
        if (q[1] == 1) {
            ans += Get(min(q[2], q[3]), max(q[2], q[3]));
        }
    }
 
    cout << ans << '\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER