제출 #341595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341595		Binyomin	Star triangles (IZhO11_triangle)	C++14	0 / 100	2058 ms	38520 KiB

triangle

# include <bits/stdc++.h>
# define fi first
# define se second
# define int long long

using namespace std ;


int32_t main() {
    //freopen("triangles.in", "r", stdin ) ;
    //freopen("triangles.out", "w", stdout ) ;
    int n ; cin >> n ;
    map < int, int > row, col, trow, tcol ;
    vector < pair < int, int > > vc ;
    map < pair < int, int >, int > mp ;
    for( int i = 1 ; i <= n ; i ++ ) {
        int x, y ; cin >> x >> y ;
        row[x] ++ ;
        col[y] ++ ;
        vc.push_back({x, y}) ;
    }
    int ans = 0 ;
    for( int i = 0 ; i < n ; i ++ ) {
        int x = vc[i].fi, y = vc[i].se ;
        tcol[y] += row[x] - 1 ;
        trow[x] += col[y] - 1 ;
        mp[{x,y}] = row[x] + col[y] - 2 ;
    }
    for( int i = 0 ; i < n ; i ++ ) {
        int x = vc[i].fi, y = vc[i].se ;
        ans += trow[x] + tcol[y] - mp[{x,y}] ;
    }
    cout << ans / 2 << endl;
}

• Subtask 1: 0 / 100