QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#141545#5251. ConstellationsPhantomThreshold#RE 4881ms128716kbC++202.6kb2023-08-17 16:15:342023-08-17 16:15:38

Judging History

你现在查看的是最新测评结果

  • [2023-08-17 16:15:38]
  • 评测
  • 测评结果:RE
  • 用时:4881ms
  • 内存:128716kb
  • [2023-08-17 16:15:34]
  • 提交

answer

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

typedef long long ll;
struct frac{
	ll p,q;
	inline frac(){p=0;q=1;}
	inline frac(ll x){p=x;q=1;}
	inline frac(ll x,ll y){ll d=__gcd(x,y);p=x/d;q=y/d;if (q<0) p=-p,q=-q;}
	frac operator + (const frac &x){return frac(p*x.q+q*x.p,q*x.q);}
	frac operator - (const frac &x){return frac(p*x.q-q*x.p,q*x.q);}
	frac operator * (const frac &x){return frac(p*x.p,q*x.q);}
	frac operator / (const frac &x){return frac(p*x.q,q*x.p);}
	bool operator < (const frac &x)const{return p*x.q<q*x.p;}
	bool operator == (const frac &x)const{return p*x.q==q*x.p;}
	bool operator > (const frac &x)const{return p*x.q>q*x.p;}
	void print(){
		cout << p << "/" << q;	
	}
};
struct point{
	frac x,y;
	point operator + (const point &k){return (point){x+k.x,y+k.y};}
	point operator - (const point &k){return (point){x-k.x,y-k.y};}
	point operator * (frac k){return (point){x*k,y*k};}
	point operator / (frac k){return (point){x/k,y/k};}
	frac abs2(){return x*x+y*y;}
	frac dis2(point k){return ((*this)-k).abs2();}
	void print(){
		cout << "(";
		x.print();
		cout << ",";
		y.print();
		cout << ") ";
	}
};

const int maxn=6000;

int n;
point a[maxn+50];
int sz[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++){
		int x,y;
		cin >> x >> y;
		a[i]=(point){frac(x),frac(y)};	
	}
	set<tuple<frac,int,int>> s;
	for (int i=1;i<=n;i++) sz[i]=1;
	int id=n;
	for (int i=1;i<=n;i++){
		for (int j=i+1;j<=n;j++){
			s.emplace(a[i].dis2(a[j]),i,j);	
		}
	}
	for (;;){
		if (s.empty()) break;
		
		auto tmp=*(s.begin());
		int x=get<1>(tmp);
		int y=get<2>(tmp);
		sz[++id]=sz[x]+sz[y];
		a[id]=(a[x]*sz[x]+a[y]*sz[y])/(sz[x]+sz[y]);
		
		for (int i=1;i<id;i++) if (sz[i]!=0){
			int l=i,r=x;
			if (l>r) swap(l,r);
			if (l==r) continue;
			auto it=s.find(make_tuple(a[l].dis2(a[r]),l,r));
			if (it!=s.end()) s.erase(it);
		}
		sz[x]=0;
		for (int i=1;i<id;i++) if (sz[i]!=0){
			int l=i,r=y;
			if (l>r) swap(l,r);
			if (l==r) continue;
			auto it=s.find(make_tuple(a[l].dis2(a[r]),l,r));
			if (it!=s.end()) s.erase(it);
		}
		sz[y]=0;
		
		for (int i=1;i<id;i++) if (sz[i]!=0){
			s.emplace(a[i].dis2(a[id]),i,id);
		}
	//	cout << "sz[id] : ";
		cout << sz[id] << "\n";
		/*
		cout << "id : " << id << endl;
		for (int i=1;i<=id;i++) a[i].print();
		cout << endl;
		for (int i=1;i<=id;i++) cout << sz[i] << " ";
		cout << endl;
		for (auto [x,i,j]:s){
			cout << "dis2,i,j : ";
			x.print();
			cout << " " << i << " " << j << endl;	
		}
		*/
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3688kb

input:

2
0 0
1 0

output:

2

result:

ok single line: '2'

Test #2:

score: 0
Accepted
time: 3520ms
memory: 128684kb

input:

2000
1000 -1000
1000 -999
1000 -998
1000 -997
1000 -996
1000 -995
1000 -994
1000 -993
1000 -992
1000 -991
1000 -990
1000 -989
1000 -988
1000 -987
1000 -986
1000 -985
1000 -984
1000 -983
1000 -982
1000 -981
1000 -980
1000 -979
1000 -978
1000 -977
1000 -976
1000 -975
1000 -974
1000 -973
1000 -972
1000...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #3:

score: 0
Accepted
time: 3508ms
memory: 128676kb

input:

2000
-1000 1000
-999 1000
-998 1000
-997 1000
-996 1000
-995 1000
-994 1000
-993 1000
-992 1000
-991 1000
-990 1000
-989 1000
-988 1000
-987 1000
-986 1000
-985 1000
-984 1000
-983 1000
-982 1000
-981 1000
-980 1000
-979 1000
-978 1000
-977 1000
-976 1000
-975 1000
-974 1000
-973 1000
-972 1000
-971...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #4:

score: 0
Accepted
time: 3494ms
memory: 128628kb

input:

2000
-1000 -1000
-999 -1000
-998 -1000
-997 -1000
-996 -1000
-995 -1000
-994 -1000
-993 -1000
-992 -1000
-991 -1000
-990 -1000
-989 -1000
-988 -1000
-987 -1000
-986 -1000
-985 -1000
-984 -1000
-983 -1000
-982 -1000
-981 -1000
-980 -1000
-979 -1000
-978 -1000
-977 -1000
-976 -1000
-975 -1000
-974 -10...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #5:

score: 0
Accepted
time: 3517ms
memory: 128620kb

input:

2000
-1000 -1000
-1000 -999
-1000 -998
-1000 -997
-1000 -996
-1000 -995
-1000 -994
-1000 -993
-1000 -992
-1000 -991
-1000 -990
-1000 -989
-1000 -988
-1000 -987
-1000 -986
-1000 -985
-1000 -984
-1000 -983
-1000 -982
-1000 -981
-1000 -980
-1000 -979
-1000 -978
-1000 -977
-1000 -976
-1000 -975
-1000 -9...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #6:

score: 0
Accepted
time: 4881ms
memory: 128636kb

input:

2000
1000 -250
1000 -249
1000 -248
1000 -247
1000 -246
1000 -245
1000 -244
1000 -243
1000 -242
1000 -241
1000 -240
1000 -239
1000 -238
1000 -237
1000 -236
1000 -235
1000 -234
1000 -233
1000 -232
1000 -231
1000 -230
1000 -229
1000 -228
1000 -227
1000 -226
1000 -225
1000 -224
1000 -223
1000 -222
1000 ...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #7:

score: 0
Accepted
time: 3387ms
memory: 128716kb

input:

2000
0 -1000
0 -999
0 -998
0 -997
0 -996
0 -995
0 -994
0 -993
0 -992
0 -991
0 -990
0 -989
0 -988
0 -987
0 -986
0 -985
0 -984
0 -983
0 -982
0 -981
0 -980
0 -979
0 -978
0 -977
0 -976
0 -975
0 -974
0 -973
0 -972
0 -971
0 -970
0 -969
0 -968
0 -967
0 -966
0 -965
0 -964
0 -963
0 -962
0 -961
0 -960
0 -959
...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #8:

score: -100
Runtime Error

input:

2000
-400 571
-725 636
-880 529
-657 372
-383 382
-746 888
-604 785
-497 557
-677 977
-562 917
-530 623
-636 535
-816 579
-633 428
-573 561
-496 479
-409 448
-570 379
-421 795
-827 865
-730 809
-423 984
-676 772
-398 816
-451 373
-756 777
-351 829
-954 345
-543 871
-595 521
-501 734
-378 769
-987 60...

output:


result: