QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#837299 | #9623. 合成大西瓜 | jiangzhihui# | WA | 0ms | 3628kb | C++14 | 387b | 2024-12-29 21:47:56 | 2024-12-29 21:47:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N],n,deg[N],m;
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i];
while(m--){
int x,y;
cin>>x>>y;
deg[x]++;
deg[y]++;
}
int ans=0;
for(int i=1;i<=n;i++){
if(deg[i]%2==0)ans=max(ans,a[i]);
}
cout<<ans<<endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
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: 3628kb
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: 3552kb
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'