oj.uz

Submission #1098075

# Submission time Handle Problem Language Result Execution time Memory
1098075 2024-10-09T03:19:55 Z TrinhKhanhDung Star triangles (IZhO11_triangle) C++14
0 / 100
 106 ms 9416 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2e5 + 10;

int N;
int x[MAX], y[MAX];
map<int, int> coorX, coorY;

void solve(){
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> x[i] >> y[i];
        coorX[x[i]]++;
        coorY[y[i]]++;
    }
    ll ans = 0;
    for(int i = 1; i <= N; i++){
        ans += 1LL * (coorX[x[i]] - 1) * (coorY[y[i]] - 1);
    }

    cout << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("btower.inp","r",stdin);
//     freopen("btower.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 1116 KB Output is correct
13 Correct 4 ms 976 KB Output is correct
14 Correct 8 ms 1576 KB Output is correct
15 Correct 87 ms 6216 KB Output is correct
16 Correct 98 ms 6484 KB Output is correct
17 Correct 89 ms 6260 KB Output is correct
18 Correct 90 ms 6264 KB Output is correct
19 Incorrect 106 ms 9416 KB Output isn't correct
20 Halted 0 ms 0 KB -