oj.uz

Submission #1010238

# Submission time Handle Problem Language Result Execution time Memory
1010238 2024-06-28T14:09:59 Z ByeWorld Star triangles (IZhO11_triangle) C++14
100 / 100
 407 ms 15604 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 3e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};

int n;
int x[MAXN], y[MAXN];
map <int, int> p, q;

signed main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> x[i] >> y[i];
        p[x[i]]++; q[y[i]]++;
    }
    int ans = 0;
    for(int i=1; i<=n; i++){
        ans += (p[x[i]]-1) * (q[y[i]]-1);
    }
    cout << ans << '\n';
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2564 KB Output is correct
12 Correct 9 ms 3160 KB Output is correct
13 Correct 8 ms 3164 KB Output is correct
14 Correct 12 ms 3676 KB Output is correct
15 Correct 132 ms 10580 KB Output is correct
16 Correct 148 ms 10764 KB Output is correct
17 Correct 130 ms 10576 KB Output is correct
18 Correct 132 ms 10576 KB Output is correct
19 Correct 362 ms 14844 KB Output is correct
20 Correct 271 ms 13080 KB Output is correct
21 Correct 387 ms 15604 KB Output is correct
22 Correct 407 ms 15576 KB Output is correct