답안 #867674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867674 2023-10-29T06:07:20 Z sleepntsheep 별들과 삼각형 (IZhO11_triangle) C++17
100 / 100
137 ms 5132 KB
#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,tune=native")

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using ll = long long;
#define N 300005

int n, C, c[N], b[N];
array<int, 2> a[N]; ll z;

int main()
{
    ShinLena;
    for (int i = (cin >> n, 0); i < n; ++i) cin >> a[i][0] >> a[i][1], c[C++] = a[i][1];
    sort(c, c+C);
    for (int i = 0; i < n; ++i) ++b[a[i][1] = lower_bound(c, c+C, a[i][1]) - c];
    sort(a, a+n); n = unique(a, a+n) - a;
    ll d=0;
    for (int f, e = 0, i = 0, l = -1; i < n; ++i)
    {
        f = a[i][0] == l;
        l += (a[i][0] - l) * !f, d *= f, e *= f;
        z += d + (b[a[i][1]] - 1ll) * e;
        ++e, d += b[a[i][1]] - 1;
    }
    cout << z;
    return 0;
}

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2504 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 4 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 4 ms 2464 KB Output is correct
15 Correct 41 ms 4700 KB Output is correct
16 Correct 45 ms 4700 KB Output is correct
17 Correct 44 ms 4696 KB Output is correct
18 Correct 45 ms 4732 KB Output is correct
19 Correct 122 ms 5044 KB Output is correct
20 Correct 87 ms 4696 KB Output is correct
21 Correct 137 ms 5128 KB Output is correct
22 Correct 134 ms 5132 KB Output is correct