oj.uz

Submission #170291

# Submission time Handle Problem Language Result Execution time Memory
170291 2019-12-24T13:56:58 Z div2der Star triangles (IZhO11_triangle) C++14
0 / 100
 2 ms 380 KB 
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
using namespace std;

#define sz(s) (int)(s.size())
#define eb emplace_back
#define all(x) x.begin(), x.end()

const int N = 2e6;
const int NN = 4e3;

#define ll long long

ll x[N], y[N], cntx[N], cnty[N];

void solve() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++ i) {
		cin >> x[i] >> y[i];
		++cntx[x[i]];
		++cnty[y[i]];
	}
	ll res = 0;
	for (int i = 1; i <= n; ++ i)
		res += ((cntx[x[i]] - 1) * (cnty[y[i]] - 1));
	cout << res;
}

int main () {	
	solve();
	return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -