oj.uz

답안 #38952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38952 2018-01-08T11:42:45 Z Scayre 별들과 삼각형 (IZhO11_triangle) C++14
0 / 100
 0 ms 6080 KB 
//
// omae wa mou shindeiru.
//

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>

#define ll long long
#define ull unsigned ll
#define ioi exit(0);

#define f first
#define s second

#define inf (int)1e9 + 7

#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define mp make_pair

#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)

#define pb push_back
#define ppb pop_back

#define endl "\n"

#define in(x) insert(x)

#define sz(x) (int)x.size()

#define all(x) x.begin(),x.end()

#define pw2(x) (1<<x) //2^x

#define sqr(x) ((x) * 1ll * (x))

using namespace std;

const int N = (int)5e5 + 7, MOD = (int)1e9 + 7;

int n;

pair <int,int> a[N];

ll ans=0;

int main(){ 

	#ifdef IOI2019
		freopen ("in.txt", "r", stdin);
	#endif

	NFS

	cin >> n;
	if (n > 100) ioi
	for(int i=1;i<=n;i++){
		cin >> a[i].f >> a[i].s;
	}

	for(int i=1;i<=n;i++){
		int l=0,r=0;
		for(int j=1;j<=n;j++){
			if(i==j){
				continue;
			}
			if(a[i].f==a[j].f){
				l++;
			}
			if(a[i].s==a[j].s){
				r++;
			}
		}
		ans+=l*r;
	}

	cout << ans << endl;

	#ifdef IOI2019
		cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
	#endif

	ioi
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6080 KB Output is correct
2 Correct 0 ms 6080 KB Output is correct
3 Correct 0 ms 6080 KB Output is correct
4 Correct 0 ms 6080 KB Output is correct
5 Correct 0 ms 6080 KB Output is correct
6 Correct 0 ms 6080 KB Output is correct
7 Correct 0 ms 6080 KB Output is correct
8 Incorrect 0 ms 6080 KB Output isn't correct
9 Halted 0 ms 0 KB -