제출 #651270

#제출 시각아이디문제언어결과실행 시간메모리
651270dilaylay_dilaylaylay별들과 삼각형 (IZhO11_triangle)C++17
100 / 100
397 ms15608 KiB
#include <iostream>
#include <bits/stdc++.h>    
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
using namespace std;
 
#define int long long
#define ll long long
#define vi vector<long long>
#define pb push_back
#define sz(s) (int)s.size()
#define all(v) v.begin(), v.end()
#define show(a) cerr << #a <<" -> "<< a <<"\n"
#define pp pair<int,int>
#define FF first
#define SS second
#define endl "\n"
 
const int N = 1e6 + 2, N3 = 1e3 + 6, inf = 1e9 + 7, LOG = 20;
map<char, int> md{{'N', 0}, {'E', 1}, {'S', 2}, {'W', 3}};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
string stepDir = "RDLU";
 
int n, x[N], y[N], ans	;
map<int, int> cnt, cnt2;
 
main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);	
	
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> x[i] >> y[i];
		cnt[x[i]]++;
		cnt2[y[i]]++;
	}
	
	for (int i = 1; i <= n; i++) {
		ans += (cnt[x[i]] - 1) * (cnt2[y[i]] - 1);
	}
	
	cout << ans;
		
	return 0;
}

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

triangle.cpp:13: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   13 | #pragma comment(linker, "/stack:200000000")
      | 
triangle.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main () {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...