QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#743978#9573. Social Mediahuang123zsWA 9ms5792kbC++141.3kb2024-11-13 20:29:372024-11-13 20:29:38

Judging History

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

  • [2024-11-13 20:29:38]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:5792kb
  • [2024-11-13 20:29:37]
  • 提交

answer

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=2.1e5;
inline LL read(){
	LL x=0,ff=1;
	char c=getchar();
	while(!isdigit(c)&&c!='-') c=getchar();
	if(c=='-') c=getchar(),ff=-1;
	while(isdigit(c)) x=x*10ll+c-'0',c=getchar();
	return x*ff;
}
int n,m,K;
#define pii pair<int,int> 
#define mk make_pair
#define x first
#define y second
bool flg[N];
pii e[N];
int val[N];
map<pii,int> ha;
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	int casecnt=read();
	while(casecnt--){
		int ans=0,sum=0;
		ha.clear();
		K=read(),m=read(),n=read();
		for(int i=1;i<=n;++i)
			flg[i]=0,val[i]=0;
		for(int i=1;i<=K;++i)
			flg[read()]=1;
		for(int i=1;i<=m;++i){
			e[i].x=read(),e[i].y=read();
			if(e[i].x>e[i].y) swap(e[i].x,e[i].y);
			if(flg[e[i].x]&&flg[e[i].y]) ++sum;
			else if(flg[e[i].x]) val[e[i].y]++; 
			else if(flg[e[i].y]) val[e[i].x]++;
			else if(e[i].x==e[i].y) val[e[i].x]++;
			else ha[e[i]]++;
		}
		int maxn=0,cmaxn=0;
		for(int i=1;i<=n;++i)
			if(!flg[i]){
				if(val[i]>maxn)
					cmaxn=maxn,maxn=val[i];
				else if(val[i]>cmaxn)
					cmaxn=val[i];
			}
		ans=maxn+cmaxn;
		for(int i=1;i<=m;++i)
			if(!flg[e[i].x]&&!flg[e[i].y])
				ans=max(ans,val[e[i].x]+val[e[i].y]+ha[e[i]]);
		printf("%d\n",ans+sum);
	} 
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 9ms
memory: 3736kb

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
7
5
1
11
19
4
3
10
6
2
4
19
15
2
18
4
17
5
1
2
5
17
3
2
6
15
6
3
6
4
4
7
3
7
4
1
19
15
2
4
6
12
12
7
6
8
8
6
8
11
16
1
4
9
8
14
2
6
19
19
16
8
20
14
8
12
7
9
6
8
2
17
9
5
5
3
6
6
20
8
13
11
10
5
3
7
3
1
8
5
8
11
7
14
10
9
9
11
7
9
5
2
8
14
10
5
3
5
5
10
1
6
10
16
5
3
19
1
4
8
8
10
4
2
1
1...

result:

wrong answer 5th numbers differ - expected: '6', found: '7'