# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314264 | Trickster | Star triangles (IZhO11_triangle) | C++14 | 958 ms | 15612 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <string.h>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
#define N 300010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mod 1000000007
#define pii pair <ll, ll>
#define sz(a) ll(a.size())
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
ll bigmod(ll a,ll e) {if(e==0)return 1;ll x=bigmod(a*a%mod,e>>1);return e&1?x*a%mod:x;}
pii p[N];
ll n, x, y;
map <ll, ll> R, C;
int main()
{
cin >> n;
ll ans = 0;
for(ll i = 1; i <= n; i++) {
cin >> x >> y;
R[x]++, C[y]++;
p[i] = {x, y};
}
for(ll i = 1; i <= n; i++) ans += (R[p[i].ff] - 1) * (C[p[i].ss] - 1);
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |