oj.uz

Submission #1116653

# Submission time Handle Problem Language Result Execution time Memory
1116653 2024-11-22T05:02:08 Z Aldk Star triangles (IZhO11_triangle) C++17
100 / 100
 285 ms 15688 KB 
#include<bits/stdc++.h>
#define pb push_back
#define pf push_frontd
#define mp make_pair
#define F first
#define S second
#define ff first
#define ss second
#define str string
#define ll long long
#define ull unsigned ll
#define ld long double
#define pll pair<ll,ll>
#define plll pair<pll,ll>
#define pllll pair<pll,pll>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
//#define vb vector<bool>
#define vi vector<int>
#define vii vector<pii>
#define sz(x) (ll)(x).size()
#define fr front()
//#define tp top()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
using namespace std;
const ld pi=acos(-1.0);
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll MOD=106710087877475399;
const ll N=3e5+10;
const ll M=1e6+10;
const ld eps=1e-9;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;ll p=bpm(x,y/2,m);
if(y%2==0)return p*p%m;else return p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
ll n,x[N],y[N];
void solve(){
    cin>>n;
    map<ll,ll> mx,my;
    for(ll i=1;i<=n;i++){
        cin>>x[i]>>y[i];
        mx[x[i]]++;
        my[y[i]]++;
    }
    ll ans=0;
    for(ll i=1;i<=n;i++){
        ans+=(mx[x[i]]-1)*(my[y[i]]-1);
    }
    cout<<ans;
    return;
}
int main(/*Aldk*/){
    ios_base::sync_with_stdio(false);  cin.tie(NULL);
    //freopen("01.in", "r", stdin);
    //freopen("01.out ", "w", stdout);
    //cout<<setpre  cision(12)<<fixed;
    int test=1;
    //cin>>test;
    for(int i=1;i<=test;i++){
        solve();
        cout<<'\n';
    }
    return 0;
}

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 2 ms 2384 KB Output is correct
5 Correct 1 ms 2384 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 2 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 6 ms 3152 KB Output is correct
13 Correct 5 ms 3408 KB Output is correct
14 Correct 10 ms 3664 KB Output is correct
15 Correct 119 ms 10568 KB Output is correct
16 Correct 110 ms 10824 KB Output is correct
17 Correct 104 ms 10568 KB Output is correct
18 Correct 100 ms 10568 KB Output is correct
19 Correct 282 ms 15004 KB Output is correct
20 Correct 196 ms 13032 KB Output is correct
21 Correct 285 ms 15584 KB Output is correct
22 Correct 268 ms 15688 KB Output is correct