QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#788258 | #9623. 合成大西瓜 | masttf# | WA | 0ms | 3812kb | C++20 | 1.4kb | 2024-11-27 16:22:14 | 2024-11-27 16:22:14 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
#define dbg(x...) \
do { \
cout << #x << " -> "; \
err(x); \
} while (0)
void err() {
cout << endl << endl;
}
template<class T, class... Ts>
void err(T arg, Ts ... args) {
cout << fixed << setprecision(10) << arg << ' ';
err(args...);
}
void solve(){
int n, m; cin >> n >> m;
vector<vector<int>> g(n + 1);
vector<int> val(n + 1);
for(int i = 1; i <= n; i++) cin >> val[i];
for(int i = 1; i <= m; i++){
int u, v; cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
if(n == 1){
cout << val[1] << '\n';
return ;
}
for(int i = 1; i <= n; i++){
sort(g[i].begin(), g[i].end(), [&](int x, int y) -> bool{
return val[x] > val[y];
});
}
int ans = 0;
for(int i = 1; i <= n; i++){
if(g[i].size() >= 2){
ans = max(ans, val[i]);
}
}
// dbg(ans);
int res = n + 1;
for(int i = 1; i <= n; i++){
if(g[i].size() == 1){
res = min(res, val[i]);
}
}
if(res != n + 1)ans = max(ans, res);
// dbg(ans);
for(int i = 1; i <= n; i++){
if(g[i].size() >= 3){
ans = max(ans, val[g[i][1]]);
}
}
cout << ans << '\n';
return ;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1; // cin >> t;
while(t--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3492kb
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: 3492kb
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: 3556kb
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: 3552kb
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: 3648kb
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: 3492kb
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: 3552kb
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: 3812kb
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: 3556kb
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: 3500kb
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: 3776kb
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: 3652kb
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'