Submission #1255251

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255251		bonic	Star triangles (IZhO11_triangle)	C++20	100 / 100	324 ms	9812 KiB

triangle

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    int n; cin >> n; vector<int> X(n); vector<int> Y(n);
    vector<pair<int, int>> A(n);
    for (int i = 0; i < n; i++) {
        int x, y; cin >> x >> y;
        A[i] = {x, y};
        X[i] = x; Y[i] = y;
    }
    sort(X.begin(), X.end()); sort(Y.begin(), Y.end()); int sum = 0;
    for (int i = 0; i < n; i++) {
        int q = A[i].first; int w = A[i].second;
        int a = (upper_bound(X.begin(), X.end(), q) - X.begin()) - (lower_bound(X.begin(), X.end(), q) - X.begin());
        int b = (upper_bound(Y.begin(), Y.end(), w) - Y.begin()) - (lower_bound(Y.begin(), Y.end(), w) - Y.begin());
        // cout << a-1 << " " << b-1 << "\n";
        sum += (a-1) * (b-1);
    }
    cout << sum;
}

• Subtask 1: 100 / 100