oj.uz

Submission #988488

# Submission time Handle Problem Language Result Execution time Memory
988488 2024-05-25T03:20:53 Z steveonalex Star triangles (IZhO11_triangle) C++17
100 / 100
 752 ms 31332 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    int n; cin >> n;
    vector<pair<int, int>> a(n);
    for(int i = 0; i<n; ++i) cin >> a[i].first >> a[i].second;

    map<int, int> X, Y;
    map<pair<int, int>, int> mp;
    for(pair<int, int> i: a){
        X[i.first]++; Y[i.second]++;
        mp[i]++;
    }

    ll ans = 0;
    for(pair<int, int> i: a){
        ll x = X[i.first] - mp[i];
        ll y = Y[i.second] - mp[i];
        ans += x * y;
    }
    cout << ans << "\n";

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 452 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 10 ms 1628 KB Output is correct
13 Correct 9 ms 1628 KB Output is correct
14 Correct 13 ms 2136 KB Output is correct
15 Correct 150 ms 12348 KB Output is correct
16 Correct 191 ms 13208 KB Output is correct
17 Correct 175 ms 12368 KB Output is correct
18 Correct 154 ms 12372 KB Output is correct
19 Correct 706 ms 29012 KB Output is correct
20 Correct 337 ms 21860 KB Output is correct
21 Correct 699 ms 31332 KB Output is correct
22 Correct 752 ms 31116 KB Output is correct