QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#745474#9623. 合成大西瓜yhdddWA 1ms8044kbC++141.2kb2024-11-14 10:14:032024-11-14 10:14:03

Judging History

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

  • [2024-11-14 10:14:03]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:8044kb
  • [2024-11-14 10:14:03]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
	return x*f;
}
bool Mbe;

int n,m,a[maxn],ans;
int mx[maxn],se[maxn],to[maxn];
void work(){
	n=read();m=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=m;i++){
		int u=read(),v=read();
		if(mx[u]<a[v])se[u]=mx[u],mx[u]=a[v];
		else if(se[u]<a[v])se[u]=a[v];
		if(mx[v]<a[u])se[v]=mx[v],mx[v]=a[u];
		else if(se[v]<a[u])se[v]=a[u];
		to[u]=v,to[v]=u;
	}
	if(n==1)ans=a[1];
	for(int i=1;i<=n;i++){
		if(se[i])ans=max(ans,a[i]);
		else{
			if(se[to[i]]==a[i])ans=max(ans,a[i]);
		}
	}
	printf("%lld\n",ans);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=1;
	while(T--)work();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

7 9
1 4 1 3 3 6 7
5 4
3 6
3 4
2 3
5 2
2 6
6 7
5 1
4 6

output:

6

result:

ok single line: '6'

Test #2:

score: 0
Accepted
time: 1ms
memory: 6004kb

input:

5 7
1 5 3 1 4
3 5
1 3
5 1
1 4
5 4
2 4
3 2

output:

5

result:

ok single line: '5'

Test #3:

score: 0
Accepted
time: 1ms
memory: 7988kb

input:

7 7
2 4 2 3 3 6 7
5 1
2 6
5 3
4 6
1 6
1 2
2 7

output:

6

result:

ok single line: '6'

Test #4:

score: 0
Accepted
time: 1ms
memory: 5812kb

input:

3 2
2 2 2
2 3
1 3

output:

2

result:

ok single line: '2'

Test #5:

score: 0
Accepted
time: 1ms
memory: 5860kb

input:

5 5
3 1 2 4 5
3 2
2 4
3 5
5 1
2 5

output:

5

result:

ok single line: '5'

Test #6:

score: 0
Accepted
time: 1ms
memory: 7860kb

input:

7 9
3 2 3 5 2 6 7
7 4
5 4
5 6
1 7
1 6
2 3
7 6
6 4
4 2

output:

7

result:

ok single line: '7'

Test #7:

score: 0
Accepted
time: 0ms
memory: 8044kb

input:

3 2
1 2 3
3 1
2 1

output:

2

result:

ok single line: '2'

Test #8:

score: 0
Accepted
time: 0ms
memory: 5800kb

input:

9 9
6 1 1 1 3 7 1 8 9
9 8
6 7
2 7
5 6
7 9
5 1
7 3
1 6
1 4

output:

9

result:

ok single line: '9'

Test #9:

score: 0
Accepted
time: 0ms
memory: 7844kb

input:

9 10
7 7 4 2 2 6 6 8 9
9 6
4 6
1 2
4 3
5 6
7 5
6 8
7 4
1 7
1 9

output:

9

result:

ok single line: '9'

Test #10:

score: 0
Accepted
time: 1ms
memory: 5812kb

input:

5 6
3 2 1 1 2
3 5
2 4
3 1
2 3
4 1
1 5

output:

3

result:

ok single line: '3'

Test #11:

score: 0
Accepted
time: 1ms
memory: 7848kb

input:

7 7
4 4 5 1 1 6 7
2 1
1 7
5 4
2 4
1 3
5 6
7 4

output:

7

result:

ok single line: '7'

Test #12:

score: -100
Wrong Answer
time: 1ms
memory: 5816kb

input:

17 17
2 15 7 13 8 6 12 8 10 13 15 5 7 8 13 16 17
5 9
6 1
7 9
6 10
16 15
3 6
14 3
11 6
12 15
8 4
9 10
7 6
15 6
2 10
8 10
13 6
17 7

output:

13

result:

wrong answer 1st lines differ - expected: '16', found: '13'