QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#878216 | #9623. 合成大西瓜 | galiyuu | WA | 1ms | 3840kb | C++23 | 1.0kb | 2025-02-01 14:11:05 | 2025-02-01 14:11:06 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;++i)
#define per(i,a,n) for(int i=n-1;i>=a;--i)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((ll)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x){return mrand()%x;}
const ll mod=998244353;
signed main() {
int n,m;
scanf("%d%d",&n,&m);
vi val(n+1),du(n+1);
rep(i,1,n+1) scanf("%d",&val[i]);
multiset<int> p[n+1];
rep(i,0,m) {
int u,v;
scanf("%d%d",&u,&v);
p[u].insert(val[v]);
p[v].insert(val[u]);
du[u]++,du[v]++;
}
if (n==1) {
printf("%d",val[1]);
return 0;
}
int ans=0;
rep(i,1,n+1) {
if (SZ(p[i])>=4) {
auto it1=p[i].rbegin();
auto it2=it1;
it2--;
ans=max(val[i],min(*it1,*it2));
}
}
printf("%d",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3840kb
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: -100
Wrong Answer
time: 1ms
memory: 3840kb
input:
5 7 1 5 3 1 4 3 5 1 3 5 1 1 4 5 4 2 4 3 2
output:
0
result:
wrong answer 1st lines differ - expected: '5', found: '0'