QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #749891 | #9623. 合成大西瓜 | CHROMIUM00 | WA | 0ms | 3716kb | C++17 | 7.9kb | 2024-11-15 11:10:40 | 2024-11-15 11:10:41 |
Judging History
answer
/* === INCLUDES === ---------------------------------------------------------- */
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/* === UTILITY === ----------------------------------------------------------- */
#ifdef _LOCAL_
#define SHOW(x) \
{ \
cerr << "[" #x "]: " << (x) << "\n"; \
}
#define SHOW_EACH(x) \
{ \
bool _head = true; \
cerr << "[" #x "]: {"; \
for (auto _iter : (x)) { \
if (_head) { \
_head = false; \
} else { \
cerr << ", "; \
} \
cerr << _iter; \
} \
cerr << "}" << "\n"; \
}
#define SHOW_RANGE(x, l, r) \
{ \
bool _head = true; \
cerr << "[" #x "]: {"; \
for (auto _iter = (l); _iter <= (r); ++_iter) { \
if (_head) { \
_head = false; \
} else { \
cerr << ", "; \
} \
cerr << (x)[_iter]; \
} \
cerr << "}" << "\n"; \
}
#else
#define SHOW(x)
#define SHOW_EACH(x)
#define SHOW_RANGE(x, l, r)
#endif // _LOCAL_
/* === MACROS === -------------------------------------------------------------*/
#define FASTIO \
ios::sync_with_stdio(false); \
cin.tie(0), cout.tie(0)
#define MULTICASE \
int _T; \
cin >> _T; \
while (_T--)
#define LL long long
#define IMAX 2147483647
#define LLMAX 9223372036854775807LL
#define endl "\n"
////////////////////////////////// ┏━━━━━━━━━┓ //////////////////////////////////
////////////////////////////////// ┣━╸ ┏━━━╸ ┃ //////////////////////////////////
////////////////////////////////// ┃ ┏━┻━━━━━┫ //////////////////////////////////
////////////////////////////////// ┃ ┣━━━━━╸ ┃ //////////////////////////////////
////////////////////////////////// ┃ ┃ ╺━━━━━┫ //////////////////////////////////
////////////////////////////////// ┣━┻━━━━━┳━┫ //////////////////////////////////
////////////////////////////////// ┃ ╻ ╻ ╺━┫ ┃ //////////////////////////////////
////////////////////////////////// ┣━╋━╋━┳━┫ ┃ //////////////////////////////////
////////////////////////////////// ┃ ╹ ╹ ┃ ┃ ┃ //////////////////////////////////
////////////////////////////////// ┃ ╻ ╻ ┃ ┃ ┃ //////////////////////////////////
////////////////////////////////// ┣━┻━┻━┻━┻━┫ //////////////////////////////////
////////////////////////////////// ┣━╸ ╺┳╸ ╺━┫ //////////////////////////////////
////////////////////////////////// ┣━╸ ╺┻╸ ╺━┫ //////////////////////////////////
////////////////////////////////// ┣━┳━┳━┳━┳━┫ //////////////////////////////////
////////////////////////////////// ┣━┛ ┗━┛ ┗━┫ //////////////////////////////////
////////////////////////////////// ┣━━━━━━━━━┫ //////////////////////////////////
////////////////////////////////// ┣╸ ╺━━━╸ ╺┫ //////////////////////////////////
////////////////////////////////// ┣━━━┓ ┏━━━┫ //////////////////////////////////
////////////////////////////////// ┃ ╻ ╹ ╹ ╻ ┃ //////////////////////////////////
////////////////////////////////// ┣━┻━━━━━┻━┫ //////////////////////////////////
////////////////////////////////// ┣━━━╸ ┏━━━┫ //////////////////////////////////
////////////////////////////////// ┃ ╺━━━┛ ╻ ┃ //////////////////////////////////
////////////////////////////////// ┗━━━━━━━┻━┛ //////////////////////////////////
int n, m;
int a[100005];
int deg[100005];
void ChromicChlorideHexahydrate()
{
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
deg[u]++, deg[v]++;
}
if (n == 1) {
cout << a[1] << endl;
return;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (deg[i] > 1) {
ans = max(a[i], ans);
}
}
cout << ans << endl;
}
signed main()
{
FASTIO;
ChromicChlorideHexahydrate();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3680kb
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: 3656kb
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: 3676kb
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: 3632kb
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: 3716kb
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: 3656kb
input:
3 2 1 2 3 3 1 2 1
output:
1
result:
wrong answer 1st lines differ - expected: '2', found: '1'