Submission #595224

---

Source Code Expand

#include<map>
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(s...) fprintf(stderr, s)

template<class T> inline void amin(T &a, const T &b) { if (b<a) a=b; }
template<class T> inline void amax(T &a, const T &b) { if (a<b) a=b; }

int N;
map<pair<LL, LL>, int>mp;

int main() {
    scanf("%d", &N);
    REP (i, N) {
	int x, y;
	scanf("%d%d", &x, &y);
	mp[make_pair(x, y)] = i;
    }

    EACH (e, mp) EACH (f, mp) {
	if (e == f) continue;
	pair<int, int> ep = e->first;
	pair<int, int> fp = f->first;
	LL dx = fp.first - ep.first;
	LL dy = fp.second - ep.second;
	LL x[] = { ep.first - dy, fp.first - dy };
	LL y[] = { ep.second + dx, fp.second + dx };

	VI v;
	REP (i, 2) {
	    if (mp.count(make_pair(x[i], y[i]))) v.push_back(mp[make_pair(x[i], y[i])]);
	}
	if (v.size() == 2u) {
	    v.push_back(e->second);
	    v.push_back(f->second);

	    puts("4");
	    sort(v.begin(), v.end());
	    REP (i, 4) {
		printf("%d\n", v[i]+1);
	    }
	    return 0;
	}
    }

    puts("0");
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:27:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result