QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#89076#5251. ConstellationszhouhuanyiTL 9520ms191120kbC++111.9kb2023-03-18 19:00:332023-03-18 19:00:36

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-18 19:00:36]
  • 评测
  • 测评结果:TL
  • 用时:9520ms
  • 内存:191120kb
  • [2023-03-18 19:00:33]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<set>
#define N 2000
using namespace std;
int read()
{
    char c=0;
    int sum=0,f=1;
    while (c!='-'&&(c<'0'||c>'9')) c=getchar();
    if (c=='-') c=getchar(),f=-1;
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum*f;
}
struct points
{
    int x,y;
};
points st[N+1];
struct reads
{
    int x,y,l,r;
    long long a,b;
    bool operator < (const reads &t)const
    {
	if ((__int128)(a)*t.b!=(__int128)(b)*t.a) return (__int128)(a)*t.b<(__int128)(b)*t.a;
	else if (l!=t.l) return l<t.l;
	else if (r!=t.r) return r<t.r;
	else if (x!=t.x) return x<t.x;
	else return y<t.y;
    }
};
set<reads>s;
int n,length,rt[N+1],delta[N+1],sz[N+1];
long long dis[N+1][N+1];
int find(int x)
{
    if (rt[x]==x) return x;
    return rt[x]=find(rt[x]);
}
void unionn(int x,int y)
{
    for (int i=1;i<=n;++i)
	if (find(i)==i&&i!=x&&i!=y)
	    dis[y][i]=dis[i][y]=dis[x][i]+dis[y][i];
    delta[y]=++length,sz[y]+=sz[x],rt[x]=y;
    return;
}
void adder(int x,int y,int d)
{
    if (x>y) swap(x,y);
    if (d==1) s.insert((reads){x,y,min(delta[x],delta[y]),max(delta[x],delta[y]),dis[x][y],1ll*sz[x]*sz[y]});
    else s.erase((reads){x,y,min(delta[x],delta[y]),max(delta[x],delta[y]),dis[x][y],1ll*sz[x]*sz[y]});
    return;
}
int main()
{
    int x,y;
    length=n=read();
    for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read(),delta[i]=rt[i]=i,sz[i]=1;
    for (int i=1;i<=n;++i)
	for (int j=i+1;j<=n;++j)
	    dis[i][j]=dis[j][i]=(st[i].x-st[j].x)*(st[i].x-st[j].x)+(st[i].y-st[j].y)*(st[i].y-st[j].y),adder(i,j,1);
    for (int i=1;i<=n-1;++i)
    {
	x=(*s.begin()).x,y=(*s.begin()).y;
	for (int j=1;j<=n;++j)
	    if (find(j)==j&&j!=x&&j!=y)
		adder(x,j,-1),adder(y,j,-1);
	adder(x,y,-1),unionn(x,y);
	for (int j=1;j<=n;++j)
	    if (find(j)==j&&j!=y)
		adder(y,j,1);
	printf("%d\n",sz[y]);
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 2ms
memory: 3468kb

input:

2
0 0
1 0

output:

2

result:

ok single line: '2'

Test #2:

score: 0
Accepted
time: 4393ms
memory: 191012kb

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: 4346ms
memory: 191120kb

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: 4331ms
memory: 190896kb

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: 4409ms
memory: 191008kb

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: 6137ms
memory: 191004kb

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: 4575ms
memory: 190960kb

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: 0
Accepted
time: 9474ms
memory: 190976kb

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:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
...

result:

ok 1999 lines

Test #9:

score: 0
Accepted
time: 9411ms
memory: 190952kb

input:

2000
-946 966
-655 760
-539 413
-857 715
-668 993
-543 399
-724 415
-584 464
-364 541
-518 756
-966 790
-648 616
-654 419
-842 544
-714 482
-636 984
-904 343
-559 925
-440 494
-636 780
-695 494
-585 465
-487 396
-683 886
-949 959
-668 518
-780 583
-854 612
-786 601
-527 758
-444 563
-994 840
-575 49...

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
3
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
3
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
3
2
2
2
...

result:

ok 1999 lines

Test #10:

score: 0
Accepted
time: 9510ms
memory: 190980kb

input:

2000
-707 382
-500 486
-927 357
-972 984
-738 591
-535 766
-610 603
-582 908
-923 676
-689 828
-940 783
-502 728
-971 384
-873 909
-824 412
-532 805
-715 448
-972 748
-423 975
-355 915
-943 453
-740 998
-776 457
-395 764
-805 337
-650 520
-656 612
-1000 841
-758 423
-414 762
-443 674
-666 469
-814 6...

output:

2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #11:

score: 0
Accepted
time: 9489ms
memory: 190952kb

input:

2000
0 0
0 -1
1 -1
-1 1
-1 2
1 -2
3 0
1 -4
3 -3
-2 -4
-1 5
5 3
3 -6
4 6
-6 -5
4 -7
-2 9
1 -9
7 7
4 10
7 9
5 10
6 11
-5 12
-13 4
-5 13
14 2
10 11
-6 14
16 -1
11 -12
-14 -9
-14 11
15 11
-16 9
6 18
0 20
13 -15
9 -19
-10 -19
-21 8
-4 -22
-23 0
16 17
12 -21
-22 12
4 25
-14 -21
-7 -25
-3 -27
-27 1
23 16
1...

output:

2
2
2
2
2
2
2
2
2
2
2
2
4
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
5
2
2
2
2
2
2
2
2
2
2
2
2
2
7
5
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
9
3
2
2
2
2
2
2
3
3
3
6
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
8
2
2
2
2
2
2
2
2
2
3
3
4
4
2
2
2
2
11
3
3
2
2
2
2
2
2
4
2
2
2
2
2
2
2
2
2...

result:

ok 1999 lines

Test #12:

score: 0
Accepted
time: 9520ms
memory: 190976kb

input:

2000
0 0
-1 0
1 -1
0 -2
-1 -2
1 3
-3 1
3 2
-4 -1
-2 -4
4 4
-5 -3
-6 3
3 6
6 5
-7 4
-9 -2
8 5
3 -9
3 -10
11 0
8 -9
-6 -11
11 -7
6 12
-7 -12
0 -14
14 -5
-15 -1
-4 -15
-2 -16
-13 11
-15 -9
8 16
-18 -6
18 5
-16 12
-9 18
-1 -21
-15 -15
4 -22
-22 4
7 -22
19 -14
16 -18
15 19
-5 25
2 26
-1 26
-7 -26
23 -16
...

output:

2
2
2
2
2
2
2
2
3
2
2
2
2
2
2
5
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
4
3
3
2
2
2
2
2
2
7
2
2
2
2
2
2
2
2
2
2
2
2
2
9
2
2
2
2
2
2
2
2
2
6
2
3
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
4
2
2
2
2
2
3
3
2
2
2
2
2
2
2
2
2
5
2
2
2
2
2
2
3
2
2
2
2
2
2
2
2
2
2
3
4
2
2
3
3
3
3
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok 1999 lines

Test #13:

score: -100
Time Limit Exceeded

input:

2000
44 -748
385 448
-556 196
-569 -152
25 178
-865 609
644 -339
780 -558
429 676
469 712
876 987
-21 705
-742 679
375 970
-884 186
158 -340
-665 -673
153 484
-662 155
879 -724
-490 -785
-273 641
318 557
377 -706
260 695
-657 -926
-561 -315
861 -328
836 253
432 -505
-229 832
-774 -194
866 -951
171 6...

output:


result: