QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#756080	#9623. 合成大西瓜	proking^#	WA	0ms	4096kb	C++11	646b	2024-11-16 18:58:16	2024-11-16 18:58:18

Judging History

你现在查看的是最新测评结果

[2024-11-16 18:58:18]
评测

测评结果：WA
用时：0ms
内存：4096kb

查看

[2024-11-16 18:58:16]
提交

answer

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5 + 5;
int N, M, deg[maxn], w[maxn];

int main() {
  //  freopen("a.in", "r", stdin);
  //  freopen("a.out", "w", stdout);
  scanf("%d%d", &N, &M);
  for (int i = 1; i <= N; i++) scanf("%d", &w[i]);
  vector<multiset<int> > st(N + 1);
  for (int i = 1; i <= M; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    deg[u]++;
    deg[v]++;
  }
  if (N == 1) {
    printf("%d\n", w[1]);
    return 0;
  }
  int ans = 0;
  for (int i = 1; i <= N; i++) {
    if (deg[i] >= 2) {
      ans = max(ans, w[i]);
    }
  }
  printf("%d\n", ans);
  return 0;
}

源文件, 语言: C++11

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3800kb

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:

result:

ok single line: '6'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3828kb

input:

output:

result:

ok single line: '5'

Test #3:

score: 0

Accepted

time: 0ms

memory: 4096kb

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:

result:

ok single line: '6'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3780kb

input:

output:

result:

ok single line: '2'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3772kb

input:

output:

result:

ok single line: '5'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3844kb

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:

result:

ok single line: '7'

Test #7:

score: -100

Wrong Answer

time: 0ms

memory: 3804kb

input:

output:

result:

wrong answer 1st lines differ - expected: '2', found: '1'