QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#747740 | #9623. 合成大西瓜 | cxq | WA | 0ms | 3652kb | C++20 | 1.2kb | 2024-11-14 18:03:49 | 2024-11-14 18:03:50 |
Judging History
answer
// Author: TrispdTit
// Date: 2024-11-14 17:47:50
//贪睡是一剂烈性毒品
#include <bits/stdc++.h>
#define endl '\n'
//#define int long long
#define ll long long
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<int> w(n + 1);
vector<vector<int>> adj(n + 1, vector<int>());
int fmn = 1e9;
for(int i = 1; i <= n; i++) {
cin >> w[i];
}
for(int i = 1, u, v; i <= m; i++) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i = 1; i <= n; i++) {
if(adj[i].size() <= 1) fmn = min(w[i], fmn);
}
vector<int> id(n + 1, 0);
iota(id.begin(), id.end(), 0);
sort(id.begin() + 1, id.end(), [&](int i, int j) {
return w[i] < w[j];
});
int res = 0;
for(int i = n; i >= 1; i--) {
if(adj[id[i]].size() >= 2) {
res = w[id[i]];
break;
}
}
if(fmn != 1e9) {
res = max(res, fmn);
}
cout << res << "\n";
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t = 1;
//cin >> t;
while(t--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
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: 3624kb
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: 0ms
memory: 3616kb
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: 0ms
memory: 3604kb
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: 3500kb
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: 3624kb
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: 0
Accepted
time: 0ms
memory: 3644kb
input:
3 2 1 2 3 3 1 2 1
output:
2
result:
ok single line: '2'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
9 9 6 1 1 1 3 7 1 8 9 9 8 6 7 2 7 5 6 7 9 5 1 7 3 1 6 1 4
output:
9
result:
ok single line: '9'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
9 10 7 7 4 2 2 6 6 8 9 9 6 4 6 1 2 4 3 5 6 7 5 6 8 7 4 1 7 1 9
output:
9
result:
ok single line: '9'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
5 6 3 2 1 1 2 3 5 2 4 3 1 2 3 4 1 1 5
output:
3
result:
ok single line: '3'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
7 7 4 4 5 1 1 6 7 2 1 1 7 5 4 2 4 1 3 5 6 7 4
output:
7
result:
ok single line: '7'
Test #12:
score: -100
Wrong Answer
time: 0ms
memory: 3620kb
input:
17 17 2 15 7 13 8 6 12 8 10 13 15 5 7 8 13 16 17 5 9 6 1 7 9 6 10 16 15 3 6 14 3 11 6 12 15 8 4 9 10 7 6 15 6 2 10 8 10 13 6 17 7
output:
13
result:
wrong answer 1st lines differ - expected: '16', found: '13'