oj.uz

Submission #382219

# Submission time Handle Problem Language Result Execution time Memory
382219 2021-03-26T18:11:22 Z vishesh312 Star triangles (IZhO11_triangle) C++17
100 / 100
 457 ms 9196 KB 
#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

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

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n;
    cin >> n;
    vector<pair<ll, ll>> v(n);
    map<ll, ll> cnta, cntb;
    for (auto &[a, b] : v) {
        cin >> a >> b;
        ++cnta[a], ++cntb[b];
    }
    ll ans = 0;
    for (auto &[a, b] : v) {
        ans += (cnta[a]-1) * (cntb[b]-1);
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 500 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 8 ms 1132 KB Output is correct
13 Correct 8 ms 1132 KB Output is correct
14 Correct 13 ms 1644 KB Output is correct
15 Correct 161 ms 5868 KB Output is correct
16 Correct 168 ms 5996 KB Output is correct
17 Correct 122 ms 5868 KB Output is correct
18 Correct 140 ms 5996 KB Output is correct
19 Correct 457 ms 8812 KB Output is correct
20 Correct 276 ms 7532 KB Output is correct
21 Correct 453 ms 9196 KB Output is correct
22 Correct 441 ms 9196 KB Output is correct