oj.uz

Submission #689292

# Submission time Handle Problem Language Result Execution time Memory
689292 2023-01-28T05:50:09 Z sudheerays123 Star triangles (IZhO11_triangle) C++17
0 / 100
 1 ms 444 KB 
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;

void solve(){

	ll n;
	cin >> n;

	unordered_map<ll,ll> x,y;
	vector<pair<ll,ll>> a(N);

	for(ll i = 1; i <= n; i++){
		cin >> a[i].first >> a[i].second;

		x[a[i].first]++;
		y[a[i].second]++;
	}

	ll cnt = 0;
	for(ll i = 1; i <= n; i++) cnt += (x[a[i].first]-1)*(y[a[i].second]-1);

	cout << cnt;
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Runtime error 1 ms 444 KB Execution killed with signal 11
9 Halted 0 ms 0 KB -