oj.uz

Submission #530921

# Submission time Handle Problem Language Result Execution time Memory
530921 2022-02-27T06:09:39 Z ohohorz Star triangles (IZhO11_triangle) C++14
0 / 100
 239 ms 20400 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define mp make_pair
#define pb push_back


const int N = 1e5 + 5;
const int INF = 1e18;
int x[N], y[N];
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    int n;
    cin>>n;    
    int ans = 0;
    for(int i = 1;i <= n;i++){
        cin >> x[i] >> y[i];
    }
    set< pii> se;

    map<int,int> cntx, cnty;
    map<pii, int> lol;
    for(int i= 1;i <= n;i++){
        cntx[x[i]] ++;
        cnty[y[i]] ++;
        lol[mp(x[i], y[i])] ++;
    }



    for(int i = 1;i <= n;i++){
        // if(se.count(mp(x[i], y[i]))) continue;
        int a = x[i], b = y[i];
        
        // (a, b2)
        // (a, b)   (a2, b)

        // find number of points such that x = a
        // find number of points such that y = b
        ans += ((cntx[a] - 1) * (cnty[b] - 1));
        se.insert(mp(a, b));
    }
    cout <<ans<<"\n";

}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 11 ms 2436 KB Output is correct
13 Correct 10 ms 2516 KB Output is correct
14 Correct 15 ms 2988 KB Output is correct
15 Correct 239 ms 20400 KB Output is correct
16 Runtime error 31 ms 5964 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -