Submission #526021

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long int64;

int main() {
    int n;
    int64 x, y;
    vector<int64> pts;
    map<int64, int> mp; 
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> x >> y;
//      cout << x << " " << y << endl;
        int64 p = ((x << 32) | (y & ((1L << 32) - 1)));
//      cout << p << endl;
        pts.push_back(p);
        mp[p] = i;
    }   
    vector<int> res;
    for(int i = 1; i < n; i++) {
        for(int j = i + 1; j <= n; j++) {
            int64 p1 = pts[i - 1], p2 = pts[j - 1]; 
            int64 x1 = p1 >> 32, y1 = p1 & ((1L << 32) - 1L), x2 = p2 >> 32, y2 = p2 & ((1L << 32) - 1L);
//          cout << x1 << ", " << y1 << " " << x2 << ", " << y2 << endl;
            if(x1 != x2 && y1 != y2) {
                int64 p3 = ((x1 << 32) | (y2 & ((1L << 32) - 1))), p4 = ((x2 << 32) | (y1 & ((1L << 32) - 1)));
                if(mp.count(p3) && mp.count(p4)) {
                    res.push_back(i);
                    res.push_back(j);
                    res.push_back(mp[p3]);
                    res.push_back(mp[p4]);
                    cout << "4" << endl;
                    sort(res.begin(), res.end());
                    for(int k = 0; k < 4; k++) {
                        cout << res[k] << endl;
                    }   
                    return 0;
                }   
            }   
        }   
    }   
    cout << "0" << endl;
    return 0;
}

Submission Info

Judge Result