oj.uz

Submission #88604

# Submission time Handle Problem Language Result Execution time Memory
88604 2018-12-07T02:44:46 Z Badral Star triangles (IZhO11_triangle) C++17
0 / 100
 2 ms 524 KB 
#include<bits/stdc++.h>

#define maxn 300000
#define ll long long
using namespace std;

pair<ll,ll> a[maxn+5];
ll u[maxn+5];
ll o[maxn+5];

int main() {
	ll n;
	cin >>n;
	for(ll i = 1; i <= n; i++) {
		cin >>a[i].first >>a[i].second;
		u[a[i].first]++;
		o[a[i].second]++;
	}
	ll s = 0;
	for(ll i = 1; i <= n; i++) {
		s += (u[a[i].first]-1) * (o[a[i].second]-1);
	}
	cout<<s;
}

Subtask #1
0 / 100.0

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