oj.uz

Submission #531262

# Submission time Handle Problem Language Result Execution time Memory
531262 2022-02-28T09:36:22 Z devariaota Star triangles (IZhO11_triangle) C++17
100 / 100
 450 ms 13164 KB 
#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.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 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 296 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 288 KB Output is correct
11 Correct 2 ms 308 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 12 ms 1100 KB Output is correct
14 Correct 16 ms 1656 KB Output is correct
15 Correct 163 ms 7092 KB Output is correct
16 Correct 164 ms 7424 KB Output is correct
17 Correct 180 ms 7232 KB Output is correct
18 Correct 153 ms 7108 KB Output is correct
19 Correct 435 ms 12508 KB Output is correct
20 Correct 320 ms 10188 KB Output is correct
21 Correct 446 ms 13164 KB Output is correct
22 Correct 450 ms 13092 KB Output is correct