Submission #531262

#	Time	Username	Problem	Language	Result	Execution time	Memory
531262		devariaota	Star triangles (IZhO11_triangle)	C++17	100 / 100	450 ms	13164 KiB

triangle

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef double dbl;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef map<ll, ll> mll;
typedef pair<string, ll> psl;
typedef map<string, ll> msl;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef deque<ll> deq;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqm;
typedef priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> dij;
typedef priority_queue<ll> pq;
typedef string str;
const ll mod=1e9+7;
const ll maxn=2e4+1;
ll gcd(ll a, ll b) {
    return a==0 ? b : gcd(a, b%a);
}
ll lcm(ll a, ll b) {
    ll ans=a*b;
    ans=ans/(gcd(a, b));
    return ans;
}
#define ihacoy ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define dh << endl;
#define co cout <<
#define udh cout << endl;
#define spa << " ";
#define ci cin >>
#define fi first
#define se second
#define sp << " " <<
#define tes while(t--)
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
#define gre greater<ll>()
#define sip return 0
#define ub upper_bound
#define lb lower_bound
#define bs binary_search
int n;
ll ans;
map<int, ll> x, y;
int main() {
    ci n;
    int u[n], v[n];
    for(int i=0; i<n; i++) {
        ci u[i] >> v[i];
        x[u[i]]++;
        y[v[i]]++;
    }
    for(int i=0; i<n; i++) {
        ans+=(x[u[i]]-1)*(y[v[i]]-1);
    }
    co ans;
}

• Subtask 1: 100 / 100