oj.uz

답안 #896052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896052 2023-12-31T14:35:14 Z thunopro 별들과 삼각형 (IZhO11_triangle) C++14
100 / 100
 618 ms 42844 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define ll long long 
#define maxn 200009 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1  

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<ll> vl ; 
typedef vector<pii> vii ; 
 
void add ( int &a , int b ) 
{
	a += b ;
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n ; 
map <int,int> mp_x , mp_y ; 
map <ll,int> mp ; 

ll get_hash ( int x , int y ) 
{
	return 1ll*x*INF+y+1ll*mod*mod ; 
}
int main () 
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0) ; 
//	rf () ; 
	cin >> n ; 
	set <pii> S ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		int x , y ; cin >> x >> y ; 
		mp_x [x] ++ , mp_y [y] ++ ; 
		S.insert ({x,y}) ; 
		mp [get_hash(x,y)] ++ ; 
	}
	
	ll res = 0 ; 
	for ( auto x : S ) 
	{
		res += 1ll*(mp_x[x.fi]-mp[get_hash(x.fi,x.se)])*(mp_y[x.se]-mp[get_hash(x.fi,x.se)]) ; 
	}
	cout << res ; 
}

// range , error , check special , ... 
// find key , find key 
//'-std=c++11' stay hard 
// there is no tomorrow

Compilation message

triangle.cpp: In function 'void rf()':
triangle.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 9 ms 2024 KB Output is correct
13 Correct 9 ms 2392 KB Output is correct
14 Correct 12 ms 2512 KB Output is correct
15 Correct 161 ms 16644 KB Output is correct
16 Correct 169 ms 17596 KB Output is correct
17 Correct 143 ms 16492 KB Output is correct
18 Correct 156 ms 16296 KB Output is correct
19 Correct 555 ms 39940 KB Output is correct
20 Correct 408 ms 29864 KB Output is correct
21 Correct 614 ms 42844 KB Output is correct
22 Correct 618 ms 42716 KB Output is correct