oj.uz

Submission #91388

# Submission time Handle Problem Language Result Execution time Memory
91388 2018-12-27T10:02:53 Z SOIVIEONE Star triangles (IZhO11_triangle) C++17
100 / 100
 474 ms 26176 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>

#define INF 1000000021
#define MOD 1000000007
#define pb push_back
#define sqr(a) (a)*(a)
#define M(a, b) make_pair(a,b)
#define T(a, b, c) make_pair(a, make_pair(b, c))
#define F first
#define S second
#define all(x) (x.begin(), x.end())
#define deb(x) cerr << #x << " = " << x << '\n'
#define N 322222

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

const ld pi = 2 * acos(0.0);
template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;}
template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;}
template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;}

//int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

ll a[N], b[N];
map<ll, ll> x, y;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
//	freopen("triangles.in", "r", stdin);
//	freopen("triangles.out", "w", stdout);
	int n;
	cin >> n;
	for(int i = 1; i <= n; i ++)
	{
		ll xx, yy;
		cin >> xx >> yy;
		x[xx] ++;
		y[yy] ++;
		a[i] = xx;
		b[i] = yy;
	}
	ll ans = 0;
	for(int i = 1; i <= n; i ++)
		ans += ((x[a[i]]-1)*(y[b[i]]-1));
	cout << ans;




	





	getchar();
	getchar();
	return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 664 KB Output is correct
5 Correct 2 ms 664 KB Output is correct
6 Correct 2 ms 664 KB Output is correct
7 Correct 2 ms 664 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 2 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 2 ms 728 KB Output is correct
12 Correct 9 ms 1556 KB Output is correct
13 Correct 8 ms 1700 KB Output is correct
14 Correct 14 ms 2424 KB Output is correct
15 Correct 183 ms 8840 KB Output is correct
16 Correct 183 ms 11320 KB Output is correct
17 Correct 177 ms 13388 KB Output is correct
18 Correct 130 ms 15404 KB Output is correct
19 Correct 385 ms 24340 KB Output is correct
20 Correct 309 ms 24540 KB Output is correct
21 Correct 474 ms 26132 KB Output is correct
22 Correct 464 ms 26176 KB Output is correct