我提交了如下代码,确实输出了星号。
![](https://cdn.luogu.com.cn/upload/image_hosting/rcia61wx.png)
~~如果我和lz大意了求别骂~~
```
#include<bits/stdc++.h>
using namespace std;
struct City{
int x;
int y;
}a[200010];
map<int,bool> p1;
map<int,bool> p2;
int main(){
// freopen("友好城市.in","r",stdin);
// freopen("友好城市.out","w",stdout);
int n;
cin>>n;
for(int i=1;i<=n;i++){
scanf("%d%d",&a[i].x,&a[i].y);
if(p1.find(a[i].x)!=p1.end()||p2.find(a[i].y)!=p2.end()){
cout<<"****";
return 0;
}
p1[a[i].x]=1;
p2[a[i].y]=1;
}
return 0;
}
```
by MeowScore @ 2021-11-12 16:27:06
@[mrsrz](/user/6813)
by 显微镜 @ 2021-11-12 16:32:48
~~会不会南北岸搞反了,一个猜想不一定对~~
by StarLbright40 @ 2021-11-12 17:12:20
但是无论先南还是先北都无法满足第一张图片我标的题目内容吧。@[星光0000](/user/128570)
by 显微镜 @ 2021-11-12 17:22:46
好像是诶,抱歉我鲁莽了)
不过后半句主语不明确,能不能理解为北岸的不同城市的友好城市不相同而南岸的城市没有限制(?
by StarLbright40 @ 2021-11-12 17:27:21
@[星光0000](/user/128570) 但是显然不满足`有且只有一个`
by MeowScore @ 2021-11-12 17:59:38
@[chen_zhe](/user/8457)
by 显微镜 @ 2021-11-12 19:21:25
@[显微镜](/user/33353) 还是没人管(
by MeowScore @ 2022-01-02 10:56:48
@[Liu_Kevin](/user/140360) 现在还没改
by Jason12 @ 2022-02-13 16:29:22
@[chen_zhe](/user/8457)
by Jason12 @ 2022-02-13 16:29:47