제출 #524232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
524232		ezdp	별들과 삼각형 (IZhO11_triangle)	C++14	100 / 100	460 ms	13488 KiB

triangle

#pragma GCC target ("sse4")
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>

#define endl '\n'
#define pb push_back
#define fr first
#define sc second
#define ll long long int
#define ld long double
#define lsb(idx) idx&(-idx)
#define bin(x) bitset<32>(x).to_string()
#define all(A) A.begin(), A.end()
#define de(x) cout << #x << " = " << x << endl;

using namespace std;
using namespace __gnu_pbds;

template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using matrix = vector<vector<T>>;
/// find_by_order(x) -> x-th element in the set
/// order_of_key(x)  -> how many elements are less than x
/// insert(x)		 -> inserts x into the set

ll n, ans = 0;
vector<pair<int, int>> v;
map<int, int> mp_x, mp_y;

int main(){
	/// ios_base::sync_with_stdio(false); cin.tie(NULL);
	/// freopen("filename.in" , "r", stdin); 
	/// freopen("filename.out", "w", stdout);
	cin >> n;
	for(int i = 0; i < n; i ++){
		int x, y; cin >> x >> y;
		++ mp_x[x];
		++ mp_y[y];
		v.pb({x, y});
	}
	for(auto [x, y] : v){
		ans += (mp_x[x] - 1) * (mp_y[y] - 1);
	}
	cout << ans << endl;
}
/**

*/

컴파일 시 표준 에러 (stderr) 메시지

triangle.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
triangle.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
triangle.cpp: In function 'int main()':
triangle.cpp:44:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |  for(auto [x, y] : v){
      |           ^

• Subtask 1: 100 / 100