oj.uz

Submission #1015521

# Submission time Handle Problem Language Result Execution time Memory
1015521 2024-07-06T13:09:19 Z Minbaev Star triangles (IZhO11_triangle) C++17
100 / 100
 391 ms 15700 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int md = 998244353;
const int N = 2e5 + 5;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;

void solve(){
	
	cin >> n;
	vector<pii>v(n);
	for(auto &to:v)cin >> to.f >> to.s;
	
	map<int,int>x;
	map<int,int>y;
	
	for(auto to:v){
		x[to.f] += 1;
		y[to.s] += 1;
	}
	int ans = 0;
	for(auto to:v){
		x[to.f] -= 1;
		y[to.s] -= 1;
		ans += x[to.f] * y[to.s];
		x[to.f] += 1;
		y[to.s] += 1;
	}
	cout << ans << "\n";
	
}
 /*
 209715
 */
 signed main()
{
	//~ freopen("triangles.in", "r", stdin);
	//~ freopen("triangles.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 496 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 1368 KB Output is correct
13 Correct 9 ms 1372 KB Output is correct
14 Correct 10 ms 1884 KB Output is correct
15 Correct 116 ms 8016 KB Output is correct
16 Correct 134 ms 8220 KB Output is correct
17 Correct 119 ms 7892 KB Output is correct
18 Correct 119 ms 8012 KB Output is correct
19 Correct 348 ms 14676 KB Output is correct
20 Correct 246 ms 11856 KB Output is correct
21 Correct 381 ms 15700 KB Output is correct
22 Correct 391 ms 15512 KB Output is correct