/** 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<pii, int> used;
map<int, vii> linex, liney;
for(int i=0;i<n;i++){
ll a, b;
cin>>a>>b;
used[{a, b}] = 1;
linex[a].pb(b);
}
for(auto x : linex){
vii tmp = x.ss;
int cur = x.ff;
for(int i = 0; i < sz(tmp); i++){
int yy = tmp[i];
for(int j = i+1; j < sz(tmp); j++){
int dis = abs (yy - tmp[j]);
if(used[{cur + dis, yy}]) ans++;
if(used[{cur - dis, yy}]) ans++;
if(used[{cur + dis, tmp[j]}]) ans++;
if(used[{cur - dis, tmp[j]}]) ans++;
}
}
}
cout<<ans<<"\n";
return;
}
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 |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
