Submission #688635

#	Time	Username	Problem	Language	Result	Execution time	Memory
688635		YENGOYAN	Star triangles (IZhO11_triangle)	C++17	100 / 100	270 ms	13372 KiB

triangle

/*
        //\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\
        \\                                    //
        //  271828___182845__904523__53602__  \\
        \\  87___47____13______52____66__24_  //
        //  97___75____72______47____09___36  \\
        \\  999595_____74______96____69___67  //
        //  62___77____24______07____66__30_  \\
        \\  35___35____47______59____45713__  //
        //                                    \\
        \\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\//
                                                    */

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>

using namespace std;
using ll = long long;
const int N = 3e5 + 5;
const ll mod = 1e9 + 7, inf = 1e18;

void solve() {
    int n; cin >> n;
    map<int, int> x, y;
    vector<pair<int, int>> vp;
    for (int i = 0; i < n; ++i) {
        int xx, yy; cin >> xx >> yy;
        vp.push_back({ xx, yy });
        ++x[xx], ++y[yy];
    }
    ll ans = 0;
    for (int i = 0; i < vp.size(); ++i) {
        ans += (x[vp[i].first] - 1) * (y[vp[i].second] - 1);
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    //int t; cin >> t;
    //while (t--)	
    solve();
}

Compilation message (stderr)

triangle.cpp: In function 'void solve()':
triangle.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for (int i = 0; i < vp.size(); ++i) {
      |                     ~~^~~~~~~~~~~

• Subtask 1: 100 / 100