# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531748 | MedalistSlayer | Star triangles (IZhO11_triangle) | C++14 | 6 ms | 332 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.
/*
Does he have IGM on CF?
-neko_nyaa
*/
#include <bits/stdc++.h>
using namespace std;
//constant
const int mod=1e9+7;
const long long mod2=998244353LL;
const long long inf=(long long)1e18;
//define
#define PB push_back
#define MP make_pair
#define pi acos(-1)
#define int long long
//typedef
typedef long long ll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef map<string,int> msi;
typedef set<int> SI;
typedef priority_queue<int> pqi;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("triangles.in", "r", stdin);
freopen("triangles.out", "w", stdout);
int n;
cin >> n;
int x[n],y[n];
map<int,int> x1,y1;
for(int i=0;i<n;i++)
{
cin >> x[i] >> y[i];
x1[x[i]]++;
y1[y[i]]++;
}
int ans=0;
for(int i=0;i<n;i++)
{
ans+=(x1[x[i]]-1)*(y1[y[i]]-1);
}
cout << ans << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |