oj.uz

답안 #995154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995154 2024-06-08T14:10:19 Z Sokol080808 별들과 삼각형 (IZhO11_triangle) C++17
100 / 100
 783 ms 22944 KB 
#include <bits/stdc++.h>
#include <malloc.h>

using namespace std;

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

// #ifndef ONPC
//     freopen("triangles.in", "r", stdin);
//     freopen("triangles.out", "w", stdout);
// #endif


    int n;
    cin >> n;
    vector<array<int, 2>> a(n);
    map<int, vector<int>> x, y;
    
    for (int i = 0; i < n; i++) {
        cin >> a[i][0] >> a[i][1];
        y[a[i][0]].push_back(a[i][1]);
        x[a[i][1]].push_back(a[i][0]);
    }

    set<int> ok_x, ok_y;
    for (int i = 0; i < n; i++) {
        if (!ok_x.count(a[i][0])) {
            ok_x.insert(a[i][0]);
            sort(all(y[a[i][0]]));
        }
        if (!ok_y.count(a[i][1])) {
            ok_y.insert(a[i][1]);
            sort(all(x[a[i][1]]));
        }
    }

    ll ans = 0;
    for (int i = 0; i < n; i++) {
        auto [curx, cury] = a[i];
        ll u = y[curx].end() - upper_bound(all(y[curx]), cury);
        ll d = lower_bound(all(y[curx]), cury) - y[curx].begin();
        ll l = lower_bound(all(x[cury]), curx) - x[cury].begin();
        ll r = x[cury].end() - upper_bound(all(x[cury]), curx);
        ans += (u + d) * (l + r);
    }
    cout << ans << '\n';

    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 17 ms 2244 KB Output is correct
13 Correct 15 ms 2140 KB Output is correct
14 Correct 25 ms 3672 KB Output is correct
15 Correct 265 ms 13464 KB Output is correct
16 Correct 274 ms 13908 KB Output is correct
17 Correct 264 ms 13272 KB Output is correct
18 Correct 246 ms 13396 KB Output is correct
19 Correct 728 ms 21840 KB Output is correct
20 Correct 514 ms 18512 KB Output is correct
21 Correct 766 ms 22764 KB Output is correct
22 Correct 783 ms 22944 KB Output is correct