#include <bits/stdc++.h>
#define fr first
#define se second
using namespace std;
const long long N = 3e5 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
long long n;
long long res;
pair<long long, long long> d[N];
int main()
{
/// freopen("input.txt", "r", stdin);
/// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio( false );
cin >> n;
for(int i = 1; i <= n; i ++){
cin >> d[i].fr >> d[i].se;
}
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= n; j ++){
for(int k = 1; k <= n; k ++){
if(i == j || i == k || j == k){
continue;
}
pair<long long, long long> a = d[i];
pair<long long, long long> b = d[j];
pair<long long, long long> c = d[k];
res += (a.fr == b.fr && b.se == c.se);
}
}
}cout << res << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
504 KB |
Output is correct |
8 |
Correct |
23 ms |
376 KB |
Output is correct |
9 |
Correct |
317 ms |
476 KB |
Output is correct |
10 |
Correct |
861 ms |
504 KB |
Output is correct |
11 |
Correct |
1821 ms |
456 KB |
Output is correct |
12 |
Execution timed out |
2032 ms |
636 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |