oj.uz

Submission #5879

# Submission time Handle Problem Language Result Execution time Memory
5879 2014-05-20T21:26:03 Z kriii Star triangles (IZhO11_triangle) C++
100 / 100
 532 ms 7644 KB 
#include <stdio.h>
#include <map>
using namespace std;

map<int, long long> X,Y;
int x[300003],y[300003];

int main()
{
	int N;

	scanf ("%d",&N);
	for (int i=0;i<N;i++){
		scanf ("%d %d",&x[i],&y[i]);
		X[x[i]]++; Y[y[i]]++;
	}

	long long ans = 0;
	for (int i=0;i<N;i++) ans += (X[x[i]] - 1) * (Y[y[i]] - 1);
	printf ("%lld\n",ans);

	return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3552 KB Output is correct
2 Correct 0 ms 3552 KB Output is correct
3 Correct 0 ms 3552 KB Output is correct
4 Correct 0 ms 3552 KB Output is correct
5 Correct 0 ms 3552 KB Output is correct
6 Correct 0 ms 3552 KB Output is correct
7 Correct 0 ms 3552 KB Output is correct
8 Correct 0 ms 3552 KB Output is correct
9 Correct 0 ms 3552 KB Output is correct
10 Correct 0 ms 3552 KB Output is correct
11 Correct 0 ms 3552 KB Output is correct
12 Correct 8 ms 4080 KB Output is correct
13 Correct 4 ms 4080 KB Output is correct
14 Correct 4 ms 4608 KB Output is correct
15 Correct 156 ms 7380 KB Output is correct
16 Correct 172 ms 7380 KB Output is correct
17 Correct 168 ms 7380 KB Output is correct
18 Correct 160 ms 7380 KB Output is correct
19 Correct 480 ms 7644 KB Output is correct
20 Correct 352 ms 7512 KB Output is correct
21 Correct 472 ms 7644 KB Output is correct
22 Correct 532 ms 7644 KB Output is correct