oj.uz

Submission #246393

# Submission time Handle Problem Language Result Execution time Memory
246393 2020-07-09T03:33:28 Z kevlee Star triangles (IZhO11_triangle) C++17
100 / 100
 385 ms 12280 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define flush fflush(stdout)
#define debug printf("Hello\n")
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
//priority_queue <int, vector <int>, greater <int> > pq;
int n, m, k, x[300005], y[300005], sum, cnt;
ll ans;
map<int, int> row, col;
int main () {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  FOR(i, 1, n) {
    cin >> x[i] >> y[i];
    row[x[i]]++;
    col[y[i]]++;
  }
  FOR(i, 1, n) {
    ans += 1LL * (row[x[i]] - 1) * (col[y[i]] - 1);
  }
  cout << ans << endl;
  return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 12 ms 1024 KB Output is correct
13 Correct 12 ms 1152 KB Output is correct
14 Correct 16 ms 1536 KB Output is correct
15 Correct 124 ms 6264 KB Output is correct
16 Correct 141 ms 6648 KB Output is correct
17 Correct 128 ms 6268 KB Output is correct
18 Correct 125 ms 6264 KB Output is correct
19 Correct 368 ms 11768 KB Output is correct
20 Correct 244 ms 9336 KB Output is correct
21 Correct 369 ms 12280 KB Output is correct
22 Correct 385 ms 12280 KB Output is correct