oj.uz

Submission #436924

# Submission time Handle Problem Language Result Execution time Memory
436924 2021-06-25T09:40:35 Z zaneyu Star triangles (IZhO11_triangle) C++14
100 / 100
 411 ms 12172 KB 
/*input
4
0 0
1 0
0 1
1 1
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O2","unroll-loops","no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=3e5+5;
const int maxlg=__lg(maxn)+2;
pii arr[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    map<int,int> r,c;
    REP(i,n) cin>>arr[i].f>>arr[i].s,r[arr[i].f]++,c[arr[i].s]++;
    ll ans=0;
    REP(i,n){
        ans+=(r[arr[i].f]-1)*(c[arr[i].s]-1);
    }
    cout<<ans;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 932 KB Output is correct
13 Correct 9 ms 992 KB Output is correct
14 Correct 12 ms 1356 KB Output is correct
15 Correct 133 ms 6164 KB Output is correct
16 Correct 152 ms 6424 KB Output is correct
17 Correct 124 ms 6124 KB Output is correct
18 Correct 132 ms 6212 KB Output is correct
19 Correct 336 ms 11488 KB Output is correct
20 Correct 310 ms 9236 KB Output is correct
21 Correct 376 ms 12172 KB Output is correct
22 Correct 411 ms 12164 KB Output is correct