Submission #676199

#	Time	Username	Problem	Language	Result	Execution time	Memory
676199		Toxtaq	Star triangles (IZhO11_triangle)	C++17	0 / 100	2088 ms	3948 KiB

triangle

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<pair<int, int>>p(n);
    map<int, int>X, Y;
    for(int i = 0;i < n;++i){
        cin >> p[i].second >> p[i].first;
        X[p[i].second]++;
        Y[p[i].first]++;
    }
    sort(p.begin(), p.end());
    int result = 0;
    for(int i = 0;i < n;++i){
        if(Y[p[i].first] < 2)continue;
        Y[p[i].first]--;
        for(int j = i + 1;j < n;++j){
            if(p[i].first == p[j].first)result += X[p[i].second] + X[p[j].second] - 2;
        }
    }
    cout << result;
}

• Subtask 1: 0 / 100