/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 1e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans;
void solve(){
fastios
cin>>n;
map<pll, int> used;
map<int, vector<pll>> dig1, dig2;
for(int i=0;i<n;i++){
ll a, b;
cin>>a>>b;
used[{a, b}] = 1;
dig1[a-b].pb({a, b});
dig2[a+b].pb({a, b});
}
for(auto tmp : dig1){
for(int i = 0; i < sz(tmp.ss); i++){
for(int j = i+1; j < sz(tmp.ss); j++){
if(used[{tmp.ss[j].ff, tmp.ss[i].ss}]) ans++;
if(used[{tmp.ss[i].ff, tmp.ss[j].ss}]) ans++;
}
}
}
for(auto tmp : dig2){
for(int i = 0; i < sz(tmp.ss); i++){
for(int j = i+1; j < sz(tmp.ss); j++){
if(used[{tmp.ss[j].ff, tmp.ss[i].ss}]) ans++;
if(used[{tmp.ss[i].ff, tmp.ss[j].ss}]) ans++;
}
}
}
cout<<ans<<"\n";
return;
}
/*
12
0 0
0 1
0 2
0 3
1 0
2 0
3 0
3 1
3 2
3 3
1 3
2 3
*/
int main(){
fastios
int t = 1;
if(t) solve();
else {
cin>>t;
while (t--) solve();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
