QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #742555 | #9623. 合成大西瓜 | howardyang# | WA | 1ms | 9092kb | C++14 | 699b | 2024-11-13 16:48:00 | 2024-11-13 16:48:03 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int ans,n,m,a[100005],in[100005],x[100005],y[100005];
struct edge{int to,next;
}e[100005];
priority_queue<int>q[100005];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i)scanf("%d",&a[i]);
for(int i=1;i<=m;++i)
{
scanf("%d%d",&x[i],&y[i]);
in[x[i]]++;in[y[i]]++;
}
for(int i=1;i<=n;++i)if(in[i]!=1)ans=max(ans,a[i]);
for(int i=1;i<=m;++i)
{
if(x[i]==1)q[y[i]].push(a[x[i]]);
}
for(int i=1;i<=n;++i)
{
if(q[i].size()>=2)
{
int res=1061109567;
res=min(res,q[i].top());q[i].pop();
res=min(res,q[i].top());q[i].pop();
res=max(res,a[i]);
ans=max(ans,res);
}
}
printf("%d\n",ans);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 8444kb
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: 7968kb
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: 7232kb
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: 7720kb
input:
3 2 2 2 2 2 3 1 3
output:
2
result:
ok single line: '2'
Test #5:
score: 0
Accepted
time: 0ms
memory: 9092kb
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: 0ms
memory: 8096kb
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: -100
Wrong Answer
time: 0ms
memory: 7440kb
input:
3 2 1 2 3 3 1 2 1
output:
1
result:
wrong answer 1st lines differ - expected: '2', found: '1'