oj.uz

Submission #1100664

# Submission time Handle Problem Language Result Execution time Memory
1100664 2024-10-14T12:04:29 Z vjudge1 Star triangles (IZhO11_triangle) C++17
100 / 100
 719 ms 33408 KB 
//#pragma optimize ("g",on)
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define db double
#define ld long double
#define pb push_back
#define pf push_front
#define ppb pop_back()
#define ppf pop_front()
#define len(x) (int)x.size()
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define vvi vector<vi>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mii map<int,int>
#define y1 u_will_not_notice_this15
#define hash u_will_not_notice_this
#define tm (tl+tr>>1)
#define ls v<<1,tl,tm
#define rs v<<1|1,tm+1,tr
#define pii pair<int,int>
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define str string
#define ins insert
#define elif else if
using namespace std;
using namespace __gnu_pbds;
const int maxn=3e5+5,mod=1e9+7,inf=1e18,bir=1,nol=0;
const bool TEST=0;
const str tch="+abcdefghijklmnopqrstuvwxyz",Tch="+ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const str Monday_14_10_24[5]={"NO\n","YES\n","-1\n","0\n","1\n"};
void at(int ok){cout<<Monday_14_10_24[ok];}
bool bit(int mask,int i){return ((bir<<i)&mask);}
int gcd(int a,int b){while(b){if(a>b) swap(a,b);b%=a;}return a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int rnd(){return (rand()<<15)^rand();}
int bpm(int a,int b){a%=mod;if(b==0) return 1;if(b&1)return bpm(a,b-1)*a%mod;int x=bpm(a,b>>1);return x*x%mod;}
int bp(int a,int b){if(b==0) return 1;if(b&1)return bp(a,b-1)*a;int x=bp(a,b>>1);return x*x;}
//CODE STARTS HERE:
//don't get stuck on one aproach
int n,x[maxn],y[maxn];
void whyareucopying(){
	cin>>n;
	mii mp1,mp2;
	map<pii,int>mp;
	int ans=0;
	for(int i=1;i<=n;i++)cin>>x[i]>>y[i],mp1[x[i]]++,mp2[y[i]]++,mp[{x[i],y[i]}]++;
	for(int i=1;i<=n;i++){
		int cur=(mp1[x[i]]-mp[{x[i],y[i]}])*(mp2[y[i]]-mp[{x[i],y[i]}]);	
		ans+=cur;
	}
	cout<<ans<<'\n';
}
signed main(){
//	freopen("txt.in","r",stdin),freopen("txt.out","w",stdout);
	ios_base::sync_with_stdio(0),cin.tie(0);
	srand(time(0));
	int T=1;
	if(TEST)cin>>T;
	for(int i=1;i<=T;i++){
//		cout<<"Case "<<i<<": ";
		whyareucopying();
	}
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 11 ms 3664 KB Output is correct
13 Correct 12 ms 3664 KB Output is correct
14 Correct 15 ms 4432 KB Output is correct
15 Correct 207 ms 14740 KB Output is correct
16 Correct 191 ms 15444 KB Output is correct
17 Correct 192 ms 17300 KB Output is correct
18 Correct 175 ms 14852 KB Output is correct
19 Correct 637 ms 31560 KB Output is correct
20 Correct 397 ms 21300 KB Output is correct
21 Correct 675 ms 28804 KB Output is correct
22 Correct 719 ms 33408 KB Output is correct