QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#736344 | #9623. 合成大西瓜 | fsy_juruo | WA | 0ms | 3736kb | C++17 | 555b | 2024-11-12 10:14:05 | 2024-11-12 10:14:05 |
Judging History
answer
#include <bits/stdc++.h>
using LL = long long;
const int maxN = 1e5 + 10;
int n, m;
int a[maxN], deg[maxN];
int main() {
std::ios::sync_with_stdio(false); std::cin.tie(nullptr);
std::cin >> n >> m;
for(int i = 1; i <= n; i++) std::cin >> a[i];
for(int i = 1; i <= m; i++) {
int x, y; std::cin >> x >> y;
deg[x]++; deg[y]++;
}
int ans = 0;
for(int i = 1; i <= n; i++) {
if(deg[i] >= 2) ans = std::max(ans, a[i]);
}
if(n == 1) {
std::cout << a[1] << "\n";
} else {
std::cout << ans << "\n";
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
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: 3608kb
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: 3736kb
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: 3600kb
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: 3728kb
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: 3580kb
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: 3668kb
input:
3 2 1 2 3 3 1 2 1
output:
1
result:
wrong answer 1st lines differ - expected: '2', found: '1'