QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#751747#9573. Social Mediawhileone27WA 28ms9816kbC++141.1kb2024-11-15 20:27:312024-11-15 20:27:31

Judging History

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

  • [2024-11-15 20:27:31]
  • 评测
  • 测评结果:WA
  • 用时:28ms
  • 内存:9816kb
  • [2024-11-15 20:27:31]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define mk make_pair
const int N=5e6+5;
int T,n,m,k,tong[N];
int bb[N],tx[N],ty[N],ans,anss;
map<pair<int,int>,int>mp;
signed main(){
	ios::sync_with_stdio(0);
	cin>>T;
	while(T--){
		cin>>n>>m>>k;
		mp.clear();
		int x,y;
		ans=0;
		for(int i=1;i<=k;++i)bb[i]=tong[i]=0;
		for(int i=1;i<=n;++i)cin>>x,bb[x]=1;
		for(int i=1;i<=m;++i){
			cin>>x>>y;
			++mp[mk(min(x,y),max(x,y))];
			tx[i]=x,ty[i]=y;
			if(bb[x]&&bb[y])++ans;
			if(bb[x]&&!bb[y])++tong[y];
			if(bb[y]&&!bb[x])++tong[x];
			if(!bb[x]&&x==y)++tong[x];
		}
		if(n>=k-2){
			cout<<m<<'\n';
			continue;
		}
		int maxx=0,cmax=0;//cout<<ans<<"CNMC\n";
		for(int i=1;i<=k;++i){
			if(tong[i]>maxx)cmax=maxx,maxx=tong[i];
			else cmax=max(cmax,tong[i]);
//			cout<<tong[i]<<"CNM\n";
		}
		anss=maxx+cmax;
		for(int i=1;i<=m;++i)
		if(tx[i]!=ty[i]){
			anss=max(anss,mp[mk(min(tx[i],ty[i]),max(tx[i],ty[y]))]+tong[tx[i]]+tong[ty[i]]);
//			cout<<anss<<' '<<tx[i]<<" "<<ty[i]<<" "<<tong[tx[i]]<<" "<<tong[ty[i]]<<" "<<mp[mk(tx[i],ty[i])]<<"FDSJKLK\n";
		}
		cout<<anss+ans<<'\n';
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

5
4 12 7
5 7 3 6
3 6
2 2
1 4
2 4
1 3
7 6
4 1
5 4
1 1
1 1
2 1
3 7
2 7 6
2 4
1 2
3 2
2 5
5 4
2 6
4 6
2 6
1 1 2
1
1 2
2 1 2
1 2
1 2
2 1 100
24 11
11 24

output:

9
5
1
1
1

result:

ok 5 number(s): "9 5 1 1 1"

Test #2:

score: -100
Wrong Answer
time: 28ms
memory: 9816kb

input:

10000
19 12 20
8 12 1 5 11 7 17 13 19 6 3 9 10 15 14 20 4 18 16
4 11
7 1
8 4
16 19
1 13
15 2
16 2
8 7
3 15
11 13
5 20
18 14
17 14 20
2 9 1 12 8 11 10 17 18 16 3 15 5 14 20 13 7
15 10
3 2
5 16
7 8
6 1
6 4
18 16
1 8
4 1
20 6
6 9
4 15
7 5
14 9
1 3 18
9
15 18
17 15
11 14
7 19 7
3 1 2 5 6 4 7
5 1
4 5
3 1...

output:

12
14
1
19
6
5
1
11
19
4
3
10
5
1
4
19
15
2
18
4
17
5
1
2
5
17
3
2
7
15
6
3
6
4
4
7
3
7
4
1
16
15
2
3
6
12
12
7
6
8
8
7
8
11
16
0
4
9
8
14
2
6
19
19
16
7
20
14
8
12
6
9
6
8
2
17
9
5
5
3
6
8
20
8
13
11
10
5
3
6
3
0
8
5
8
11
7
14
10
9
9
11
7
9
5
2
7
14
10
5
3
5
5
10
2
7
9
16
5
2
19
2
3
8
8
10
4
3
2
15...

result:

wrong answer 13th numbers differ - expected: '4', found: '5'