QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#770261 | #9623. 合成大西瓜 | Zgln | WA | 0ms | 3648kb | C++17 | 413b | 2024-11-21 21:17:11 | 2024-11-21 21:17:15 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int a[100005],b[100005]={0};
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int l,r;
for(int i=1;i<=m;i++){
cin>>l>>r;
b[l]++;
b[r]++;
}
int sum=0;
for(int i=1;i<=n;i++){
if(b[i]%2==0){
sum=max(sum,a[i]);
}
}
cout<<sum;
}
/*
7 7
1 1 2 3 1 2 1
1 2
2 3
1 3
2 4
2 5
5 6
5 7
1 0
1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
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: 3648kb
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: 3640kb
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'