QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#755191 | #9623. 合成大西瓜 | Yori# | WA | 0ms | 3592kb | C++20 | 834b | 2024-11-16 16:39:42 | 2024-11-16 16:39:42 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
typedef pair<int, int> PII;
const int N = 2e5+7;
int n, m, k;
int a[N];
void sovle()
{
cin>>n>>m;
map<int,int>min1,v;
for(int i=1;i<=n;i++) cin>>a[i],min1[i]=2e12;
for(int i=1;i<=m;i++){
int x,y;
cin>>x>>y;
v[x]++;
v[y]++;
min1[x]=min(min1[x],a[y]);
min1[y]=min(min1[y],a[x]);
}
int max1=0;
for(int i=1;i<=n;i++){
if(v[i]%2==0) max1=max(max1,max(min1[i],a[i]));
}
if(n==1) cout<<a[1];
else cout<<max1<<endl;
}
signed main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int ING = 1;
//cin>>ING;
while (ING--)
{
sovle();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 3576kb
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: 3560kb
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'