这道题比较鬼畜
虽然说的确是有真经做法的我觉得随机化蛮正经的qwq
可以发现圆的半径是约等于
2–√∗106
2
∗
10
6
每次移动映射到坐标轴上最长的距离是
106
10
6
考虑一个贪心。我们每次忘靠近圆心的地方跳
这样的贪心显然是有问题的。
但是我们可以证明最终导致答案不在圆内的概率极低,出现的条件是极为苛刻的。
所以我们可以随机化初始数组然后进行贪心
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define ll long long
const ll INF = 1420000;
struct node{
ll x,y;
ll id;
ll ran;
}a[500100];
const double LIM = 1.0*CLOCKS_PER_SEC;
int n;
ll read()
{
ll sum = 0;char c = getchar();bool flag = true;
while(c < '0' || c > '9') {if(c == '-') flag = false;c = getchar();}
while(c >= '0' && c <= '9') sum = sum * 10 + c - 48,c = getchar();
if(flag) return sum;
else return -sum;
}
bool mycmp(node a,node b)
{
return a.ran < b.ran;
}
int ans[500100];
int main()
{
freopen("jump.in","r",stdin);
freopen("jump.out","w",stdout);
srand(time(0));
n = read();
ll x = 0,y = 0;
rep(i,1,n)
a[i].x = read(),
a[i].y = read(),
a[i].id = i;
while(1)
{
rep(i,1,n) a[i].ran = 1ll*rand()*rand();
sort(a+1,a+n+1,mycmp);
rep(i,1,n)
{
int xx = a[i].x,yy = a[i].y;
if( (x+xx)*(x+xx)+(y+yy)*(y+yy) < (x-xx)*(x-xx)+(y-yy)*(y-yy) ) x+=xx,y+=yy,ans[a[i].id]=1;
else x-=xx,y-=yy,ans[a[i].id] = -1;
}
if(x*x+y*y<=INF*INF) {
rep(i,1,n) printf("%d\n",ans[i]);
return 0;
}
}
return 0;
}