oj.uz

답안 #525659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525659 2022-02-12T11:18:39 Z Shavkatjon 별들과 삼각형 (IZhO11_triangle) C++14
100 / 100
 301 ms 15556 KB 
#include <bits/stdc++.h>

#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define int long long
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) sort(x.begin(), x.end())
#define rall(x) sort(x.rbegin(), x.rend())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 222222

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

const ld pi = 2 * acos(0.0);

//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

int gcd(int a, int b) {
    return b ? gcd (b, a % b) : a;
}

int binpow (int a, int n) {
    if (n == 0)
        return 1LL;
    if (n % 2 == 1)
        return ((binpow (a, n-1)%MOD) * 1LL * a)%MOD;
    else {
        int b = binpow (a, n/2)%MOD;
        return (b * b)%MOD;
    }
}

//void swap(int &a, int &b){
//    b = (a+b) - (a=b);
//}

void solve(){
    map<int, int> m1, m2;
    int n, a[300001][2], sum = 0;
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> a[i][0] >> a[i][1];
        m1[a[i][0]]++;
        m2[a[i][1]]++;
    }
    for(int i = 0; i < n; i++){
        sum += (m1[a[i][0]] - 1) * (m2[a[i][1]] - 1);
    }
    cout << sum;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
        cout << "\n";
    }

    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5008 KB Output is correct
2 Correct 3 ms 4996 KB Output is correct
3 Correct 2 ms 5000 KB Output is correct
4 Correct 2 ms 4940 KB Output is correct
5 Correct 2 ms 5008 KB Output is correct
6 Correct 2 ms 4940 KB Output is correct
7 Correct 2 ms 5004 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 2 ms 4940 KB Output is correct
10 Correct 4 ms 5000 KB Output is correct
11 Correct 3 ms 5068 KB Output is correct
12 Correct 8 ms 5708 KB Output is correct
13 Correct 7 ms 5772 KB Output is correct
14 Correct 14 ms 6296 KB Output is correct
15 Correct 102 ms 11044 KB Output is correct
16 Correct 146 ms 11204 KB Output is correct
17 Correct 104 ms 11112 KB Output is correct
18 Correct 116 ms 11064 KB Output is correct
19 Correct 273 ms 14996 KB Output is correct
20 Correct 221 ms 13476 KB Output is correct
21 Correct 276 ms 15468 KB Output is correct
22 Correct 301 ms 15556 KB Output is correct