Submission #3056530


Source Code Expand

Copy
/*input
12
0 0
0 10
0 20
10 0
10 10
10 20
20 0
20 10
20 20
30 0
30 10
30 20
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#ifdef leowang
#define debug(...) do{\
	fprintf(stderr,"%s - %d : (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
	_DO(__VA_ARGS__);\
}while(0)
template<typename I> void _DO(I&&x){cerr<<x<<endl;}
template<typename I,typename...T> void _DO(I&&x,T&&...tail){cerr<<x<<", ";_DO(tail...);}
#else
#define debug(...)
#endif
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
	out<<'('<<P.F<<','<<P.S<<')';
	return out;
}
//}}}
const ll maxn=100005;
const ll maxlg=__lg(maxn)+2;
const ll INF64=8000000000000000000LL;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const double PI=acos(-1);
//const ll p=880301;
//const ll P=31;

ll mypow(ll a,ll b){
	ll res=1LL;
	while(b){
		if(b&1) res=res*a%MOD;
		a=a*a%MOD;
		b>>=1;
	}
	return res;
}

pll a[maxn];
ll x[maxn],y[maxn];
map<pll,int> mp;

vector<pll> upp,low;

int main()
{
	int n;
	cin>>n;
	REP(i,n) cin>>a[i].F>>a[i].S;
	REP(i,n) mp[a[i]]=i+1;
	sort(a,a+n);

	REP(i,n) x[i]=a[i].F,y[i]=a[i].S;

	for(int i=1;i<n-1;i++){
		if((x[0]-x[i])*(y[n-1]-y[i])>=(x[n-1]-x[i])*(y[0]-y[i])) upp.pb(a[i]);
		else low.pb(a[i]);
	}
	cout<<mp[a[0]]<<'\n';
	for(pll i:upp) cout<<mp[i]<<'\n';
	cout<<mp[a[n-1]]<<'\n';
	while(SZ(low)){
		cout<<mp[low.back()]<<'\n';
		low.pop_back();
	}
	return 0;
}








Submission Info

Submission Time
Task B - Jumps
User iloveUtaha
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2146 Byte
Status IE