Submission #332123

#	Time	Username	Problem	Language	Result	Execution time	Memory
332123		Valera_Grinenko	Star triangles (IZhO11_triangle)	C++17	100 / 100	519 ms	32052 KiB

triangle

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int main() {

  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  int n = 0;

  cin >> n;

  ll ans = 0;

  map<int, ll> amx, amy;

  map<pair<int, int>, ll> amp;

  vector<pair<int, int> > p(n);

  for(auto& x : p) cin >> x.fi >> x.se;

  make_unique(p);

  for(auto& x : p) {
    amx[x.fi]++;
    amy[x.se]++;
    amp[x]++;
  }

  for(auto& x : p)
    ans += (amx[x.fi] - 1ll) * (amy[x.se] - 1ll);

  cout << ans;

  return 0;
}
/*

*/

Compilation message (stderr)

triangle.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      |

• Subtask 1: 100 / 100