Submission #85257

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
#include <stack>

#define f first
#define s second
#define mkp make_pair
#define pb push_back
#define FILL(a,b) memset(a,b,sizeof(a))
#define FOR(a,b,c) for(a=b;a<=c;a++)
#define VFOR(a,b) for(a=0;a<b.size();a++)
#define ll long long
#define INF (int)1000000000
#define LINF (ll)1e16
#define vi vector<int>

using namespace std;

class NUM
{ 
	public:
	int sag,sol,ust,alt;
	NUM() { sag=sol=ust=alt=0; }
}Arr[20005];

int N,M;
pair < pair < int , int >, int > P[20005],R;

int hesapla(int a,int b)
{
	int T=2;
	T+=abs(Arr[P[a].s].sag-Arr[P[b].s].sag)-1;
	T+=abs(Arr[P[a].s].sol-Arr[P[b].s].sol)-1;
	T+=abs(Arr[P[a].s].ust-Arr[P[b].s].ust)-1;
	T+=abs(Arr[P[a].s].alt-Arr[P[b].s].alt)-1;
	return T;
}

bool cmp( typeof(R) a, typeof(R) b){	return a.s < b.s; }

int main()
{
	int i,j;
	scanf(" %d",&N);
	FOR(i,1,N){
		scanf(" %d %d",&P[i].f.f,&P[i].f.s);
		P[i].s=i;
	}
	
	sort(P+1,P+N+1);
	FOR(i,1,N)
	{
		Arr[P[i].s].sol=i-1;
		Arr[P[i].s].sag=N-i;
	}
	
	sort(P+1,P+N+1,cmp);
	FOR(i,1,N)
	{
		Arr[P[i].s].alt=i-1;
		Arr[P[i].s].ust=N-i;
	}

	int mn=INF,k;
	pair < int ,int > ans;

	FOR(i,1,N)
		FOR(j,i+1,N)
		{
			k=hesapla(i,j);
			if(k < M) continue;
			if(k < mn)
			{
				mn=k;
				ans=mkp(i,j);
			}
		}
		
	cout << ans.f << " " << ans.s << endl;

	return 0;
}

Submission Info

Compile Error

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

Judge Result