QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #738661 | #9623. 合成大西瓜 | xiaoyilang# | WA | 0ms | 3656kb | C++20 | 556b | 2024-11-12 19:39:58 | 2024-11-12 19:39:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,du[N],a[N],p[N],q[N];
int main(){
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=m;i++){
int u,v;
cin>>u>>v;
du[u]++;
du[v]++;
if(a[v]>=p[u]){
q[u]=p[u];
p[u]=a[v];
}
if(a[u]>=p[v]){
q[v]=p[v];
p[v]=a[u];
}
}
int ans=0;
for(int i=1;i<=n;i++){
if(du[i]%2==0) ans=max(ans,max(a[i],q[i]));
}
cout<<ans;
return 0;
}
/*
7 7
1 1 2 3 1 2 1
1 2
2 3
1 3
2 4
2 5
5 6
5 7
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3656kb
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: 0ms
memory: 3540kb
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: -100
Wrong Answer
time: 0ms
memory: 3656kb
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:
3
result:
wrong answer 1st lines differ - expected: '6', found: '3'