# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947464 | vjudge306 | Star triangles (IZhO11_triangle) | C++14 | 509 ms | 33528 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 <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nn "\n"
#define x_x ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define intt int _; cin >> _; while (_--)
#define emp push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define ld long double
#define A first
#define B second
typedef long long ll;
const ld eps = 1e-27;
// diff between decimals 0.000000001 mt19937 mt(time(nullptr));
int main() {
x_x
int n; cin>>n; vector<pair<int,int>>ar;
map<pair<int,int>,int>mp; map<int,ll>r,c;
for(int i=0,x,y; i<n; i++) {
cin>>x>>y; if (mp.find({x,y})==mp.end()) {mp[{x,y}]=1, r[x]++, c[y]++;
ar.emp({x,y});}
}
ll ans=0;
for(int i=0; i<ar.size(); i++) {
ans+=((r[ar[i].A]-1)*(c[ar[i].B]-1));
}
cout<<ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |